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.42 by root, Sat Dec 16 03:08:26 2006 UTC vs.
Revision 1.90 by root, Fri Apr 27 00:49:58 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) 2001 Mark Wedel 5 * Copyright (C) 2001 Mark Wedel
5 Copyright (C) 1992 Frank Tore Johansen 6 * Copyright (C) 1992 Frank Tore Johansen
6 7 *
7 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
8 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
9 the Free Software Foundation; either version 2 of the License, or 10 * the Free Software Foundation; either version 2 of the License, or
10 (at your option) any later version. 11 * (at your option) any later version.
11 12 *
12 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,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of 14 * but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details. 16 * GNU General Public License for more details.
16 17 *
17 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
18 along with this program; if not, write to the Free Software 19 * along with this program; if not, write to the Free Software
19 Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. 20 * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
20 21 *
21 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>
22*/ 23 */
23 24
24/** 25/**
25 * \file 26 * \file
26 * Client handling. 27 * Client handling.
27 * 28 *
… …
35 * 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
36 * way, we can use one dispatch table. 37 * way, we can use one dispatch table.
37 * 38 *
38 * esrv_map_new starts updating the map 39 * esrv_map_new starts updating the map
39 * 40 *
40 * esrv_map_setbelow allows filling in all of the faces for the map.
41 * if a face has not already been sent to the client, it is sent now.
42 *
43 * mapcellchanged, compactlayer, compactstack, perform the map compressing
44 * operations
45 *
46 */ 41 */
47 42
48#include <global.h> 43#include <global.h>
49#include <sproto.h> 44#include <sproto.h>
50 45
… …
86 -1, /* life stealing */ 81 -1, /* life stealing */
87 -1 /* Disease - not fully done yet */ 82 -1 /* Disease - not fully done yet */
88}; 83};
89 84
90static void 85static void
91socket_map_scroll (client * ns, int dx, int dy) 86socket_map_scroll (client *ns, int dx, int dy)
92{ 87{
93 struct Map newmap; 88 struct Map newmap;
94 int x, y, mx, my; 89 int x, y, mx, my;
95 90
96 ns->send_packet_printf ("map_scroll %d %d", dx, dy); 91 ns->send_packet_printf ("map_scroll %d %d", dx, dy);
… …
102 * complexities for the client, and probably doesn't make 97 * complexities for the client, and probably doesn't make
103 * that much difference in bandwidth. 98 * that much difference in bandwidth.
104 */ 99 */
105 mx = ns->mapx; 100 mx = ns->mapx;
106 my = ns->mapy; 101 my = ns->mapy;
107
108 if (ns->mapmode == Map1aCmd)
109 {
110 mx += MAX_HEAD_OFFSET;
111 my += MAX_HEAD_OFFSET;
112 }
113 102
114 /* 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
115 * (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,
116 * if the destination x or y coordinate is outside the viewable 105 * if the destination x or y coordinate is outside the viewable
117 * area, we clear the values - otherwise, the old values 106 * area, we clear the values - otherwise, the old values
… …
141} 130}
142 131
143static void 132static void
144clear_map (player *pl) 133clear_map (player *pl)
145{ 134{
146 client &socket = *pl->socket;
147
148 memset (&socket.lastmap, 0, sizeof (socket.lastmap)); 135 memset (&pl->ns->lastmap, 0, sizeof (pl->ns->lastmap));
149 136
137 pl->ns->force_newmap = false;
138
150 if (socket.newmapcmd == 1) 139 if (pl->ns->newmapcmd == 1)
151 socket.send_packet ("newmap"); 140 pl->ns->send_packet ("newmap");
152 141
153 socket.update_look = 1; 142 pl->ns->floorbox_reset ();
154 socket.look_position = 0;
155} 143}
156 144
157/** check for map change and send new map data */ 145/** check for map/region change and send new map data */
158static void 146static void
159check_map_change (player *pl) 147check_map_change (player *pl)
160{ 148{
161 client &socket = *pl->socket; 149 client &socket = *pl->ns;
162 object *ob = pl->ob; 150 object *ob = pl->ob;
163 char buf[MAX_BUF]; /* eauugggh */ 151 char buf[MAX_BUF]; /* eauugggh */
164 152
165 if (socket.current_map != ob->map) 153 if (socket.current_map != ob->map || socket.force_newmap)
166 { 154 {
155 clear_map (pl);
167 socket.current_map = ob->map; 156 socket.current_map = ob->map;
168
169 clear_map (pl);
170 157
171 if (socket.mapinfocmd) 158 if (socket.mapinfocmd)
172 { 159 {
173 if (ob->map && ob->map->path[0]) 160 if (ob->map && ob->map->path[0])
174 { 161 {
175 int flags = 0; 162 int flags = 0;
176 163
177 if (ob->map->tile_path[0]) 164 if (ob->map->tile_path[0]) flags |= 1;
178 flags |= 1;
179 if (ob->map->tile_path[1]) 165 if (ob->map->tile_path[1]) flags |= 2;
180 flags |= 2;
181 if (ob->map->tile_path[2]) 166 if (ob->map->tile_path[2]) flags |= 4;
182 flags |= 4;
183 if (ob->map->tile_path[3]) 167 if (ob->map->tile_path[3]) flags |= 8;
184 flags |= 8;
185 168
186 snprintf (buf, MAX_BUF, "mapinfo - spatial %d %d %d %d %d %s", 169 snprintf (buf, MAX_BUF, "mapinfo - spatial %d %d %d %d %d %s",
187 flags, socket.mapx / 2 - ob->x, socket.mapy / 2 - ob->y, ob->map->width, ob->map->height, ob->map->path); 170 flags, socket.mapx / 2 - ob->x, socket.mapy / 2 - ob->y, ob->map->width, ob->map->height, &ob->map->path);
188 } 171 }
189 else 172 else
190 snprintf (buf, MAX_BUF, "mapinfo current"); 173 snprintf (buf, MAX_BUF, "mapinfo current");
191 174
192 socket.send_packet (buf); 175 socket.send_packet (buf);
… …
200 if (socket.buggy_mapscroll && (abs (dx) > 8 || abs (dy) > 8)) 183 if (socket.buggy_mapscroll && (abs (dx) > 8 || abs (dy) > 8))
201 clear_map (pl); // current (<= 1.9.1) clients have unchecked buffer overflows 184 clear_map (pl); // current (<= 1.9.1) clients have unchecked buffer overflows
202 else 185 else
203 { 186 {
204 socket_map_scroll (&socket, ob->x - socket.current_x, ob->y - socket.current_y); 187 socket_map_scroll (&socket, ob->x - socket.current_x, ob->y - socket.current_y);
205 socket.update_look = 1; 188 socket.floorbox_reset ();
206 socket.look_position = 0;
207 } 189 }
208 } 190 }
209 191
210 socket.current_x = ob->x; 192 socket.current_x = ob->x;
211 socket.current_y = ob->y; 193 socket.current_y = ob->y;
194
195 region *reg = ob->region ();
196 if (socket.current_region != reg)
197 {
198 socket.current_region = reg;
199 socket.send_packet_printf ("drawinfo 0 You are now %s.\n(use whereami for more details)", &reg->longname);
200 }
212} 201}
213 202
214/** 203/**
215 * RequestInfo is sort of a meta command. There is some specific 204 * RequestInfo is sort of a meta command. There is some specific
216 * request of information, but we call other functions to provide 205 * request of information, but we call other functions to provide
… …
260{ 249{
261 INVOKE_PLAYER (EXTCMD, pl, ARG_DATA (buf, len)); 250 INVOKE_PLAYER (EXTCMD, pl, ARG_DATA (buf, len));
262} 251}
263 252
264void 253void
254ExtiCmd (char *buf, int len, client *ns)
255{
256 INVOKE_CLIENT (EXTICMD, ns, ARG_DATA (buf, len));
257}
258
259void
265MapInfoCmd (char *buf, int len, player *pl) 260MapInfoCmd (char *buf, int len, player *pl)
266{ 261{
267 // <mapinfo tag spatial tile-path 262 // <mapinfo tag spatial tile-path
268 // >mapinfo tag spatial flags x y w h hash 263 // >mapinfo tag spatial flags x y w h hash
269 264
… …
281 buf += 8; 276 buf += 8;
282 277
283 // initial map and its origin 278 // initial map and its origin
284 maptile *map = pl->ob->map; 279 maptile *map = pl->ob->map;
285 sint16 dx, dy; 280 sint16 dx, dy;
286 int mapx = pl->socket->mapx / 2 - pl->ob->x; 281 int mapx = pl->ns->mapx / 2 - pl->ob->x;
287 int mapy = pl->socket->mapy / 2 - pl->ob->y; 282 int mapy = pl->ns->mapy / 2 - pl->ob->y;
288 int max_distance = 8; // limit maximum path length to something generous 283 int max_distance = 8; // limit maximum path length to something generous
289 284
290 while (*buf && map && max_distance) 285 while (*buf && map && max_distance)
291 { 286 {
292 int dir = *buf++; 287 int dir = *buf++;
293 288
294 switch (dir) 289 switch (dir)
295 { 290 {
296 case '1': 291 case '1':
297 dx = 0; 292 dx = 0;
298 dy = -1; 293 dy = -1;
299 map = get_map_from_coord (map, &dx, &dy); 294 map = map->xy_find (dx, dy);
300 map && (mapy -= map->height); 295 map && (mapy -= map->height);
301 break; 296 break;
302 case '2': 297 case '2':
303 mapx += map->width; 298 mapx += map->width;
304 dx = map->width; 299 dx = map->width;
305 dy = 0; 300 dy = 0;
306 map = get_map_from_coord (map, &dx, &dy); 301 map = map->xy_find (dx, dy);
307 break; 302 break;
308 case '3': 303 case '3':
309 mapy += map->height; 304 mapy += map->height;
310 dx = 0; 305 dx = 0;
311 dy = map->height; 306 dy = map->height;
312 map = get_map_from_coord (map, &dx, &dy); 307 map = map->xy_find (dx, dy);
313 break; 308 break;
314 case '4': 309 case '4':
315 dx = -1; 310 dx = -1;
316 dy = 0; 311 dy = 0;
317 map = get_map_from_coord (map, &dx, &dy); 312 map = map->xy_find (dx, dy);
318 map && (mapx -= map->width); 313 map && (mapx -= map->width);
319 break; 314 break;
320 } 315 }
321 316
322 --max_distance; 317 --max_distance;
323 } 318 }
324 319
… …
326 snprintf (bigbuf, MAX_BUF, "mapinfo %s error", token); 321 snprintf (bigbuf, MAX_BUF, "mapinfo %s error", token);
327 else if (map && map->path[0]) 322 else if (map && map->path[0])
328 { 323 {
329 int flags = 0; 324 int flags = 0;
330 325
331 if (map->tile_path[0]) 326 if (map->tile_path[0]) flags |= 1;
332 flags |= 1;
333 if (map->tile_path[1]) 327 if (map->tile_path[1]) flags |= 2;
334 flags |= 2;
335 if (map->tile_path[2]) 328 if (map->tile_path[2]) flags |= 4;
336 flags |= 4;
337 if (map->tile_path[3]) 329 if (map->tile_path[3]) flags |= 8;
338 flags |= 8;
339 330
340 snprintf (bigbuf, MAX_BUF, "mapinfo %s spatial %d %d %d %d %d %s", token, flags, mapx, mapy, map->width, map->height, map->path); 331 snprintf (bigbuf, MAX_BUF, "mapinfo %s spatial %d %d %d %d %d %s", token, flags, mapx, mapy, map->width, map->height, &map->path);
341 } 332 }
342 else 333 else
343 snprintf (bigbuf, MAX_BUF, "mapinfo %s nomap", token); 334 snprintf (bigbuf, MAX_BUF, "mapinfo %s nomap", token);
344 } 335 }
345 else 336 else
346 snprintf (bigbuf, MAX_BUF, "mapinfo %s unsupported", token); 337 snprintf (bigbuf, MAX_BUF, "mapinfo %s unsupported", token);
347 338
348 pl->socket->send_packet (bigbuf); 339 pl->ns->send_packet (bigbuf);
349} 340}
350 341
351/** This is the Setup cmd - easy first implementation */ 342/** This is the Setup cmd */
352void 343void
353SetUp (char *buf, int len, client * ns) 344SetUp (char *buf, int len, client * ns)
354{ 345{
355 int s, slen; 346 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 {
406 ns->exp64 = atoi (param);
407 safe_strcat (cmdback, param, &slen, HUGE_BUF);
408 }
409 else if (!strcmp (cmd, "spellmon"))
410 {
411 ns->monitor_spells = atoi (param);
412 safe_strcat (cmdback, param, &slen, HUGE_BUF);
413 }
414 else if (!strcmp (cmd, "darkness"))
415 {
416 ns->darkness = atoi (param);
417 safe_strcat (cmdback, param, &slen, HUGE_BUF);
418 }
419 else if (!strcmp (cmd, "map1cmd"))
420 {
421 if (atoi (param))
422 ns->mapmode = Map1Cmd;
423 /* if beyond this size, need to use map1cmd no matter what */
424 if (ns->mapx > 11 || ns->mapy > 11)
425 ns->mapmode = Map1Cmd;
426 safe_strcat (cmdback, ns->mapmode == Map1Cmd ? "1" : "0", &slen, HUGE_BUF);
427 }
428 else if (!strcmp (cmd, "map1acmd"))
429 {
430 if (atoi (param))
431 ns->mapmode = Map1aCmd;
432 /* if beyond this size, need to use map1acmd no matter what */
433 if (ns->mapx > 11 || ns->mapy > 11)
434 ns->mapmode = Map1aCmd;
435 safe_strcat (cmdback, ns->mapmode == Map1aCmd ? "1" : "0", &slen, HUGE_BUF);
436 }
437 else if (!strcmp (cmd, "newmapcmd"))
438 {
439 ns->newmapcmd = atoi (param);
440 safe_strcat (cmdback, param, &slen, HUGE_BUF);
441// } else if (!strcmp(cmd,"plugincmd")) {
442// ns->plugincmd = atoi(param);
443// safe_strcat(cmdback, param, &slen, HUGE_BUF);
444 }
445 else if (!strcmp (cmd, "mapinfocmd"))
446 {
447 ns->mapinfocmd = atoi (param);
448 safe_strcat (cmdback, "1", &slen, HUGE_BUF);
449 }
450 else if (!strcmp (cmd, "extcmd"))
451 {
452 ns->extcmd = atoi (param);
453 safe_strcat (cmdback, "1", &slen, HUGE_BUF);
454 }
455 else if (!strcmp (cmd, "extmap"))
456 {
457 ns->extmap = atoi (param);
458 safe_strcat (cmdback, "1", &slen, HUGE_BUF);
459 }
460 else if (!strcmp (cmd, "facecache"))
461 {
462 ns->facecache = atoi (param);
463 safe_strcat (cmdback, param, &slen, HUGE_BUF);
464 }
465 else if (!strcmp (cmd, "faceset"))
466 {
467 char tmpbuf[20];
468 int q = atoi (param);
469
470 if (is_valid_faceset (q))
471 ns->faceset = q;
472 sprintf (tmpbuf, "%d", ns->faceset);
473 safe_strcat (cmdback, tmpbuf, &slen, HUGE_BUF);
474 /* if the client is using faceset, it knows about image2 command */
475 ns->image2 = 1;
476 }
477 else if (!strcmp (cmd, "itemcmd"))
478 {
479 /* Version of the item protocol command to use. Currently,
480 * only supported versions are 1 and 2. Using a numeric
481 * value will make it very easy to extend this in the future.
482 */
483 char tmpbuf[20];
484 int q = atoi (param);
485
486 if (q < 1 || q > 2)
487 {
488 strcpy (tmpbuf, "FALSE");
489 }
490 else
491 {
492 ns->itemcmd = q;
493 sprintf (tmpbuf, "%d", ns->itemcmd);
494 }
495 safe_strcat (cmdback, tmpbuf, &slen, HUGE_BUF);
496 }
497 else if (!strcmp (cmd, "mapsize"))
498 {
499 int x, y = 0;
500 char tmpbuf[MAX_BUF], *cp;
501
502 x = atoi (param);
503 for (cp = param; *cp != 0; cp++)
504 if (*cp == 'x' || *cp == 'X')
505 {
506 y = atoi (cp + 1);
507 break;
508 }
509 if (x < 9 || y < 9 || x > MAP_CLIENT_X || y > MAP_CLIENT_Y)
510 {
511 sprintf (tmpbuf, " %dx%d", MAP_CLIENT_X, MAP_CLIENT_Y);
512 safe_strcat (cmdback, tmpbuf, &slen, HUGE_BUF);
513 }
514 else
515 {
516 ns->mapx = x;
517 ns->mapy = y;
518 /* better to send back what we are really using and not the
519 * param as given to us in case it gets parsed differently.
520 */
521 sprintf (tmpbuf, "%dx%d", x, y);
522 safe_strcat (cmdback, tmpbuf, &slen, HUGE_BUF);
523 /* If beyond this size and still using orig map command, need to
524 * go to map1cmd.
525 */
526 if ((x > 11 || y > 11) && ns->mapmode == Map0Cmd)
527 ns->mapmode = Map1Cmd;
528 }
529 }
530 else if (!strcmp (cmd, "extendedMapInfos"))
531 {
532 /* Added by tchize
533 * prepare to use the mapextended command
534 */
535 char tmpbuf[20];
536
537 ns->ext_mapinfos = (atoi (param));
538 sprintf (tmpbuf, "%d", ns->ext_mapinfos);
539 safe_strcat (cmdback, tmpbuf, &slen, HUGE_BUF);
540 }
541 else if (!strcmp (cmd, "extendedTextInfos"))
542 {
543 /* Added by tchize
544 * prepare to use the extended text commands
545 * Client toggle this to non zero to get exttext
546 */
547 char tmpbuf[20];
548
549 ns->has_readable_type = (atoi (param));
550 sprintf (tmpbuf, "%d", ns->has_readable_type);
551 safe_strcat (cmdback, tmpbuf, &slen, HUGE_BUF);
552 }
553 else
554 {
555 /* Didn't get a setup command we understood -
556 * report a failure to the client.
557 */
558 safe_strcat (cmdback, "FALSE", &slen, HUGE_BUF);
559 }
560 } /* for processing all the setup commands */
561
562 LOG (llevInfo, "SendBack SetupCmd:: %s\n", cmdback);
563 ns->send_packet (cmdback);
564} 347}
565 348
566/** 349/**
567 * The client has requested to be added to the game. 350 * The client has requested to be added to the game.
568 * This is what takes care of it. We tell the client how things worked out. 351 * This is what takes care of it. We tell the client how things worked out.
569 * I am not sure if this file is the best place for this function. however, 352 * I am not sure if this file is the best place for this function. however,
570 * it either has to be here or init_sockets needs to be exported. 353 * it either has to be here or init_sockets needs to be exported.
571 */ 354 */
572void 355void
573AddMeCmd (char *buf, int len, client * ns) 356AddMeCmd (char *buf, int len, client *ns)
574{ 357{
575 Settings oldsettings; 358 INVOKE_CLIENT (ADDME, ns, ARG_DATA (buf, len));
576
577 oldsettings = settings;
578 if (ns->status != Ns_Add || add_player (ns))
579 ns->send_packet ("addme_failed");
580 else
581 ns->send_packet ("addme_success");
582
583 settings = oldsettings;
584} 359}
585 360
586/** Reply to ExtendedInfos command */ 361/** Reply to ExtendedInfos command */
587void 362void
588ToggleExtendedInfos (char *buf, int len, client * ns) 363ToggleExtendedInfos (char *buf, int len, client * ns)
… …
698 473
699 ns->send_packet (cmdback); 474 ns->send_packet (cmdback);
700} 475}
701 476
702/** 477/**
703 * A lot like the old AskSmooth (in fact, now called by AskSmooth). 478 * client requested an image. send it rate-limited
704 * Basically, it makes no sense to wait for the client to request a 479 * before flushing.
705 * a piece of data from us that we know the client wants. So
706 * if we know the client wants it, might as well push it to the
707 * client.
708 */
709static void
710SendSmooth (client * ns, uint16 face)
711{
712 uint16 smoothface;
713
714 /* If we can't find a face, return and set it so we won't try to send this
715 * again.
716 */ 480 */
717 if ((!FindSmooth (face, &smoothface)) && (!FindSmooth (smooth_face->number, &smoothface))) 481void
718 { 482AskFaceCmd (char *buf, int len, client *ns)
719 483{
720 LOG (llevError, "could not findsmooth for %d. Neither default (%s)\n", face, &smooth_face->name); 484 ns->askface.push_back (atoi (buf));
721 ns->faces_sent[face] |= NS_FACESENT_SMOOTH;
722 return;
723 }
724
725 if (!(ns->faces_sent[smoothface] & NS_FACESENT_FACE))
726 esrv_send_face (ns, smoothface, 0);
727
728 ns->faces_sent[face] |= NS_FACESENT_SMOOTH;
729
730 packet sl;
731
732 sl << "smooth "
733 << uint16 (face)
734 << uint16 (smoothface);
735
736 ns->send_packet (sl);
737} 485}
738 486
739 /** 487/**
740 * Tells client the picture it has to use 488 * Tells client the picture it has to use
741 * to smooth a picture number given as argument. 489 * to smooth a picture number given as argument.
742 */ 490 */
743void 491void
744AskSmooth (char *buf, int len, client * ns) 492AskSmooth (char *buf, int len, client *ns)
745{ 493{
746 uint16 facenbr; 494 ns->send_face (atoi (buf));
747 495 ns->flush_fx ();
748 facenbr = atoi (buf);
749 SendSmooth (ns, facenbr);
750} 496}
751 497
752/** 498/**
753 * This handles the general commands from the client (ie, north, fire, cast, 499 * This handles the general commands from the client (ie, north, fire, cast,
754 * etc.) 500 * etc.)
755 */ 501 */
756void 502void
757PlayerCmd (char *buf, int len, player *pl) 503PlayerCmd (char *buf, int len, player *pl)
758{ 504{
759
760 /* The following should never happen with a proper or honest client.
761 * Therefore, the error message doesn't have to be too clear - if
762 * someone is playing with a hacked/non working client, this gives them
763 * an idea of the problem, but they deserve what they get
764 */
765 if (pl->state != ST_PLAYING)
766 {
767 new_draw_info_format (NDI_UNIQUE, 0, pl->ob, "You can not issue commands - state is not ST_PLAYING (%s)", buf);
768 return;
769 }
770 /* Check if there is a count. In theory, a zero count could also be 505 /* Check if there is a count. In theory, a zero count could also be
771 * sent, so check for that also. 506 * sent, so check for that also.
772 */ 507 */
773 if (atoi (buf) || buf[0] == '0') 508 if (atoi (buf) || buf[0] == '0')
774 { 509 {
775 pl->count = atoi ((char *) buf); 510 pl->count = atoi ((char *) buf);
511
776 buf = strchr (buf, ' '); /* advance beyond the numbers */ 512 buf = strchr (buf, ' '); /* advance beyond the numbers */
777 if (!buf) 513 if (!buf)
778 {
779#ifdef ESRV_DEBUG
780 LOG (llevDebug, "PlayerCmd: Got count but no command.\n");
781#endif
782 return; 514 return;
783 } 515
784 buf++; 516 buf++;
785 } 517 }
786 /* This should not happen anymore. */ 518
787 if (pl->ob->speed_left < -1.0)
788 {
789 LOG (llevError, "Player has negative time - shouldn't do command.\n");
790 }
791 /* In c_new.c */
792 execute_newserver_command (pl->ob, (char *) buf); 519 execute_newserver_command (pl->ob, (char *) buf);
793 /* Perhaps something better should be done with a left over count.
794 * Cleaning up the input should probably be done first - all actions
795 * for the command that issued the count should be done before any other
796 * commands.
797 */
798 520
799 pl->count = 0;
800
801}
802
803
804/**
805 * This handles the general commands from the client (ie, north, fire, cast,
806 * etc.). It is a lot like PlayerCmd above, but is called with the
807 * 'ncom' method which gives more information back to the client so it
808 * can throttle.
809 */
810void
811NewPlayerCmd (char *buf, int len, player *pl)
812{
813 int time, repeat;
814 char command[MAX_BUF];
815 int pktlen;
816
817 if (len < 7)
818 {
819 LOG (llevDebug, "Corrupt ncom command <%s> not long enough - discarding\n", buf);
820 return;
821 }
822
823 pktlen = net_uint16 ((uint8 *)buf);
824 repeat = net_uint32 ((uint8 *)buf + 2);
825
826 /* -1 is special - no repeat, but don't update */
827 if (repeat != -1)
828 pl->count = repeat;
829
830 if ((len - 4) >= MAX_BUF)
831 len = MAX_BUF - 5;
832
833 strncpy ((char *) command, (char *) buf + 6, len - 4);
834 command[len - 4] = 0;
835
836 /* This should not happen anymore. */
837 if (pl->ob->speed_left < -1.0)
838 LOG (llevError, "Player has negative time - shouldn't do command.\n");
839
840 /* In c_new.c */
841 execute_newserver_command (pl->ob, (char *) command);
842 /* Perhaps something better should be done with a left over count. 521 /* Perhaps something better should be done with a left over count.
843 * Cleaning up the input should probably be done first - all actions 522 * Cleaning up the input should probably be done first - all actions
844 * for the command that issued the count should be done before any other 523 * for the command that issued the count should be done before any other
845 * commands. 524 * commands.
846 */ 525 */
847 pl->count = 0; 526 pl->count = 0;
527}
848 528
849 if (FABS (pl->ob->speed) < 0.001) 529
530/**
531 * This handles the general commands from the client (ie, north, fire, cast,
532 * etc.). It is a lot like PlayerCmd above, but is called with the
533 * 'ncom' method which gives more information back to the client so it
534 * can throttle.
535 */
536void
537NewPlayerCmd (char *buf, int len, player *pl)
538{
539 if (len <= 6)
540 {
541 LOG (llevDebug, "Corrupt ncom command <%s> not long enough - discarding\n", buf);
542 return;
543 }
544
545 uint16 cmdid = net_uint16 ((uint8 *)buf);
546 sint32 repeat = net_sint32 ((uint8 *)buf + 2);
547
548 /* -1 is special - no repeat, but don't update */
549 if (repeat != -1)
550 pl->count = repeat;
551
552 buf += 6; //len -= 6;
553
554 execute_newserver_command (pl->ob, buf);
555
556 /* Perhaps something better should be done with a left over count.
557 * Cleaning up the input should probably be done first - all actions
558 * for the command that issued the count should be done before any other
559 * commands.
560 */
561 pl->count = 0;
562
563 //TODO: schmorp thinks whatever this calculates, it makes no sense at all
564 int time = fabs (pl->ob->speed) < 0.001
850 time = MAX_TIME * 100; 565 ? time = MAX_TIME * 100
851 else
852 time = (int) (MAX_TIME / FABS (pl->ob->speed)); 566 : time = (int) (MAX_TIME / fabs (pl->ob->speed));
853 567
854 /* Send confirmation of command execution now */ 568 /* Send confirmation of command execution now */
855 569 packet sl ("comc");
856 packet sl;
857 sl << "comc " << uint16 (pktlen) << uint32 (time); 570 sl << uint16 (cmdid) << uint32 (time);
858 pl->socket->send_packet (sl); 571 pl->ns->send_packet (sl);
859} 572}
860
861 573
862/** This is a reply to a previous query. */ 574/** This is a reply to a previous query. */
863void 575void
864ReplyCmd (char *buf, int len, player *pl) 576ReplyCmd (char *buf, int len, client *ns)
865{ 577{
578 if (ns->state == ST_CUSTOM)
579 {
580 INVOKE_CLIENT (REPLY, ns, ARG_DATA (buf, len));
581 return;
582 }
583
584 if (!ns->pl)
585 return; //TODO: depends on the exact reply we are after
586 //TODO: but right now, we always have a ns->pl
587
588 player *pl = ns->pl;
589
866 /* This is to synthesize how the data would be stored if it 590 /* This is to synthesize how the data would be stored if it
867 * was normally entered. A bit of a hack, and should be cleaned up 591 * was normally entered. A bit of a hack, and should be cleaned up
868 * once all the X11 code is removed from the server. 592 * once all the X11 code is removed from the server.
869 * 593 *
870 * We pass 13 to many of the functions because this way they 594 * We pass 13 to many of the functions because this way they
871 * think it was the carriage return that was entered, and the 595 * think it was the carriage return that was entered, and the
872 * function then does not try to do additional input. 596 * function then does not try to do additional input.
873 */ 597 */
874 snprintf (pl->write_buf, sizeof (pl->write_buf), ":%s", buf); 598 snprintf (pl->write_buf, sizeof (pl->write_buf), ":%s", buf);
875 599
876 /* this avoids any hacking here */ 600 /* this avoids any hacking here */
877 601
878 switch (pl->state) 602 switch (ns->state)
879 { 603 {
880 case ST_PLAYING: 604 case ST_PLAYING:
881 LOG (llevError, "Got reply message with ST_PLAYING input state\n"); 605 LOG (llevError, "Got reply message with ST_PLAYING input state\n");
882 break; 606 break;
883 607
884 case ST_PLAY_AGAIN:
885 /* We can check this for return value (2==quit). Maybe we
886 * should, and do something appropriate?
887 */
888 receive_play_again (pl->ob, buf[0]);
889 break;
890
891 case ST_ROLL_STAT:
892 key_roll_stat (pl->ob, buf[0]);
893 break;
894
895 case ST_CHANGE_CLASS:
896
897 key_change_class (pl->ob, buf[0]);
898 break;
899
900 case ST_CONFIRM_QUIT:
901 key_confirm_quit (pl->ob, buf[0]);
902 break;
903
904 case ST_CONFIGURE:
905 LOG (llevError, "In client input handling, but into configure state\n");
906 pl->state = ST_PLAYING;
907 break;
908
909 case ST_GET_NAME:
910 receive_player_name (pl->ob, 13);
911 break;
912
913 case ST_GET_PASSWORD:
914 case ST_CONFIRM_PASSWORD:
915 receive_player_password (pl->ob, 13);
916 break;
917
918 case ST_GET_PARTY_PASSWORD: /* Get password for party */ 608 case ST_GET_PARTY_PASSWORD: /* Get password for party */
919 receive_party_password (pl->ob, 13); 609 receive_party_password (pl->ob, 13);
920 break; 610 break;
921 611
922 default: 612 default:
923 LOG (llevError, "Unknown input state: %d\n", pl->state); 613 LOG (llevError, "Unknown input state: %d\n", ns->state);
924 } 614 }
925} 615}
926 616
927/** 617/**
928 * Client tells its version. If there is a mismatch, we close the 618 * Client tells its version. If there is a mismatch, we close the
… …
932 * problem. 622 * problem.
933 */ 623 */
934void 624void
935VersionCmd (char *buf, int len, client * ns) 625VersionCmd (char *buf, int len, client * ns)
936{ 626{
937 char *cp;
938 char version_warning[256];
939
940 if (!buf) 627 if (!buf)
941 { 628 {
942 LOG (llevError, "CS: received corrupted version command\n"); 629 LOG (llevError, "CS: received corrupted version command\n");
943 return; 630 return;
944 } 631 }
945 632
946 ns->cs_version = atoi (buf); 633 ns->cs_version = atoi (buf);
947 ns->sc_version = ns->cs_version; 634 ns->sc_version = ns->cs_version;
635
636 LOG (llevDebug, "connection from client <%s>\n", buf);
637
638 //TODO: should log here just for statistics
639
948 if (VERSION_CS != ns->cs_version) 640 //if (VERSION_CS != ns->cs_version)
949 { 641 // unchecked;
950#ifdef ESRV_DEBUG 642
951 LOG (llevDebug, "CS: csversion mismatch (%d,%d)\n", VERSION_CS, ns->cs_version);
952#endif
953 }
954 cp = strchr (buf + 1, ' '); 643 char *cp = strchr (buf + 1, ' ');
955 if (!cp) 644 if (!cp)
956 return; 645 return;
646
957 ns->sc_version = atoi (cp); 647 ns->sc_version = atoi (cp);
648
958 if (VERSION_SC != ns->sc_version) 649 //if (VERSION_SC != ns->sc_version)
959 { 650 // unchecked;
960#ifdef ESRV_DEBUG 651
961 LOG (llevDebug, "CS: scversion mismatch (%d,%d)\n", VERSION_SC, ns->sc_version);
962#endif
963 }
964 cp = strchr (cp + 1, ' '); 652 cp = strchr (cp + 1, ' ');
653
965 if (cp) 654 if (cp)
966 { 655 {
967 LOG (llevDebug, "CS: connection from client of type <%s>, ip %s\n", cp, ns->host);
968
969 assign (ns->version, cp + 1); 656 ns->version = cp + 1;
970 657
971 if (ns->sc_version < 1026) 658 if (ns->sc_version < 1026)
972 { 659 ns->send_packet_printf ("drawinfo %d %s", NDI_RED,
973 sprintf (version_warning, "drawinfo %d %s", NDI_RED,
974 "**** VERSION WARNING ****\n**** CLIENT IS TOO OLD!! UPDATE THE CLIENT!! ****"); 660 "**** VERSION WARNING ****\n**** CLIENT IS TOO OLD!! UPDATE THE CLIENT!! ****");
975 ns->send_packet (version_warning);
976 }
977
978 } 661 }
979} 662}
980 663
981/** sound related functions. */ 664/** sound related functions. */
982void 665void
… …
984{ 667{
985 ns->sound = atoi (buf); 668 ns->sound = atoi (buf);
986} 669}
987 670
988/** client wants the map resent */ 671/** client wants the map resent */
989
990void 672void
991MapRedrawCmd (char *buf, int len, player *pl) 673MapRedrawCmd (char *buf, int len, player *pl)
992{ 674{
993
994/* This function is currently disabled; just clearing the map state results in 675/* This function is currently disabled; just clearing the map state results in
995 * display errors. It should clear the cache and send a newmap command. 676 * display errors. It should clear the cache and send a newmap command.
996 * Unfortunately this solution does not work because some client versions send 677 * Unfortunately this solution does not work because some client versions send
997 * a mapredraw command after receiving a newmap command. 678 * a mapredraw command after receiving a newmap command.
998 */ 679 */
999#if 0
1000 /* Okay, this is MAJOR UGLY. but the only way I know how to
1001 * clear the "cache"
1002 */
1003 memset (&pl->socket->lastmap, 0, sizeof (struct Map));
1004 draw_client_map (pl->ob);
1005#endif
1006} 680}
1007 681
1008/** 682/**
1009 * Moves an object (typically, container to inventory). 683 * Moves an object (typically, container to inventory).
1010 * syntax is: move (to) (tag) (nrof) 684 * syntax is: move (to) (tag) (nrof)
… …
1013MoveCmd (char *buf, int len, player *pl) 687MoveCmd (char *buf, int len, player *pl)
1014{ 688{
1015 int vals[3], i; 689 int vals[3], i;
1016 690
1017 /* A little funky here. We only cycle for 2 records, because 691 /* A little funky here. We only cycle for 2 records, because
1018 * we obviously am not going to find a space after the third 692 * we obviously are not going to find a space after the third
1019 * record. Perhaps we should just replace this with a 693 * record. Perhaps we should just replace this with a
1020 * sscanf? 694 * sscanf?
1021 */ 695 */
1022 for (i = 0; i < 2; i++) 696 for (i = 0; i < 2; i++)
1023 { 697 {
1024 vals[i] = atoi (buf); 698 vals[i] = atoi (buf);
699
1025 if (!(buf = strchr (buf, ' '))) 700 if (!(buf = strchr (buf, ' ')))
1026 { 701 {
1027 LOG (llevError, "Incomplete move command: %s\n", buf); 702 LOG (llevError, "Incomplete move command: %s\n", buf);
1028 return; 703 return;
1029 } 704 }
705
1030 buf++; 706 buf++;
1031 } 707 }
708
1032 vals[2] = atoi (buf); 709 vals[2] = atoi (buf);
1033 710
1034/* LOG(llevDebug,"Move item %d (nrof=%d) to %d.\n", vals[1], vals[2], vals[0]);*/ 711/* LOG(llevDebug,"Move item %d (nrof=%d) to %d.\n", vals[1], vals[2], vals[0]);*/
1035 esrv_move_object (pl->ob, vals[0], vals[1], vals[2]); 712 esrv_move_object (pl->ob, vals[0], vals[1], vals[2]);
1036} 713}
1037
1038
1039 714
1040/****************************************************************************** 715/******************************************************************************
1041 * 716 *
1042 * Start of commands the server sends to the client. 717 * Start of commands the server sends to the client.
1043 * 718 *
… …
1046/** 721/**
1047 * Asks the client to query the user. This way, the client knows 722 * Asks the client to query the user. This way, the client knows
1048 * it needs to send something back (vs just printing out a message) 723 * it needs to send something back (vs just printing out a message)
1049 */ 724 */
1050void 725void
1051send_query (client * ns, uint8 flags, char *text) 726send_query (client *ns, uint8 flags, const char *text)
1052{ 727{
1053 char buf[MAX_BUF];
1054
1055 sprintf (buf, "query %d %s", flags, text ? text : ""); 728 ns->send_packet_printf ("query %d %s", flags, text ? text : "");
1056 ns->send_packet (buf);
1057} 729}
1058 730
1059#define AddIfInt64(Old,New,Type) if (Old != New) {\ 731#define AddIfInt64(Old,New,Type) if (Old != New) {\
1060 Old = New; \ 732 Old = New; \
1061 sl << uint8 (Type) << uint64 (New); \ 733 sl << uint8 (Type) << uint64 (New); \
… …
1091esrv_update_stats (player *pl) 763esrv_update_stats (player *pl)
1092{ 764{
1093 char buf[MAX_BUF]; 765 char buf[MAX_BUF];
1094 uint16 flags; 766 uint16 flags;
1095 767
1096 packet sl; 768 client *ns = pl->ns;
1097 sl << "stats "; 769 if (!ns)
770 return;
1098 771
1099 if (pl->ob != NULL) 772 object *ob = pl->ob;
1100 { 773 if (!ob)
774 return;
775
776 packet sl ("stats");
777
1101 AddIfShort (pl->last_stats.hp, pl->ob->stats.hp, CS_STAT_HP); 778 AddIfShort (ns->last_stats.hp, ob->stats.hp, CS_STAT_HP);
1102 AddIfShort (pl->last_stats.maxhp, pl->ob->stats.maxhp, CS_STAT_MAXHP); 779 AddIfShort (ns->last_stats.maxhp, ob->stats.maxhp, CS_STAT_MAXHP);
1103 AddIfShort (pl->last_stats.sp, pl->ob->stats.sp, CS_STAT_SP); 780 AddIfShort (ns->last_stats.sp, ob->stats.sp, CS_STAT_SP);
1104 AddIfShort (pl->last_stats.maxsp, pl->ob->stats.maxsp, CS_STAT_MAXSP); 781 AddIfShort (ns->last_stats.maxsp, ob->stats.maxsp, CS_STAT_MAXSP);
1105 AddIfShort (pl->last_stats.grace, pl->ob->stats.grace, CS_STAT_GRACE); 782 AddIfShort (ns->last_stats.grace, ob->stats.grace, CS_STAT_GRACE);
1106 AddIfShort (pl->last_stats.maxgrace, pl->ob->stats.maxgrace, CS_STAT_MAXGRACE); 783 AddIfShort (ns->last_stats.maxgrace, ob->stats.maxgrace, CS_STAT_MAXGRACE);
1107 AddIfShort (pl->last_stats.Str, pl->ob->stats.Str, CS_STAT_STR); 784 AddIfShort (ns->last_stats.Str, ob->stats.Str, CS_STAT_STR);
1108 AddIfShort (pl->last_stats.Int, pl->ob->stats.Int, CS_STAT_INT);
1109 AddIfShort (pl->last_stats.Pow, pl->ob->stats.Pow, CS_STAT_POW);
1110 AddIfShort (pl->last_stats.Wis, pl->ob->stats.Wis, CS_STAT_WIS);
1111 AddIfShort (pl->last_stats.Dex, pl->ob->stats.Dex, CS_STAT_DEX); 785 AddIfShort (ns->last_stats.Dex, ob->stats.Dex, CS_STAT_DEX);
1112 AddIfShort (pl->last_stats.Con, pl->ob->stats.Con, CS_STAT_CON); 786 AddIfShort (ns->last_stats.Con, ob->stats.Con, CS_STAT_CON);
787 AddIfShort (ns->last_stats.Int, ob->stats.Int, CS_STAT_INT);
788 AddIfShort (ns->last_stats.Wis, ob->stats.Wis, CS_STAT_WIS);
789 AddIfShort (ns->last_stats.Pow, ob->stats.Pow, CS_STAT_POW);
1113 AddIfShort (pl->last_stats.Cha, pl->ob->stats.Cha, CS_STAT_CHA); 790 AddIfShort (ns->last_stats.Cha, ob->stats.Cha, CS_STAT_CHA);
1114 }
1115 791
1116 if (pl->socket->exp64)
1117 {
1118 uint8 s;
1119
1120 for (s = 0; s < NUM_SKILLS; s++) 792 for (int s = 0; s < NUM_SKILLS; s++)
793 if (object *skill = pl->last_skill_ob[s])
794 if (skill->stats.exp != ns->last_skill_exp [s])
1121 { 795 {
1122 if (pl->last_skill_ob[s] && pl->last_skill_exp[s] != pl->last_skill_ob[s]->stats.exp) 796 ns->last_skill_exp [s] = skill->stats.exp;
1123 { 797
1124 /* Always send along the level if exp changes. This is only 798 /* Always send along the level if exp changes. This is only
1125 * 1 extra byte, but keeps processing simpler. 799 * 1 extra byte, but keeps processing simpler.
1126 */ 800 */
1127 sl << uint8 (s + CS_STAT_SKILLINFO) 801 sl << uint8 (s + CS_STAT_SKILLINFO)
1128 << uint8 (pl->last_skill_ob[s]->level) 802 << uint8 (skill->level)
1129 << uint64 (pl->last_skill_ob[s]->stats.exp); 803 << uint64 (skill->stats.exp);
1130
1131 pl->last_skill_exp[s] = pl->last_skill_ob[s]->stats.exp;
1132 }
1133 } 804 }
1134 }
1135 805
1136 if (pl->socket->exp64)
1137 { AddIfInt64 (pl->last_stats.exp, pl->ob->stats.exp, CS_STAT_EXP64) } 806 AddIfInt64 (ns->last_stats.exp, ob->stats.exp, CS_STAT_EXP64);
1138 else
1139 { AddIfInt (pl->last_stats.exp, (int) pl->ob->stats.exp, CS_STAT_EXP) }
1140
1141 AddIfShort (pl->last_level, (char) pl->ob->level, CS_STAT_LEVEL); 807 AddIfShort (ns->last_level, ob->level, CS_STAT_LEVEL);
1142 AddIfShort (pl->last_stats.wc, pl->ob->stats.wc, CS_STAT_WC); 808 AddIfShort (ns->last_stats.wc, ob->stats.wc, CS_STAT_WC);
1143 AddIfShort (pl->last_stats.ac, pl->ob->stats.ac, CS_STAT_AC); 809 AddIfShort (ns->last_stats.ac, ob->stats.ac, CS_STAT_AC);
1144 AddIfShort (pl->last_stats.dam, pl->ob->stats.dam, CS_STAT_DAM); 810 AddIfShort (ns->last_stats.dam, ob->stats.dam, CS_STAT_DAM);
1145 AddIfFloat (pl->last_speed, pl->ob->speed, CS_STAT_SPEED); 811 AddIfFloat (ns->last_speed, ob->speed, CS_STAT_SPEED);
1146 AddIfShort (pl->last_stats.food, pl->ob->stats.food, CS_STAT_FOOD); 812 AddIfShort (ns->last_stats.food, ob->stats.food, CS_STAT_FOOD);
1147 AddIfFloat (pl->last_weapon_sp, pl->weapon_sp, CS_STAT_WEAP_SP); 813 AddIfFloat (ns->last_weapon_sp, pl->weapon_sp, CS_STAT_WEAP_SP);
1148 AddIfInt (pl->last_weight_limit, (sint32) weight_limit[pl->ob->stats.Str], CS_STAT_WEIGHT_LIM); 814 AddIfInt (ns->last_weight_limit, weight_limit[ob->stats.Str], CS_STAT_WEIGHT_LIM);
815
1149 flags = 0; 816 flags = 0;
1150 817
1151 if (pl->fire_on) 818 if (pl->fire_on)
1152 flags |= SF_FIREON; 819 flags |= SF_FIREON;
1153 820
1154 if (pl->run_on) 821 if (pl->run_on)
1155 flags |= SF_RUNON; 822 flags |= SF_RUNON;
1156 823
1157 AddIfShort (pl->last_flags, flags, CS_STAT_FLAGS); 824 AddIfShort (ns->last_flags, flags, CS_STAT_FLAGS);
1158 825
1159 if (pl->socket->sc_version < 1025) 826 if (ns->sc_version < 1025)
1160 { AddIfShort (pl->last_resist[ATNR_PHYSICAL], pl->ob->resist[ATNR_PHYSICAL], CS_STAT_ARMOUR) } 827 { AddIfShort (ns->last_resist[ATNR_PHYSICAL], ob->resist[ATNR_PHYSICAL], CS_STAT_ARMOUR) }
1161 else 828 else
1162 {
1163 int i;
1164
1165 for (i = 0; i < NROFATTACKS; i++) 829 for (int i = 0; i < NROFATTACKS; i++)
1166 { 830 {
1167 /* Skip ones we won't send */ 831 /* Skip ones we won't send */
1168 if (atnr_cs_stat[i] == -1) 832 if (atnr_cs_stat[i] == -1)
1169 continue; 833 continue;
1170 834
1171 AddIfShort (pl->last_resist[i], pl->ob->resist[i], (char) atnr_cs_stat[i]); 835 AddIfShort (ns->last_resist[i], ob->resist[i], atnr_cs_stat[i]);
1172 } 836 }
1173 }
1174 837
1175 if (pl->socket->monitor_spells) 838 if (pl->ns->monitor_spells)
1176 { 839 {
1177 AddIfInt (pl->last_path_attuned, pl->ob->path_attuned, CS_STAT_SPELL_ATTUNE); 840 AddIfInt (ns->last_path_attuned, ob->path_attuned, CS_STAT_SPELL_ATTUNE);
1178 AddIfInt (pl->last_path_repelled, pl->ob->path_repelled, CS_STAT_SPELL_REPEL); 841 AddIfInt (ns->last_path_repelled, ob->path_repelled, CS_STAT_SPELL_REPEL);
1179 AddIfInt (pl->last_path_denied, pl->ob->path_denied, CS_STAT_SPELL_DENY); 842 AddIfInt (ns->last_path_denied, ob->path_denied, CS_STAT_SPELL_DENY);
1180 } 843 }
1181 844
1182 rangetostring (pl->ob, buf); /* we want use the new fire & run system in new client */ 845 rangetostring (ob, buf); /* we want use the new fire & run system in new client */
1183 AddIfString (pl->socket->stats.range, buf, CS_STAT_RANGE); 846 AddIfString (ns->stats.range, buf, CS_STAT_RANGE);
1184 set_title (pl->ob, buf); 847 set_title (ob, buf);
1185 AddIfString (pl->socket->stats.title, buf, CS_STAT_TITLE); 848 AddIfString (ns->stats.title, buf, CS_STAT_TITLE);
1186 849
1187 /* Only send it away if we have some actual data */ 850 /* Only send it away if we have some actual data */
1188 if (sl.length () > 6) 851 if (sl.length () > 6)
1189 pl->socket->send_packet (sl); 852 ns->send_packet (sl);
1190} 853}
1191 854
1192/** 855/**
1193 * Tells the client that here is a player it should start using. 856 * Tells the client that here is a player it should start using.
1194 */ 857 */
1195void 858void
1196esrv_new_player (player *pl, uint32 weight) 859esrv_new_player (player *pl, uint32 weight)
1197{ 860{
1198 pl->last_weight = weight; 861 packet sl ("player");
1199
1200 packet sl;
1201 sl << "player ";
1202 862
1203 sl << uint32 (pl->ob->count) 863 sl << uint32 (pl->ob->count)
1204 << uint32 (weight) 864 << uint32 (weight)
1205 << uint32 (pl->ob->face->number) 865 << uint32 (pl->ob->face)
1206 << data8 (pl->ob->name); 866 << data8 (pl->ob->name);
1207 867
868 pl->ns->last_weight = weight;
1208 pl->socket->send_packet (sl); 869 pl->ns->send_packet (sl);
1209 SET_FLAG (pl->ob, FLAG_CLIENT_SENT); 870 SET_FLAG (pl->ob, FLAG_CLIENT_SENT);
1210} 871}
1211
1212/**
1213 * Need to send an animation sequence to the client.
1214 * We will send appropriate face commands to the client if we haven't
1215 * sent them the face yet (this can become quite costly in terms of
1216 * how much we are sending - on the other hand, this should only happen
1217 * when the player logs in and picks stuff up.
1218 */
1219void
1220esrv_send_animation (client * ns, short anim_num)
1221{
1222 int i;
1223
1224 /* Do some checking on the anim_num we got. Note that the animations
1225 * are added in contigous order, so if the number is in the valid
1226 * range, it must be a valid animation.
1227 */
1228 if (anim_num < 0 || anim_num > num_animations)
1229 {
1230 LOG (llevError, "esrv_send_anim (%d) out of bounds??\n", anim_num);
1231 return;
1232 }
1233
1234 packet sl;
1235
1236 sl << "anim "
1237 << uint16 (anim_num)
1238 << uint16 (0); /* flags - not used right now */
1239
1240 /* Build up the list of faces. Also, send any information (ie, the
1241 * the face itself) down to the client.
1242 */
1243 for (i = 0; i < animations[anim_num].num_animations; i++)
1244 {
1245 if (!(ns->faces_sent[animations[anim_num].faces[i]] & NS_FACESENT_FACE))
1246 esrv_send_face (ns, animations[anim_num].faces[i], 0);
1247 sl << uint16 (animations[anim_num].faces[i]); /* flags - not used right now */
1248 }
1249
1250 ns->send_packet (sl);
1251
1252 ns->anims_sent[anim_num] = 1;
1253}
1254
1255 872
1256/****************************************************************************** 873/******************************************************************************
1257 * 874 *
1258 * Start of map related commands. 875 * Start of map related commands.
1259 * 876 *
1260 ******************************************************************************/ 877 ******************************************************************************/
1261 878
1262/**
1263 * This adds face_num to a map cell at x,y. If the client doesn't have
1264 * the face yet, we will also send it.
1265 */
1266static void
1267esrv_map_setbelow (client * ns, int x, int y, short face_num, struct Map *newmap)
1268{
1269 if (newmap->cells[x][y].count >= MAP_LAYERS)
1270 {
1271 LOG (llevError, "Too many faces in map cell %d %d\n", x, y);
1272 return;
1273 abort ();
1274 }
1275
1276 newmap->cells[x][y].faces[newmap->cells[x][y].count] = face_num;
1277 newmap->cells[x][y].count++;
1278
1279 if (!(ns->faces_sent[face_num] & NS_FACESENT_FACE))
1280 esrv_send_face (ns, face_num, 0);
1281}
1282
1283struct LayerCell
1284{
1285 uint16 xy;
1286 short face;
1287};
1288
1289struct MapLayer
1290{
1291 int count;
1292 struct LayerCell lcells[MAP_CLIENT_X * MAP_CLIENT_Y];
1293};
1294
1295/** Checkes if map cells have changed */
1296static int
1297mapcellchanged (client * ns, int i, int j, struct Map *newmap)
1298{
1299 int k;
1300
1301 if (ns->lastmap.cells[i][j].count != newmap->cells[i][j].count)
1302 return 1;
1303 for (k = 0; k < newmap->cells[i][j].count; k++)
1304 {
1305 if (ns->lastmap.cells[i][j].faces[k] != newmap->cells[i][j].faces[k])
1306 {
1307 return 1;
1308 }
1309 }
1310 return 0;
1311}
1312
1313/**
1314 * Basically, what this does is pack the data into layers.
1315 * cnum is the client number, cur is the the buffer we put all of
1316 * this data into. we return the end of the data. layers is
1317 * how many layers of data we should back.
1318 */
1319static uint8 *
1320compactlayer (client * ns, unsigned char *cur, int numlayers, struct Map *newmap)
1321{
1322 int x, y, k;
1323 int face;
1324 unsigned char *fcur;
1325 struct MapLayer layers[MAP_LAYERS];
1326
1327 for (k = 0; k < MAP_LAYERS; k++)
1328 layers[k].count = 0;
1329 fcur = cur;
1330 for (x = 0; x < ns->mapx; x++)
1331 {
1332 for (y = 0; y < ns->mapy; y++)
1333 {
1334 if (!mapcellchanged (ns, x, y, newmap))
1335 continue;
1336 if (newmap->cells[x][y].count == 0)
1337 {
1338 *cur = x * ns->mapy + y; /* mark empty space */
1339 cur++;
1340 continue;
1341 }
1342 for (k = 0; k < newmap->cells[x][y].count; k++)
1343 {
1344 layers[k].lcells[layers[k].count].xy = x * ns->mapy + y;
1345 layers[k].lcells[layers[k].count].face = newmap->cells[x][y].faces[k];
1346 layers[k].count++;
1347 }
1348 }
1349 }
1350 /* If no data, return now. */
1351 if (fcur == cur && layers[0].count == 0)
1352 return cur;
1353 *cur = 255; /* mark end of explicitly cleared cells */
1354 cur++;
1355 /* First pack by layers. */
1356 for (k = 0; k < numlayers; k++)
1357 {
1358 if (layers[k].count == 0)
1359 break; /* once a layer is entirely empty, no layer below it can
1360 have anything in it either */
1361 /* Pack by entries in thie layer */
1362 for (x = 0; x < layers[k].count;)
1363 {
1364 fcur = cur;
1365 *cur = layers[k].lcells[x].face >> 8;
1366 cur++;
1367 *cur = layers[k].lcells[x].face & 0xFF;
1368 cur++;
1369 face = layers[k].lcells[x].face;
1370 /* Now, we back the redundant data into 1 byte xy pairings */
1371 for (y = x; y < layers[k].count; y++)
1372 {
1373 if (layers[k].lcells[y].face == face)
1374 {
1375 *cur = (uint8) layers[k].lcells[y].xy;
1376 cur++;
1377 layers[k].lcells[y].face = -1;
1378 }
1379 }
1380 *(cur - 1) = *(cur - 1) | 128; /* mark for end of xy's; 11*11 < 128 */
1381 /* forward over the now redundant data */
1382 while (x < layers[k].count && layers[k].lcells[x].face == -1)
1383 x++;
1384 }
1385 *fcur = *fcur | 128; /* mark for end of faces at this layer */
1386 }
1387 return cur;
1388}
1389
1390/** Clears a map cell */ 879/** Clears a map cell */
1391static void 880static void
1392map_clearcell (struct MapCell *cell, int face0, int face1, int face2, int count) 881map_clearcell (struct MapCell *cell, int count)
1393{ 882{
1394 cell->faces[0] = face0; 883 cell->faces[0] = 0;
1395 cell->faces[1] = face1; 884 cell->faces[1] = 0;
1396 cell->faces[2] = face2; 885 cell->faces[2] = 0;
886 cell->smooth[0] = 0;
887 cell->smooth[1] = 0;
888 cell->smooth[2] = 0;
1397 cell->count = count; 889 cell->count = count;
1398 cell->stat_hp = 0; 890 cell->stat_hp = 0;
1399 cell->flags = 0; 891 cell->flags = 0;
1400 cell->player = 0; 892 cell->player = 0;
1401} 893}
1402 894
1403#define MAX_HEAD_POS MAX(MAX_CLIENT_X, MAX_CLIENT_Y)
1404#define MAX_LAYERS 3 895#define MAX_LAYERS 3
1405
1406/* Using a global really isn't a good approach, but saves the over head of
1407 * allocating and deallocating such a block of data each time run through,
1408 * and saves the space of allocating this in the socket object when we only
1409 * need it for this cycle. If the serve is ever threaded, this needs to be
1410 * re-examined.
1411 */
1412
1413static object *heads[MAX_HEAD_POS * MAX_HEAD_POS * MAX_LAYERS];
1414
1415/**
1416 * Returns true if any of the heads for this
1417 * space is set. Returns false if all are blank - this is used
1418 * for empty space checking.
1419 */
1420static inline int
1421have_head (int ax, int ay)
1422{
1423
1424 if (heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS] ||
1425 heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS + 1] || heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS + 2])
1426 return 1;
1427 return 0;
1428}
1429
1430/**
1431 * check_head is a bit simplistic version of update_space below.
1432 * basically, it only checks the that the head on space ax,ay at layer
1433 * needs to get sent - if so, it adds the data, sending the head
1434 * if needed, and returning 1. If this no data needs to get
1435 * sent, it returns zero.
1436 */
1437static int
1438check_head (packet &sl, client &ns, int ax, int ay, int layer)
1439{
1440 short face_num;
1441
1442 if (heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS + layer])
1443 face_num = heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS + layer]->face->number;
1444 else
1445 face_num = 0;
1446
1447 if (face_num != ns.lastmap.cells[ax][ay].faces[layer])
1448 {
1449 sl << uint16 (face_num);
1450 if (face_num && !(ns.faces_sent[face_num] & NS_FACESENT_FACE))
1451 esrv_send_face (&ns, face_num, 0);
1452
1453 heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS + layer] = NULL;
1454 ns.lastmap.cells[ax][ay].faces[layer] = face_num;
1455 return 1;
1456 }
1457
1458 return 0; /* No change */
1459}
1460 896
1461/** 897/**
1462 * Removes the need to replicate the same code for each layer. 898 * Removes the need to replicate the same code for each layer.
1463 * this returns true if this space is now in fact different than 899 * this returns true if this space is now in fact different than
1464 * it was. 900 * it was.
1465 * sl is the socklist this data is going into. 901 * sl is the socklist this data is going into.
1466 * ns is the socket we are working on - all the info we care 902 * ns is the socket we are working on - all the info we care
1467 * about is in this socket structure, so now need not pass the 903 * about is in this socket structure, so now need not pass the
1468 * entire player object. 904 * entire player object.
1469 * mx and my are map coordinate offsets for map mp
1470 * sx and sy are the offsets into the socket structure that
1471 * holds the old values.
1472 * layer is the layer to update, with 2 being the floor and 0 the 905 * layer is the layer to update, with 2 being the floor and 0 the
1473 * top layer (this matches what the GET_MAP_FACE and GET_MAP_FACE_OBJ) 906 * top layer (this matches what the GET_MAP_FACE and GET_MAP_FACE_OBJ)
1474 * take. Interesting to note that before this function, the map1 function 907 * take. Interesting to note that before this function, the map1 function
1475 * numbers the spaces differently - I think this was a leftover from 908 * numbers the spaces differently - I think this was a leftover from
1476 * the map command, where the faces stack up. Sinces that is no longer 909 * the map command, where the faces stack up. Sinces that is no longer
1477 * the case, it seems to make more sense to have these layer values 910 * the case, it seems to make more sense to have these layer values
1478 * actually match. 911 * actually match.
1479 */ 912 */
1480
1481static int 913static int
1482update_space (packet &sl, client &ns, maptile *mp, int mx, int my, int sx, int sy, int layer) 914update_space (packet &sl, client &ns, mapspace &ms, MapCell &lastcell, int layer)
1483{ 915{
1484 object *ob, *head; 916 object *ob = ms.faces_obj [layer];
1485 uint16 face_num;
1486 int bx, by, i;
1487
1488 /* If there is a multipart object stored away, treat that as more important.
1489 * If not, then do the normal processing.
1490 */
1491 head = heads[(sy * MAX_HEAD_POS + sx) * MAX_LAYERS + layer];
1492
1493 /* Check to see if this head is part of the set of objects
1494 * we would normally send for this space. If so, then
1495 * don't use the head value. We need to do the check
1496 * here and not when setting up the heads[] value for two reasons -
1497 * 1) the heads[] values will get used even if the space is not visible.
1498 * 2) its possible the head is not on the same map as a part, and I'd
1499 * rather not need to do the map translation overhead.
1500 * 3) We need to do some extra checking to make sure that we will
1501 * otherwise send the image as this layer, eg, either it matches
1502 * the head value, or is not multipart.
1503 */
1504 if (head && !head->more)
1505 {
1506 for (i = 0; i < MAP_LAYERS; i++)
1507 {
1508 ob = GET_MAP_FACE_OBJ (mp, mx, my, i);
1509 if (!ob)
1510 continue;
1511
1512 if (ob->head)
1513 ob = ob->head;
1514
1515 if (ob == head)
1516 {
1517 heads[(sy * MAX_HEAD_POS + sx) * MAX_LAYERS + layer] = NULL;
1518 head = NULL;
1519 break;
1520 }
1521 }
1522 }
1523
1524 ob = head;
1525 if (!ob)
1526 ob = GET_MAP_FACE_OBJ (mp, mx, my, layer);
1527 917
1528 /* If there is no object for this space, or if the face for the object 918 /* If there is no object for this space, or if the face for the object
1529 * is the blank face, set the face number to zero. 919 * is the blank face, set the face number to zero.
1530 * else if we have the stored head object for this space, that takes 920 * else if we have the stored head object for this space, that takes
1531 * precedence over the other object for this space. 921 * precedence over the other object for this space.
1532 * otherwise, we do special head processing 922 * otherwise, we do special head processing
1533 */ 923 */
1534 if (!ob || ob->face == blank_face) 924 uint16 face_num = ob && ob->face != blank_face ? ob->face : 0;
1535 face_num = 0;
1536 else if (head)
1537 {
1538 /* if this is a head that had previously been stored */
1539 face_num = ob->face->number;
1540 }
1541 else
1542 {
1543 /* if the faces for the different parts of a multipart object
1544 * are the same, we only want to send the bottom right most
1545 * portion of the object. That info is in the tail_.. values
1546 * of the head. Note that for the head itself, ob->head will
1547 * be null, so we only do this block if we are working on
1548 * a tail piece.
1549 */
1550
1551 /* tail_x and tail_y will only be set in the head object. If
1552 * this is the head object and these are set, we proceed
1553 * with logic to only send bottom right. Similarly, if
1554 * this is one of the more parts but the head has those values
1555 * set, we want to do the processing. There can be cases where
1556 * the head is not visible but one of its parts is, so we just
1557 * can always expect that ob->arch->tail_x will be true for all
1558 * object we may want to display.
1559 */
1560 if ((ob->arch->tail_x || ob->arch->tail_y) || (ob->head && (ob->head->arch->tail_x || ob->head->arch->tail_y)))
1561 {
1562
1563 if (ob->head)
1564 head = ob->head;
1565 else
1566 head = ob;
1567
1568 /* Basically figure out where the offset is from where we are right
1569 * now. the ob->arch->clone.{x,y} values hold the offset that this current
1570 * piece is from the head, and the tail is where the tail is from the
1571 * head. Note that bx and by will equal sx and sy if we are already working
1572 * on the bottom right corner. If ob is the head, the clone values
1573 * will be zero, so the right thing will still happen.
1574 */
1575 bx = sx + head->arch->tail_x - ob->arch->clone.x;
1576 by = sy + head->arch->tail_y - ob->arch->clone.y;
1577
1578 /* I don't think this can ever happen, but better to check for it just
1579 * in case.
1580 */
1581 if (bx < sx || by < sy)
1582 {
1583 LOG (llevError, "update_space: bx (%d) or by (%d) is less than sx (%d) or sy (%d)\n", bx, by, sx, sy);
1584 face_num = 0;
1585 }
1586 /* single part object, multipart object with non merged faces,
1587 * of multipart object already at lower right.
1588 */
1589 else if (bx == sx && by == sy)
1590 {
1591 face_num = ob->face->number;
1592
1593 /* if this face matches one stored away, clear that one away.
1594 * this code relies on the fact that the map1 commands
1595 * goes from 2 down to 0.
1596 */
1597 for (i = 0; i < MAP_LAYERS; i++)
1598 if (heads[(sy * MAX_HEAD_POS + sx) * MAX_LAYERS + i] &&
1599 heads[(sy * MAX_HEAD_POS + sx) * MAX_LAYERS + i]->face->number == face_num)
1600 heads[(sy * MAX_HEAD_POS + sx) * MAX_LAYERS + i] = NULL;
1601 }
1602 else
1603 {
1604 /* If this head is stored away, clear it - otherwise,
1605 * there can be cases where a object is on multiple layers -
1606 * we only want to send it once.
1607 */
1608 face_num = head->face->number;
1609 for (i = 0; i < MAP_LAYERS; i++)
1610 if (heads[(by * MAX_HEAD_POS + bx) * MAX_LAYERS + i] &&
1611 heads[(by * MAX_HEAD_POS + bx) * MAX_LAYERS + i]->face->number == face_num)
1612 heads[(by * MAX_HEAD_POS + bx) * MAX_LAYERS + i] = NULL;
1613
1614 /* First, try to put the new head on the same layer. If that is used up,
1615 * then find another layer.
1616 */
1617 if (heads[(by * MAX_HEAD_POS + bx) * MAX_LAYERS + layer] == NULL)
1618 {
1619 heads[(by * MAX_HEAD_POS + bx) * MAX_LAYERS + layer] = head;
1620 }
1621 else
1622 for (i = 0; i < MAX_LAYERS; i++)
1623 {
1624 if (heads[(by * MAX_HEAD_POS + bx) * MAX_LAYERS + i] == NULL ||
1625 heads[(by * MAX_HEAD_POS + bx) * MAX_LAYERS + i] == head)
1626 {
1627 heads[(by * MAX_HEAD_POS + bx) * MAX_LAYERS + i] = head;
1628 }
1629 }
1630 face_num = 0; /* Don't send this object - we'll send the head later */
1631 }
1632 }
1633 else
1634 {
1635 /* In this case, we are already at the lower right or single part object,
1636 * so nothing special
1637 */
1638 face_num = ob->face->number;
1639
1640 /* clear out any head entries that have the same face as this one */
1641 for (bx = 0; bx < layer; bx++)
1642 if (heads[(sy * MAX_HEAD_POS + sx) * MAX_LAYERS + bx] &&
1643 heads[(sy * MAX_HEAD_POS + sx) * MAX_LAYERS + bx]->face->number == face_num)
1644 heads[(sy * MAX_HEAD_POS + sx) * MAX_LAYERS + bx] = NULL;
1645 }
1646 } /* else not already head object or blank face */
1647
1648 /* This is a real hack. Basically, if we have nothing to send for this layer,
1649 * but there is a head on the next layer, send that instead.
1650 * Without this, what happens is you can get the case where the player stands
1651 * on the same space as the head. However, if you have overlapping big objects
1652 * of the same type, what happens then is it doesn't think it needs to send
1653 * This tends to make stacking also work/look better.
1654 */
1655 if (!face_num && layer > 0 && heads[(sy * MAX_HEAD_POS + sx) * MAX_LAYERS + layer - 1])
1656 {
1657 face_num = heads[(sy * MAX_HEAD_POS + sx) * MAX_LAYERS + layer - 1]->face->number;
1658 heads[(sy * MAX_HEAD_POS + sx) * MAX_LAYERS + layer - 1] = NULL;
1659 }
1660
1661 /* Another hack - because of heads and whatnot, this face may match one
1662 * we already sent for a lower layer. In that case, don't send
1663 * this one.
1664 */
1665 if (face_num && layer + 1 < MAP_LAYERS && ns.lastmap.cells[sx][sy].faces[layer + 1] == face_num)
1666 face_num = 0;
1667 925
1668 /* We've gotten what face we want to use for the object. Now see if 926 /* We've gotten what face we want to use for the object. Now see if
1669 * if it has changed since we last sent it to the client. 927 * if it has changed since we last sent it to the client.
1670 */ 928 */
1671 if (ns.lastmap.cells[sx][sy].faces[layer] != face_num) 929 if (lastcell.faces[layer] != face_num)
1672 { 930 {
1673 ns.lastmap.cells[sx][sy].faces[layer] = face_num; 931 lastcell.faces[layer] = face_num;
932
1674 if (!(ns.faces_sent[face_num] & NS_FACESENT_FACE)) 933 if (!ns.faces_sent[face_num])
934 if (ob)
935 ns.send_faces (ob);
936 else
1675 esrv_send_face (&ns, face_num, 0); 937 ns.send_face (face_num);
1676 938
1677 sl << uint16 (face_num); 939 sl << uint16 (face_num);
1678 return 1;
1679 }
1680
1681 /* Nothing changed */
1682 return 0;
1683}
1684
1685/**
1686 * This function is mainly a copy of update_space,
1687 * except it handles update of the smoothing updates,
1688 * not the face updates.
1689 * Removes the need to replicate the same code for each layer.
1690 * this returns true if this smooth is now in fact different
1691 * than it was.
1692 * sl is the socklist this data is going into.
1693 * ns is the socket we are working on - all the info we care
1694 * about is in this socket structure, so know need to pass the
1695 * entire player object.
1696 * mx and my are map coordinate offsets for map mp
1697 * sx and sy are the offsets into the socket structure that
1698 * holds the old values.
1699 * layer is the layer to update, with 2 being the floor and 0 the
1700 * top layer (this matches what the GET_MAP_FACE and GET_MAP_FACE_OBJ
1701 * take.
1702 */
1703
1704static inline int
1705update_smooth (packet &sl, client &ns, maptile *mp, int mx, int my, int sx, int sy, int layer)
1706{
1707 object *ob;
1708 int smoothlevel; /* old face_num; */
1709
1710 ob = GET_MAP_FACE_OBJ (mp, mx, my, layer);
1711
1712 /* If there is no object for this space, or if the face for the object
1713 * is the blank face, set the smoothlevel to zero.
1714 */
1715 if (!ob || ob->face == blank_face || MAP_NOSMOOTH (mp))
1716 smoothlevel = 0;
1717 else
1718 {
1719 smoothlevel = ob->smoothlevel;
1720 if (smoothlevel && !(ns.faces_sent[ob->face->number] & NS_FACESENT_SMOOTH))
1721 SendSmooth (&ns, ob->face->number);
1722 } /* else not already head object or blank face */
1723
1724 /* We've gotten what face we want to use for the object. Now see if
1725 * if it has changed since we last sent it to the client.
1726 */
1727 if (smoothlevel > 255)
1728 smoothlevel = 255;
1729 else if (smoothlevel < 0)
1730 smoothlevel = 0;
1731
1732 if (ns.lastmap.cells[sx][sy].smooth[layer] != smoothlevel)
1733 {
1734 ns.lastmap.cells[sx][sy].smooth[layer] = smoothlevel;
1735 sl << uint8 (smoothlevel);
1736 return 1; 940 return 1;
1737 } 941 }
1738 942
1739 /* Nothing changed */ 943 /* Nothing changed */
1740 return 0; 944 return 0;
… …
1753 if (ns->ext_mapinfos) 957 if (ns->ext_mapinfos)
1754 { 958 {
1755 if (ns->EMI_smooth) 959 if (ns->EMI_smooth)
1756 result += 1; /*One byte for smoothlevel */ 960 result += 1; /*One byte for smoothlevel */
1757 } 961 }
962
1758 return result; 963 return result;
964}
965
966// prefetch (and touch) all maps within a specific distancd
967static void
968prefetch_surrounding_maps (maptile *map, int distance)
969{
970 map->last_access = runtime;
971
972 if (--distance)
973 for (int dir = 4; --dir; )
974 if (const shstr &path = map->tile_path [dir])
975 if (maptile *&neigh = map->tile_map [dir])
976 prefetch_surrounding_maps (neigh, distance);
977 else
978 neigh = maptile::find_async (path, map);
979}
980
981// prefetch a generous area around the player
982static void
983prefetch_surrounding_maps (object *op)
984{
985 prefetch_surrounding_maps (op->map, 3);
1759} 986}
1760 987
1761/** 988/**
1762 * This function uses the new map1 protocol command to send the map 989 * This function uses the new map1 protocol command to send the map
1763 * to the client. It is necessary because the old map command supports 990 * to the client. It is necessary because the old map command supports
… …
1769 * we need 2 bytes for coordinates and 2 bytes for faces, such a trade off 996 * we need 2 bytes for coordinates and 2 bytes for faces, such a trade off
1770 * maps no sense. Instead, we actually really only use 12 bits for coordinates, 997 * maps no sense. Instead, we actually really only use 12 bits for coordinates,
1771 * and use the other 4 bits for other informatiion. For full documentation 998 * and use the other 4 bits for other informatiion. For full documentation
1772 * of what we send, see the doc/Protocol file. 999 * of what we send, see the doc/Protocol file.
1773 * I will describe internally what we do: 1000 * I will describe internally what we do:
1774 * the socket->lastmap shows how the map last looked when sent to the client. 1001 * the ns->lastmap shows how the map last looked when sent to the client.
1775 * in the lastmap structure, there is a cells array, which is set to the 1002 * in the lastmap structure, there is a cells array, which is set to the
1776 * maximum viewable size (As set in config.h). 1003 * maximum viewable size (As set in config.h).
1777 * in the cells, there are faces and a count value. 1004 * in the cells, there are faces and a count value.
1778 * we use the count value to hold the darkness value. If -1, then this space 1005 * we use the count value to hold the darkness value. If -1, then this space
1779 * is not viewable. 1006 * is not viewable.
… …
1781 * look like. 1008 * look like.
1782 */ 1009 */
1783void 1010void
1784draw_client_map1 (object *pl) 1011draw_client_map1 (object *pl)
1785{ 1012{
1786 int x, y, ax, ay, d, startlen, max_x, max_y, oldlen; 1013 int x, y, ax, ay, startlen, max_x, max_y, oldlen;
1787 sint16 nx, ny; 1014 sint16 nx, ny;
1788 int estartlen, eoldlen; 1015 int estartlen, eoldlen;
1789 uint16 mask, emask;
1790 uint8 eentrysize; 1016 uint8 eentrysize;
1791 uint16 ewhatstart, ewhatflag; 1017 uint16 ewhatstart, ewhatflag;
1792 uint8 extendedinfos; 1018 uint8 extendedinfos;
1793 maptile *m; 1019 maptile *m;
1794 1020
1795 client &socket = *pl->contr->socket; 1021 client &socket = *pl->contr->ns;
1022
1023 if (!pl->active)
1024 return;
1796 1025
1797 check_map_change (pl->contr); 1026 check_map_change (pl->contr);
1027 prefetch_surrounding_maps (pl);
1798 1028
1799 packet sl; 1029 packet sl (socket.mapmode == Map1Cmd ? "map1" : "map1a");
1800 packet esl; 1030 packet esl;
1801 1031
1802 sl << (socket.mapmode == Map1Cmd ? "map1 " : "map1a ");
1803 startlen = sl.length (); 1032 startlen = sl.length ();
1804 1033
1805 /*Extendedmapinfo structure initialisation */ 1034 /*Extendedmapinfo structure initialisation */
1806 if (socket.ext_mapinfos) 1035 if (socket.ext_mapinfos)
1807 { 1036 {
… …
1818 << uint8 (extendedinfos) 1047 << uint8 (extendedinfos)
1819 << uint8 (eentrysize); 1048 << uint8 (eentrysize);
1820 1049
1821 estartlen = esl.length (); 1050 estartlen = esl.length ();
1822 } 1051 }
1823 else
1824 {
1825 /* suppress compiler warnings */
1826 ewhatstart = 0;
1827 ewhatflag = 0;
1828 estartlen = 0;
1829 }
1830
1831 /* Init data to zero */
1832 memset (heads, 0, sizeof (object *) * MAX_HEAD_POS * MAX_HEAD_POS * MAX_LAYERS);
1833 1052
1834 /* x,y are the real map locations. ax, ay are viewport relative 1053 /* x,y are the real map locations. ax, ay are viewport relative
1835 * locations. 1054 * locations.
1836 */ 1055 */
1837 ay = 0; 1056 ay = 0;
… …
1840 * but that started to get a bit messy to look at. 1059 * but that started to get a bit messy to look at.
1841 */ 1060 */
1842 max_x = pl->x + (socket.mapx + 1) / 2; 1061 max_x = pl->x + (socket.mapx + 1) / 2;
1843 max_y = pl->y + (socket.mapy + 1) / 2; 1062 max_y = pl->y + (socket.mapy + 1) / 2;
1844 1063
1845 if (socket.mapmode == Map1aCmd) 1064 maptile *plmap = pl->map;
1846 {
1847 max_x += MAX_HEAD_OFFSET;
1848 max_y += MAX_HEAD_OFFSET;
1849 }
1850 1065
1851 for (y = pl->y - socket.mapy / 2; y < max_y; y++, ay++) 1066 for (y = pl->y - socket.mapy / 2; y < max_y; y++, ay++)
1852 { 1067 {
1853 ax = 0; 1068 ax = 0;
1854 for (x = pl->x - socket.mapx / 2; x < max_x; x++, ax++) 1069 for (x = pl->x - socket.mapx / 2; x < max_x; x++, ax++)
1855 { 1070 {
1856 1071 int emask, mask;
1857 emask = mask = (ax & 0x3f) << 10 | (ay & 0x3f) << 4; 1072 emask = mask = (ax & 0x3f) << 10 | (ay & 0x3f) << 4;
1858 1073
1859 /* If this space is out of the normal viewable area, we only check
1860 * the heads value ax or ay will only be greater than what
1861 * the client wants if using the map1a command - this is because
1862 * if the map1a command is not used, max_x and max_y will be
1863 * set to lower values.
1864 */
1865 if (ax >= socket.mapx || ay >= socket.mapy)
1866 {
1867 int i, got_one;
1868
1869 oldlen = sl.length ();
1870
1871 sl << uint16 (mask);
1872
1873 if (check_head (sl, socket, ax, ay, 2)) mask |= 0x4;
1874 if (check_head (sl, socket, ax, ay, 1)) mask |= 0x2;
1875 if (check_head (sl, socket, ax, ay, 0)) mask |= 0x1;
1876
1877 /* If all we are doing is sending 0 (blank) faces, we don't
1878 * actually need to send that - just the coordinates
1879 * with no faces tells the client to blank out the
1880 * space.
1881 */
1882 got_one = 0;
1883 for (i = oldlen + 2; i < sl.length (); i++)
1884 if (sl[i])
1885 got_one = 1;
1886
1887 if (got_one && (mask & 0xf))
1888 sl[oldlen + 1] = mask & 0xff;
1889 else
1890 { /*either all faces blank, either no face at all */
1891 if (mask & 0xf) /*at least 1 face, we know it's blank, only send coordinates */
1892 sl.reset (oldlen + 2);
1893 else
1894 sl.reset (oldlen);
1895 }
1896
1897 /*What concerns extendinfos, nothing to be done for now
1898 * (perhaps effects layer later)
1899 */
1900 continue; /* don't do processing below */
1901 }
1902
1903 MapCell &lastcell = socket.lastmap.cells[ax][ay]; 1074 MapCell &lastcell = socket.lastmap.cells[ax][ay];
1904
1905 d = pl->contr->blocked_los[ax][ay];
1906 1075
1907 /* If the coordinates are not valid, or it is too dark to see, 1076 /* If the coordinates are not valid, or it is too dark to see,
1908 * we tell the client as such 1077 * we tell the client as such
1909 */ 1078 */
1910 nx = x; 1079 nx = x;
1911 ny = y; 1080 ny = y;
1912 m = get_map_from_coord (pl->map, &nx, &ny); 1081 m = get_map_from_coord (plmap, &nx, &ny);
1913 1082
1914 if (!m) 1083 if (!m)
1915 { 1084 {
1916 /* space is out of map. Update space and clear values 1085 /* space is out of map. Update space and clear values
1917 * if this hasn't already been done. If the space is out 1086 * if this hasn't already been done. If the space is out
1918 * of the map, it shouldn't have a head 1087 * of the map, it shouldn't have a head
1919 */ 1088 */
1920 if (lastcell.count != -1) 1089 if (lastcell.count != -1)
1921 { 1090 {
1922 sl << uint16 (mask); 1091 sl << uint16 (mask);
1923 map_clearcell (&lastcell, 0, 0, 0, -1); 1092 map_clearcell (&lastcell, -1);
1924 } 1093 }
1094
1095 continue;
1925 } 1096 }
1097
1098 m->touch ();
1099
1100 int d = pl->contr->blocked_los[ax][ay];
1101
1926 else if (d > 3) 1102 if (d > 3)
1927 { 1103 {
1104
1928 int need_send = 0, count; 1105 int need_send = 0, count;
1929 1106
1930 /* This block deals with spaces that are not visible for whatever 1107 /* This block deals with spaces that are not visible for whatever
1931 * reason. Still may need to send the head for this space. 1108 * reason. Still may need to send the head for this space.
1932 */ 1109 */
1933 1110
1934 oldlen = sl.length (); 1111 oldlen = sl.length ();
1935 1112
1936 sl << uint16 (mask); 1113 sl << uint16 (mask);
… …
1938 if (lastcell.count != -1) 1115 if (lastcell.count != -1)
1939 need_send = 1; 1116 need_send = 1;
1940 1117
1941 count = -1; 1118 count = -1;
1942 1119
1943 if (socket.mapmode == Map1aCmd && have_head (ax, ay))
1944 {
1945 /* Now check to see if any heads need to be sent */
1946
1947 if (check_head (sl, socket, ax, ay, 2)) mask |= 0x4;
1948 if (check_head (sl, socket, ax, ay, 1)) mask |= 0x2;
1949 if (check_head (sl, socket, ax, ay, 0)) mask |= 0x1;
1950
1951 lastcell.count = count;
1952 }
1953 else
1954 {
1955 /* properly clear a previously sent big face */ 1120 /* properly clear a previously sent big face */
1956 if (lastcell.faces[0] != 0 || lastcell.faces[1] != 0 || lastcell.faces[2] != 0 1121 if (lastcell.faces[0] || lastcell.faces[1] || lastcell.faces[2]
1957 || lastcell.stat_hp || lastcell.flags || lastcell.player) 1122 || lastcell.stat_hp || lastcell.flags || lastcell.player)
1958 need_send = 1; 1123 need_send = 1;
1959 1124
1960 map_clearcell (&lastcell, 0, 0, 0, count); 1125 map_clearcell (&lastcell, count);
1961 }
1962 1126
1963 if ((mask & 0xf) || need_send) 1127 if ((mask & 0xf) || need_send)
1964 sl[oldlen + 1] = mask & 0xff; 1128 sl[oldlen + 1] = mask & 0xff;
1965 else 1129 else
1966 sl.reset (oldlen); 1130 sl.reset (oldlen);
1967 } 1131 }
1968 else 1132 else
1969 { 1133 {
1970 /* In this block, the space is visible or there are head objects 1134 /* In this block, the space is visible.
1971 * we need to send.
1972 */ 1135 */
1973 1136
1974 /* Rather than try to figure out what everything that we might 1137 /* Rather than try to figure out what everything that we might
1975 * need to send is, then form the packet after that, 1138 * need to send is, then form the packet after that,
1976 * we presume that we will in fact form a packet, and update 1139 * we presume that we will in fact form a packet, and update
… …
1979 * is done. 1142 * is done.
1980 * I think this is simpler than doing a bunch of checks to see 1143 * I think this is simpler than doing a bunch of checks to see
1981 * what if anything we need to send, setting the bits, then 1144 * what if anything we need to send, setting the bits, then
1982 * doing those checks again to add the real data. 1145 * doing those checks again to add the real data.
1983 */ 1146 */
1984 oldlen = sl.length (); 1147 oldlen = sl.length ();
1985 mask = (ax & 0x3f) << 10 | (ay & 0x3f) << 4;
1986 eoldlen = esl.length (); 1148 eoldlen = esl.length ();
1987 emask = (ax & 0x3f) << 10 | (ay & 0x3f) << 4; 1149
1988 sl << uint16 (mask); 1150 sl << uint16 (mask);
1989
1990 if (socket.ext_mapinfos)
1991 esl << uint16 (emask);
1992 1151
1993 unsigned char dummy; 1152 unsigned char dummy;
1994 unsigned char *last_ext = &dummy; 1153 unsigned char *last_ext = &dummy;
1995 1154
1996 /* Darkness changed */ 1155 /* Darkness changed */
… …
2008 sl << uint8 (255 - 64 * d); 1167 sl << uint8 (255 - 64 * d);
2009 } 1168 }
2010 1169
2011 lastcell.count = d; 1170 lastcell.count = d;
2012 1171
1172 mapspace &ms = m->at (nx, ny);
1173
2013 if (socket.extmap) 1174 if (socket.extmap)
2014 { 1175 {
2015 uint8 stat_hp = 0; 1176 uint8 stat_hp = 0;
2016 uint8 stat_width = 0; 1177 uint8 stat_width = 0;
2017 uint8 flags = 0; 1178 uint8 flags = 0;
2018 UUID player = 0; 1179 tag_t player = 0;
2019 1180
2020 // send hp information, if applicable 1181 // send hp information, if applicable
2021 if (object *op = GET_MAP_FACE_OBJ (m, nx, ny, 0)) 1182 if (object *op = ms.faces_obj [0])
2022 { 1183 {
2023 if (op->head || op->invisible) 1184 if (op->head || op->invisible)
2024 ; // do not show 1185 ; // do not show
2025 else if (op->type == PLAYER 1186 else if (op->type == PLAYER
2026 || QUERY_FLAG (op, FLAG_MONSTER) || QUERY_FLAG (op, FLAG_ALIVE) || QUERY_FLAG (op, FLAG_GENERATOR)) 1187 || QUERY_FLAG (op, FLAG_MONSTER) || QUERY_FLAG (op, FLAG_ALIVE) || QUERY_FLAG (op, FLAG_GENERATOR))
… …
2064 1225
2065 mask |= 0x8; 1226 mask |= 0x8;
2066 *last_ext |= 0x80; 1227 *last_ext |= 0x80;
2067 last_ext = &sl[sl.length ()]; 1228 last_ext = &sl[sl.length ()];
2068 1229
2069 sl << uint8 (0x47) << uint8 (8) << (uint64)player; 1230 sl << uint8 (0x47) << uint8 (4) << (uint32)player;
2070 } 1231 }
2071 1232
2072 if (lastcell.flags != flags) 1233 if (lastcell.flags != flags)
2073 { 1234 {
2074 lastcell.flags = flags; 1235 lastcell.flags = flags;
… …
2080 sl << uint8 (8) << uint8 (flags); 1241 sl << uint8 (8) << uint8 (flags);
2081 } 1242 }
2082 } 1243 }
2083 1244
2084 /* Floor face */ 1245 /* Floor face */
2085 if (update_space (sl, socket, m, nx, ny, ax, ay, 2)) 1246 if (update_space (sl, socket, ms, lastcell, 2))
2086 mask |= 0x4; 1247 mask |= 0x4;
2087 1248
2088 if (socket.EMI_smooth)
2089 if (update_smooth (esl, socket, m, nx, ny, ax, ay, 2))
2090 emask |= 0x4;
2091
2092 /* Middle face */ 1249 /* Middle face */
2093 if (update_space (sl, socket, m, nx, ny, ax, ay, 1)) 1250 if (update_space (sl, socket, ms, lastcell, 1))
2094 mask |= 0x2; 1251 mask |= 0x2;
2095 1252
2096 if (socket.EMI_smooth) 1253 if (ms.player () == pl
2097 if (update_smooth (esl, socket, m, nx, ny, ax, ay, 1)) 1254 && (pl->invisible & (pl->invisible < 50 ? 1 : 7)))
2098 emask |= 0x2;
2099
2100 if (nx == pl->x && ny == pl->y && pl->invisible & (pl->invisible < 50 ? 4 : 1))
2101 { 1255 {
1256 // force player to be visible to himself if invisible
2102 if (lastcell.faces[0] != pl->face->number) 1257 if (lastcell.faces[0] != pl->face)
2103 { 1258 {
2104 lastcell.faces[0] = pl->face->number; 1259 lastcell.faces[0] = pl->face;
1260
2105 mask |= 0x1; 1261 mask |= 0x1;
2106
2107 if (!(socket.faces_sent[pl->face->number] & NS_FACESENT_FACE))
2108 esrv_send_face (&socket, pl->face->number, 0);
2109
2110 sl << uint16 (pl->face->number); 1262 sl << uint16 (pl->face);
1263
1264 socket.send_faces (pl);
2111 } 1265 }
2112 } 1266 }
2113 else
2114 {
2115 /* Top face */ 1267 /* Top face */
2116 if (update_space (sl, socket, m, nx, ny, ax, ay, 0)) 1268 else if (update_space (sl, socket, ms, lastcell, 0))
2117 mask |= 0x1; 1269 mask |= 0x1;
2118
2119 if (socket.EMI_smooth)
2120 if (update_smooth (esl, socket, m, nx, ny, ax, ay, 0))
2121 emask |= 0x1;
2122 } 1270
2123 1271
2124 /* Check to see if we are in fact sending anything for this 1272 /* Check to see if we are in fact sending anything for this
2125 * space by checking the mask. If so, update the mask. 1273 * space by checking the mask. If so, update the mask.
2126 * if not, reset the len to that from before adding the mask 1274 * if not, reset the len to that from before adding the mask
2127 * value, so we don't send those bits. 1275 * value, so we don't send those bits.
… …
2129 if (mask & 0xf) 1277 if (mask & 0xf)
2130 sl[oldlen + 1] = mask & 0xff; 1278 sl[oldlen + 1] = mask & 0xff;
2131 else 1279 else
2132 sl.reset (oldlen); 1280 sl.reset (oldlen);
2133 1281
1282 if (socket.ext_mapinfos)
1283 esl << uint16 (emask);
1284
1285 if (socket.EMI_smooth)
1286 {
1287 for (int layer = 2+1; layer--; )
1288 {
1289 object *ob = ms.faces_obj [layer];
1290
1291 // If there is no object for this space, or if the face for the object
1292 // is the blank face, set the smoothlevel to zero.
1293 int smoothlevel = ob && ob->face != blank_face ? ob->smoothlevel : 0;
1294
1295 // We've gotten what face we want to use for the object. Now see if
1296 // if it has changed since we last sent it to the client.
1297 if (lastcell.smooth[layer] != smoothlevel)
1298 {
1299 lastcell.smooth[layer] = smoothlevel;
1300 esl << uint8 (smoothlevel);
1301 emask |= 1 << layer;
1302 }
1303 }
1304
2134 if (emask & 0xf) 1305 if (emask & 0xf)
2135 esl[eoldlen + 1] = emask & 0xff; 1306 esl[eoldlen + 1] = emask & 0xff;
2136 else 1307 else
2137 esl.reset (eoldlen); 1308 esl.reset (eoldlen);
1309 }
2138 } /* else this is a viewable space */ 1310 } /* else this is a viewable space */
2139 } /* for x loop */ 1311 } /* for x loop */
2140 } /* for y loop */ 1312 } /* for y loop */
1313
1314 socket.flush_fx ();
2141 1315
2142 /* Verify that we in fact do need to send this */ 1316 /* Verify that we in fact do need to send this */
2143 if (socket.ext_mapinfos) 1317 if (socket.ext_mapinfos)
2144 { 1318 {
2145 if (!(sl.length () > startlen || socket.sent_scroll)) 1319 if (!(sl.length () > startlen || socket.sent_scroll))
2146 { 1320 {
2147 /* No map data will follow, so don't say the client 1321 /* No map data will follow, so don't say the client
2148 * it doesn't need draw! 1322 * it doesn't need draw!
2149 */ 1323 */
2150 ewhatflag &= (~EMI_NOREDRAW); 1324 ewhatflag &= ~EMI_NOREDRAW;
2151 esl[ewhatstart + 1] = ewhatflag & 0xff; 1325 esl[ewhatstart + 1] = ewhatflag & 0xff;
2152 } 1326 }
2153 1327
2154 if (esl.length () > estartlen) 1328 if (esl.length () > estartlen)
2155 socket.send_packet (esl); 1329 socket.send_packet (esl);
… …
2167 */ 1341 */
2168void 1342void
2169draw_client_map (object *pl) 1343draw_client_map (object *pl)
2170{ 1344{
2171 int i, j; 1345 int i, j;
2172 sint16 ax, ay, nx, ny; /* ax and ay goes from 0 to max-size of arrays */ 1346 sint16 ax, ay; /* ax and ay goes from 0 to max-size of arrays */
2173 New_Face *face, *floor;
2174 New_Face *floor2;
2175 int d, mflags; 1347 int mflags;
2176 struct Map newmap; 1348 struct Map newmap;
2177 maptile *m, *pm; 1349 maptile *m, *pm;
2178 1350
2179 if (pl->type != PLAYER) 1351 if (pl->type != PLAYER)
2180 { 1352 {
… …
2191 if (pm == NULL || pm->in_memory != MAP_IN_MEMORY) 1363 if (pm == NULL || pm->in_memory != MAP_IN_MEMORY)
2192 return; 1364 return;
2193 1365
2194 memset (&newmap, 0, sizeof (struct Map)); 1366 memset (&newmap, 0, sizeof (struct Map));
2195 1367
2196 for (j = (pl->y - pl->contr->socket->mapy / 2); j < (pl->y + (pl->contr->socket->mapy + 1) / 2); j++) 1368 for (j = (pl->y - pl->contr->ns->mapy / 2); j < (pl->y + (pl->contr->ns->mapy + 1) / 2); j++)
2197 {
2198 for (i = (pl->x - pl->contr->socket->mapx / 2); i < (pl->x + (pl->contr->socket->mapx + 1) / 2); i++) 1369 for (i = (pl->x - pl->contr->ns->mapx / 2); i < (pl->x + (pl->contr->ns->mapx + 1) / 2); i++)
2199 { 1370 {
2200 ax = i; 1371 ax = i;
2201 ay = j; 1372 ay = j;
2202 m = pm; 1373 m = pm;
2203 mflags = get_map_flags (m, &m, ax, ay, &ax, &ay); 1374 mflags = get_map_flags (m, &m, ax, ay, &ax, &ay);
1375
2204 if (mflags & P_OUT_OF_MAP) 1376 if (mflags & P_OUT_OF_MAP)
2205 continue; 1377 continue;
2206 if (mflags & P_NEED_UPDATE) 1378
2207 update_position (m, ax, ay);
2208 /* If a map is visible to the player, we don't want to swap it out 1379 /* If a map is visible to the player, we don't want to swap it out
2209 * just to reload it. This should really call something like 1380 * just to reload it. This should really call something like
2210 * swap_map, but this is much more efficient and 'good enough' 1381 * swap_map, but this is much more efficient and 'good enough'
2211 */ 1382 */
2212 if (mflags & P_NEW_MAP) 1383 if (mflags & P_NEW_MAP)
2213 m->timeout = 50; 1384 m->timeout = 50;
2214 } 1385 }
2215 } 1386
2216 /* do LOS after calls to update_position */ 1387 /* do LOS after calls to update_position */
2217 if (pl->contr->do_los) 1388 if (pl->contr->do_los)
2218 { 1389 {
2219 update_los (pl); 1390 update_los (pl);
2220 pl->contr->do_los = 0; 1391 pl->contr->do_los = 0;
… …
2235 1406
2236/*****************************************************************************/ 1407/*****************************************************************************/
2237void 1408void
2238send_plugin_custom_message (object *pl, char *buf) 1409send_plugin_custom_message (object *pl, char *buf)
2239{ 1410{
2240 pl->contr->socket->send_packet (buf); 1411 pl->contr->ns->send_packet (buf);
2241} 1412}
2242 1413
2243/** 1414/**
2244 * This sends the skill number to name mapping. We ignore 1415 * This sends the skill number to name mapping. We ignore
2245 * the params - we always send the same info no matter what. 1416 * the params - we always send the same info no matter what.
… …
2290 * it then sends an updspell packet for each spell that has changed in this way 1461 * it then sends an updspell packet for each spell that has changed in this way
2291 */ 1462 */
2292void 1463void
2293esrv_update_spells (player *pl) 1464esrv_update_spells (player *pl)
2294{ 1465{
1466 if (!pl->ns)
1467 return;
1468
2295 if (!pl->socket->monitor_spells) 1469 if (!pl->ns->monitor_spells)
2296 return; 1470 return;
2297 1471
2298 for (object *spell = pl->ob->inv; spell; spell = spell->below) 1472 for (object *spell = pl->ob->inv; spell; spell = spell->below)
2299 { 1473 {
2300 if (spell->type == SPELL) 1474 if (spell->type == SPELL)
… …
2330 1504
2331 if (flags & UPD_SP_MANA ) sl << uint16 (spell->last_sp); 1505 if (flags & UPD_SP_MANA ) sl << uint16 (spell->last_sp);
2332 if (flags & UPD_SP_GRACE ) sl << uint16 (spell->last_grace); 1506 if (flags & UPD_SP_GRACE ) sl << uint16 (spell->last_grace);
2333 if (flags & UPD_SP_DAMAGE) sl << uint16 (spell->last_eat); 1507 if (flags & UPD_SP_DAMAGE) sl << uint16 (spell->last_eat);
2334 1508
2335 pl->socket->send_packet (sl); 1509 pl->ns->send_packet (sl);
2336 } 1510 }
2337 } 1511 }
2338 } 1512 }
2339} 1513}
2340 1514
2341void 1515void
2342esrv_remove_spell (player *pl, object *spell) 1516esrv_remove_spell (player *pl, object *spell)
2343{ 1517{
2344 if (!pl->socket->monitor_spells) 1518 if (!pl->ns->monitor_spells)
2345 return; 1519 return;
2346 1520
2347 if (!pl || !spell || spell->env != pl->ob) 1521 if (!pl || !spell || spell->env != pl->ob)
2348 { 1522 {
2349 LOG (llevError, "Invalid call to esrv_remove_spell"); 1523 LOG (llevError, "Invalid call to esrv_remove_spell");
2350 return; 1524 return;
2351 } 1525 }
2352 1526
2353 packet sl; 1527 packet sl ("delspell");
2354 1528
2355 sl << "delspell "
2356 << uint32 (spell->count); 1529 sl << uint32 (spell->count);
2357 1530
2358 pl->socket->send_packet (sl); 1531 pl->ns->send_packet (sl);
2359} 1532}
2360 1533
2361/* appends the spell *spell to the Socklist we will send the data to. */ 1534/* appends the spell *spell to the Socklist we will send the data to. */
2362static void 1535static void
2363append_spell (player *pl, packet &sl, object *spell) 1536append_spell (player *pl, packet &sl, object *spell)
2364{ 1537{
2365 int len, i, skill = 0; 1538 int i, skill = 0;
2366 1539
2367 if (!(spell->name)) 1540 if (!(spell->name))
2368 { 1541 {
2369 LOG (llevError, "item number %d is a spell with no name.\n", spell->count); 1542 LOG (llevError, "item number %d is a spell with no name.\n", spell->count);
2370 return; 1543 return;
… …
2382 if (!strcmp (spell->skill, skill_names[i])) 1555 if (!strcmp (spell->skill, skill_names[i]))
2383 { 1556 {
2384 skill = i + CS_STAT_SKILLINFO; 1557 skill = i + CS_STAT_SKILLINFO;
2385 break; 1558 break;
2386 } 1559 }
1560 }
1561
1562 // spells better have a face
1563 if (!spell->face)
1564 {
1565 LOG (llevError, "%s: spell has no face, but face is mandatory.\n", &spell->name);
1566 spell->face = face_find ("burnout.x11", blank_face);
2387 } 1567 }
2388 1568
2389 /* send the current values */ 1569 /* send the current values */
2390 sl << uint32 (spell->count) 1570 sl << uint32 (spell->count)
2391 << uint16 (spell->level) 1571 << uint16 (spell->level)
… …
2393 << uint16 (spell->last_sp) 1573 << uint16 (spell->last_sp)
2394 << uint16 (spell->last_grace) 1574 << uint16 (spell->last_grace)
2395 << uint16 (spell->last_eat) 1575 << uint16 (spell->last_eat)
2396 << uint8 (skill) 1576 << uint8 (skill)
2397 << uint32 (spell->path_attuned) 1577 << uint32 (spell->path_attuned)
2398 << uint32 (spell->face ? spell->face->number : 0) 1578 << uint32 (spell->face)
2399 << data8 (spell->name) 1579 << data8 (spell->name)
2400 << data16 (spell->msg); 1580 << data16 (spell->msg);
2401} 1581}
2402 1582
2403/** 1583/**
… …
2411 { 1591 {
2412 LOG (llevError, "esrv_add_spells, tried to add a spell to a NULL player"); 1592 LOG (llevError, "esrv_add_spells, tried to add a spell to a NULL player");
2413 return; 1593 return;
2414 } 1594 }
2415 1595
2416 if (!pl->socket->monitor_spells) 1596 if (!pl->ns->monitor_spells)
2417 return; 1597 return;
2418 1598
2419 packet sl; 1599 packet sl ("addspell");
2420
2421 sl << "addspell ";
2422 1600
2423 if (!spell) 1601 if (!spell)
2424 { 1602 {
2425 for (spell = pl->ob->inv; spell != NULL; spell = spell->below) 1603 for (spell = pl->ob->inv; spell; spell = spell->below)
2426 { 1604 {
2427 /* were we to simply keep appending data here, we could exceed 1605 /* were we to simply keep appending data here, we could exceed
2428 * MAXSOCKBUF if the player has enough spells to add, we know that 1606 * MAXSOCKBUF if the player has enough spells to add, we know that
2429 * append_spells will always append 19 data bytes, plus 4 length 1607 * append_spells will always append 19 data bytes, plus 4 length
2430 * bytes and 3 strings (because that is the spec) so we need to 1608 * bytes and 3 strings (because that is the spec) so we need to
… …
2440 if (spell->type != SPELL) 1618 if (spell->type != SPELL)
2441 continue; 1619 continue;
2442 1620
2443 if (sl.length () >= (MAXSOCKBUF - (26 + strlen (spell->name) + (spell->msg ? strlen (spell->msg) : 0)))) 1621 if (sl.length () >= (MAXSOCKBUF - (26 + strlen (spell->name) + (spell->msg ? strlen (spell->msg) : 0))))
2444 { 1622 {
2445 pl->socket->send_packet (sl); 1623 pl->ns->send_packet (sl);
2446 1624
2447 sl.reset (); 1625 sl.reset ();
2448 sl << "addspell "; 1626 sl << "addspell ";
2449 } 1627 }
2450 1628
… …
2464 LOG (llevError, "Buffer overflow in esrv_add_spells!\n"); 1642 LOG (llevError, "Buffer overflow in esrv_add_spells!\n");
2465 fatal (0); 1643 fatal (0);
2466 } 1644 }
2467 1645
2468 /* finally, we can send the packet */ 1646 /* finally, we can send the packet */
2469 pl->socket->send_packet (sl); 1647 pl->ns->send_packet (sl);
2470} 1648}
2471 1649

Diff Legend

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