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.143 by root, Tue Dec 23 06:58:24 2008 UTC vs.
Revision 1.174 by root, Thu Apr 15 00:40:34 2010 UTC

1/* 1/*
2 * This file is part of Deliantra, the Roguelike Realtime MMORPG. 2 * This file is part of Deliantra, the Roguelike Realtime MMORPG.
3 * 3 *
4 * Copyright (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra team 4 * Copyright (©) 2005,2006,2007,2008,2009,2010 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
5 * Copyright (©) 2001,2007 Mark Wedel 5 * Copyright (©) 2001 Mark Wedel
6 * Copyright (©) 1992,2007 Frank Tore Johansen 6 * Copyright (©) 1992 Frank Tore Johansen
7 * 7 *
8 * Deliantra is free software: you can redistribute it and/or modify 8 * Deliantra is free software: you can redistribute it and/or modify it under
9 * it under the terms of the GNU General Public License as published by 9 * the terms of the Affero GNU General Public License as published by the
10 * the Free Software Foundation, either version 3 of the License, or 10 * Free Software Foundation, either version 3 of the License, or (at your
11 * (at your option) any later version. 11 * 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 Affero GNU General Public License
19 * along with this program. If not, see <http://www.gnu.org/licenses/>. 19 * and the GNU General Public License along with this program. If not, see
20 * <http://www.gnu.org/licenses/>.
20 * 21 *
21 * The authors can be reached via e-mail to <support@deliantra.net> 22 * The authors can be reached via e-mail to <support@deliantra.net>
22 */ 23 */
24
25//+GPL
23 26
24/** 27/**
25 * \file 28 * \file
26 * Client handling. 29 * Client handling.
27 * 30 *
41 44
42#include <global.h> 45#include <global.h>
43#include <sproto.h> 46#include <sproto.h>
44 47
45#include <living.h> 48#include <living.h>
46#include <commands.h>
47 49
48/* This block is basically taken from socket.c - I assume if it works there, 50/* This block is basically taken from socket.c - I assume if it works there,
49 * it should work here. 51 * it should work here.
50 */ 52 */
51#include <sys/types.h> 53#include <sys/types.h>
63 * This table translates the attack numbers as used within the 65 * This table translates the attack numbers as used within the
64 * program to the value we use when sending STATS command to the 66 * program to the value we use when sending STATS command to the
65 * client. If a value is -1, then we don't send that to the 67 * client. If a value is -1, then we don't send that to the
66 * client. 68 * client.
67 */ 69 */
68short atnr_cs_stat[NROFATTACKS] = { CS_STAT_RES_PHYS, 70static short atnr_cs_stat[NROFATTACKS] =
69 CS_STAT_RES_MAG, CS_STAT_RES_FIRE, CS_STAT_RES_ELEC, 71{
70 CS_STAT_RES_COLD, CS_STAT_RES_CONF, CS_STAT_RES_ACID, 72 CS_STAT_RES_PHYS,
71 CS_STAT_RES_DRAIN, -1 /* weaponmagic */ , 73 CS_STAT_RES_MAG,
72 CS_STAT_RES_GHOSTHIT, CS_STAT_RES_POISON, 74 CS_STAT_RES_FIRE,
73 CS_STAT_RES_SLOW, CS_STAT_RES_PARA, CS_STAT_TURN_UNDEAD, 75 CS_STAT_RES_ELEC,
74 CS_STAT_RES_FEAR, -1 /* Cancellation */ , 76 CS_STAT_RES_COLD,
75 CS_STAT_RES_DEPLETE, CS_STAT_RES_DEATH, 77 CS_STAT_RES_CONF,
76 -1 /* Chaos */ , -1 /* Counterspell */ , 78 CS_STAT_RES_ACID,
77 -1 /* Godpower */ , CS_STAT_RES_HOLYWORD, 79 CS_STAT_RES_DRAIN,
80 -1 /* weaponmagic */,
81 CS_STAT_RES_GHOSTHIT,
82 CS_STAT_RES_POISON,
83 CS_STAT_RES_SLOW,
84 CS_STAT_RES_PARA,
85 CS_STAT_TURN_UNDEAD,
86 CS_STAT_RES_FEAR,
87 -1 /* Cancellation */,
88 CS_STAT_RES_DEPLETE,
89 CS_STAT_RES_DEATH,
90 -1 /* Chaos */,
91 -1 /* Counterspell */,
92 -1 /* Godpower */,
93 CS_STAT_RES_HOLYWORD,
78 CS_STAT_RES_BLIND, 94 CS_STAT_RES_BLIND,
79 -1, /* Internal */ 95 -1, /* Internal */
80 -1, /* life stealing */ 96 -1, /* life stealing */
81 -1 /* Disease - not fully done yet */ 97 -1 /* Disease - not fully done yet */
82}; 98};
141 157
142static void 158static void
143send_map_info (player *pl) 159send_map_info (player *pl)
144{ 160{
145 client &socket = *pl->ns; 161 client &socket = *pl->ns;
146 object *ob = pl->observe; 162 object *ob = pl->viewpoint;
147 163
148 if (socket.mapinfocmd) 164 if (socket.mapinfocmd)
149 { 165 {
150 if (ob->map && ob->map->path[0]) 166 if (ob->map && ob->map->path[0])
151 { 167 {
168/** check for map/region change and send new map data */ 184/** check for map/region change and send new map data */
169static void 185static void
170check_map_change (player *pl) 186check_map_change (player *pl)
171{ 187{
172 client &socket = *pl->ns; 188 client &socket = *pl->ns;
173 object *ob = pl->observe; 189 object *ob = pl->viewpoint;
174 190
175 region *reg = ob->region (); 191 region *reg = ob->region ();
176 if (socket.current_region != reg) 192 if (socket.current_region != reg)
177 { 193 {
178 INVOKE_PLAYER (REGION_CHANGE, pl, ARG_REGION (reg), ARG_REGION (socket.current_region)); 194 INVOKE_PLAYER (REGION_CHANGE, pl, ARG_REGION (reg), ARG_REGION (socket.current_region));
208 else if (socket.current_x != ob->x || socket.current_y != ob->y) 224 else if (socket.current_x != ob->x || socket.current_y != ob->y)
209 { 225 {
210 int dx = ob->x - socket.current_x; 226 int dx = ob->x - socket.current_x;
211 int dy = ob->y - socket.current_y; 227 int dy = ob->y - socket.current_y;
212 228
213 if (socket.buggy_mapscroll && (abs (dx) > 8 || abs (dy) > 8))
214 clear_map (pl); // current (<= 1.9.1) clients have unchecked buffer overflows
215 else
216 {
217 socket_map_scroll (&socket, ob->x - socket.current_x, ob->y - socket.current_y); 229 socket_map_scroll (&socket, ob->x - socket.current_x, ob->y - socket.current_y);
218 socket.floorbox_reset (); 230 socket.floorbox_reset ();
219 }
220 } 231 }
221 232
222 socket.current_x = ob->x; 233 socket.current_x = ob->x;
223 socket.current_y = ob->y; 234 socket.current_y = ob->y;
235}
236
237/**
238 * This sends the skill number to name mapping. We ignore
239 * the params - we always send the same info no matter what.
240 */
241static void
242send_skill_info (client *ns, char *params)
243{
244 packet sl;
245 sl << "replyinfo skill_info\n";
246
247 for (int i = 0; i < skillvec.size (); ++i)
248 sl.printf ("%d:%s\n", CS_STAT_SKILLINFO + i, &skillvec [i]->name);
249
250 if (sl.length () > MAXSOCKBUF)
251 {
252 LOG (llevError, "Buffer overflow in send_skill_info!\n");
253 fatal (0);
254 }
255
256 ns->send_packet (sl);
257}
258
259/**
260 * This sends the spell path to name mapping. We ignore
261 * the params - we always send the same info no matter what.
262 */
263static void
264send_spell_paths (client * ns, char *params)
265{
266 packet sl;
267
268 sl << "replyinfo spell_paths\n";
269
270 for (int i = 0; i < NRSPELLPATHS; i++)
271 sl.printf ("%d:%s\n", 1 << i, spellpathnames[i]);
272
273 if (sl.length () > MAXSOCKBUF)
274 {
275 LOG (llevError, "Buffer overflow in send_spell_paths!\n");
276 fatal (0);
277 }
278
279 ns->send_packet (sl);
224} 280}
225 281
226/** 282/**
227 * RequestInfo is sort of a meta command. There is some specific 283 * RequestInfo is sort of a meta command. There is some specific
228 * request of information, but we call other functions to provide 284 * request of information, but we call other functions to provide
241 { 297 {
242 *params++ = 0; 298 *params++ = 0;
243 break; 299 break;
244 } 300 }
245 301
246 if (!strcmp (buf, "image_info"))
247 send_image_info (ns, params);
248 else if (!strcmp (buf, "image_sums"))
249 send_image_sums (ns, params);
250 else if (!strcmp (buf, "skill_info")) 302 if (!strcmp (buf, "skill_info"))
251 send_skill_info (ns, params); 303 send_skill_info (ns, params);
252 else if (!strcmp (buf, "spell_paths")) 304 else if (!strcmp (buf, "spell_paths"))
253 send_spell_paths (ns, params); 305 send_spell_paths (ns, params);
254 else 306 else
255 { 307 {
271ExtiCmd (char *buf, int len, client *ns) 323ExtiCmd (char *buf, int len, client *ns)
272{ 324{
273 INVOKE_CLIENT (EXTICMD, ns, ARG_DATA (buf, len)); 325 INVOKE_CLIENT (EXTICMD, ns, ARG_DATA (buf, len));
274} 326}
275 327
328//-GPL
329
276void 330void
277client::mapinfo_queue_clear () 331client::mapinfo_queue_clear ()
278{ 332{
279 for (auto (i, mapinfo_queue.begin ()); i != mapinfo_queue.end (); ++i) 333 for (auto (i, mapinfo_queue.begin ()); i != mapinfo_queue.end (); ++i)
280 free (*i); 334 free (*i);
287{ 341{
288 char *token = buf; 342 char *token = buf;
289 buf += strlen (buf) + 9; 343 buf += strlen (buf) + 9;
290 344
291 // initial map and its origin 345 // initial map and its origin
292 maptile *map = pl->observe->map; 346 maptile *map = pl->viewpoint->map;
293 int mapx = pl->ns->mapx / 2 - pl->observe->x; 347 int mapx = pl->ns->mapx / 2 - pl->viewpoint->x;
294 int mapy = pl->ns->mapy / 2 - pl->observe->y; 348 int mapy = pl->ns->mapy / 2 - pl->viewpoint->y;
295 int max_distance = 8; // limit maximum path length to something generous 349 int max_distance = 8; // limit maximum path length to something generous
296 350
297 while (*buf && map && max_distance) 351 while (*buf && map && max_distance)
298 { 352 {
299 int dir = *buf++ - '1'; 353 int dir = *buf++ - '1';
404AddMeCmd (char *buf, int len, client *ns) 458AddMeCmd (char *buf, int len, client *ns)
405{ 459{
406 INVOKE_CLIENT (ADDME, ns, ARG_DATA (buf, len)); 460 INVOKE_CLIENT (ADDME, ns, ARG_DATA (buf, len));
407} 461}
408 462
409/** Reply to ExtendedInfos command */ 463//+GPL
410void
411ToggleExtendedInfos (char *buf, int len, client * ns)
412{
413 char cmdback[MAX_BUF];
414 char command[50];
415 int info, nextinfo;
416
417 cmdback[0] = '\0';
418 nextinfo = 0;
419
420 while (1)
421 {
422 /* 1. Extract an info */
423 info = nextinfo;
424
425 while ((info < len) && (buf[info] == ' '))
426 info++;
427
428 if (info >= len)
429 break;
430
431 nextinfo = info + 1;
432
433 while ((nextinfo < len) && (buf[nextinfo] != ' '))
434 nextinfo++;
435
436 if (nextinfo - info >= 49) /*Erroneous info asked */
437 continue;
438
439 strncpy (command, &(buf[info]), nextinfo - info);
440
441 /* 2. Interpret info */
442 if (!strcmp ("smooth", command))
443 /* Toggle smoothing */
444 ns->EMI_smooth = !ns->EMI_smooth;
445 else
446 /*bad value */;
447
448 /*3. Next info */
449 }
450
451 strcpy (cmdback, "ExtendedInfoSet");
452
453 if (ns->EMI_smooth)
454 {
455 strcat (cmdback, " ");
456 strcat (cmdback, "smoothing");
457 }
458
459 ns->send_packet (cmdback);
460}
461
462/*
463#define MSG_TYPE_BOOK 1
464#define MSG_TYPE_CARD 2
465#define MSG_TYPE_PAPER 3
466#define MSG_TYPE_SIGN 4
467#define MSG_TYPE_MONUMENT 5
468#define MSG_TYPE_SCRIPTED_DIALOG 6*/
469
470/** Reply to ExtendedInfos command */
471void
472ToggleExtendedText (char *buf, int len, client * ns)
473{
474 char cmdback[MAX_BUF];
475 char temp[10];
476 char command[50];
477 int info, nextinfo, i, flag;
478
479 cmdback[0] = '\0';
480
481 nextinfo = 0;
482 while (1)
483 {
484 /* 1. Extract an info */
485 info = nextinfo;
486
487 while ((info < len) && (buf[info] == ' '))
488 info++;
489
490 if (info >= len)
491 break;
492
493 nextinfo = info + 1;
494
495 while ((nextinfo < len) && (buf[nextinfo] != ' '))
496 nextinfo++;
497
498 if (nextinfo - info >= 49) /*Erroneous info asked */
499 continue;
500
501 strncpy (command, &(buf[info]), nextinfo - info);
502 command[nextinfo - info] = '\0';
503 /* 2. Interpret info */
504 i = sscanf (command, "%d", &flag);
505
506 if ((i == 1) && (flag > 0) && (flag <= MSG_TYPE_LAST))
507 ns->supported_readables |= (1 << flag);
508 /*3. Next info */
509 }
510
511 /* Send resulting state */
512 strcpy (cmdback, "ExtendedTextSet");
513
514 for (i = 0; i <= MSG_TYPE_LAST; i++)
515 if (ns->supported_readables & (1 << i))
516 {
517 strcat (cmdback, " ");
518 snprintf (temp, sizeof (temp), "%d", i);
519 strcat (cmdback, temp);
520 }
521
522 ns->send_packet (cmdback);
523}
524 464
525/** 465/**
526 * This handles the general commands from the client (ie, north, fire, cast, 466 * This handles the general commands from the client (ie, north, fire, cast,
527 * etc.) 467 * etc.)
528 */ 468 */
541 return; 481 return;
542 482
543 buf++; 483 buf++;
544 } 484 }
545 485
546 execute_newserver_command (pl->ob, (char *) buf); 486 execute_newserver_command (pl->ob, (char *)buf);
547 487
548 /* Perhaps something better should be done with a left over count. 488 /* Perhaps something better should be done with a left over count.
549 * Cleaning up the input should probably be done first - all actions 489 * Cleaning up the input should probably be done first - all actions
550 * for the command that issued the count should be done before any other 490 * for the command that issued the count should be done before any other
551 * commands. 491 * commands.
585 * commands. 525 * commands.
586 */ 526 */
587 pl->count = 0; 527 pl->count = 0;
588 528
589 //TODO: schmorp thinks whatever this calculates, it makes no sense at all 529 //TODO: schmorp thinks whatever this calculates, it makes no sense at all
590 int time = fabs (pl->ob->speed) < 0.001 530 int time = pl->ob->has_active_speed ()
591 ? time = MAX_TIME * 100
592 : time = (int) (MAX_TIME / fabs (pl->ob->speed)); 531 ? (int) (MAX_TIME / pl->ob->speed)
532 : MAX_TIME * 100;
593 533
594 /* Send confirmation of command execution now */ 534 /* Send confirmation of command execution now */
595 packet sl ("comc"); 535 packet sl ("comc");
596 sl << uint16 (cmdid) << uint32 (time); 536 sl << uint16 (cmdid) << uint32 (time);
597 pl->ns->send_packet (sl); 537 pl->ns->send_packet (sl);
639 LOG (llevError, "Unknown input state: %d\n", ns->state); 579 LOG (llevError, "Unknown input state: %d\n", ns->state);
640 } 580 }
641} 581}
642 582
643/** 583/**
644 * Client tells its version. If there is a mismatch, we close the 584 * Client tells its version info.
645 * socket. In real life, all we should care about is the client having
646 * something older than the server. If we assume the client will be
647 * backwards compatible, having it be a later version should not be a
648 * problem.
649 */ 585 */
650void 586void
651VersionCmd (char *buf, int len, client * ns) 587VersionCmd (char *buf, int len, client *ns)
652{ 588{
653 if (!buf) 589 INVOKE_CLIENT (VERSION, ns, ARG_DATA (buf, len));
654 {
655 LOG (llevError, "CS: received corrupted version command\n");
656 return;
657 }
658
659 ns->cs_version = atoi (buf);
660 ns->sc_version = ns->cs_version;
661
662 LOG (llevDebug, "connection from client <%s>\n", buf);
663
664 //TODO: should log here just for statistics
665
666 //if (VERSION_CS != ns->cs_version)
667 // unchecked;
668
669 char *cp = strchr (buf + 1, ' ');
670 if (!cp)
671 return;
672
673 ns->sc_version = atoi (cp);
674
675 //if (VERSION_SC != ns->sc_version)
676 // unchecked;
677
678 cp = strchr (cp + 1, ' ');
679
680 if (cp)
681 {
682 ns->version = cp + 1;
683
684 if (ns->sc_version < 1026)
685 ns->send_packet_printf ("drawinfo %d %s", NDI_RED,
686 "**** VERSION WARNING ****\n**** CLIENT IS TOO OLD!! UPDATE THE CLIENT!! ****");
687 }
688} 590}
689 591
690/** sound related functions. */ 592/** sound related functions. */
691void 593void
692SetSound (char *buf, int len, client * ns) 594SetSound (char *buf, int len, client * ns)
743 * Get player's current range attack in obuf. 645 * Get player's current range attack in obuf.
744 */ 646 */
745static void 647static void
746rangetostring (player *pl, char *obuf) 648rangetostring (player *pl, char *obuf)
747{ 649{
748 dynbuf_text buf; 650 dynbuf_text &buf = msg_dynbuf; buf.clear ();
651
652#if 0
653 // print ranged/chosen_skill etc. objects every call
654 printf ("%s %s => %s (%s)\n",
655 pl->ranged_ob ? &pl->ranged_ob->name : "-",
656 pl->combat_ob ? &pl->combat_ob->name : "-",
657 pl->ob->current_weapon ? &pl->ob->current_weapon->name : "-",
658 pl->ob->chosen_skill ? &pl->ob->chosen_skill->name : "-"
659 );
660#endif
749 661
750 if (pl->ranged_ob) 662 if (pl->ranged_ob)
751 buf << " Range" << (pl->ob->current_weapon == pl->ranged_ob ? "*" : "") << ": " << pl->ranged_ob->name; 663 buf << " Range" << (pl->ob->current_weapon == pl->ranged_ob ? "*" : "") << ": " << pl->ranged_ob->name;
752 664
753 if (pl->combat_ob) 665 if (pl->combat_ob)
799 * commands for now. 711 * commands for now.
800 */ 712 */
801void 713void
802esrv_update_stats (player *pl) 714esrv_update_stats (player *pl)
803{ 715{
804 char buf[MAX_BUF];
805 uint16 flags;
806
807 client *ns = pl->ns; 716 client *ns = pl->ns;
808 if (!ns) 717 if (!ns)
809 return; 718 return;
810 719
811 object *ob = pl->observe; 720 object *ob = pl->observe;
828 AddIfShort (ns->last_stats.Int, ob->stats.Int, CS_STAT_INT); 737 AddIfShort (ns->last_stats.Int, ob->stats.Int, CS_STAT_INT);
829 AddIfShort (ns->last_stats.Wis, ob->stats.Wis, CS_STAT_WIS); 738 AddIfShort (ns->last_stats.Wis, ob->stats.Wis, CS_STAT_WIS);
830 AddIfShort (ns->last_stats.Pow, ob->stats.Pow, CS_STAT_POW); 739 AddIfShort (ns->last_stats.Pow, ob->stats.Pow, CS_STAT_POW);
831 AddIfShort (ns->last_stats.Cha, ob->stats.Cha, CS_STAT_CHA); 740 AddIfShort (ns->last_stats.Cha, ob->stats.Cha, CS_STAT_CHA);
832 741
833 for (int s = 0; s < NUM_SKILLS; s++) 742 for (int s = 0; s < CS_NUM_SKILLS; s++)
834 if (object *skill = opl->last_skill_ob [s]) 743 if (object *skill = opl->last_skill_ob [s])
835 if (skill->stats.exp != ns->last_skill_exp [s]) 744 if (skill->stats.exp != ns->last_skill_exp [s])
836 { 745 {
837 ns->last_skill_exp [s] = skill->stats.exp; 746 ns->last_skill_exp [s] = skill->stats.exp;
838 747
839 /* Always send along the level if exp changes. This is only 748 /* Always send along the level if exp changes. This is only
840 * 1 extra byte, but keeps processing simpler. 749 * 1 extra byte, but keeps processing simpler.
841 */ 750 */
842 sl << uint8 (s + CS_STAT_SKILLINFO) 751 sl << uint8 (CS_STAT_SKILLINFO + s)
843 << uint8 (skill->level) 752 << uint8 (skill->level)
844 << uint64 (skill->stats.exp); 753 << uint64 (skill->stats.exp);
845 } 754 }
846 755
847 AddIfInt64 (ns->last_stats.exp, ob->stats.exp, CS_STAT_EXP64); 756 AddIfInt64 (ns->last_stats.exp, ob->stats.exp, CS_STAT_EXP64);
848 AddIfShort (ns->last_level, ob->level, CS_STAT_LEVEL); 757 AddIfShort (ns->last_level, ob->level, CS_STAT_LEVEL);
849 AddIfShort (ns->last_stats.wc, ob->stats.wc, CS_STAT_WC); 758 AddIfShort (ns->last_stats.wc, ob->stats.wc, CS_STAT_WC);
850 AddIfShort (ns->last_stats.ac, ob->stats.ac, CS_STAT_AC); 759 AddIfShort (ns->last_stats.ac, ob->stats.ac, CS_STAT_AC);
851 AddIfShort (ns->last_stats.dam, ob->stats.dam, CS_STAT_DAM); 760 AddIfShort (ns->last_stats.dam, ob->stats.dam, CS_STAT_DAM);
852 AddIfFloat (ns->last_speed, ob->speed, CS_STAT_SPEED, 1.f/TICK); 761 AddIfFloat (ns->last_speed, ob->speed, CS_STAT_SPEED, 1.f / TICK);
853 AddIfShort (ns->last_stats.food, ob->stats.food, CS_STAT_FOOD); 762 AddIfShort (ns->last_stats.food, ob->stats.food, CS_STAT_FOOD);
854 AddIfFloat (ns->last_weapon_sp, pl->weapon_sp, CS_STAT_WEAP_SP, 1.f/TICK); 763 AddIfFloat (ns->last_weapon_sp, pl->weapon_sp, CS_STAT_WEAP_SP, 1.f / TICK);
855 AddIfInt (ns->last_weight_limit, weight_limit[ob->stats.Str], CS_STAT_WEIGHT_LIM); 764 AddIfInt (ns->last_weight_limit, weight_limit[ob->stats.Str], CS_STAT_WEIGHT_LIM);
856 765
857 flags = 0; 766 int flags = (opl->fire_on ? SF_FIREON : 0)
858 767 | (opl->run_on ? SF_RUNON : 0);
859 if (opl->fire_on)
860 flags |= SF_FIREON;
861
862 if (opl->run_on)
863 flags |= SF_RUNON;
864 768
865 AddIfShort (ns->last_flags, flags, CS_STAT_FLAGS); 769 AddIfShort (ns->last_flags, flags, CS_STAT_FLAGS);
866 770
867 if (ns->sc_version < 1025)
868 { AddIfShort (ns->last_resist[ATNR_PHYSICAL], ob->resist[ATNR_PHYSICAL], CS_STAT_ARMOUR) }
869 else
870 for (int i = 0; i < NROFATTACKS; i++) 771 for (int i = 0; i < NROFATTACKS; i++)
871 {
872 /* Skip ones we won't send */ 772 /* Skip ones we won't send */
873 if (atnr_cs_stat[i] == -1) 773 if (atnr_cs_stat[i] >= 0)
874 continue;
875
876 AddIfShort (ns->last_resist[i], ob->resist[i], atnr_cs_stat[i]); 774 AddIfShort (ns->last_resist[i], ob->resist[i], atnr_cs_stat[i]);
877 }
878 775
879 if (pl->ns->monitor_spells) 776 if (pl->ns->monitor_spells)
880 { 777 {
881 AddIfInt (ns->last_path_attuned, ob->path_attuned, CS_STAT_SPELL_ATTUNE); 778 AddIfInt (ns->last_path_attuned, ob->path_attuned, CS_STAT_SPELL_ATTUNE);
882 AddIfInt (ns->last_path_repelled, ob->path_repelled, CS_STAT_SPELL_REPEL); 779 AddIfInt (ns->last_path_repelled, ob->path_repelled, CS_STAT_SPELL_REPEL);
883 AddIfInt (ns->last_path_denied, ob->path_denied, CS_STAT_SPELL_DENY); 780 AddIfInt (ns->last_path_denied, ob->path_denied, CS_STAT_SPELL_DENY);
884 } 781 }
885 782
783 char buf[MAX_BUF];
886 rangetostring (opl, buf); /* we want use the new fire & run system in new client */ 784 rangetostring (opl, buf); /* we want use the new fire & run system in new client */
887 AddIfString (ns->stats.range, buf, CS_STAT_RANGE); 785 AddIfString (ns->stats.range, buf, CS_STAT_RANGE);
888 set_title (ob, buf); 786 set_title (ob, buf);
889 AddIfString (ns->stats.title, buf, CS_STAT_TITLE); 787 AddIfString (ns->stats.title, buf, CS_STAT_TITLE);
890 788
984 882
985 /* Nothing changed */ 883 /* Nothing changed */
986 return 0; 884 return 0;
987} 885}
988 886
989/** 887//-GPL
990 * Returns the size of a data for a map square as returned by
991 * mapextended. There are CLIENTMAPX*CLIENTMAPY*LAYERS entries
992 * available.
993 */
994int
995getExtendedMapInfoSize (client * ns)
996{
997 int result = 0;
998
999 if (ns->ext_mapinfos)
1000 {
1001 if (ns->EMI_smooth)
1002 result += 1; /*One byte for smoothlevel */
1003 }
1004
1005 return result;
1006}
1007 888
1008// prefetch (and touch) all maps within a specific distancd 889// prefetch (and touch) all maps within a specific distancd
1009static void 890static void
1010prefetch_surrounding_maps (maptile *map, int distance) 891prefetch_surrounding_maps (maptile *map, int distance)
1011{ 892{
1012 map->last_access = runtime; 893 map->touch ();
1013 894
1014 if (--distance) 895 if (--distance)
1015 for (int dir = 4; --dir; ) 896 for (int dir = 4; dir--; )
1016 if (const shstr &path = map->tile_path [dir]) 897 if (const shstr &path = map->tile_path [dir])
1017 if (maptile *&neigh = map->tile_map [dir]) 898 if (maptile *&neigh = map->tile_map [dir])
1018 prefetch_surrounding_maps (neigh, distance); 899 prefetch_surrounding_maps (neigh, distance);
1019 else 900 else
1020 neigh = maptile::find_async (path, map); 901 neigh = maptile::find_async (path, map);
1025prefetch_surrounding_maps (object *op) 906prefetch_surrounding_maps (object *op)
1026{ 907{
1027 prefetch_surrounding_maps (op->map, 3); 908 prefetch_surrounding_maps (op->map, 3);
1028} 909}
1029 910
911//+GPL
912
1030/** 913/**
1031 * Draws client map. 914 * Draws client map.
1032 */ 915 */
1033void 916void
1034draw_client_map (player *pl) 917draw_client_map (player *pl)
1035{ 918{
1036 object *ob = pl->observe; 919 object *ob = pl->viewpoint;
1037 if (!ob->active) 920 if (!pl->observe->active)
1038 return; 921 return;
1039 922
1040 /* If player is just joining the game, he isn't here yet, so the map 923 /* If player is just joining the game, he isn't here yet, so the map
1041 * can get swapped out. If so, don't try to send them a map. All will 924 * can get swapped out. If so, don't try to send them a map. All will
1042 * be OK once they really log in. 925 * be OK once they really log in.
1043 */ 926 */
1044 if (!ob->map || ob->map->in_memory != MAP_ACTIVE) 927 if (!ob->map || ob->map->in_memory != MAP_ACTIVE)
1045 return; 928 return;
1046 929
1047 int startlen, oldlen; 930 int startlen, oldlen;
1048 int estartlen, eoldlen;
1049 uint8 eentrysize;
1050 uint16 ewhatstart, ewhatflag;
1051 uint8 extendedinfos;
1052 931
1053 check_map_change (pl); 932 check_map_change (pl);
1054 prefetch_surrounding_maps (pl->ob); 933 prefetch_surrounding_maps (pl->ob);
1055 934
1056 /* do LOS after calls to update_position */ 935 /* do LOS after calls to update_position */
1057 /* unfortunately, we need to udpate los when observing, currently */ 936 /* unfortunately, we need to udpate los when observing, currently */
1058 if (pl->do_los || pl->observe != pl->ob) 937 if (pl->do_los || pl->viewpoint != pl->ob)
1059 { 938 {
1060 pl->do_los = 0; 939 pl->do_los = 0;
1061 pl->update_los (); 940 pl->update_los ();
1062 } 941 }
1063 942
1085 */ 964 */
1086 965
1087 client &socket = *pl->ns; 966 client &socket = *pl->ns;
1088 967
1089 packet sl (socket.mapmode == Map1Cmd ? "map1" : "map1a"); 968 packet sl (socket.mapmode == Map1Cmd ? "map1" : "map1a");
1090 packet esl;
1091 969
1092 startlen = sl.length (); 970 startlen = sl.length ();
1093 971
1094 /*Extendedmapinfo structure initialisation */
1095 if (socket.ext_mapinfos)
1096 {
1097 extendedinfos = EMI_NOREDRAW;
1098
1099 if (socket.EMI_smooth)
1100 extendedinfos |= EMI_SMOOTH;
1101
1102 ewhatstart = esl.length ();
1103 ewhatflag = extendedinfos; /*The EMI_NOREDRAW bit
1104 could need to be taken away */
1105 eentrysize = getExtendedMapInfoSize (&socket);
1106 esl << "mapextended "
1107 << uint8 (extendedinfos)
1108 << uint8 (eentrysize);
1109
1110 estartlen = esl.length ();
1111 }
1112
1113 /* We could do this logic as conditionals in the if statement,
1114 * but that started to get a bit messy to look at.
1115 */
1116 int hx = socket.mapx / 2; 972 int hx = socket.mapx / 2;
1117 int hy = socket.mapy / 2; 973 int hy = socket.mapy / 2;
1118 974
1119 for (int dx = -hx; dx <= hx; dx++) 975 ordered_mapwalk_begin (ob, -hx, -hy, hx, hy)
976 int ax = dx + hx;
977 int ay = dy + hy;
978
979 int mask = (ax << 10) | (ay << 4);
980 MapCell &lastcell = socket.lastmap.cells[ax][ay];
981
982 /* If the coordinates are not valid, or it is too dark to see,
983 * we tell the client as such
984 */
985 if (!m)
1120 { 986 {
1121 sint16 nx, ny; 987 /* space is out of map. Update space and clear values
1122 maptile *m = 0; 988 * if this hasn't already been done. If the space is out
1123 989 * of the map, it shouldn't have a head.
1124 for (int dy = -hy; dy <= hy; dy++) 990 */
991 if (lastcell.count != -1)
1125 { 992 {
1126 // check to see if we can simply go one down quickly 993 sl << uint16 (mask);
1127 if (m && ++ny >= m->height) 994 map_clearcell (&lastcell, -1);
995 }
996
997 continue;
998 }
999
1000 int d = pl->blocked_los_uc (dx, dy);
1001
1002 if (d > 3)
1003 {
1004 /* This block deals with spaces that are not visible for whatever
1005 * reason. Still may need to send the head for this space.
1006 */
1007 if (lastcell.count != -1
1008 || lastcell.faces[0]
1009 || lastcell.faces[1]
1010 || lastcell.faces[2]
1011 || lastcell.stat_hp
1012 || lastcell.flags
1013 || lastcell.player)
1014 sl << uint16 (mask);
1015
1016 /* properly clear a previously sent big face */
1017 map_clearcell (&lastcell, -1);
1018 }
1019 else
1020 {
1021 /* In this block, the space is visible.
1022 */
1023
1024 /* Rather than try to figure out what everything that we might
1025 * need to send is, then form the packet after that,
1026 * we presume that we will in fact form a packet, and update
1027 * the bits by what we do actually send. If we send nothing,
1028 * we just back out sl.length () to the old value, and no harm
1029 * is done.
1030 * I think this is simpler than doing a bunch of checks to see
1031 * what if anything we need to send, setting the bits, then
1032 * doing those checks again to add the real data.
1033 */
1034 oldlen = sl.length ();
1035
1036 sl << uint16 (mask);
1037
1038 unsigned char dummy;
1039 unsigned char *last_ext = &dummy;
1040
1041 /* Darkness changed */
1042 if (lastcell.count != d)
1043 {
1128 m = 0; 1044 mask |= 0x8;
1129 1045
1130 // no, so do it the slow way 1046 *last_ext |= 0x80;
1131 if (!m) 1047 last_ext = &sl[sl.length ()];
1048 sl << uint8 (d);
1049 }
1050
1051 lastcell.count = d;
1052
1053 mapspace &ms = m->at (nx, ny);
1054 ms.update ();
1055
1056 // extmap handling
1057 uint8 stat_hp = 0;
1058 uint8 stat_width = 0;
1059 uint8 flags = 0;
1060 tag_t player = 0;
1061
1062 // send hp information, if applicable
1063 if (object *op = ms.faces_obj [0])
1064 if (op->is_head () && !op->invisible)
1132 { 1065 {
1133 nx = ob->x + dx; ny = ob->y + dy; m = ob->map; 1066 if (op->stats.maxhp > op->stats.hp
1134 1067 && op->stats.maxhp > 0
1135 if (xy_normalise (m, nx, ny)) 1068 && (op->type == PLAYER
1136 m->touch (); 1069 || op->type == DOOR // does not work, have maxhp 0
1137 else 1070 || op->flag [FLAG_MONSTER]
1071 || op->flag [FLAG_ALIVE]
1072 || op->flag [FLAG_GENERATOR]))
1138 m = 0; 1073 {
1074 stat_hp = 255 - (op->stats.hp * 255 + 254) / op->stats.maxhp;
1075 stat_width = op->arch->max_x - op->arch->x; //TODO: should be upper-left edge
1076 }
1077
1078 if (expect_false (op->has_dialogue ()))
1079 flags |= 1;
1080
1081 if (expect_false (op->type == PLAYER))
1082 player = op == ob ? pl->ob->count
1083 : op == pl->ob ? ob->count
1084 : op->count;
1139 } 1085 }
1140 1086
1141 int ax = dx + hx; 1087 if (expect_false (lastcell.stat_hp != stat_hp))
1142 int ay = dy + hy;
1143
1144 int emask, mask;
1145 emask = mask = (ax & 0x3f) << 10 | (ay & 0x3f) << 4;
1146
1147 MapCell &lastcell = socket.lastmap.cells[ax][ay];
1148
1149 /* If the coordinates are not valid, or it is too dark to see,
1150 * we tell the client as such
1151 */
1152 if (!m)
1153 { 1088 {
1154 /* space is out of map. Update space and clear values 1089 lastcell.stat_hp = stat_hp;
1155 * if this hasn't already been done. If the space is out 1090
1156 * of the map, it shouldn't have a head. 1091 mask |= 0x8;
1157 */ 1092 *last_ext |= 0x80;
1158 if (lastcell.count != -1) 1093 last_ext = &sl[sl.length ()];
1094
1095 sl << uint8 (5) << uint8 (stat_hp);
1096
1097 if (stat_width > 1)
1159 { 1098 {
1160 sl << uint16 (mask);
1161 map_clearcell (&lastcell, -1);
1162 }
1163
1164 continue;
1165 }
1166
1167 int d = pl->blocked_los_uc (dx, dy);
1168
1169 if (d > 3)
1170 {
1171 int need_send = 0, count;
1172
1173 /* This block deals with spaces that are not visible for whatever
1174 * reason. Still may need to send the head for this space.
1175 */
1176
1177 oldlen = sl.length ();
1178
1179 sl << uint16 (mask);
1180
1181 if (lastcell.count != -1)
1182 need_send = 1;
1183
1184 count = -1;
1185
1186 if (lastcell.faces[0] || lastcell.faces[1] || lastcell.faces[2]
1187 || lastcell.stat_hp || lastcell.flags || lastcell.player)
1188 need_send = 1;
1189
1190 /* properly clear a previously sent big face */
1191 map_clearcell (&lastcell, count);
1192
1193 if ((mask & 0xf) || need_send)
1194 sl[oldlen + 1] = mask & 0xff;
1195 else
1196 sl.reset (oldlen);
1197 }
1198 else
1199 {
1200 /* In this block, the space is visible.
1201 */
1202
1203 /* Rather than try to figure out what everything that we might
1204 * need to send is, then form the packet after that,
1205 * we presume that we will in fact form a packet, and update
1206 * the bits by what we do actually send. If we send nothing,
1207 * we just back out sl.length () to the old value, and no harm
1208 * is done.
1209 * I think this is simpler than doing a bunch of checks to see
1210 * what if anything we need to send, setting the bits, then
1211 * doing those checks again to add the real data.
1212 */
1213 oldlen = sl.length ();
1214 eoldlen = esl.length ();
1215
1216 sl << uint16 (mask);
1217
1218 unsigned char dummy;
1219 unsigned char *last_ext = &dummy;
1220
1221 /* Darkness changed */
1222 if (lastcell.count != d && socket.darkness)
1223 {
1224 mask |= 0x8;
1225
1226 if (socket.extmap)
1227 {
1228 *last_ext |= 0x80; 1099 *last_ext |= 0x80;
1229 last_ext = &sl[sl.length ()]; 1100 last_ext = &sl[sl.length ()];
1230 sl << uint8 (d); 1101
1231 } 1102 sl << uint8 (6) << uint8 (stat_width);
1232 else
1233 sl << uint8 (255 - 64 * d);
1234 } 1103 }
1104 }
1235 1105
1236 lastcell.count = d; 1106 if (expect_false (lastcell.player != player))
1237
1238 mapspace &ms = m->at (nx, ny);
1239 ms.update ();
1240
1241 if (socket.extmap)
1242 { 1107 {
1243 uint8 stat_hp = 0; 1108 lastcell.player = player;
1244 uint8 stat_width = 0;
1245 uint8 flags = 0;
1246 tag_t player = 0;
1247 1109
1248 // send hp information, if applicable
1249 if (object *op = ms.faces_obj [0])
1250 if (op->is_head () && !op->invisible)
1251 {
1252 if (op->stats.maxhp > op->stats.hp
1253 && op->stats.maxhp > 0
1254 && (op->type == PLAYER
1255 || op->type == DOOR // does not work, have maxhp 0
1256 || QUERY_FLAG (op, FLAG_MONSTER)
1257 || QUERY_FLAG (op, FLAG_ALIVE)
1258 || QUERY_FLAG (op, FLAG_GENERATOR)))
1259 {
1260 stat_hp = 255 - (op->stats.hp * 255 + 254) / op->stats.maxhp;
1261 stat_width = op->arch->max_x - op->arch->x; //TODO: should be upper-left edge
1262 }
1263
1264 if (op->has_dialogue ())
1265 flags |= 1;
1266
1267 if (op->type == PLAYER)
1268 player = op == ob ? pl->ob->count
1269 : op == pl->ob ? ob->count
1270 : op->count;
1271 }
1272
1273 if (lastcell.stat_hp != stat_hp)
1274 {
1275 lastcell.stat_hp = stat_hp;
1276
1277 mask |= 0x8; 1110 mask |= 0x8;
1278 *last_ext |= 0x80; 1111 *last_ext |= 0x80;
1279 last_ext = &sl[sl.length ()]; 1112 last_ext = &sl[sl.length ()];
1280 1113
1281 sl << uint8 (5) << uint8 (stat_hp);
1282
1283 if (stat_width > 1)
1284 {
1285 *last_ext |= 0x80;
1286 last_ext = &sl[sl.length ()];
1287
1288 sl << uint8 (6) << uint8 (stat_width);
1289 }
1290 }
1291
1292 if (lastcell.player != player)
1293 {
1294 lastcell.player = player;
1295
1296 mask |= 0x8;
1297 *last_ext |= 0x80;
1298 last_ext = &sl[sl.length ()];
1299
1300 sl << uint8 (0x47) << uint8 (4) << (uint32)player; 1114 sl << uint8 (0x47) << uint8 (4) << (uint32)player;
1301 } 1115 }
1302 1116
1303 if (lastcell.flags != flags) 1117 if (expect_false (lastcell.flags != flags))
1304 { 1118 {
1305 lastcell.flags = flags; 1119 lastcell.flags = flags;
1306 1120
1307 mask |= 0x8; 1121 mask |= 0x8;
1308 *last_ext |= 0x80; 1122 *last_ext |= 0x80;
1309 last_ext = &sl[sl.length ()]; 1123 last_ext = &sl[sl.length ()];
1310 1124
1311 sl << uint8 (8) << uint8 (flags); 1125 sl << uint8 (8) << uint8 (flags);
1312 }
1313 } 1126 }
1314 1127
1128 // faces
1129
1315 /* Floor face */ 1130 /* Floor face */
1316 if (update_space (sl, socket, ms, lastcell, 2)) 1131 if (update_space (sl, socket, ms, lastcell, 2))
1317 mask |= 0x4; 1132 mask |= 0x4;
1318 1133
1319 /* Middle face */ 1134 /* Middle face */
1320 if (update_space (sl, socket, ms, lastcell, 1)) 1135 if (update_space (sl, socket, ms, lastcell, 1))
1321 mask |= 0x2; 1136 mask |= 0x2;
1322 1137
1323 if (ob->invisible 1138 if (expect_false (ob->invisible)
1324 && ob->invisible & (ob->invisible < 50 ? 1 : 7) 1139 && ob->invisible & (ob->invisible < 50 ? 1 : 7)
1325 && ms.player () == ob) 1140 && ms.player () == ob)
1326 { 1141 {
1327 // force player to be visible to himself if invisible 1142 // force player to be visible to himself if invisible
1328 if (lastcell.faces[0] != ob->face) 1143 if (lastcell.faces[0] != ob->face)
1329 { 1144 {
1330 lastcell.faces[0] = ob->face; 1145 lastcell.faces[0] = ob->face;
1331 1146
1332 mask |= 0x1;
1333 sl << uint16 (ob->face);
1334
1335 socket.send_faces (ob);
1336 }
1337 }
1338 /* Top face */
1339 else if (update_space (sl, socket, ms, lastcell, 0))
1340 mask |= 0x1; 1147 mask |= 0x1;
1148 sl << uint16 (ob->face);
1341 1149
1150 socket.send_faces (ob);
1151 }
1152 }
1153 /* Top face */
1154 else if (update_space (sl, socket, ms, lastcell, 0))
1155 mask |= 0x1;
1156
1342 /* Check to see if we are in fact sending anything for this 1157 /* Check to see if we are in fact sending anything for this
1343 * space by checking the mask. If so, update the mask. 1158 * space by checking the mask. If so, update the mask.
1344 * if not, reset the len to that from before adding the mask 1159 * if not, reset the len to that from before adding the mask
1345 * value, so we don't send those bits. 1160 * value, so we don't send those bits.
1346 */ 1161 */
1347 if (mask & 0xf) 1162 if (mask & 0xf)
1348 sl[oldlen + 1] = mask & 0xff; 1163 sl[oldlen + 1] = mask & 0xff;
1349 else 1164 else
1350 sl.reset (oldlen); 1165 sl.reset (oldlen);
1351
1352 if (socket.ext_mapinfos)
1353 esl << uint16 (emask);
1354
1355 if (socket.EMI_smooth)
1356 {
1357 for (int layer = 2+1; layer--; )
1358 {
1359 object *ob = ms.faces_obj [layer];
1360
1361 // If there is no object for this space, or if the face for the object
1362 // is the blank face, set the smoothlevel to zero.
1363 int smoothlevel = ob && ob->face != blank_face ? ob->smoothlevel : 0;
1364
1365 // We've gotten what face we want to use for the object. Now see if
1366 // if it has changed since we last sent it to the client.
1367 if (lastcell.smooth[layer] != smoothlevel)
1368 {
1369 lastcell.smooth[layer] = smoothlevel;
1370 esl << uint8 (smoothlevel);
1371 emask |= 1 << layer;
1372 }
1373 }
1374
1375 if (emask & 0xf)
1376 esl[eoldlen + 1] = emask & 0xff;
1377 else
1378 esl.reset (eoldlen);
1379 }
1380 } /* else this is a viewable space */ 1166 } /* else this is a viewable space */
1381 } /* for x loop */ 1167 ordered_mapwalk_end
1382 } /* for y loop */
1383 1168
1384 socket.flush_fx (); 1169 socket.flush_fx ();
1385
1386 /* Verify that we in fact do need to send this */
1387 if (socket.ext_mapinfos)
1388 {
1389 if (!(sl.length () > startlen || socket.sent_scroll))
1390 {
1391 /* No map data will follow, so don't say the client
1392 * it doesn't need draw!
1393 */
1394 ewhatflag &= ~EMI_NOREDRAW;
1395 esl[ewhatstart + 1] = ewhatflag & 0xff;
1396 }
1397
1398 if (esl.length () > estartlen)
1399 socket.send_packet (esl);
1400 }
1401 1170
1402 if (sl.length () > startlen || socket.sent_scroll) 1171 if (sl.length () > startlen || socket.sent_scroll)
1403 { 1172 {
1404 socket.send_packet (sl); 1173 socket.send_packet (sl);
1405 socket.sent_scroll = 0; 1174 socket.sent_scroll = 0;
1406 } 1175 }
1407} 1176}
1408 1177
1409/*****************************************************************************/
1410/* GROS: The following one is used to allow a plugin to send a generic cmd to*/
1411/* a player. Of course, the client need to know the command to be able to */
1412/* manage it ! */
1413/*****************************************************************************/
1414void
1415send_plugin_custom_message (object *pl, char *buf)
1416{
1417 pl->contr->ns->send_packet (buf);
1418}
1419
1420/**
1421 * This sends the skill number to name mapping. We ignore
1422 * the params - we always send the same info no matter what.
1423 */
1424void
1425send_skill_info (client *ns, char *params)
1426{
1427 packet sl;
1428 sl << "replyinfo skill_info\n";
1429
1430 for (int i = 1; i < NUM_SKILLS; i++)
1431 sl.printf ("%d:%s\n", i + CS_STAT_SKILLINFO, &skill_names [i]);
1432
1433 if (sl.length () > MAXSOCKBUF)
1434 {
1435 LOG (llevError, "Buffer overflow in send_skill_info!\n");
1436 fatal (0);
1437 }
1438
1439 ns->send_packet (sl);
1440}
1441
1442/**
1443 * This sends the spell path to name mapping. We ignore
1444 * the params - we always send the same info no matter what.
1445 */
1446void
1447send_spell_paths (client * ns, char *params)
1448{
1449 packet sl;
1450
1451 sl << "replyinfo spell_paths\n";
1452
1453 for (int i = 0; i < NRSPELLPATHS; i++)
1454 sl.printf ("%d:%s\n", 1 << i, spellpathnames[i]);
1455
1456 if (sl.length () > MAXSOCKBUF)
1457 {
1458 LOG (llevError, "Buffer overflow in send_spell_paths!\n");
1459 fatal (0);
1460 }
1461
1462 ns->send_packet (sl);
1463}
1464
1465/** 1178/**
1466 * This looks for any spells the player may have that have changed their stats. 1179 * This looks for any spells the player may have that have changed their stats.
1467 * it then sends an updspell packet for each spell that has changed in this way 1180 * it then sends an updspell packet for each spell that has changed in this way
1468 */ 1181 */
1469void 1182void
1470esrv_update_spells (player *pl) 1183esrv_update_spells (player *pl)
1471{ 1184{
1472 if (!pl->ns) 1185 if (!pl->ns)
1473 return; 1186 return;
1474 1187
1188 pl->ns->update_spells = false;
1189
1475 if (!pl->ns->monitor_spells) 1190 if (!pl->ns->monitor_spells)
1476 return; 1191 return;
1477 1192
1478 for (object *spell = pl->ob->inv; spell; spell = spell->below) 1193 for (object *spell = pl->ob->inv; spell; spell = spell->below)
1479 {
1480 if (spell->type == SPELL) 1194 if (spell->type == SPELL)
1481 { 1195 {
1482 int flags = 0; 1196 int flags = 0;
1197 int val;
1483 1198
1484 /* check if we need to update it */ 1199 /* check if we need to update it */
1485 if (spell->cached_sp != SP_level_spellpoint_cost (pl->ob, spell, SPELL_MANA)) 1200 val = SP_level_spellpoint_cost (pl->ob, spell, SPELL_MANA);
1201 if (spell->cached_sp != val)
1486 { 1202 {
1487 spell->cached_sp = SP_level_spellpoint_cost (pl->ob, spell, SPELL_MANA); 1203 spell->cached_sp = val;
1488 flags |= UPD_SP_MANA; 1204 flags |= UPD_SP_MANA;
1489 } 1205 }
1490 1206
1491 if (spell->cached_grace != SP_level_spellpoint_cost (pl->ob, spell, SPELL_GRACE)) 1207 val = SP_level_spellpoint_cost (pl->ob, spell, SPELL_GRACE);
1208 if (spell->cached_grace != val)
1492 { 1209 {
1493 spell->cached_grace = SP_level_spellpoint_cost (pl->ob, spell, SPELL_GRACE); 1210 spell->cached_grace = val;
1494 flags |= UPD_SP_GRACE; 1211 flags |= UPD_SP_GRACE;
1495 } 1212 }
1496 1213
1497 if (spell->cached_eat != spell->stats.dam + SP_level_dam_adjust (pl->ob, spell)) 1214 val = casting_level (pl->ob, spell);
1215 if (spell->cached_eat != val)
1498 { 1216 {
1499 spell->cached_eat = spell->stats.dam + SP_level_dam_adjust (pl->ob, spell); 1217 spell->cached_eat = val;
1500 flags |= UPD_SP_DAMAGE; 1218 flags |= UPD_SP_LEVEL;
1501 } 1219 }
1502 1220
1503 if (flags) 1221 if (flags)
1504 { 1222 {
1505 packet sl; 1223 packet sl;
1506 1224
1507 sl << "updspell " 1225 sl << "updspell "
1508 << uint8 (flags) 1226 << uint8 (flags)
1509 << uint32 (spell->count); 1227 << uint32 (spell->count);
1510 1228
1511 if (flags & UPD_SP_MANA ) sl << uint16 (spell->cached_sp); 1229 if (flags & UPD_SP_MANA ) sl << uint16 (spell->cached_sp);
1512 if (flags & UPD_SP_GRACE ) sl << uint16 (spell->cached_grace); 1230 if (flags & UPD_SP_GRACE) sl << uint16 (spell->cached_grace);
1513 if (flags & UPD_SP_DAMAGE) sl << uint16 (spell->cached_eat); 1231 if (flags & UPD_SP_LEVEL) sl << uint16 (spell->cached_eat);
1514 1232
1515 pl->ns->send_packet (sl); 1233 pl->ns->send_packet (sl);
1516 } 1234 }
1517 } 1235 }
1518 }
1519} 1236}
1520 1237
1521void 1238void
1522esrv_remove_spell (player *pl, object *spell) 1239esrv_remove_spell (player *pl, object *spell)
1523{ 1240{
1550 } 1267 }
1551 1268
1552 /* store costs and damage in the object struct, to compare to later */ 1269 /* store costs and damage in the object struct, to compare to later */
1553 spell->cached_sp = SP_level_spellpoint_cost (pl->ob, spell, SPELL_MANA); 1270 spell->cached_sp = SP_level_spellpoint_cost (pl->ob, spell, SPELL_MANA);
1554 spell->cached_grace = SP_level_spellpoint_cost (pl->ob, spell, SPELL_GRACE); 1271 spell->cached_grace = SP_level_spellpoint_cost (pl->ob, spell, SPELL_GRACE);
1555 spell->cached_eat = spell->stats.dam + SP_level_dam_adjust (pl->ob, spell); 1272 spell->cached_eat = casting_level (pl->ob, spell);
1556 1273
1557 /* figure out which skill it uses, if it uses one */ 1274 /* figure out which skill it uses, if it uses one */
1558 if (spell->skill) 1275 if (spell->skill)
1559 if (object *tmp = pl->find_skill (spell->skill)) 1276 if (object *tmp = pl->find_skill (spell->skill))
1560 skill = tmp->subtype + CS_STAT_SKILLINFO; 1277 skill = CS_STAT_SKILLINFO + SKILL_INDEX (tmp);
1561 1278
1562 // spells better have a face 1279 // spells better have a face
1563 if (!spell->face) 1280 if (!spell->face)
1564 { 1281 {
1565 LOG (llevError, "%s: spell has no face, but face is mandatory.\n", &spell->name); 1282 LOG (llevError, "%s: spell has no face, but face is mandatory.\n", &spell->name);
1649 /* finally, we can send the packet */ 1366 /* finally, we can send the packet */
1650 pl->ns->flush_fx (); 1367 pl->ns->flush_fx ();
1651 pl->ns->send_packet (sl); 1368 pl->ns->send_packet (sl);
1652} 1369}
1653 1370
1371//-GPL
1372

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines