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.46 by root, Tue Dec 19 05:12:52 2006 UTC vs.
Revision 1.111 by root, Sun Jul 1 04:08:14 2007 UTC

1/* 1/*
2 CrossFire, A Multiplayer game for X-windows 2 * This file is part of Crossfire TRT, the Multiplayer Online Role Playing Game.
3 3 *
4 * Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Crossfire TRT team
4 Copyright (C) 2001 Mark Wedel 5 * Copyright (©) 2001,2007 Mark Wedel
5 Copyright (C) 1992 Frank Tore Johansen 6 * Copyright (©) 1992,2007 Frank Tore Johansen
6 7 *
7 This program is free software; you can redistribute it and/or modify 8 * Crossfire TRT is free software; you can redistribute it and/or modify it
8 it under the terms of the GNU General Public License as published by 9 * under the terms of the GNU General Public License as published by the Free
9 the Free Software Foundation; either version 2 of the License, or 10 * Software Foundation; either version 2 of the License, or (at your option)
10 (at your option) any later version. 11 * 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, but
13 but WITHOUT ANY WARRANTY; without even the implied warranty of 14 * WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 15 * or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
15 GNU General Public License for more details. 16 * 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 along
18 along with this program; if not, write to the Free Software 19 * with Crossfire TRT; if not, write to the Free Software Foundation, Inc. 51
19 Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. 20 * Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
20 21 *
21 The author can be reached via e-mail to <crossfire@schmorp.de> 22 * The authors 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 */ 41 */
44 42
45#include <global.h> 43#include <global.h>
46#include <sproto.h> 44#include <sproto.h>
47 45
… …
100 * that much difference in bandwidth. 98 * that much difference in bandwidth.
101 */ 99 */
102 mx = ns->mapx; 100 mx = ns->mapx;
103 my = ns->mapy; 101 my = ns->mapy;
104 102
105 if (ns->mapmode == Map1aCmd)
106 {
107 mx += MAX_HEAD_OFFSET;
108 my += MAX_HEAD_OFFSET;
109 }
110
111 /* 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
112 * (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,
113 * if the destination x or y coordinate is outside the viewable 105 * if the destination x or y coordinate is outside the viewable
114 * area, we clear the values - otherwise, the old values 106 * area, we clear the values - otherwise, the old values
115 * are preserved, and the check_head thinks it needs to clear them. 107 * are preserved, and the check_head thinks it needs to clear them.
… …
138} 130}
139 131
140static void 132static void
141clear_map (player *pl) 133clear_map (player *pl)
142{ 134{
143 memset (&pl->socket->lastmap, 0, sizeof (pl->socket->lastmap)); 135 memset (&pl->ns->lastmap, 0, sizeof (pl->ns->lastmap));
144 136
137 pl->ns->force_newmap = false;
138
145 if (pl->socket->newmapcmd == 1) 139 if (pl->ns->newmapcmd == 1)
146 pl->socket->send_packet ("newmap"); 140 pl->ns->send_packet ("newmap");
147 141
148 pl->socket->floorbox_reset (); 142 pl->ns->floorbox_reset ();
149} 143}
150 144
151/** check for map change and send new map data */ 145/** check for map/region change and send new map data */
152static void 146static void
153check_map_change (player *pl) 147check_map_change (player *pl)
154{ 148{
155 client &socket = *pl->socket; 149 client &socket = *pl->ns;
156 object *ob = pl->ob; 150 object *ob = pl->observe;
157 char buf[MAX_BUF]; /* eauugggh */
158 151
159 if (socket.current_map != ob->map) 152 if (socket.current_map != ob->map || socket.force_newmap)
160 { 153 {
154 clear_map (pl);
161 socket.current_map = ob->map; 155 socket.current_map = ob->map;
162
163 clear_map (pl);
164 156
165 if (socket.mapinfocmd) 157 if (socket.mapinfocmd)
166 { 158 {
167 if (ob->map && ob->map->path[0]) 159 if (ob->map && ob->map->path[0])
168 { 160 {
169 int flags = 0; 161 int flags = 0;
170 162
171 if (ob->map->tile_path[0]) 163 if (ob->map->tile_path[0]) flags |= 1;
172 flags |= 1;
173 if (ob->map->tile_path[1]) 164 if (ob->map->tile_path[1]) flags |= 2;
174 flags |= 2;
175 if (ob->map->tile_path[2]) 165 if (ob->map->tile_path[2]) flags |= 4;
176 flags |= 4;
177 if (ob->map->tile_path[3]) 166 if (ob->map->tile_path[3]) flags |= 8;
178 flags |= 8;
179 167
180 snprintf (buf, MAX_BUF, "mapinfo - spatial %d %d %d %d %d %s", 168 socket.send_packet_printf ("mapinfo - spatial %d %d %d %d %d %s",
181 flags, socket.mapx / 2 - ob->x, socket.mapy / 2 - ob->y, ob->map->width, ob->map->height, ob->map->path); 169 flags, socket.mapx / 2 - ob->x, socket.mapy / 2 - ob->y,
170 ob->map->width, ob->map->height, &ob->map->path);
182 } 171 }
183 else 172 else
184 snprintf (buf, MAX_BUF, "mapinfo current");
185
186 socket.send_packet (buf); 173 socket.send_packet ("mapinfo current");
187 } 174 }
188 } 175 }
189 else if (socket.current_x != ob->x || socket.current_y != ob->y) 176 else if (socket.current_x != ob->x || socket.current_y != ob->y)
190 { 177 {
191 int dx = ob->x - socket.current_x; 178 int dx = ob->x - socket.current_x;
… …
200 } 187 }
201 } 188 }
202 189
203 socket.current_x = ob->x; 190 socket.current_x = ob->x;
204 socket.current_y = ob->y; 191 socket.current_y = ob->y;
192
193 region *reg = ob->region ();
194 if (socket.current_region != reg)
195 {
196 socket.current_region = reg;
197 socket.send_packet_printf ("drawinfo 0 You are now %s.\n(use whereami for more details)", &reg->longname);
198 }
205} 199}
206 200
207/** 201/**
208 * RequestInfo is sort of a meta command. There is some specific 202 * RequestInfo is sort of a meta command. There is some specific
209 * request of information, but we call other functions to provide 203 * request of information, but we call other functions to provide
… …
280 buf += 8; 274 buf += 8;
281 275
282 // initial map and its origin 276 // initial map and its origin
283 maptile *map = pl->ob->map; 277 maptile *map = pl->ob->map;
284 sint16 dx, dy; 278 sint16 dx, dy;
285 int mapx = pl->socket->mapx / 2 - pl->ob->x; 279 int mapx = pl->ns->mapx / 2 - pl->ob->x;
286 int mapy = pl->socket->mapy / 2 - pl->ob->y; 280 int mapy = pl->ns->mapy / 2 - pl->ob->y;
287 int max_distance = 8; // limit maximum path length to something generous 281 int max_distance = 8; // limit maximum path length to something generous
288 282
289 while (*buf && map && max_distance) 283 while (*buf && map && max_distance)
290 { 284 {
291 int dir = *buf++; 285 int dir = *buf++;
292 286
293 switch (dir) 287 switch (dir)
294 { 288 {
295 case '1': 289 case '1':
296 dx = 0; 290 dx = 0;
297 dy = -1; 291 dy = -1;
298 map = get_map_from_coord (map, &dx, &dy); 292 map = map->xy_find (dx, dy);
299 map && (mapy -= map->height); 293 map && (mapy -= map->height);
300 break; 294 break;
301 case '2': 295 case '2':
302 mapx += map->width; 296 mapx += map->width;
303 dx = map->width; 297 dx = map->width;
304 dy = 0; 298 dy = 0;
305 map = get_map_from_coord (map, &dx, &dy); 299 map = map->xy_find (dx, dy);
306 break; 300 break;
307 case '3': 301 case '3':
308 mapy += map->height; 302 mapy += map->height;
309 dx = 0; 303 dx = 0;
310 dy = map->height; 304 dy = map->height;
311 map = get_map_from_coord (map, &dx, &dy); 305 map = map->xy_find (dx, dy);
312 break; 306 break;
313 case '4': 307 case '4':
314 dx = -1; 308 dx = -1;
315 dy = 0; 309 dy = 0;
316 map = get_map_from_coord (map, &dx, &dy); 310 map = map->xy_find (dx, dy);
317 map && (mapx -= map->width); 311 map && (mapx -= map->width);
318 break; 312 break;
319 } 313 }
320 314
321 --max_distance; 315 --max_distance;
322 } 316 }
323 317
… …
325 snprintf (bigbuf, MAX_BUF, "mapinfo %s error", token); 319 snprintf (bigbuf, MAX_BUF, "mapinfo %s error", token);
326 else if (map && map->path[0]) 320 else if (map && map->path[0])
327 { 321 {
328 int flags = 0; 322 int flags = 0;
329 323
330 if (map->tile_path[0]) 324 if (map->tile_path[0]) flags |= 1;
331 flags |= 1;
332 if (map->tile_path[1]) 325 if (map->tile_path[1]) flags |= 2;
333 flags |= 2;
334 if (map->tile_path[2]) 326 if (map->tile_path[2]) flags |= 4;
335 flags |= 4;
336 if (map->tile_path[3]) 327 if (map->tile_path[3]) flags |= 8;
337 flags |= 8;
338 328
339 snprintf (bigbuf, MAX_BUF, "mapinfo %s spatial %d %d %d %d %d %s", token, flags, mapx, mapy, map->width, map->height, map->path); 329 snprintf (bigbuf, MAX_BUF, "mapinfo %s spatial %d %d %d %d %d %s", token, flags, mapx, mapy, map->width, map->height, &map->path);
340 } 330 }
341 else 331 else
342 snprintf (bigbuf, MAX_BUF, "mapinfo %s nomap", token); 332 snprintf (bigbuf, MAX_BUF, "mapinfo %s nomap", token);
343 } 333 }
344 else 334 else
345 snprintf (bigbuf, MAX_BUF, "mapinfo %s unsupported", token); 335 snprintf (bigbuf, MAX_BUF, "mapinfo %s unsupported", token);
346 336
347 pl->socket->send_packet (bigbuf); 337 pl->ns->send_packet (bigbuf);
348} 338}
349 339
350/** This is the Setup cmd - easy first implementation */ 340/** This is the Setup cmd */
351void 341void
352SetUp (char *buf, int len, client * ns) 342SetUp (char *buf, int len, client * ns)
353{ 343{
354 int s, slen; 344 INVOKE_CLIENT (SETUP, ns, ARG_DATA (buf, len));
355 char *cmd, *param, cmdback[HUGE_BUF];
356
357 /* run through the cmds of setup
358 * syntax is setup <cmdname1> <parameter> <cmdname2> <parameter> ...
359 *
360 * we send the status of the cmd back, or a FALSE is the cmd is the server unknown
361 * The client then must sort this out
362 */
363
364 //LOG (llevInfo, "Get SetupCmd:: %s\n", buf);
365
366 strcpy (cmdback, "setup");
367 for (s = 0; s < len; )
368 {
369 cmd = &buf[s];
370
371 /* find the next space, and put a null there */
372 for (; buf[s] && buf[s] != ' '; s++)
373 ;
374
375 buf[s++] = 0;
376
377 while (buf[s] == ' ')
378 s++;
379
380 if (s >= len)
381 break;
382
383 param = &buf[s];
384
385 for (; buf[s] && buf[s] != ' '; s++)
386 ;
387
388 buf[s++] = 0;
389
390 while (buf[s] == ' ')
391 s++;
392
393 slen = strlen (cmdback);
394 safe_strcat (cmdback, " ", &slen, HUGE_BUF);
395 safe_strcat (cmdback, cmd, &slen, HUGE_BUF);
396 safe_strcat (cmdback, " ", &slen, HUGE_BUF);
397
398 if (!strcmp (cmd, "sound"))
399 {
400 ns->sound = atoi (param);
401 safe_strcat (cmdback, param, &slen, HUGE_BUF);
402 }
403 else if (!strcmp (cmd, "exp64"))
404 {
405 ns->exp64 = atoi (param);
406 safe_strcat (cmdback, param, &slen, HUGE_BUF);
407 }
408 else if (!strcmp (cmd, "spellmon"))
409 {
410 ns->monitor_spells = atoi (param);
411 safe_strcat (cmdback, param, &slen, HUGE_BUF);
412 }
413 else if (!strcmp (cmd, "darkness"))
414 {
415 ns->darkness = atoi (param);
416 safe_strcat (cmdback, param, &slen, HUGE_BUF);
417 }
418 else if (!strcmp (cmd, "map1cmd"))
419 {
420 if (atoi (param))
421 ns->mapmode = Map1Cmd;
422 /* if beyond this size, need to use map1cmd no matter what */
423 if (ns->mapx > 11 || ns->mapy > 11)
424 ns->mapmode = Map1Cmd;
425 safe_strcat (cmdback, ns->mapmode == Map1Cmd ? "1" : "0", &slen, HUGE_BUF);
426 }
427 else if (!strcmp (cmd, "map1acmd"))
428 {
429 if (atoi (param))
430 ns->mapmode = Map1aCmd;
431 /* if beyond this size, need to use map1acmd no matter what */
432 if (ns->mapx > 11 || ns->mapy > 11)
433 ns->mapmode = Map1aCmd;
434 safe_strcat (cmdback, ns->mapmode == Map1aCmd ? "1" : "0", &slen, HUGE_BUF);
435 }
436 else if (!strcmp (cmd, "newmapcmd"))
437 {
438 ns->newmapcmd = atoi (param);
439 safe_strcat (cmdback, param, &slen, HUGE_BUF);
440// } else if (!strcmp(cmd,"plugincmd")) {
441// ns->plugincmd = atoi(param);
442// safe_strcat(cmdback, param, &slen, HUGE_BUF);
443 }
444 else if (!strcmp (cmd, "mapinfocmd"))
445 {
446 ns->mapinfocmd = atoi (param);
447 safe_strcat (cmdback, "1", &slen, HUGE_BUF);
448 }
449 else if (!strcmp (cmd, "extcmd"))
450 {
451 ns->extcmd = atoi (param);
452 safe_strcat (cmdback, "1", &slen, HUGE_BUF);
453 }
454 else if (!strcmp (cmd, "extmap"))
455 {
456 ns->extmap = atoi (param);
457 safe_strcat (cmdback, "1", &slen, HUGE_BUF);
458 }
459 else if (!strcmp (cmd, "facecache"))
460 {
461 ns->facecache = atoi (param);
462 safe_strcat (cmdback, param, &slen, HUGE_BUF);
463 }
464 else if (!strcmp (cmd, "faceset"))
465 {
466 char tmpbuf[20];
467 int q = atoi (param);
468
469 if (is_valid_faceset (q))
470 ns->faceset = q;
471 sprintf (tmpbuf, "%d", ns->faceset);
472 safe_strcat (cmdback, tmpbuf, &slen, HUGE_BUF);
473 /* if the client is using faceset, it knows about image2 command */
474 ns->image2 = 1;
475 }
476 else if (!strcmp (cmd, "itemcmd"))
477 {
478 /* Version of the item protocol command to use. Currently,
479 * only supported versions are 1 and 2. Using a numeric
480 * value will make it very easy to extend this in the future.
481 */
482 char tmpbuf[20];
483 int q = atoi (param);
484
485 if (q < 1 || q > 2)
486 {
487 strcpy (tmpbuf, "FALSE");
488 }
489 else
490 {
491 ns->itemcmd = q;
492 sprintf (tmpbuf, "%d", ns->itemcmd);
493 }
494 safe_strcat (cmdback, tmpbuf, &slen, HUGE_BUF);
495 }
496 else if (!strcmp (cmd, "mapsize"))
497 {
498 int x, y = 0;
499 char tmpbuf[MAX_BUF], *cp;
500
501 x = atoi (param);
502 for (cp = param; *cp != 0; cp++)
503 if (*cp == 'x' || *cp == 'X')
504 {
505 y = atoi (cp + 1);
506 break;
507 }
508 if (x < 9 || y < 9 || x > MAP_CLIENT_X || y > MAP_CLIENT_Y)
509 {
510 sprintf (tmpbuf, " %dx%d", MAP_CLIENT_X, MAP_CLIENT_Y);
511 safe_strcat (cmdback, tmpbuf, &slen, HUGE_BUF);
512 }
513 else
514 {
515 ns->mapx = x;
516 ns->mapy = y;
517 /* better to send back what we are really using and not the
518 * param as given to us in case it gets parsed differently.
519 */
520 sprintf (tmpbuf, "%dx%d", x, y);
521 safe_strcat (cmdback, tmpbuf, &slen, HUGE_BUF);
522 /* If beyond this size and still using orig map command, need to
523 * go to map1cmd.
524 */
525 if ((x > 11 || y > 11) && ns->mapmode == Map0Cmd)
526 ns->mapmode = Map1Cmd;
527 }
528 }
529 else if (!strcmp (cmd, "extendedMapInfos"))
530 {
531 /* Added by tchize
532 * prepare to use the mapextended command
533 */
534 char tmpbuf[20];
535
536 ns->ext_mapinfos = (atoi (param));
537 sprintf (tmpbuf, "%d", ns->ext_mapinfos);
538 safe_strcat (cmdback, tmpbuf, &slen, HUGE_BUF);
539 }
540 else if (!strcmp (cmd, "extendedTextInfos"))
541 {
542 /* Added by tchize
543 * prepare to use the extended text commands
544 * Client toggle this to non zero to get exttext
545 */
546 char tmpbuf[20];
547
548 ns->has_readable_type = (atoi (param));
549 sprintf (tmpbuf, "%d", ns->has_readable_type);
550 safe_strcat (cmdback, tmpbuf, &slen, HUGE_BUF);
551 }
552 else
553 {
554 /* Didn't get a setup command we understood -
555 * report a failure to the client.
556 */
557 safe_strcat (cmdback, "FALSE", &slen, HUGE_BUF);
558 }
559 } /* for processing all the setup commands */
560
561 LOG (llevInfo, "SendBack SetupCmd:: %s\n", cmdback);
562 ns->send_packet (cmdback);
563} 345}
564 346
565/** 347/**
566 * The client has requested to be added to the game. 348 * The client has requested to be added to the game.
567 * This is what takes care of it. We tell the client how things worked out. 349 * This is what takes care of it. We tell the client how things worked out.
568 * I am not sure if this file is the best place for this function. however, 350 * I am not sure if this file is the best place for this function. however,
569 * it either has to be here or init_sockets needs to be exported. 351 * it either has to be here or init_sockets needs to be exported.
570 */ 352 */
571void 353void
572AddMeCmd (char *buf, int len, client * ns) 354AddMeCmd (char *buf, int len, client *ns)
573{ 355{
574 if (ns->status != Ns_Add || add_player (ns)) 356 INVOKE_CLIENT (ADDME, ns, ARG_DATA (buf, len));
575 ns->send_packet ("addme_failed");
576 else
577 ns->send_packet ("addme_success");
578} 357}
579 358
580/** Reply to ExtendedInfos command */ 359/** Reply to ExtendedInfos command */
581void 360void
582ToggleExtendedInfos (char *buf, int len, client * ns) 361ToggleExtendedInfos (char *buf, int len, client * ns)
… …
692 471
693 ns->send_packet (cmdback); 472 ns->send_packet (cmdback);
694} 473}
695 474
696/** 475/**
697 * A lot like the old AskSmooth (in fact, now called by AskSmooth).
698 * Basically, it makes no sense to wait for the client to request a
699 * a piece of data from us that we know the client wants. So
700 * if we know the client wants it, might as well push it to the
701 * client.
702 */
703static void
704SendSmooth (client *ns, uint16 face)
705{
706 uint16 smoothface;
707
708 /* If we can't find a face, return and set it so we won't try to send this
709 * again.
710 */
711 if ((!FindSmooth (face, &smoothface)) && (!FindSmooth (smooth_face->number, &smoothface)))
712 {
713
714 LOG (llevError, "could not findsmooth for %d. Neither default (%s)\n", face, &smooth_face->name);
715 ns->faces_sent[face] |= NS_FACESENT_SMOOTH;
716 return;
717 }
718
719 if (!(ns->faces_sent[smoothface] & NS_FACESENT_FACE))
720 esrv_send_face (ns, smoothface, 0);
721
722 ns->faces_sent[face] |= NS_FACESENT_SMOOTH;
723
724 packet sl;
725
726 sl << "smooth "
727 << uint16 (face)
728 << uint16 (smoothface);
729
730 ns->send_packet (sl);
731}
732
733 /**
734 * Tells client the picture it has to use
735 * to smooth a picture number given as argument.
736 */
737void
738AskSmooth (char *buf, int len, client *ns)
739{
740 SendSmooth (ns, atoi (buf));
741}
742
743/**
744 * This handles the general commands from the client (ie, north, fire, cast, 476 * This handles the general commands from the client (ie, north, fire, cast,
745 * etc.) 477 * etc.)
746 */ 478 */
747void 479void
748PlayerCmd (char *buf, int len, player *pl) 480PlayerCmd (char *buf, int len, player *pl)
… …
769 * commands. 501 * commands.
770 */ 502 */
771 pl->count = 0; 503 pl->count = 0;
772} 504}
773 505
774
775/** 506/**
776 * This handles the general commands from the client (ie, north, fire, cast, 507 * This handles the general commands from the client (ie, north, fire, cast,
777 * etc.). It is a lot like PlayerCmd above, but is called with the 508 * etc.). It is a lot like PlayerCmd above, but is called with the
778 * 'ncom' method which gives more information back to the client so it 509 * 'ncom' method which gives more information back to the client so it
779 * can throttle. 510 * can throttle.
… …
804 * commands. 535 * commands.
805 */ 536 */
806 pl->count = 0; 537 pl->count = 0;
807 538
808 //TODO: schmorp thinks whatever this calculates, it makes no sense at all 539 //TODO: schmorp thinks whatever this calculates, it makes no sense at all
809 int time = FABS (pl->ob->speed) < 0.001 540 int time = fabs (pl->ob->speed) < 0.001
810 ? time = MAX_TIME * 100 541 ? time = MAX_TIME * 100
811 : time = (int) (MAX_TIME / FABS (pl->ob->speed)); 542 : time = (int) (MAX_TIME / fabs (pl->ob->speed));
812 543
813 /* Send confirmation of command execution now */ 544 /* Send confirmation of command execution now */
814 packet sl; 545 packet sl ("comc");
815 sl << "comc " << uint16 (cmdid) << uint32 (time); 546 sl << uint16 (cmdid) << uint32 (time);
816 pl->socket->send_packet (sl); 547 pl->ns->send_packet (sl);
817} 548}
818
819 549
820/** This is a reply to a previous query. */ 550/** This is a reply to a previous query. */
821void 551void
822ReplyCmd (char *buf, int len, player *pl) 552ReplyCmd (char *buf, int len, client *ns)
823{ 553{
554 if (ns->state == ST_CUSTOM)
555 {
556 INVOKE_CLIENT (REPLY, ns, ARG_DATA (buf, len));
557 return;
558 }
559
560 if (!ns->pl)
561 return; //TODO: depends on the exact reply we are after
562 //TODO: but right now, we always have a ns->pl
563
564 player *pl = ns->pl;
565
824 /* This is to synthesize how the data would be stored if it 566 /* This is to synthesize how the data would be stored if it
825 * was normally entered. A bit of a hack, and should be cleaned up 567 * was normally entered. A bit of a hack, and should be cleaned up
826 * once all the X11 code is removed from the server. 568 * once all the X11 code is removed from the server.
827 * 569 *
828 * We pass 13 to many of the functions because this way they 570 * We pass 13 to many of the functions because this way they
… …
831 */ 573 */
832 snprintf (pl->write_buf, sizeof (pl->write_buf), ":%s", buf); 574 snprintf (pl->write_buf, sizeof (pl->write_buf), ":%s", buf);
833 575
834 /* this avoids any hacking here */ 576 /* this avoids any hacking here */
835 577
836 switch (pl->state) 578 switch (ns->state)
837 { 579 {
838 case ST_PLAYING: 580 case ST_PLAYING:
839 LOG (llevError, "Got reply message with ST_PLAYING input state\n"); 581 LOG (llevError, "Got reply message with ST_PLAYING input state\n");
840 break; 582 break;
841 583
842 case ST_PLAY_AGAIN:
843 /* We can check this for return value (2==quit). Maybe we
844 * should, and do something appropriate?
845 */
846 receive_play_again (pl->ob, buf[0]);
847 break;
848
849 case ST_ROLL_STAT:
850 key_roll_stat (pl->ob, buf[0]);
851 break;
852
853 case ST_CHANGE_CLASS:
854
855 key_change_class (pl->ob, buf[0]);
856 break;
857
858 case ST_CONFIRM_QUIT:
859 key_confirm_quit (pl->ob, buf[0]);
860 break;
861
862 case ST_CONFIGURE:
863 LOG (llevError, "In client input handling, but into configure state\n");
864 pl->state = ST_PLAYING;
865 break;
866
867 case ST_GET_NAME:
868 receive_player_name (pl->ob, 13);
869 break;
870
871 case ST_GET_PASSWORD:
872 case ST_CONFIRM_PASSWORD:
873 receive_player_password (pl->ob, 13);
874 break;
875
876 case ST_GET_PARTY_PASSWORD: /* Get password for party */ 584 case ST_GET_PARTY_PASSWORD: /* Get password for party */
877 receive_party_password (pl->ob, 13); 585 receive_party_password (pl->ob, 13);
878 break; 586 break;
879 587
880 default: 588 default:
881 LOG (llevError, "Unknown input state: %d\n", pl->state); 589 LOG (llevError, "Unknown input state: %d\n", ns->state);
882 } 590 }
883} 591}
884 592
885/** 593/**
886 * Client tells its version. If there is a mismatch, we close the 594 * Client tells its version. If there is a mismatch, we close the
… …
901 ns->cs_version = atoi (buf); 609 ns->cs_version = atoi (buf);
902 ns->sc_version = ns->cs_version; 610 ns->sc_version = ns->cs_version;
903 611
904 LOG (llevDebug, "connection from client <%s>\n", buf); 612 LOG (llevDebug, "connection from client <%s>\n", buf);
905 613
906
907 //TODO: should log here just for statistics 614 //TODO: should log here just for statistics
908 615
909 //if (VERSION_CS != ns->cs_version) 616 //if (VERSION_CS != ns->cs_version)
910 // unchecked; 617 // unchecked;
911 618
… …
920 627
921 cp = strchr (cp + 1, ' '); 628 cp = strchr (cp + 1, ' ');
922 629
923 if (cp) 630 if (cp)
924 { 631 {
925 assign (ns->version, cp + 1); 632 ns->version = cp + 1;
926 633
927 if (ns->sc_version < 1026) 634 if (ns->sc_version < 1026)
928 ns->send_packet_printf ("drawinfo %d %s", NDI_RED, 635 ns->send_packet_printf ("drawinfo %d %s", NDI_RED,
929 "**** VERSION WARNING ****\n**** CLIENT IS TOO OLD!! UPDATE THE CLIENT!! ****"); 636 "**** VERSION WARNING ****\n**** CLIENT IS TOO OLD!! UPDATE THE CLIENT!! ****");
930 } 637 }
… …
936{ 643{
937 ns->sound = atoi (buf); 644 ns->sound = atoi (buf);
938} 645}
939 646
940/** client wants the map resent */ 647/** client wants the map resent */
941
942void 648void
943MapRedrawCmd (char *buf, int len, player *pl) 649MapRedrawCmd (char *buf, int len, player *pl)
944{ 650{
945/* This function is currently disabled; just clearing the map state results in 651/* This function is currently disabled; just clearing the map state results in
946 * display errors. It should clear the cache and send a newmap command. 652 * display errors. It should clear the cache and send a newmap command.
… …
991/** 697/**
992 * Asks the client to query the user. This way, the client knows 698 * Asks the client to query the user. This way, the client knows
993 * it needs to send something back (vs just printing out a message) 699 * it needs to send something back (vs just printing out a message)
994 */ 700 */
995void 701void
996send_query (client *ns, uint8 flags, char *text) 702send_query (client *ns, uint8 flags, const char *text)
997{ 703{
998 ns->send_packet_printf ("query %d %s", flags, text ? text : ""); 704 ns->send_packet_printf ("query %d %s", flags, text ? text : "");
705}
706
707/**
708 * Get player's current range attack in obuf.
709 */
710static void
711rangetostring (player *pl, char *obuf)
712{
713 dynbuf_text buf;
714
715 if (pl->ranged_ob)
716 buf << " Range" << (pl->ob->current_weapon == pl->ranged_ob ? "*" : "") << ": " << pl->ranged_ob->name;
717
718 if (pl->combat_ob)
719 buf << " Combat" << (pl->ob->current_weapon == pl->combat_ob ? "*" : "") << ": " << pl->combat_ob->name;
720
721#if 0
722 //TODO: remove this when slot system is working, this is only for debugging
723 if (pl->ob->chosen_skill)
724 buf << " Skill*: " << pl->ob->chosen_skill->name;
725#endif
726
727 //TODO: maybe golem should become the current_weapon, quite simply?
728 if (pl->golem)
729 buf << " Golem*: " << pl->golem->name;
730
731 buf << '\0';
732 buf.linearise (obuf);
999} 733}
1000 734
1001#define AddIfInt64(Old,New,Type) if (Old != New) {\ 735#define AddIfInt64(Old,New,Type) if (Old != New) {\
1002 Old = New; \ 736 Old = New; \
1003 sl << uint8 (Type) << uint64 (New); \ 737 sl << uint8 (Type) << uint64 (New); \
… …
1011#define AddIfShort(Old,New,Type) if (Old != New) {\ 745#define AddIfShort(Old,New,Type) if (Old != New) {\
1012 Old = New; \ 746 Old = New; \
1013 sl << uint8 (Type) << uint16 (New); \ 747 sl << uint8 (Type) << uint16 (New); \
1014 } 748 }
1015 749
1016#define AddIfFloat(Old,New,Type) if (Old != New) {\ 750#define AddIfFloat(Old,New,Type,mult) if (Old != New) {\
1017 Old = New; \ 751 Old = New; \
1018 sl << uint8 (Type) << uint32 (New*FLOAT_MULTI); \ 752 sl << uint8 (Type) << uint32 (New*FLOAT_MULTI*mult); \
1019 } 753 }
1020 754
1021#define AddIfString(Old,New,Type) if (Old == NULL || strcmp(Old,New)) {\ 755#define AddIfString(Old,New,Type) if (Old == NULL || strcmp(Old,New)) {\
1022 free(Old); Old = strdup (New);\ 756 free(Old); Old = strdup (New);\
1023 sl << uint8 (Type) << data8 (New); \ 757 sl << uint8 (Type) << data8 (New); \
… …
1033esrv_update_stats (player *pl) 767esrv_update_stats (player *pl)
1034{ 768{
1035 char buf[MAX_BUF]; 769 char buf[MAX_BUF];
1036 uint16 flags; 770 uint16 flags;
1037 771
1038 packet sl; 772 client *ns = pl->ns;
1039 sl << "stats "; 773 if (!ns)
774 return;
1040 775
776 object *ob = pl->observe;
1041 if (pl->ob) 777 if (!ob)
1042 { 778 return;
779
780 player *opl = ob->contr ? static_cast<player *>(ob->contr) : pl;
781
782 packet sl ("stats");
783
1043 AddIfShort (pl->last_stats.hp, pl->ob->stats.hp, CS_STAT_HP); 784 AddIfShort (ns->last_stats.hp, ob->stats.hp, CS_STAT_HP);
1044 AddIfShort (pl->last_stats.maxhp, pl->ob->stats.maxhp, CS_STAT_MAXHP); 785 AddIfShort (ns->last_stats.maxhp, ob->stats.maxhp, CS_STAT_MAXHP);
1045 AddIfShort (pl->last_stats.sp, pl->ob->stats.sp, CS_STAT_SP); 786 AddIfShort (ns->last_stats.sp, ob->stats.sp, CS_STAT_SP);
1046 AddIfShort (pl->last_stats.maxsp, pl->ob->stats.maxsp, CS_STAT_MAXSP); 787 AddIfShort (ns->last_stats.maxsp, ob->stats.maxsp, CS_STAT_MAXSP);
1047 AddIfShort (pl->last_stats.grace, pl->ob->stats.grace, CS_STAT_GRACE); 788 AddIfShort (ns->last_stats.grace, ob->stats.grace, CS_STAT_GRACE);
1048 AddIfShort (pl->last_stats.maxgrace, pl->ob->stats.maxgrace, CS_STAT_MAXGRACE); 789 AddIfShort (ns->last_stats.maxgrace, ob->stats.maxgrace, CS_STAT_MAXGRACE);
1049 AddIfShort (pl->last_stats.Str, pl->ob->stats.Str, CS_STAT_STR); 790 AddIfShort (ns->last_stats.Str, ob->stats.Str, CS_STAT_STR);
1050 AddIfShort (pl->last_stats.Int, pl->ob->stats.Int, CS_STAT_INT);
1051 AddIfShort (pl->last_stats.Pow, pl->ob->stats.Pow, CS_STAT_POW);
1052 AddIfShort (pl->last_stats.Wis, pl->ob->stats.Wis, CS_STAT_WIS);
1053 AddIfShort (pl->last_stats.Dex, pl->ob->stats.Dex, CS_STAT_DEX); 791 AddIfShort (ns->last_stats.Dex, ob->stats.Dex, CS_STAT_DEX);
1054 AddIfShort (pl->last_stats.Con, pl->ob->stats.Con, CS_STAT_CON); 792 AddIfShort (ns->last_stats.Con, ob->stats.Con, CS_STAT_CON);
793 AddIfShort (ns->last_stats.Int, ob->stats.Int, CS_STAT_INT);
794 AddIfShort (ns->last_stats.Wis, ob->stats.Wis, CS_STAT_WIS);
795 AddIfShort (ns->last_stats.Pow, ob->stats.Pow, CS_STAT_POW);
1055 AddIfShort (pl->last_stats.Cha, pl->ob->stats.Cha, CS_STAT_CHA); 796 AddIfShort (ns->last_stats.Cha, ob->stats.Cha, CS_STAT_CHA);
1056 }
1057 797
1058 if (pl->socket->exp64)
1059 for (int s = 0; s < NUM_SKILLS; s++) 798 for (int s = 0; s < NUM_SKILLS; s++)
1060 if (pl->last_skill_ob[s] && pl->last_skill_exp[s] != pl->last_skill_ob[s]->stats.exp) 799 if (object *skill = opl->last_skill_ob[s])
800 if (skill->stats.exp != ns->last_skill_exp [s])
1061 { 801 {
802 ns->last_skill_exp [s] = skill->stats.exp;
803
1062 /* Always send along the level if exp changes. This is only 804 /* Always send along the level if exp changes. This is only
1063 * 1 extra byte, but keeps processing simpler. 805 * 1 extra byte, but keeps processing simpler.
1064 */ 806 */
1065 sl << uint8 (s + CS_STAT_SKILLINFO) 807 sl << uint8 (s + CS_STAT_SKILLINFO)
1066 << uint8 (pl->last_skill_ob[s]->level) 808 << uint8 (skill->level)
1067 << uint64 (pl->last_skill_ob[s]->stats.exp); 809 << uint64 (skill->stats.exp);
1068
1069 pl->last_skill_exp[s] = pl->last_skill_ob[s]->stats.exp;
1070 } 810 }
1071 811
1072 if (pl->socket->exp64)
1073 { AddIfInt64 (pl->last_stats.exp, pl->ob->stats.exp, CS_STAT_EXP64) } 812 AddIfInt64 (ns->last_stats.exp, ob->stats.exp, CS_STAT_EXP64);
1074 else
1075 { AddIfInt (pl->last_stats.exp, (int) pl->ob->stats.exp, CS_STAT_EXP) }
1076
1077 AddIfShort (pl->last_level, (char) pl->ob->level, CS_STAT_LEVEL); 813 AddIfShort (ns->last_level, ob->level, CS_STAT_LEVEL);
1078 AddIfShort (pl->last_stats.wc, pl->ob->stats.wc, CS_STAT_WC); 814 AddIfShort (ns->last_stats.wc, ob->stats.wc, CS_STAT_WC);
1079 AddIfShort (pl->last_stats.ac, pl->ob->stats.ac, CS_STAT_AC); 815 AddIfShort (ns->last_stats.ac, ob->stats.ac, CS_STAT_AC);
1080 AddIfShort (pl->last_stats.dam, pl->ob->stats.dam, CS_STAT_DAM); 816 AddIfShort (ns->last_stats.dam, ob->stats.dam, CS_STAT_DAM);
1081 AddIfFloat (pl->last_speed, pl->ob->speed, CS_STAT_SPEED); 817 AddIfFloat (ns->last_speed, ob->speed, CS_STAT_SPEED, 1.f/TICK);
1082 AddIfShort (pl->last_stats.food, pl->ob->stats.food, CS_STAT_FOOD); 818 AddIfShort (ns->last_stats.food, ob->stats.food, CS_STAT_FOOD);
1083 AddIfFloat (pl->last_weapon_sp, pl->weapon_sp, CS_STAT_WEAP_SP); 819 AddIfFloat (ns->last_weapon_sp, pl->weapon_sp, CS_STAT_WEAP_SP, 1.f/TICK);
1084 AddIfInt (pl->last_weight_limit, (sint32) weight_limit[pl->ob->stats.Str], CS_STAT_WEIGHT_LIM); 820 AddIfInt (ns->last_weight_limit, weight_limit[ob->stats.Str], CS_STAT_WEIGHT_LIM);
821
1085 flags = 0; 822 flags = 0;
1086 823
1087 if (pl->fire_on) 824 if (opl->fire_on)
1088 flags |= SF_FIREON; 825 flags |= SF_FIREON;
1089 826
1090 if (pl->run_on) 827 if (opl->run_on)
1091 flags |= SF_RUNON; 828 flags |= SF_RUNON;
1092 829
1093 AddIfShort (pl->last_flags, flags, CS_STAT_FLAGS); 830 AddIfShort (ns->last_flags, flags, CS_STAT_FLAGS);
1094 831
1095 if (pl->socket->sc_version < 1025) 832 if (ns->sc_version < 1025)
1096 { AddIfShort (pl->last_resist[ATNR_PHYSICAL], pl->ob->resist[ATNR_PHYSICAL], CS_STAT_ARMOUR) } 833 { AddIfShort (ns->last_resist[ATNR_PHYSICAL], ob->resist[ATNR_PHYSICAL], CS_STAT_ARMOUR) }
1097 else 834 else
1098 for (int i = 0; i < NROFATTACKS; i++) 835 for (int i = 0; i < NROFATTACKS; i++)
1099 { 836 {
1100 /* Skip ones we won't send */ 837 /* Skip ones we won't send */
1101 if (atnr_cs_stat[i] == -1) 838 if (atnr_cs_stat[i] == -1)
1102 continue; 839 continue;
1103 840
1104 AddIfShort (pl->last_resist[i], pl->ob->resist[i], (char) atnr_cs_stat[i]); 841 AddIfShort (ns->last_resist[i], ob->resist[i], atnr_cs_stat[i]);
1105 } 842 }
1106 843
1107 if (pl->socket->monitor_spells) 844 if (pl->ns->monitor_spells)
1108 { 845 {
1109 AddIfInt (pl->last_path_attuned, pl->ob->path_attuned, CS_STAT_SPELL_ATTUNE); 846 AddIfInt (ns->last_path_attuned, ob->path_attuned, CS_STAT_SPELL_ATTUNE);
1110 AddIfInt (pl->last_path_repelled, pl->ob->path_repelled, CS_STAT_SPELL_REPEL); 847 AddIfInt (ns->last_path_repelled, ob->path_repelled, CS_STAT_SPELL_REPEL);
1111 AddIfInt (pl->last_path_denied, pl->ob->path_denied, CS_STAT_SPELL_DENY); 848 AddIfInt (ns->last_path_denied, ob->path_denied, CS_STAT_SPELL_DENY);
1112 } 849 }
1113 850
1114 rangetostring (pl->ob, buf); /* we want use the new fire & run system in new client */ 851 rangetostring (opl, buf); /* we want use the new fire & run system in new client */
1115 AddIfString (pl->socket->stats.range, buf, CS_STAT_RANGE); 852 AddIfString (ns->stats.range, buf, CS_STAT_RANGE);
1116 set_title (pl->ob, buf); 853 set_title (ob, buf);
1117 AddIfString (pl->socket->stats.title, buf, CS_STAT_TITLE); 854 AddIfString (ns->stats.title, buf, CS_STAT_TITLE);
1118 855
1119 /* Only send it away if we have some actual data */ 856 /* Only send it away if we have some actual data */
1120 if (sl.length () > 6) 857 if (sl.length () > 6)
1121 pl->socket->send_packet (sl); 858 ns->send_packet (sl);
1122} 859}
1123 860
1124/** 861/**
1125 * Tells the client that here is a player it should start using. 862 * Tells the client that here is a player it should start using.
1126 */ 863 */
1127void 864void
1128esrv_new_player (player *pl, uint32 weight) 865esrv_new_player (player *pl, uint32 weight)
1129{ 866{
1130 pl->last_weight = weight; 867 packet sl ("player");
1131
1132 packet sl;
1133 sl << "player ";
1134 868
1135 sl << uint32 (pl->ob->count) 869 sl << uint32 (pl->ob->count)
1136 << uint32 (weight) 870 << uint32 (weight)
1137 << uint32 (pl->ob->face->number) 871 << uint32 (pl->ob->face)
1138 << data8 (pl->ob->name); 872 << data8 (pl->ob->name);
1139 873
874 pl->ns->last_weight = weight;
1140 pl->socket->send_packet (sl); 875 pl->ns->send_packet (sl);
1141 SET_FLAG (pl->ob, FLAG_CLIENT_SENT); 876 SET_FLAG (pl->ob, FLAG_CLIENT_SENT);
1142} 877}
1143
1144/**
1145 * Need to send an animation sequence to the client.
1146 * We will send appropriate face commands to the client if we haven't
1147 * sent them the face yet (this can become quite costly in terms of
1148 * how much we are sending - on the other hand, this should only happen
1149 * when the player logs in and picks stuff up.
1150 */
1151void
1152esrv_send_animation (client * ns, short anim_num)
1153{
1154 /* Do some checking on the anim_num we got. Note that the animations
1155 * are added in contigous order, so if the number is in the valid
1156 * range, it must be a valid animation.
1157 */
1158 if (anim_num < 0 || anim_num > num_animations)
1159 {
1160 LOG (llevError, "esrv_send_anim (%d) out of bounds??\n", anim_num);
1161 return;
1162 }
1163
1164 packet sl;
1165
1166 sl << "anim "
1167 << uint16 (anim_num)
1168 << uint16 (0); /* flags - not used right now */
1169
1170 /* Build up the list of faces. Also, send any information (ie, the
1171 * the face itself) down to the client.
1172 */
1173 for (int i = 0; i < animations[anim_num].num_animations; i++)
1174 {
1175 if (!(ns->faces_sent[animations[anim_num].faces[i]] & NS_FACESENT_FACE))
1176 esrv_send_face (ns, animations[anim_num].faces[i], 0);
1177
1178 sl << uint16 (animations[anim_num].faces[i]); /* flags - not used right now */
1179 }
1180
1181 ns->send_packet (sl);
1182
1183 ns->anims_sent[anim_num] = 1;
1184}
1185
1186 878
1187/****************************************************************************** 879/******************************************************************************
1188 * 880 *
1189 * Start of map related commands. 881 * Start of map related commands.
1190 * 882 *
1191 ******************************************************************************/ 883 ******************************************************************************/
1192 884
1193/**
1194 * This adds face_num to a map cell at x,y. If the client doesn't have
1195 * the face yet, we will also send it.
1196 */
1197static void
1198esrv_map_setbelow (client * ns, int x, int y, short face_num, struct Map *newmap)
1199{
1200 if (newmap->cells[x][y].count >= MAP_LAYERS)
1201 {
1202 //TODO: one or the other, can't both have abort and return, verify and act
1203 LOG (llevError, "Too many faces in map cell %d %d\n", x, y);
1204 return;
1205 abort ();
1206 }
1207
1208 newmap->cells[x][y].faces[newmap->cells[x][y].count] = face_num;
1209 newmap->cells[x][y].count++;
1210
1211 if (!(ns->faces_sent[face_num] & NS_FACESENT_FACE))
1212 esrv_send_face (ns, face_num, 0);
1213}
1214
1215/** Clears a map cell */ 885/** Clears a map cell */
1216static void 886static void
1217map_clearcell (struct MapCell *cell, int face0, int face1, int face2, int count) 887map_clearcell (struct MapCell *cell, int count)
1218{ 888{
1219 cell->faces[0] = face0; 889 cell->faces[0] = 0;
1220 cell->faces[1] = face1; 890 cell->faces[1] = 0;
1221 cell->faces[2] = face2; 891 cell->faces[2] = 0;
892 cell->smooth[0] = 0;
893 cell->smooth[1] = 0;
894 cell->smooth[2] = 0;
1222 cell->count = count; 895 cell->count = count;
1223 cell->stat_hp = 0; 896 cell->stat_hp = 0;
1224 cell->flags = 0; 897 cell->flags = 0;
1225 cell->player = 0; 898 cell->player = 0;
1226} 899}
1227 900
1228#define MAX_HEAD_POS MAX(MAX_CLIENT_X, MAX_CLIENT_Y)
1229#define MAX_LAYERS 3 901#define MAX_LAYERS 3
1230
1231/* Using a global really isn't a good approach, but saves the over head of
1232 * allocating and deallocating such a block of data each time run through,
1233 * and saves the space of allocating this in the socket object when we only
1234 * need it for this cycle. If the server is ever threaded, this needs to be
1235 * re-examined.
1236 */
1237static object *heads[MAX_HEAD_POS * MAX_HEAD_POS * MAX_LAYERS];
1238
1239/**
1240 * Returns true if any of the heads for this
1241 * space is set. Returns false if all are blank - this is used
1242 * for empty space checking.
1243 */
1244static inline int
1245have_head (int ax, int ay)
1246{
1247 if (heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS] ||
1248 heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS + 1] || heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS + 2])
1249 return 1;
1250
1251 return 0;
1252}
1253
1254/**
1255 * check_head is a bit simplistic version of update_space below.
1256 * basically, it only checks the that the head on space ax,ay at layer
1257 * needs to get sent - if so, it adds the data, sending the head
1258 * if needed, and returning 1. If this no data needs to get
1259 * sent, it returns zero.
1260 */
1261static int
1262check_head (packet &sl, client &ns, int ax, int ay, int layer)
1263{
1264 short face_num;
1265
1266 if (heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS + layer])
1267 face_num = heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS + layer]->face->number;
1268 else
1269 face_num = 0;
1270
1271 if (face_num != ns.lastmap.cells[ax][ay].faces[layer])
1272 {
1273 sl << uint16 (face_num);
1274 if (face_num && !(ns.faces_sent[face_num] & NS_FACESENT_FACE))
1275 esrv_send_face (&ns, face_num, 0);
1276
1277 heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS + layer] = NULL;
1278 ns.lastmap.cells[ax][ay].faces[layer] = face_num;
1279 return 1;
1280 }
1281
1282 return 0; /* No change */
1283}
1284 902
1285/** 903/**
1286 * Removes the need to replicate the same code for each layer. 904 * Removes the need to replicate the same code for each layer.
1287 * this returns true if this space is now in fact different than 905 * this returns true if this space is now in fact different than
1288 * it was. 906 * it was.
1289 * sl is the socklist this data is going into. 907 * sl is the socklist this data is going into.
1290 * ns is the socket we are working on - all the info we care 908 * ns is the socket we are working on - all the info we care
1291 * about is in this socket structure, so now need not pass the 909 * about is in this socket structure, so now need not pass the
1292 * entire player object. 910 * entire player object.
1293 * mx and my are map coordinate offsets for map mp
1294 * sx and sy are the offsets into the socket structure that
1295 * holds the old values.
1296 * layer is the layer to update, with 2 being the floor and 0 the 911 * layer is the layer to update, with 2 being the floor and 0 the
1297 * top layer (this matches what the GET_MAP_FACE and GET_MAP_FACE_OBJ) 912 * top layer (this matches what the GET_MAP_FACE and GET_MAP_FACE_OBJ)
1298 * take. Interesting to note that before this function, the map1 function 913 * take. Interesting to note that before this function, the map1 function
1299 * numbers the spaces differently - I think this was a leftover from 914 * numbers the spaces differently - I think this was a leftover from
1300 * the map command, where the faces stack up. Sinces that is no longer 915 * the map command, where the faces stack up. Sinces that is no longer
1301 * the case, it seems to make more sense to have these layer values 916 * the case, it seems to make more sense to have these layer values
1302 * actually match. 917 * actually match.
1303 */ 918 */
1304static int 919static int
1305update_space (packet &sl, client &ns, maptile *mp, int mx, int my, int sx, int sy, int layer) 920update_space (packet &sl, client &ns, mapspace &ms, MapCell &lastcell, int layer)
1306{ 921{
1307 object *ob, *head; 922 object *ob = ms.faces_obj [layer];
1308 uint16 face_num;
1309 int bx, by, i;
1310
1311 /* If there is a multipart object stored away, treat that as more important.
1312 * If not, then do the normal processing.
1313 */
1314 head = heads[(sy * MAX_HEAD_POS + sx) * MAX_LAYERS + layer];
1315
1316 /* Check to see if this head is part of the set of objects
1317 * we would normally send for this space. If so, then
1318 * don't use the head value. We need to do the check
1319 * here and not when setting up the heads[] value for two reasons -
1320 * 1) the heads[] values will get used even if the space is not visible.
1321 * 2) its possible the head is not on the same map as a part, and I'd
1322 * rather not need to do the map translation overhead.
1323 * 3) We need to do some extra checking to make sure that we will
1324 * otherwise send the image as this layer, eg, either it matches
1325 * the head value, or is not multipart.
1326 */
1327 if (head && !head->more)
1328 {
1329 for (i = 0; i < MAP_LAYERS; i++)
1330 {
1331 ob = GET_MAP_FACE_OBJ (mp, mx, my, i);
1332 if (!ob)
1333 continue;
1334
1335 if (ob->head)
1336 ob = ob->head;
1337
1338 if (ob == head)
1339 {
1340 heads[(sy * MAX_HEAD_POS + sx) * MAX_LAYERS + layer] = NULL;
1341 head = NULL;
1342 break;
1343 }
1344 }
1345 }
1346
1347 ob = head;
1348 if (!ob)
1349 ob = GET_MAP_FACE_OBJ (mp, mx, my, layer);
1350 923
1351 /* If there is no object for this space, or if the face for the object 924 /* If there is no object for this space, or if the face for the object
1352 * is the blank face, set the face number to zero. 925 * is the blank face, set the face number to zero.
1353 * else if we have the stored head object for this space, that takes 926 * else if we have the stored head object for this space, that takes
1354 * precedence over the other object for this space. 927 * precedence over the other object for this space.
1355 * otherwise, we do special head processing 928 * otherwise, we do special head processing
1356 */ 929 */
1357 if (!ob || ob->face == blank_face) 930 uint16 face_num = ob && ob->face != blank_face ? ob->face : 0;
1358 face_num = 0;
1359 else if (head)
1360 {
1361 /* if this is a head that had previously been stored */
1362 face_num = ob->face->number;
1363 }
1364 else
1365 {
1366 /* if the faces for the different parts of a multipart object
1367 * are the same, we only want to send the bottom right most
1368 * portion of the object. That info is in the tail_.. values
1369 * of the head. Note that for the head itself, ob->head will
1370 * be null, so we only do this block if we are working on
1371 * a tail piece.
1372 */
1373
1374 /* tail_x and tail_y will only be set in the head object. If
1375 * this is the head object and these are set, we proceed
1376 * with logic to only send bottom right. Similarly, if
1377 * this is one of the more parts but the head has those values
1378 * set, we want to do the processing. There can be cases where
1379 * the head is not visible but one of its parts is, so we just
1380 * can always expect that ob->arch->tail_x will be true for all
1381 * object we may want to display.
1382 */
1383 if ((ob->arch->tail_x || ob->arch->tail_y) || (ob->head && (ob->head->arch->tail_x || ob->head->arch->tail_y)))
1384 {
1385
1386 if (ob->head)
1387 head = ob->head;
1388 else
1389 head = ob;
1390
1391 /* Basically figure out where the offset is from where we are right
1392 * now. the ob->arch->clone.{x,y} values hold the offset that this current
1393 * piece is from the head, and the tail is where the tail is from the
1394 * head. Note that bx and by will equal sx and sy if we are already working
1395 * on the bottom right corner. If ob is the head, the clone values
1396 * will be zero, so the right thing will still happen.
1397 */
1398 bx = sx + head->arch->tail_x - ob->arch->clone.x;
1399 by = sy + head->arch->tail_y - ob->arch->clone.y;
1400
1401 /* I don't think this can ever happen, but better to check for it just
1402 * in case.
1403 */
1404 if (bx < sx || by < sy)
1405 {
1406 LOG (llevError, "update_space: bx (%d) or by (%d) is less than sx (%d) or sy (%d)\n", bx, by, sx, sy);
1407 face_num = 0;
1408 }
1409 /* single part object, multipart object with non merged faces,
1410 * of multipart object already at lower right.
1411 */
1412 else if (bx == sx && by == sy)
1413 {
1414 face_num = ob->face->number;
1415
1416 /* if this face matches one stored away, clear that one away.
1417 * this code relies on the fact that the map1 commands
1418 * goes from 2 down to 0.
1419 */
1420 for (i = 0; i < MAP_LAYERS; i++)
1421 if (heads[(sy * MAX_HEAD_POS + sx) * MAX_LAYERS + i] &&
1422 heads[(sy * MAX_HEAD_POS + sx) * MAX_LAYERS + i]->face->number == face_num)
1423 heads[(sy * MAX_HEAD_POS + sx) * MAX_LAYERS + i] = NULL;
1424 }
1425 else
1426 {
1427 /* If this head is stored away, clear it - otherwise,
1428 * there can be cases where a object is on multiple layers -
1429 * we only want to send it once.
1430 */
1431 face_num = head->face->number;
1432 for (i = 0; i < MAP_LAYERS; i++)
1433 if (heads[(by * MAX_HEAD_POS + bx) * MAX_LAYERS + i] &&
1434 heads[(by * MAX_HEAD_POS + bx) * MAX_LAYERS + i]->face->number == face_num)
1435 heads[(by * MAX_HEAD_POS + bx) * MAX_LAYERS + i] = NULL;
1436
1437 /* First, try to put the new head on the same layer. If that is used up,
1438 * then find another layer.
1439 */
1440 if (heads[(by * MAX_HEAD_POS + bx) * MAX_LAYERS + layer] == NULL)
1441 {
1442 heads[(by * MAX_HEAD_POS + bx) * MAX_LAYERS + layer] = head;
1443 }
1444 else
1445 for (i = 0; i < MAX_LAYERS; i++)
1446 {
1447 if (heads[(by * MAX_HEAD_POS + bx) * MAX_LAYERS + i] == NULL ||
1448 heads[(by * MAX_HEAD_POS + bx) * MAX_LAYERS + i] == head)
1449 {
1450 heads[(by * MAX_HEAD_POS + bx) * MAX_LAYERS + i] = head;
1451 }
1452 }
1453 face_num = 0; /* Don't send this object - we'll send the head later */
1454 }
1455 }
1456 else
1457 {
1458 /* In this case, we are already at the lower right or single part object,
1459 * so nothing special
1460 */
1461 face_num = ob->face->number;
1462
1463 /* clear out any head entries that have the same face as this one */
1464 for (bx = 0; bx < layer; bx++)
1465 if (heads[(sy * MAX_HEAD_POS + sx) * MAX_LAYERS + bx] &&
1466 heads[(sy * MAX_HEAD_POS + sx) * MAX_LAYERS + bx]->face->number == face_num)
1467 heads[(sy * MAX_HEAD_POS + sx) * MAX_LAYERS + bx] = NULL;
1468 }
1469 } /* else not already head object or blank face */
1470
1471 /* This is a real hack. Basically, if we have nothing to send for this layer,
1472 * but there is a head on the next layer, send that instead.
1473 * Without this, what happens is you can get the case where the player stands
1474 * on the same space as the head. However, if you have overlapping big objects
1475 * of the same type, what happens then is it doesn't think it needs to send
1476 * This tends to make stacking also work/look better.
1477 */
1478 if (!face_num && layer > 0 && heads[(sy * MAX_HEAD_POS + sx) * MAX_LAYERS + layer - 1])
1479 {
1480 face_num = heads[(sy * MAX_HEAD_POS + sx) * MAX_LAYERS + layer - 1]->face->number;
1481 heads[(sy * MAX_HEAD_POS + sx) * MAX_LAYERS + layer - 1] = NULL;
1482 }
1483
1484 /* Another hack - because of heads and whatnot, this face may match one
1485 * we already sent for a lower layer. In that case, don't send
1486 * this one.
1487 */
1488 if (face_num && layer + 1 < MAP_LAYERS && ns.lastmap.cells[sx][sy].faces[layer + 1] == face_num)
1489 face_num = 0;
1490 931
1491 /* We've gotten what face we want to use for the object. Now see if 932 /* We've gotten what face we want to use for the object. Now see if
1492 * if it has changed since we last sent it to the client. 933 * if it has changed since we last sent it to the client.
1493 */ 934 */
1494 if (ns.lastmap.cells[sx][sy].faces[layer] != face_num) 935 if (lastcell.faces[layer] != face_num)
1495 { 936 {
1496 ns.lastmap.cells[sx][sy].faces[layer] = face_num; 937 lastcell.faces[layer] = face_num;
938
1497 if (!(ns.faces_sent[face_num] & NS_FACESENT_FACE)) 939 if (!ns.faces_sent[face_num])
940 if (ob)
941 ns.send_faces (ob);
942 else
1498 esrv_send_face (&ns, face_num, 0); 943 ns.send_face (face_num);
1499 944
1500 sl << uint16 (face_num); 945 sl << uint16 (face_num);
1501 return 1;
1502 }
1503
1504 /* Nothing changed */
1505 return 0;
1506}
1507
1508/**
1509 * This function is mainly a copy of update_space,
1510 * except it handles update of the smoothing updates,
1511 * not the face updates.
1512 * Removes the need to replicate the same code for each layer.
1513 * this returns true if this smooth is now in fact different
1514 * than it was.
1515 * sl is the socklist this data is going into.
1516 * ns is the socket we are working on - all the info we care
1517 * about is in this socket structure, so know need to pass the
1518 * entire player object.
1519 * mx and my are map coordinate offsets for map mp
1520 * sx and sy are the offsets into the socket structure that
1521 * holds the old values.
1522 * layer is the layer to update, with 2 being the floor and 0 the
1523 * top layer (this matches what the GET_MAP_FACE and GET_MAP_FACE_OBJ
1524 * take.
1525 */
1526
1527static inline int
1528update_smooth (packet &sl, client &ns, maptile *mp, int mx, int my, int sx, int sy, int layer)
1529{
1530 object *ob;
1531 int smoothlevel; /* old face_num; */
1532
1533 ob = GET_MAP_FACE_OBJ (mp, mx, my, layer);
1534
1535 /* If there is no object for this space, or if the face for the object
1536 * is the blank face, set the smoothlevel to zero.
1537 */
1538 if (!ob || ob->face == blank_face || MAP_NOSMOOTH (mp))
1539 smoothlevel = 0;
1540 else
1541 {
1542 smoothlevel = ob->smoothlevel;
1543 if (smoothlevel && !(ns.faces_sent[ob->face->number] & NS_FACESENT_SMOOTH))
1544 SendSmooth (&ns, ob->face->number);
1545 } /* else not already head object or blank face */
1546
1547 /* We've gotten what face we want to use for the object. Now see if
1548 * if it has changed since we last sent it to the client.
1549 */
1550 if (smoothlevel > 255)
1551 smoothlevel = 255;
1552 else if (smoothlevel < 0)
1553 smoothlevel = 0;
1554
1555 if (ns.lastmap.cells[sx][sy].smooth[layer] != smoothlevel)
1556 {
1557 ns.lastmap.cells[sx][sy].smooth[layer] = smoothlevel;
1558 sl << uint8 (smoothlevel);
1559 return 1; 946 return 1;
1560 } 947 }
1561 948
1562 /* Nothing changed */ 949 /* Nothing changed */
1563 return 0; 950 return 0;
… …
1580 } 967 }
1581 968
1582 return result; 969 return result;
1583} 970}
1584 971
972// prefetch (and touch) all maps within a specific distancd
973static void
974prefetch_surrounding_maps (maptile *map, int distance)
975{
976 map->last_access = runtime;
977
978 if (--distance)
979 for (int dir = 4; --dir; )
980 if (const shstr &path = map->tile_path [dir])
981 if (maptile *&neigh = map->tile_map [dir])
982 prefetch_surrounding_maps (neigh, distance);
983 else
984 neigh = maptile::find_async (path, map);
985}
986
987// prefetch a generous area around the player
988static void
989prefetch_surrounding_maps (object *op)
990{
991 prefetch_surrounding_maps (op->map, 3);
992}
993
1585/** 994/**
1586 * This function uses the new map1 protocol command to send the map 995 * Draws client map.
1587 * to the client. It is necessary because the old map command supports
1588 * a maximum map size of 15x15.
1589 * This function is much simpler than the old one. This is because
1590 * the old function optimized to send as few face identifiers as possible,
1591 * at the expense of sending more coordinate location (coordinates were
1592 * only 1 byte, faces 2 bytes, so this was a worthwhile savings). Since
1593 * we need 2 bytes for coordinates and 2 bytes for faces, such a trade off
1594 * maps no sense. Instead, we actually really only use 12 bits for coordinates,
1595 * and use the other 4 bits for other informatiion. For full documentation
1596 * of what we send, see the doc/Protocol file.
1597 * I will describe internally what we do:
1598 * the socket->lastmap shows how the map last looked when sent to the client.
1599 * in the lastmap structure, there is a cells array, which is set to the
1600 * maximum viewable size (As set in config.h).
1601 * in the cells, there are faces and a count value.
1602 * we use the count value to hold the darkness value. If -1, then this space
1603 * is not viewable.
1604 * we use faces[0] faces[1] faces[2] to hold what the three layers
1605 * look like.
1606 */ 996 */
1607void 997void
1608draw_client_map1 (object *pl) 998draw_client_map (player *pl)
1609{ 999{
1000 object *ob = pl->observe;
1001 if (!ob->active)
1002 return;
1003
1004 maptile *plmap = ob->map;
1005
1006 /* If player is just joining the game, he isn't here yet, so the map
1007 * can get swapped out. If so, don't try to send them a map. All will
1008 * be OK once they really log in.
1009 */
1010 if (!plmap || plmap->in_memory != MAP_IN_MEMORY)
1011 return;
1012
1610 int x, y, ax, ay, d, startlen, max_x, max_y, oldlen; 1013 int x, y, ax, ay, startlen, max_x, max_y, oldlen;
1611 sint16 nx, ny;
1612 int estartlen, eoldlen; 1014 int estartlen, eoldlen;
1613 uint16 mask, emask;
1614 uint8 eentrysize; 1015 uint8 eentrysize;
1615 uint16 ewhatstart, ewhatflag; 1016 uint16 ewhatstart, ewhatflag;
1616 uint8 extendedinfos; 1017 uint8 extendedinfos;
1617 maptile *m;
1618 1018
1619 client &socket = *pl->contr->socket;
1620
1621 check_map_change (pl->contr); 1019 check_map_change (pl);
1020 prefetch_surrounding_maps (pl->ob);
1622 1021
1623 packet sl; 1022 /* do LOS after calls to update_position */
1023 if (ob != pl->ob)
1024 clear_los (pl);
1025 else if (pl->do_los)
1026 {
1027 update_los (ob);
1028 pl->do_los = 0;
1029 }
1030
1031 /**
1032 * This function uses the new map1 protocol command to send the map
1033 * to the client. It is necessary because the old map command supports
1034 * a maximum map size of 15x15.
1035 * This function is much simpler than the old one. This is because
1036 * the old function optimized to send as few face identifiers as possible,
1037 * at the expense of sending more coordinate location (coordinates were
1038 * only 1 byte, faces 2 bytes, so this was a worthwhile savings). Since
1039 * we need 2 bytes for coordinates and 2 bytes for faces, such a trade off
1040 * maps no sense. Instead, we actually really only use 12 bits for coordinates,
1041 * and use the other 4 bits for other informatiion. For full documentation
1042 * of what we send, see the doc/Protocol file.
1043 * I will describe internally what we do:
1044 * the ns->lastmap shows how the map last looked when sent to the client.
1045 * in the lastmap structure, there is a cells array, which is set to the
1046 * maximum viewable size (As set in config.h).
1047 * in the cells, there are faces and a count value.
1048 * we use the count value to hold the darkness value. If -1, then this space
1049 * is not viewable.
1050 * we use faces[0] faces[1] faces[2] to hold what the three layers
1051 * look like.
1052 */
1053
1054 client &socket = *pl->ns;
1055
1056 packet sl (socket.mapmode == Map1Cmd ? "map1" : "map1a");
1624 packet esl; 1057 packet esl;
1625 1058
1626 sl << (socket.mapmode == Map1Cmd ? "map1 " : "map1a ");
1627 startlen = sl.length (); 1059 startlen = sl.length ();
1628 1060
1629 /*Extendedmapinfo structure initialisation */ 1061 /*Extendedmapinfo structure initialisation */
1630 if (socket.ext_mapinfos) 1062 if (socket.ext_mapinfos)
1631 { 1063 {
… …
1642 << uint8 (extendedinfos) 1074 << uint8 (extendedinfos)
1643 << uint8 (eentrysize); 1075 << uint8 (eentrysize);
1644 1076
1645 estartlen = esl.length (); 1077 estartlen = esl.length ();
1646 } 1078 }
1647 else
1648 {
1649 /* suppress compiler warnings */
1650 ewhatstart = 0;
1651 ewhatflag = 0;
1652 estartlen = 0;
1653 }
1654
1655 /* Init data to zero */
1656 memset (heads, 0, sizeof (object *) * MAX_HEAD_POS * MAX_HEAD_POS * MAX_LAYERS);
1657 1079
1658 /* x,y are the real map locations. ax, ay are viewport relative 1080 /* x,y are the real map locations. ax, ay are viewport relative
1659 * locations. 1081 * locations.
1660 */ 1082 */
1661 ay = 0; 1083 ay = 0;
1662 1084
1663 /* We could do this logic as conditionals in the if statement, 1085 /* We could do this logic as conditionals in the if statement,
1664 * but that started to get a bit messy to look at. 1086 * but that started to get a bit messy to look at.
1665 */ 1087 */
1666 max_x = pl->x + (socket.mapx + 1) / 2; 1088 max_x = ob->x + (socket.mapx + 1) / 2;
1667 max_y = pl->y + (socket.mapy + 1) / 2; 1089 max_y = ob->y + (socket.mapy + 1) / 2;
1668 1090
1669 if (socket.mapmode == Map1aCmd)
1670 {
1671 max_x += MAX_HEAD_OFFSET;
1672 max_y += MAX_HEAD_OFFSET;
1673 }
1674
1675 for (y = pl->y - socket.mapy / 2; y < max_y; y++, ay++) 1091 for (y = ob->y - socket.mapy / 2; y < max_y; y++, ay++)
1676 { 1092 {
1093 sint16 nx, ny;
1094 maptile *m = 0;
1095
1677 ax = 0; 1096 ax = 0;
1678 for (x = pl->x - socket.mapx / 2; x < max_x; x++, ax++) 1097 for (x = ob->x - socket.mapx / 2; x < max_x; x++, ax++)
1679 { 1098 {
1099 // check to see if we can simply go one right quickly
1100 ++nx;
1101 if (m && nx >= m->width)
1102 m = 0;
1680 1103
1104 if (!m)
1105 {
1106 nx = x; ny = y; m = plmap;
1107
1108 if (!xy_normalise (m, nx, ny))
1109 m = 0;
1110 }
1111
1112 int emask, mask;
1681 emask = mask = (ax & 0x3f) << 10 | (ay & 0x3f) << 4; 1113 emask = mask = (ax & 0x3f) << 10 | (ay & 0x3f) << 4;
1682 1114
1683 /* If this space is out of the normal viewable area, we only check
1684 * the heads value ax or ay will only be greater than what
1685 * the client wants if using the map1a command - this is because
1686 * if the map1a command is not used, max_x and max_y will be
1687 * set to lower values.
1688 */
1689 if (ax >= socket.mapx || ay >= socket.mapy)
1690 {
1691 int i, got_one;
1692
1693 oldlen = sl.length ();
1694
1695 sl << uint16 (mask);
1696
1697 if (check_head (sl, socket, ax, ay, 2)) mask |= 0x4;
1698 if (check_head (sl, socket, ax, ay, 1)) mask |= 0x2;
1699 if (check_head (sl, socket, ax, ay, 0)) mask |= 0x1;
1700
1701 /* If all we are doing is sending 0 (blank) faces, we don't
1702 * actually need to send that - just the coordinates
1703 * with no faces tells the client to blank out the
1704 * space.
1705 */
1706 got_one = 0;
1707 for (i = oldlen + 2; i < sl.length (); i++)
1708 if (sl[i])
1709 got_one = 1;
1710
1711 if (got_one && (mask & 0xf))
1712 sl[oldlen + 1] = mask & 0xff;
1713 else
1714 { /*either all faces blank, either no face at all */
1715 if (mask & 0xf) /*at least 1 face, we know it's blank, only send coordinates */
1716 sl.reset (oldlen + 2);
1717 else
1718 sl.reset (oldlen);
1719 }
1720
1721 /*What concerns extendinfos, nothing to be done for now
1722 * (perhaps effects layer later)
1723 */
1724 continue; /* don't do processing below */
1725 }
1726
1727 MapCell &lastcell = socket.lastmap.cells[ax][ay]; 1115 MapCell &lastcell = socket.lastmap.cells[ax][ay];
1728
1729 d = pl->contr->blocked_los[ax][ay];
1730 1116
1731 /* If the coordinates are not valid, or it is too dark to see, 1117 /* If the coordinates are not valid, or it is too dark to see,
1732 * we tell the client as such 1118 * we tell the client as such
1733 */ 1119 */
1734 nx = x;
1735 ny = y;
1736 m = get_map_from_coord (pl->map, &nx, &ny);
1737
1738 if (!m) 1120 if (!m)
1739 { 1121 {
1740 /* space is out of map. Update space and clear values 1122 /* space is out of map. Update space and clear values
1741 * if this hasn't already been done. If the space is out 1123 * if this hasn't already been done. If the space is out
1742 * of the map, it shouldn't have a head 1124 * of the map, it shouldn't have a head
1743 */ 1125 */
1744 if (lastcell.count != -1) 1126 if (lastcell.count != -1)
1745 { 1127 {
1746 sl << uint16 (mask); 1128 sl << uint16 (mask);
1747 map_clearcell (&lastcell, 0, 0, 0, -1); 1129 map_clearcell (&lastcell, -1);
1748 } 1130 }
1131
1132 continue;
1749 } 1133 }
1134
1135 m->touch ();
1136
1137 int d = pl->blocked_los[ax][ay];
1138
1750 else if (d > 3) 1139 if (d > 3)
1751 { 1140 {
1141
1752 int need_send = 0, count; 1142 int need_send = 0, count;
1753 1143
1754 /* This block deals with spaces that are not visible for whatever 1144 /* This block deals with spaces that are not visible for whatever
1755 * reason. Still may need to send the head for this space. 1145 * reason. Still may need to send the head for this space.
1756 */ 1146 */
1757 1147
1758 oldlen = sl.length (); 1148 oldlen = sl.length ();
1759 1149
1760 sl << uint16 (mask); 1150 sl << uint16 (mask);
… …
1762 if (lastcell.count != -1) 1152 if (lastcell.count != -1)
1763 need_send = 1; 1153 need_send = 1;
1764 1154
1765 count = -1; 1155 count = -1;
1766 1156
1767 if (socket.mapmode == Map1aCmd && have_head (ax, ay))
1768 {
1769 /* Now check to see if any heads need to be sent */
1770
1771 if (check_head (sl, socket, ax, ay, 2)) mask |= 0x4;
1772 if (check_head (sl, socket, ax, ay, 1)) mask |= 0x2;
1773 if (check_head (sl, socket, ax, ay, 0)) mask |= 0x1;
1774
1775 lastcell.count = count;
1776 }
1777 else
1778 {
1779 /* properly clear a previously sent big face */ 1157 /* properly clear a previously sent big face */
1780 if (lastcell.faces[0] != 0 || lastcell.faces[1] != 0 || lastcell.faces[2] != 0 1158 if (lastcell.faces[0] || lastcell.faces[1] || lastcell.faces[2]
1781 || lastcell.stat_hp || lastcell.flags || lastcell.player) 1159 || lastcell.stat_hp || lastcell.flags || lastcell.player)
1782 need_send = 1; 1160 need_send = 1;
1783 1161
1784 map_clearcell (&lastcell, 0, 0, 0, count); 1162 map_clearcell (&lastcell, count);
1785 }
1786 1163
1787 if ((mask & 0xf) || need_send) 1164 if ((mask & 0xf) || need_send)
1788 sl[oldlen + 1] = mask & 0xff; 1165 sl[oldlen + 1] = mask & 0xff;
1789 else 1166 else
1790 sl.reset (oldlen); 1167 sl.reset (oldlen);
1791 } 1168 }
1792 else 1169 else
1793 { 1170 {
1794 /* In this block, the space is visible or there are head objects 1171 /* In this block, the space is visible.
1795 * we need to send.
1796 */ 1172 */
1797 1173
1798 /* Rather than try to figure out what everything that we might 1174 /* Rather than try to figure out what everything that we might
1799 * need to send is, then form the packet after that, 1175 * need to send is, then form the packet after that,
1800 * we presume that we will in fact form a packet, and update 1176 * we presume that we will in fact form a packet, and update
… …
1803 * is done. 1179 * is done.
1804 * I think this is simpler than doing a bunch of checks to see 1180 * I think this is simpler than doing a bunch of checks to see
1805 * what if anything we need to send, setting the bits, then 1181 * what if anything we need to send, setting the bits, then
1806 * doing those checks again to add the real data. 1182 * doing those checks again to add the real data.
1807 */ 1183 */
1808 oldlen = sl.length (); 1184 oldlen = sl.length ();
1809 mask = (ax & 0x3f) << 10 | (ay & 0x3f) << 4;
1810 eoldlen = esl.length (); 1185 eoldlen = esl.length ();
1811 emask = (ax & 0x3f) << 10 | (ay & 0x3f) << 4; 1186
1812 sl << uint16 (mask); 1187 sl << uint16 (mask);
1813
1814 if (socket.ext_mapinfos)
1815 esl << uint16 (emask);
1816 1188
1817 unsigned char dummy; 1189 unsigned char dummy;
1818 unsigned char *last_ext = &dummy; 1190 unsigned char *last_ext = &dummy;
1819 1191
1820 /* Darkness changed */ 1192 /* Darkness changed */
… …
1832 sl << uint8 (255 - 64 * d); 1204 sl << uint8 (255 - 64 * d);
1833 } 1205 }
1834 1206
1835 lastcell.count = d; 1207 lastcell.count = d;
1836 1208
1209 mapspace &ms = m->at (nx, ny);
1210 ms.update ();
1211
1837 if (socket.extmap) 1212 if (socket.extmap)
1838 { 1213 {
1839 uint8 stat_hp = 0; 1214 uint8 stat_hp = 0;
1840 uint8 stat_width = 0; 1215 uint8 stat_width = 0;
1841 uint8 flags = 0; 1216 uint8 flags = 0;
1842 UUID player = 0; 1217 tag_t player = 0;
1843 1218
1844 // send hp information, if applicable 1219 // send hp information, if applicable
1845 if (object *op = GET_MAP_FACE_OBJ (m, nx, ny, 0)) 1220 if (object *op = ms.faces_obj [0])
1846 { 1221 {
1847 if (op->head || op->invisible) 1222 if (op->head || op->invisible)
1848 ; // do not show 1223 ; // do not show
1849 else if (op->type == PLAYER 1224 else if (op->type == PLAYER
1850 || QUERY_FLAG (op, FLAG_MONSTER) || QUERY_FLAG (op, FLAG_ALIVE) || QUERY_FLAG (op, FLAG_GENERATOR)) 1225 || QUERY_FLAG (op, FLAG_MONSTER) || QUERY_FLAG (op, FLAG_ALIVE) || QUERY_FLAG (op, FLAG_GENERATOR))
1851 { 1226 {
1852 if (op->stats.maxhp > 0 && (unsigned) op->stats.maxhp > (unsigned) op->stats.hp) 1227 if (op->stats.maxhp > 0 && (unsigned) op->stats.maxhp > (unsigned) op->stats.hp)
1853 { 1228 {
1854 stat_hp = 255 - (op->stats.hp * 255 + 254) / op->stats.maxhp; 1229 stat_hp = 255 - (op->stats.hp * 255 + 254) / op->stats.maxhp;
1855 stat_width = op->arch->tail_x; 1230 stat_width = op->arch->max_x - op->arch->x; //TODO: should be upper-left edge
1856 } 1231 }
1857 } 1232 }
1858 1233
1859 if (op->msg && op->msg[0] == '@') 1234 if (op->msg && op->msg[0] == '@')
1860 flags |= 1; 1235 flags |= 1;
1861 1236
1862 if (op->type == PLAYER && op != pl) 1237 if (op->type == PLAYER && op != ob)
1863 player = op->count; 1238 player = op->count;
1864 } 1239 }
1865 1240
1866 if (lastcell.stat_hp != stat_hp) 1241 if (lastcell.stat_hp != stat_hp)
1867 { 1242 {
… …
1888 1263
1889 mask |= 0x8; 1264 mask |= 0x8;
1890 *last_ext |= 0x80; 1265 *last_ext |= 0x80;
1891 last_ext = &sl[sl.length ()]; 1266 last_ext = &sl[sl.length ()];
1892 1267
1893 sl << uint8 (0x47) << uint8 (8) << (uint64)player; 1268 sl << uint8 (0x47) << uint8 (4) << (uint32)player;
1894 } 1269 }
1895 1270
1896 if (lastcell.flags != flags) 1271 if (lastcell.flags != flags)
1897 { 1272 {
1898 lastcell.flags = flags; 1273 lastcell.flags = flags;
… …
1904 sl << uint8 (8) << uint8 (flags); 1279 sl << uint8 (8) << uint8 (flags);
1905 } 1280 }
1906 } 1281 }
1907 1282
1908 /* Floor face */ 1283 /* Floor face */
1909 if (update_space (sl, socket, m, nx, ny, ax, ay, 2)) 1284 if (update_space (sl, socket, ms, lastcell, 2))
1910 mask |= 0x4; 1285 mask |= 0x4;
1911 1286
1912 if (socket.EMI_smooth)
1913 if (update_smooth (esl, socket, m, nx, ny, ax, ay, 2))
1914 emask |= 0x4;
1915
1916 /* Middle face */ 1287 /* Middle face */
1917 if (update_space (sl, socket, m, nx, ny, ax, ay, 1)) 1288 if (update_space (sl, socket, ms, lastcell, 1))
1918 mask |= 0x2; 1289 mask |= 0x2;
1919 1290
1920 if (socket.EMI_smooth) 1291 if (ms.player () == ob
1921 if (update_smooth (esl, socket, m, nx, ny, ax, ay, 1)) 1292 && (ob->invisible & (ob->invisible < 50 ? 1 : 7)))
1922 emask |= 0x2;
1923
1924 if (nx == pl->x && ny == pl->y && pl->invisible & (pl->invisible < 50 ? 4 : 1))
1925 { 1293 {
1294 // force player to be visible to himself if invisible
1926 if (lastcell.faces[0] != pl->face->number) 1295 if (lastcell.faces[0] != ob->face)
1927 { 1296 {
1928 lastcell.faces[0] = pl->face->number; 1297 lastcell.faces[0] = ob->face;
1298
1929 mask |= 0x1; 1299 mask |= 0x1;
1930
1931 if (!(socket.faces_sent[pl->face->number] & NS_FACESENT_FACE))
1932 esrv_send_face (&socket, pl->face->number, 0);
1933
1934 sl << uint16 (pl->face->number); 1300 sl << uint16 (ob->face);
1301
1302 socket.send_faces (ob);
1935 } 1303 }
1936 } 1304 }
1937 else
1938 {
1939 /* Top face */ 1305 /* Top face */
1940 if (update_space (sl, socket, m, nx, ny, ax, ay, 0)) 1306 else if (update_space (sl, socket, ms, lastcell, 0))
1941 mask |= 0x1; 1307 mask |= 0x1;
1942
1943 if (socket.EMI_smooth)
1944 if (update_smooth (esl, socket, m, nx, ny, ax, ay, 0))
1945 emask |= 0x1;
1946 }
1947 1308
1948 /* Check to see if we are in fact sending anything for this 1309 /* Check to see if we are in fact sending anything for this
1949 * space by checking the mask. If so, update the mask. 1310 * space by checking the mask. If so, update the mask.
1950 * if not, reset the len to that from before adding the mask 1311 * if not, reset the len to that from before adding the mask
1951 * value, so we don't send those bits. 1312 * value, so we don't send those bits.
… …
1953 if (mask & 0xf) 1314 if (mask & 0xf)
1954 sl[oldlen + 1] = mask & 0xff; 1315 sl[oldlen + 1] = mask & 0xff;
1955 else 1316 else
1956 sl.reset (oldlen); 1317 sl.reset (oldlen);
1957 1318
1319 if (socket.ext_mapinfos)
1320 esl << uint16 (emask);
1321
1322 if (socket.EMI_smooth)
1323 {
1324 for (int layer = 2+1; layer--; )
1325 {
1326 object *ob = ms.faces_obj [layer];
1327
1328 // If there is no object for this space, or if the face for the object
1329 // is the blank face, set the smoothlevel to zero.
1330 int smoothlevel = ob && ob->face != blank_face ? ob->smoothlevel : 0;
1331
1332 // We've gotten what face we want to use for the object. Now see if
1333 // if it has changed since we last sent it to the client.
1334 if (lastcell.smooth[layer] != smoothlevel)
1335 {
1336 lastcell.smooth[layer] = smoothlevel;
1337 esl << uint8 (smoothlevel);
1338 emask |= 1 << layer;
1339 }
1340 }
1341
1958 if (emask & 0xf) 1342 if (emask & 0xf)
1959 esl[eoldlen + 1] = emask & 0xff; 1343 esl[eoldlen + 1] = emask & 0xff;
1960 else 1344 else
1961 esl.reset (eoldlen); 1345 esl.reset (eoldlen);
1346 }
1962 } /* else this is a viewable space */ 1347 } /* else this is a viewable space */
1963 } /* for x loop */ 1348 } /* for x loop */
1964 } /* for y loop */ 1349 } /* for y loop */
1350
1351 socket.flush_fx ();
1965 1352
1966 /* Verify that we in fact do need to send this */ 1353 /* Verify that we in fact do need to send this */
1967 if (socket.ext_mapinfos) 1354 if (socket.ext_mapinfos)
1968 { 1355 {
1969 if (!(sl.length () > startlen || socket.sent_scroll)) 1356 if (!(sl.length () > startlen || socket.sent_scroll))
1970 { 1357 {
1971 /* No map data will follow, so don't say the client 1358 /* No map data will follow, so don't say the client
1972 * it doesn't need draw! 1359 * it doesn't need draw!
1973 */ 1360 */
1974 ewhatflag &= (~EMI_NOREDRAW); 1361 ewhatflag &= ~EMI_NOREDRAW;
1975 esl[ewhatstart + 1] = ewhatflag & 0xff; 1362 esl[ewhatstart + 1] = ewhatflag & 0xff;
1976 } 1363 }
1977 1364
1978 if (esl.length () > estartlen) 1365 if (esl.length () > estartlen)
1979 socket.send_packet (esl); 1366 socket.send_packet (esl);
… …
1984 socket.send_packet (sl); 1371 socket.send_packet (sl);
1985 socket.sent_scroll = 0; 1372 socket.sent_scroll = 0;
1986 } 1373 }
1987} 1374}
1988 1375
1989/**
1990 * Draws client map.
1991 */
1992void
1993draw_client_map (object *pl)
1994{
1995 int i, j;
1996 sint16 ax, ay, nx, ny; /* ax and ay goes from 0 to max-size of arrays */
1997 New_Face *face, *floor;
1998 New_Face *floor2;
1999 int d, mflags;
2000 struct Map newmap;
2001 maptile *m, *pm;
2002
2003 if (pl->type != PLAYER)
2004 {
2005 LOG (llevError, "draw_client_map called with non player/non eric-server\n");
2006 return;
2007 }
2008
2009 pm = pl->map;
2010
2011 /* If player is just joining the game, he isn't here yet, so the map
2012 * can get swapped out. If so, don't try to send them a map. All will
2013 * be OK once they really log in.
2014 */
2015 if (pm == NULL || pm->in_memory != MAP_IN_MEMORY)
2016 return;
2017
2018 memset (&newmap, 0, sizeof (struct Map));
2019
2020 for (j = (pl->y - pl->contr->socket->mapy / 2); j < (pl->y + (pl->contr->socket->mapy + 1) / 2); j++)
2021 {
2022 for (i = (pl->x - pl->contr->socket->mapx / 2); i < (pl->x + (pl->contr->socket->mapx + 1) / 2); i++)
2023 {
2024 ax = i;
2025 ay = j;
2026 m = pm;
2027 mflags = get_map_flags (m, &m, ax, ay, &ax, &ay);
2028
2029 if (mflags & P_OUT_OF_MAP)
2030 continue;
2031
2032 if (mflags & P_NEED_UPDATE)
2033 update_position (m, ax, ay);
2034
2035 /* If a map is visible to the player, we don't want to swap it out
2036 * just to reload it. This should really call something like
2037 * swap_map, but this is much more efficient and 'good enough'
2038 */
2039 if (mflags & P_NEW_MAP)
2040 m->timeout = 50;
2041 }
2042 }
2043 /* do LOS after calls to update_position */
2044 if (pl->contr->do_los)
2045 {
2046 update_los (pl);
2047 pl->contr->do_los = 0;
2048 }
2049
2050 /* Big maps need a different drawing mechanism to work */
2051 draw_client_map1 (pl);
2052}
2053
2054
2055/*****************************************************************************/ 1376/*****************************************************************************/
2056
2057/* GROS: The following one is used to allow a plugin to send a generic cmd to*/ 1377/* GROS: The following one is used to allow a plugin to send a generic cmd to*/
2058
2059/* a player. Of course, the client need to know the command to be able to */ 1378/* a player. Of course, the client need to know the command to be able to */
2060
2061/* manage it ! */ 1379/* manage it ! */
2062
2063/*****************************************************************************/ 1380/*****************************************************************************/
2064void 1381void
2065send_plugin_custom_message (object *pl, char *buf) 1382send_plugin_custom_message (object *pl, char *buf)
2066{ 1383{
2067 pl->contr->socket->send_packet (buf); 1384 pl->contr->ns->send_packet (buf);
2068} 1385}
2069 1386
2070/** 1387/**
2071 * This sends the skill number to name mapping. We ignore 1388 * This sends the skill number to name mapping. We ignore
2072 * the params - we always send the same info no matter what. 1389 * the params - we always send the same info no matter what.
… …
2117 * it then sends an updspell packet for each spell that has changed in this way 1434 * it then sends an updspell packet for each spell that has changed in this way
2118 */ 1435 */
2119void 1436void
2120esrv_update_spells (player *pl) 1437esrv_update_spells (player *pl)
2121{ 1438{
1439 if (!pl->ns)
1440 return;
1441
2122 if (!pl->socket->monitor_spells) 1442 if (!pl->ns->monitor_spells)
2123 return; 1443 return;
2124 1444
2125 for (object *spell = pl->ob->inv; spell; spell = spell->below) 1445 for (object *spell = pl->ob->inv; spell; spell = spell->below)
2126 { 1446 {
2127 if (spell->type == SPELL) 1447 if (spell->type == SPELL)
… …
2157 1477
2158 if (flags & UPD_SP_MANA ) sl << uint16 (spell->last_sp); 1478 if (flags & UPD_SP_MANA ) sl << uint16 (spell->last_sp);
2159 if (flags & UPD_SP_GRACE ) sl << uint16 (spell->last_grace); 1479 if (flags & UPD_SP_GRACE ) sl << uint16 (spell->last_grace);
2160 if (flags & UPD_SP_DAMAGE) sl << uint16 (spell->last_eat); 1480 if (flags & UPD_SP_DAMAGE) sl << uint16 (spell->last_eat);
2161 1481
2162 pl->socket->send_packet (sl); 1482 pl->ns->send_packet (sl);
2163 } 1483 }
2164 } 1484 }
2165 } 1485 }
2166} 1486}
2167 1487
2168void 1488void
2169esrv_remove_spell (player *pl, object *spell) 1489esrv_remove_spell (player *pl, object *spell)
2170{ 1490{
2171 if (!pl->socket->monitor_spells) 1491 if (!pl->ns->monitor_spells)
2172 return; 1492 return;
2173 1493
2174 if (!pl || !spell || spell->env != pl->ob) 1494 if (!pl || !spell || spell->env != pl->ob)
2175 { 1495 {
2176 LOG (llevError, "Invalid call to esrv_remove_spell"); 1496 LOG (llevError, "Invalid call to esrv_remove_spell");
2177 return; 1497 return;
2178 } 1498 }
2179 1499
2180 packet sl; 1500 packet sl ("delspell");
2181 1501
2182 sl << "delspell "
2183 << uint32 (spell->count); 1502 sl << uint32 (spell->count);
2184 1503
2185 pl->socket->send_packet (sl); 1504 pl->ns->send_packet (sl);
2186} 1505}
2187 1506
2188/* appends the spell *spell to the Socklist we will send the data to. */ 1507/* appends the spell *spell to the Socklist we will send the data to. */
2189static void 1508static void
2190append_spell (player *pl, packet &sl, object *spell) 1509append_spell (player *pl, packet &sl, object *spell)
2191{ 1510{
2192 int len, i, skill = 0; 1511 int i, skill = 0;
2193 1512
2194 if (!(spell->name)) 1513 if (!(spell->name))
2195 { 1514 {
2196 LOG (llevError, "item number %d is a spell with no name.\n", spell->count); 1515 LOG (llevError, "item number %d is a spell with no name.\n", spell->count);
2197 return; 1516 return;
… …
2209 if (!strcmp (spell->skill, skill_names[i])) 1528 if (!strcmp (spell->skill, skill_names[i]))
2210 { 1529 {
2211 skill = i + CS_STAT_SKILLINFO; 1530 skill = i + CS_STAT_SKILLINFO;
2212 break; 1531 break;
2213 } 1532 }
1533 }
1534
1535 // spells better have a face
1536 if (!spell->face)
1537 {
1538 LOG (llevError, "%s: spell has no face, but face is mandatory.\n", &spell->name);
1539 spell->face = face_find ("burnout.x11", blank_face);
2214 } 1540 }
2215 1541
2216 /* send the current values */ 1542 /* send the current values */
2217 sl << uint32 (spell->count) 1543 sl << uint32 (spell->count)
2218 << uint16 (spell->level) 1544 << uint16 (spell->level)
… …
2220 << uint16 (spell->last_sp) 1546 << uint16 (spell->last_sp)
2221 << uint16 (spell->last_grace) 1547 << uint16 (spell->last_grace)
2222 << uint16 (spell->last_eat) 1548 << uint16 (spell->last_eat)
2223 << uint8 (skill) 1549 << uint8 (skill)
2224 << uint32 (spell->path_attuned) 1550 << uint32 (spell->path_attuned)
2225 << uint32 (spell->face ? spell->face->number : 0) 1551 << uint32 (spell->face)
2226 << data8 (spell->name) 1552 << data8 (spell->name)
2227 << data16 (spell->msg); 1553 << data16 (spell->msg);
2228} 1554}
2229 1555
2230/** 1556/**
… …
2238 { 1564 {
2239 LOG (llevError, "esrv_add_spells, tried to add a spell to a NULL player"); 1565 LOG (llevError, "esrv_add_spells, tried to add a spell to a NULL player");
2240 return; 1566 return;
2241 } 1567 }
2242 1568
2243 if (!pl->socket->monitor_spells) 1569 if (!pl->ns->monitor_spells)
2244 return; 1570 return;
2245 1571
2246 packet sl; 1572 packet sl ("addspell");
2247 sl << "addspell ";
2248 1573
2249 if (!spell) 1574 if (!spell)
2250 { 1575 {
2251 for (spell = pl->ob->inv; spell != NULL; spell = spell->below) 1576 for (spell = pl->ob->inv; spell; spell = spell->below)
2252 { 1577 {
2253 /* were we to simply keep appending data here, we could exceed 1578 /* were we to simply keep appending data here, we could exceed
2254 * MAXSOCKBUF if the player has enough spells to add, we know that 1579 * MAXSOCKBUF if the player has enough spells to add, we know that
2255 * append_spells will always append 19 data bytes, plus 4 length 1580 * append_spells will always append 19 data bytes, plus 4 length
2256 * bytes and 3 strings (because that is the spec) so we need to 1581 * bytes and 3 strings (because that is the spec) so we need to
… …
2266 if (spell->type != SPELL) 1591 if (spell->type != SPELL)
2267 continue; 1592 continue;
2268 1593
2269 if (sl.length () >= (MAXSOCKBUF - (26 + strlen (spell->name) + (spell->msg ? strlen (spell->msg) : 0)))) 1594 if (sl.length () >= (MAXSOCKBUF - (26 + strlen (spell->name) + (spell->msg ? strlen (spell->msg) : 0))))
2270 { 1595 {
2271 pl->socket->send_packet (sl); 1596 pl->ns->send_packet (sl);
2272 1597
2273 sl.reset (); 1598 sl.reset ();
2274 sl << "addspell "; 1599 sl << "addspell ";
2275 } 1600 }
2276 1601
… …
2290 LOG (llevError, "Buffer overflow in esrv_add_spells!\n"); 1615 LOG (llevError, "Buffer overflow in esrv_add_spells!\n");
2291 fatal (0); 1616 fatal (0);
2292 } 1617 }
2293 1618
2294 /* finally, we can send the packet */ 1619 /* finally, we can send the packet */
2295 pl->socket->send_packet (sl); 1620 pl->ns->send_packet (sl);
2296} 1621}
2297 1622

Diff Legend

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