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.16 by root, Sun Sep 10 13:43:33 2006 UTC vs.
Revision 1.76 by root, Wed Mar 14 13:05:30 2007 UTC

1
2/* 1/*
3 * static char *rcsid_init_c =
4 * "$Id: request.C,v 1.16 2006/09/10 13:43:33 root Exp $";
5 */
6
7/*
8 CrossFire, A Multiplayer game for X-windows 2 * CrossFire, A Multiplayer game for X-windows
9 3 *
4 * Copyright (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team
10 Copyright (C) 2001 Mark Wedel 5 * Copyright (C) 2001 Mark Wedel
11 Copyright (C) 1992 Frank Tore Johansen 6 * Copyright (C) 1992 Frank Tore Johansen
12 7 *
13 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
14 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
15 the Free Software Foundation; either version 2 of the License, or 10 * the Free Software Foundation; either version 2 of the License, or
16 (at your option) any later version. 11 * (at your option) any later version.
17 12 *
18 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,
19 but WITHOUT ANY WARRANTY; without even the implied warranty of 14 * but WITHOUT ANY WARRANTY; without even the implied warranty of
20 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
21 GNU General Public License for more details. 16 * GNU General Public License for more details.
22 17 *
23 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
24 along with this program; if not, write to the Free Software 19 * along with this program; if not, write to the Free Software
25 Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. 20 * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
26 21 *
27 The author can be reached via e-mail to crossfire-devel@real-time.com 22 * The author can be reached via e-mail to <crossfire@schmorp.de>
28*/ 23 */
29 24
30/** 25/**
31 * \file 26 * \file
32 * Client handling. 27 * Client handling.
33 * 28 *
… …
41 * 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
42 * way, we can use one dispatch table. 37 * way, we can use one dispatch table.
43 * 38 *
44 * esrv_map_new starts updating the map 39 * esrv_map_new starts updating the map
45 * 40 *
46 * esrv_map_setbelow allows filling in all of the faces for the map.
47 * if a face has not already been sent to the client, it is sent now.
48 *
49 * mapcellchanged, compactlayer, compactstack, perform the map compressing
50 * operations
51 *
52 * esrv_map_doneredraw finishes the map update, and ships across the
53 * map updates.
54 *
55 * esrv_map_scroll tells the client to scroll the map, and does similarily
56 * for the locally cached copy.
57 */ 41 */
58 42
59#include <global.h> 43#include <global.h>
60#include <sproto.h> 44#include <sproto.h>
61 45
62#include <newclient.h>
63#include <newserver.h>
64#include <living.h> 46#include <living.h>
65#include <commands.h> 47#include <commands.h>
66 48
67/* This block is basically taken from socket.c - I assume if it works there, 49/* This block is basically taken from socket.c - I assume if it works there,
68 * it should work here. 50 * it should work here.
69 */ 51 */
70#ifndef WIN32 /* ---win32 exclude unix headers */
71# include <sys/types.h> 52#include <sys/types.h>
72# include <sys/time.h> 53#include <sys/time.h>
73# include <sys/socket.h> 54#include <sys/socket.h>
74# include <netinet/in.h> 55#include <netinet/in.h>
75# include <netdb.h> 56#include <netdb.h>
76#endif /* win32 */
77 57
78#ifdef HAVE_UNISTD_H
79# include <unistd.h> 58#include <unistd.h>
80#endif
81
82#ifdef HAVE_SYS_TIME_H
83# include <sys/time.h> 59#include <sys/time.h>
84#endif
85 60
86#include "sounds.h" 61#include "sounds.h"
87 62
88/** 63/**
89 * This table translates the attack numbers as used within the 64 * This table translates the attack numbers as used within the
… …
106 -1, /* life stealing */ 81 -1, /* life stealing */
107 -1 /* Disease - not fully done yet */ 82 -1 /* Disease - not fully done yet */
108}; 83};
109 84
110static void 85static void
111socket_map_scroll (NewSocket * ns, int dx, int dy) 86socket_map_scroll (client *ns, int dx, int dy)
112{ 87{
113 struct Map newmap; 88 struct Map newmap;
114 int x, y, mx, my; 89 int x, y, mx, my;
115 90
116 {
117 char buf[MAXSOCKBUF];
118
119 sprintf (buf, "map_scroll %d %d", dx, dy); 91 ns->send_packet_printf ("map_scroll %d %d", dx, dy);
120 Write_String_To_Socket (ns, buf, strlen (buf));
121 }
122 92
123 /* If we are using the Map1aCmd, we may in fact send 93 /* If we are using the Map1aCmd, we may in fact send
124 * head information that is outside the viewable map. 94 * head information that is outside the viewable map.
125 * So set the mx,my to the max value we want to 95 * So set the mx,my to the max value we want to
126 * look for. Removed code to do so - it caused extra 96 * look for. Removed code to do so - it caused extra
… …
128 * that much difference in bandwidth. 98 * that much difference in bandwidth.
129 */ 99 */
130 mx = ns->mapx; 100 mx = ns->mapx;
131 my = ns->mapy; 101 my = ns->mapy;
132 102
133 if (ns->mapmode == Map1aCmd)
134 {
135 mx += MAX_HEAD_OFFSET;
136 my += MAX_HEAD_OFFSET;
137 }
138
139 /* 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
140 * (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,
141 * if the destination x or y coordinate is outside the viewable 105 * if the destination x or y coordinate is outside the viewable
142 * area, we clear the values - otherwise, the old values 106 * area, we clear the values - otherwise, the old values
143 * 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.
… …
145 for (x = 0; x < mx; x++) 109 for (x = 0; x < mx; x++)
146 { 110 {
147 for (y = 0; y < my; y++) 111 for (y = 0; y < my; y++)
148 { 112 {
149 if (x >= ns->mapx || y >= ns->mapy) 113 if (x >= ns->mapx || y >= ns->mapy)
150 {
151 /* clear cells outside the viewable area */ 114 /* clear cells outside the viewable area */
152 memset (&newmap.cells[x][y], 0, sizeof (struct MapCell)); 115 memset (&newmap.cells[x][y], 0, sizeof (struct MapCell));
153 }
154 else if ((x + dx) < 0 || (x + dx) >= ns->mapx || (y + dy) < 0 || (y + dy) >= ns->mapy) 116 else if ((x + dx) < 0 || (x + dx) >= ns->mapx || (y + dy) < 0 || (y + dy) >= ns->mapy)
155 {
156 /* clear newly visible tiles within the viewable area */ 117 /* clear newly visible tiles within the viewable area */
157 memset (&(newmap.cells[x][y]), 0, sizeof (struct MapCell)); 118 memset (&(newmap.cells[x][y]), 0, sizeof (struct MapCell));
158 }
159 else 119 else
160 {
161 memcpy (&(newmap.cells[x][y]), &(ns->lastmap.cells[x + dx][y + dy]), sizeof (struct MapCell)); 120 memcpy (&(newmap.cells[x][y]), &(ns->lastmap.cells[x + dx][y + dy]), sizeof (struct MapCell));
162 }
163 } 121 }
164 } 122 }
165 123
166 memcpy (&(ns->lastmap), &newmap, sizeof (struct Map)); 124 memcpy (&(ns->lastmap), &newmap, sizeof (struct Map));
167 125
… …
172} 130}
173 131
174static void 132static void
175clear_map (player *pl) 133clear_map (player *pl)
176{ 134{
177 NewSocket & socket = pl->socket;
178
179 memset (&socket.lastmap, 0, sizeof (socket.lastmap)); 135 memset (&pl->ns->lastmap, 0, sizeof (pl->ns->lastmap));
180 136
181 if (socket.newmapcmd == 1) 137 if (pl->ns->newmapcmd == 1)
182 Write_String_To_Socket (&socket, "newmap", 6); 138 pl->ns->send_packet ("newmap");
183 139
184 socket.update_look = 1; 140 pl->ns->floorbox_reset ();
185 socket.look_position = 0;
186} 141}
187 142
188/** check for map change and send new map data */ 143/** check for map/region change and send new map data */
189static void 144static void
190check_map_change (player *pl) 145check_map_change (player *pl)
191{ 146{
192 NewSocket & socket = pl->socket; 147 client &socket = *pl->ns;
193 object *ob = pl->ob; 148 object *ob = pl->ob;
194 char buf[MAX_BUF]; /* eauugggh */ 149 char buf[MAX_BUF]; /* eauugggh */
195 150
196 if (socket.current_map != ob->map) 151 if (socket.current_map != ob->map)
197 { 152 {
… …
213 flags |= 4; 168 flags |= 4;
214 if (ob->map->tile_path[3]) 169 if (ob->map->tile_path[3])
215 flags |= 8; 170 flags |= 8;
216 171
217 snprintf (buf, MAX_BUF, "mapinfo - spatial %d %d %d %d %d %s", 172 snprintf (buf, MAX_BUF, "mapinfo - spatial %d %d %d %d %d %s",
218 flags, socket.mapx / 2 - ob->x, socket.mapy / 2 - ob->y, ob->map->width, ob->map->height, ob->map->path); 173 flags, socket.mapx / 2 - ob->x, socket.mapy / 2 - ob->y, ob->map->width, ob->map->height, &ob->map->path);
219 } 174 }
220 else 175 else
221 snprintf (buf, MAX_BUF, "mapinfo current"); 176 snprintf (buf, MAX_BUF, "mapinfo current");
222 177
223 Write_String_To_Socket (&socket, buf, strlen (buf)); 178 socket.send_packet (buf);
224 } 179 }
225 } 180 }
226 else if (socket.current_x != ob->x || socket.current_y != ob->y) 181 else if (socket.current_x != ob->x || socket.current_y != ob->y)
227 { 182 {
228 int dx = ob->x - socket.current_x; 183 int dx = ob->x - socket.current_x;
… …
231 if (socket.buggy_mapscroll && (abs (dx) > 8 || abs (dy) > 8)) 186 if (socket.buggy_mapscroll && (abs (dx) > 8 || abs (dy) > 8))
232 clear_map (pl); // current (<= 1.9.1) clients have unchecked buffer overflows 187 clear_map (pl); // current (<= 1.9.1) clients have unchecked buffer overflows
233 else 188 else
234 { 189 {
235 socket_map_scroll (&socket, ob->x - socket.current_x, ob->y - socket.current_y); 190 socket_map_scroll (&socket, ob->x - socket.current_x, ob->y - socket.current_y);
236 socket.update_look = 1; 191 socket.floorbox_reset ();
237 socket.look_position = 0;
238 } 192 }
239 } 193 }
240 194
241 socket.current_x = ob->x; 195 socket.current_x = ob->x;
242 socket.current_y = ob->y; 196 socket.current_y = ob->y;
197
198 region *reg = ob->region ();
199 if (socket.current_region != reg)
200 {
201 socket.current_region = reg;
202 socket.send_packet_printf ("drawinfo 0 You are now %s.\n(use whereami for more details)", &reg->longname);
203 }
204}
205
206/**
207 * RequestInfo is sort of a meta command. There is some specific
208 * request of information, but we call other functions to provide
209 * that information.
210 */
211void
212RequestInfo (char *buf, int len, client * ns)
213{
214 char *params = NULL, *cp;
215
216 /* No match */
217 char bigbuf[MAX_BUF];
218 int slen;
219
220 /* Set up replyinfo before we modify any of the buffers - this is used
221 * if we don't find a match.
222 */
223 strcpy (bigbuf, "replyinfo ");
224 slen = strlen (bigbuf);
225 safe_strcat (bigbuf, buf, &slen, MAX_BUF);
226
227 /* find the first space, make it null, and update the
228 * params pointer.
229 */
230 for (cp = buf; *cp != '\0'; cp++)
231 if (*cp == ' ')
232 {
233 *cp = '\0';
234 params = cp + 1;
235 break;
236 }
237
238 if (!strcmp (buf, "image_info"))
239 send_image_info (ns, params);
240 else if (!strcmp (buf, "image_sums"))
241 send_image_sums (ns, params);
242 else if (!strcmp (buf, "skill_info"))
243 send_skill_info (ns, params);
244 else if (!strcmp (buf, "spell_paths"))
245 send_spell_paths (ns, params);
246 else
247 ns->send_packet (bigbuf, len);
243} 248}
244 249
245void 250void
246ExtCmd (char *buf, int len, player *pl) 251ExtCmd (char *buf, int len, player *pl)
247{ 252{
248 INVOKE_PLAYER (EXTCMD, pl, ARG_DATA (buf, len)); 253 INVOKE_PLAYER (EXTCMD, pl, ARG_DATA (buf, len));
254}
255
256void
257ExtiCmd (char *buf, int len, client *ns)
258{
259 INVOKE_CLIENT (EXTICMD, ns, ARG_DATA (buf, len));
249} 260}
250 261
251void 262void
252MapInfoCmd (char *buf, int len, player *pl) 263MapInfoCmd (char *buf, int len, player *pl)
253{ 264{
… …
266 if (!strncmp (buf, "spatial ", 8)) 277 if (!strncmp (buf, "spatial ", 8))
267 { 278 {
268 buf += 8; 279 buf += 8;
269 280
270 // initial map and its origin 281 // initial map and its origin
271 mapstruct *map = pl->ob->map; 282 maptile *map = pl->ob->map;
272 sint16 dx, dy; 283 sint16 dx, dy;
273 int mapx = pl->socket.mapx / 2 - pl->ob->x; 284 int mapx = pl->ns->mapx / 2 - pl->ob->x;
274 int mapy = pl->socket.mapy / 2 - pl->ob->y; 285 int mapy = pl->ns->mapy / 2 - pl->ob->y;
275 int max_distance = 8; // limit maximum path length to something generous 286 int max_distance = 8; // limit maximum path length to something generous
276 287
277 while (*buf && map && max_distance) 288 while (*buf && map && max_distance)
278 { 289 {
279 int dir = *buf++; 290 int dir = *buf++;
280 291
281 switch (dir) 292 switch (dir)
282 { 293 {
283 case '1': 294 case '1':
284 dx = 0; 295 dx = 0;
285 dy = -1; 296 dy = -1;
286 map = get_map_from_coord (map, &dx, &dy); 297 map = map->xy_find (dx, dy);
287 map && (mapy -= map->height); 298 map && (mapy -= map->height);
288 break; 299 break;
289 case '2': 300 case '2':
290 mapx += map->width; 301 mapx += map->width;
291 dx = map->width; 302 dx = map->width;
292 dy = 0; 303 dy = 0;
293 map = get_map_from_coord (map, &dx, &dy); 304 map = map->xy_find (dx, dy);
294 break; 305 break;
295 case '3': 306 case '3':
296 mapy += map->height; 307 mapy += map->height;
297 dx = 0; 308 dx = 0;
298 dy = map->height; 309 dy = map->height;
299 map = get_map_from_coord (map, &dx, &dy); 310 map = map->xy_find (dx, dy);
300 break; 311 break;
301 case '4': 312 case '4':
302 dx = -1; 313 dx = -1;
303 dy = 0; 314 dy = 0;
304 map = get_map_from_coord (map, &dx, &dy); 315 map = map->xy_find (dx, dy);
305 map && (mapx -= map->width); 316 map && (mapx -= map->width);
306 break; 317 break;
307 } 318 }
308 319
309 --max_distance; 320 --max_distance;
310 } 321 }
311 322
… …
322 if (map->tile_path[2]) 333 if (map->tile_path[2])
323 flags |= 4; 334 flags |= 4;
324 if (map->tile_path[3]) 335 if (map->tile_path[3])
325 flags |= 8; 336 flags |= 8;
326 337
327 snprintf (bigbuf, MAX_BUF, "mapinfo %s spatial %d %d %d %d %d %s", token, flags, mapx, mapy, map->width, map->height, map->path); 338 snprintf (bigbuf, MAX_BUF, "mapinfo %s spatial %d %d %d %d %d %s", token, flags, mapx, mapy, map->width, map->height, &map->path);
328 } 339 }
329 else 340 else
330 snprintf (bigbuf, MAX_BUF, "mapinfo %s nomap", token); 341 snprintf (bigbuf, MAX_BUF, "mapinfo %s nomap", token);
331 } 342 }
332 else 343 else
333 snprintf (bigbuf, MAX_BUF, "mapinfo %s unsupported", token); 344 snprintf (bigbuf, MAX_BUF, "mapinfo %s unsupported", token);
334 345
335 Write_String_To_Socket (&pl->socket, bigbuf, strlen (bigbuf)); 346 pl->ns->send_packet (bigbuf);
336} 347}
337 348
338/** This is the Setup cmd - easy first implementation */ 349/** This is the Setup cmd - easy first implementation */
339void 350void
340SetUp (char *buf, int len, NewSocket * ns) 351SetUp (char *buf, int len, client * ns)
341{ 352{
342 int s, slen; 353 int s, slen;
343 char *cmd, *param, cmdback[HUGE_BUF]; 354 char *cmd, *param, cmdback[HUGE_BUF];
344 355
345 /* run through the cmds of setup 356 /* run through the cmds of setup
… …
347 * 358 *
348 * we send the status of the cmd back, or a FALSE is the cmd is the server unknown 359 * we send the status of the cmd back, or a FALSE is the cmd is the server unknown
349 * The client then must sort this out 360 * The client then must sort this out
350 */ 361 */
351 362
352 LOG (llevInfo, "Get SetupCmd:: %s\n", buf); 363 //LOG (llevInfo, "Get SetupCmd:: %s\n", buf);
364
353 strcpy (cmdback, "setup"); 365 strcpy (cmdback, "setup");
354 for (s = 0; s < len;) 366 for (s = 0; s < len; )
355 { 367 {
356
357 cmd = &buf[s]; 368 cmd = &buf[s];
358 369
359 /* find the next space, and put a null there */ 370 /* find the next space, and put a null there */
360 for (; buf[s] && buf[s] != ' '; s++); 371 for (; buf[s] && buf[s] != ' '; s++)
372 ;
373
361 buf[s++] = 0; 374 buf[s++] = 0;
375
362 while (buf[s] == ' ') 376 while (buf[s] == ' ')
363 s++; 377 s++;
364 378
365 if (s >= len) 379 if (s >= len)
366 break; 380 break;
367 381
368 param = &buf[s]; 382 param = &buf[s];
369 383
370 for (; buf[s] && buf[s] != ' '; s++); 384 for (; buf[s] && buf[s] != ' '; s++)
385 ;
386
371 buf[s++] = 0; 387 buf[s++] = 0;
388
372 while (buf[s] == ' ') 389 while (buf[s] == ' ')
373 s++; 390 s++;
374 391
375 slen = strlen (cmdback); 392 slen = strlen (cmdback);
376 safe_strcat (cmdback, " ", &slen, HUGE_BUF); 393 safe_strcat (cmdback, " ", &slen, HUGE_BUF);
… …
381 { 398 {
382 ns->sound = atoi (param); 399 ns->sound = atoi (param);
383 safe_strcat (cmdback, param, &slen, HUGE_BUF); 400 safe_strcat (cmdback, param, &slen, HUGE_BUF);
384 } 401 }
385 else if (!strcmp (cmd, "exp64")) 402 else if (!strcmp (cmd, "exp64"))
386 {
387 ns->exp64 = atoi (param);
388 safe_strcat (cmdback, param, &slen, HUGE_BUF); 403 safe_strcat (cmdback, param, &slen, HUGE_BUF);
389 }
390 else if (!strcmp (cmd, "spellmon")) 404 else if (!strcmp (cmd, "spellmon"))
391 { 405 {
392 ns->monitor_spells = atoi (param); 406 ns->monitor_spells = atoi (param);
393 safe_strcat (cmdback, param, &slen, HUGE_BUF); 407 safe_strcat (cmdback, param, &slen, HUGE_BUF);
394 } 408 }
… …
417 } 431 }
418 else if (!strcmp (cmd, "newmapcmd")) 432 else if (!strcmp (cmd, "newmapcmd"))
419 { 433 {
420 ns->newmapcmd = atoi (param); 434 ns->newmapcmd = atoi (param);
421 safe_strcat (cmdback, param, &slen, HUGE_BUF); 435 safe_strcat (cmdback, param, &slen, HUGE_BUF);
422// } else if (!strcmp(cmd,"plugincmd")) {
423// ns->plugincmd = atoi(param);
424// safe_strcat(cmdback, param, &slen, HUGE_BUF);
425 } 436 }
426 else if (!strcmp (cmd, "mapinfocmd")) 437 else if (!strcmp (cmd, "mapinfocmd"))
427 { 438 {
428 ns->mapinfocmd = atoi (param); 439 ns->mapinfocmd = atoi (param);
429 safe_strcat (cmdback, "1", &slen, HUGE_BUF); 440 safe_strcat (cmdback, "1", &slen, HUGE_BUF);
… …
448 char tmpbuf[20]; 459 char tmpbuf[20];
449 int q = atoi (param); 460 int q = atoi (param);
450 461
451 if (is_valid_faceset (q)) 462 if (is_valid_faceset (q))
452 ns->faceset = q; 463 ns->faceset = q;
464
453 sprintf (tmpbuf, "%d", ns->faceset); 465 sprintf (tmpbuf, "%d", ns->faceset);
454 safe_strcat (cmdback, tmpbuf, &slen, HUGE_BUF); 466 safe_strcat (cmdback, tmpbuf, &slen, HUGE_BUF);
455 /* if the client is using faceset, it knows about image2 command */ 467 /* if the client is using faceset, it knows about image2 command */
456 ns->image2 = 1; 468 ns->image2 = 1;
457 } 469 }
… …
485 if (*cp == 'x' || *cp == 'X') 497 if (*cp == 'x' || *cp == 'X')
486 { 498 {
487 y = atoi (cp + 1); 499 y = atoi (cp + 1);
488 break; 500 break;
489 } 501 }
502
490 if (x < 9 || y < 9 || x > MAP_CLIENT_X || y > MAP_CLIENT_Y) 503 if (x < 9 || y < 9 || x > MAP_CLIENT_X || y > MAP_CLIENT_Y)
491 { 504 {
492 sprintf (tmpbuf, " %dx%d", MAP_CLIENT_X, MAP_CLIENT_Y); 505 sprintf (tmpbuf, " %dx%d", MAP_CLIENT_X, MAP_CLIENT_Y);
493 safe_strcat (cmdback, tmpbuf, &slen, HUGE_BUF); 506 safe_strcat (cmdback, tmpbuf, &slen, HUGE_BUF);
494 } 507 }
… …
537 * report a failure to the client. 550 * report a failure to the client.
538 */ 551 */
539 safe_strcat (cmdback, "FALSE", &slen, HUGE_BUF); 552 safe_strcat (cmdback, "FALSE", &slen, HUGE_BUF);
540 } 553 }
541 } /* for processing all the setup commands */ 554 } /* for processing all the setup commands */
555
542 LOG (llevInfo, "SendBack SetupCmd:: %s\n", cmdback); 556 LOG (llevInfo, "SendBack SetupCmd:: %s\n", cmdback);
543 Write_String_To_Socket (ns, cmdback, strlen (cmdback)); 557 ns->send_packet (cmdback);
544} 558}
545 559
546/** 560/**
547 * The client has requested to be added to the game. 561 * The client has requested to be added to the game.
548 * This is what takes care of it. We tell the client how things worked out. 562 * This is what takes care of it. We tell the client how things worked out.
549 * I am not sure if this file is the best place for this function. however, 563 * I am not sure if this file is the best place for this function. however,
550 * it either has to be here or init_sockets needs to be exported. 564 * it either has to be here or init_sockets needs to be exported.
551 */ 565 */
552void 566void
553AddMeCmd (char *buf, int len, NewSocket * ns) 567AddMeCmd (char *buf, int len, client * ns)
554{ 568{
555 Settings oldsettings; 569 INVOKE_CLIENT (ADDME, ns, ARG_DATA (buf, len));
556
557 oldsettings = settings;
558 if (ns->status != Ns_Add || add_player (ns))
559 {
560 Write_String_To_Socket (ns, "addme_failed", 12);
561 }
562 else
563 {
564 /* Basically, the add_player copies the socket structure into
565 * the player structure, so this one (which is from init_sockets)
566 * is not needed anymore. The write below should still work, as the
567 * stuff in ns is still relevant.
568 */
569 Write_String_To_Socket (ns, "addme_success", 13);
570 socket_info.nconns--;
571 ns->status = Ns_Avail;
572 }
573 settings = oldsettings;
574} 570}
575 571
576/** Reply to ExtendedInfos command */ 572/** Reply to ExtendedInfos command */
577void 573void
578ToggleExtendedInfos (char *buf, int len, NewSocket * ns) 574ToggleExtendedInfos (char *buf, int len, client * ns)
579{ 575{
580 char cmdback[MAX_BUF]; 576 char cmdback[MAX_BUF];
581 char command[50]; 577 char command[50];
582 int info, nextinfo; 578 int info, nextinfo;
583 579
584 cmdback[0] = '\0'; 580 cmdback[0] = '\0';
585 nextinfo = 0; 581 nextinfo = 0;
582
586 while (1) 583 while (1)
587 { 584 {
588 /* 1. Extract an info */ 585 /* 1. Extract an info */
589 info = nextinfo; 586 info = nextinfo;
587
590 while ((info < len) && (buf[info] == ' ')) 588 while ((info < len) && (buf[info] == ' '))
591 info++; 589 info++;
590
592 if (info >= len) 591 if (info >= len)
593 break; 592 break;
593
594 nextinfo = info + 1; 594 nextinfo = info + 1;
595
595 while ((nextinfo < len) && (buf[nextinfo] != ' ')) 596 while ((nextinfo < len) && (buf[nextinfo] != ' '))
596 nextinfo++; 597 nextinfo++;
598
597 if (nextinfo - info >= 49) /*Erroneous info asked */ 599 if (nextinfo - info >= 49) /*Erroneous info asked */
598 continue; 600 continue;
601
599 strncpy (command, &(buf[info]), nextinfo - info); 602 strncpy (command, &(buf[info]), nextinfo - info);
600 command[nextinfo - info] = '\0'; 603
601 /* 2. Interpret info */ 604 /* 2. Interpret info */
602 if (!strcmp ("smooth", command)) 605 if (!strcmp ("smooth", command))
603 {
604 /* Toggle smoothing */ 606 /* Toggle smoothing */
605 ns->EMI_smooth = !ns->EMI_smooth; 607 ns->EMI_smooth = !ns->EMI_smooth;
606 }
607 else 608 else
608 {
609 /*bad value */ 609 /*bad value */;
610 } 610
611 /*3. Next info */ 611 /*3. Next info */
612 } 612 }
613
613 strcpy (cmdback, "ExtendedInfoSet"); 614 strcpy (cmdback, "ExtendedInfoSet");
615
614 if (ns->EMI_smooth) 616 if (ns->EMI_smooth)
615 { 617 {
616 strcat (cmdback, " "); 618 strcat (cmdback, " ");
617 strcat (cmdback, "smoothing"); 619 strcat (cmdback, "smoothing");
618 } 620 }
619 Write_String_To_Socket (ns, cmdback, strlen (cmdback)); 621
622 ns->send_packet (cmdback);
620} 623}
621 624
622/* 625/*
623#define MSG_TYPE_BOOK 1 626#define MSG_TYPE_BOOK 1
624#define MSG_TYPE_CARD 2 627#define MSG_TYPE_CARD 2
… …
627#define MSG_TYPE_MONUMENT 5 630#define MSG_TYPE_MONUMENT 5
628#define MSG_TYPE_SCRIPTED_DIALOG 6*/ 631#define MSG_TYPE_SCRIPTED_DIALOG 6*/
629 632
630/** Reply to ExtendedInfos command */ 633/** Reply to ExtendedInfos command */
631void 634void
632ToggleExtendedText (char *buf, int len, NewSocket * ns) 635ToggleExtendedText (char *buf, int len, client * ns)
633{ 636{
634 char cmdback[MAX_BUF]; 637 char cmdback[MAX_BUF];
635 char temp[10]; 638 char temp[10];
636 char command[50]; 639 char command[50];
637 int info, nextinfo, i, flag; 640 int info, nextinfo, i, flag;
638 641
639 cmdback[0] = '\0'; 642 cmdback[0] = '\0';
643
640 nextinfo = 0; 644 nextinfo = 0;
641 while (1) 645 while (1)
642 { 646 {
643 /* 1. Extract an info */ 647 /* 1. Extract an info */
644 info = nextinfo; 648 info = nextinfo;
649
645 while ((info < len) && (buf[info] == ' ')) 650 while ((info < len) && (buf[info] == ' '))
646 info++; 651 info++;
652
647 if (info >= len) 653 if (info >= len)
648 break; 654 break;
655
649 nextinfo = info + 1; 656 nextinfo = info + 1;
657
650 while ((nextinfo < len) && (buf[nextinfo] != ' ')) 658 while ((nextinfo < len) && (buf[nextinfo] != ' '))
651 nextinfo++; 659 nextinfo++;
660
652 if (nextinfo - info >= 49) /*Erroneous info asked */ 661 if (nextinfo - info >= 49) /*Erroneous info asked */
653 continue; 662 continue;
663
654 strncpy (command, &(buf[info]), nextinfo - info); 664 strncpy (command, &(buf[info]), nextinfo - info);
655 command[nextinfo - info] = '\0'; 665 command[nextinfo - info] = '\0';
656 /* 2. Interpret info */ 666 /* 2. Interpret info */
657 i = sscanf (command, "%d", &flag); 667 i = sscanf (command, "%d", &flag);
668
658 if ((i == 1) && (flag > 0) && (flag <= MSG_TYPE_LAST)) 669 if ((i == 1) && (flag > 0) && (flag <= MSG_TYPE_LAST))
659 ns->supported_readables |= (1 << flag); 670 ns->supported_readables |= (1 << flag);
660 /*3. Next info */ 671 /*3. Next info */
661 } 672 }
673
662 /* Send resulting state */ 674 /* Send resulting state */
663 strcpy (cmdback, "ExtendedTextSet"); 675 strcpy (cmdback, "ExtendedTextSet");
676
664 for (i = 0; i <= MSG_TYPE_LAST; i++) 677 for (i = 0; i <= MSG_TYPE_LAST; i++)
665 if (ns->supported_readables & (1 << i)) 678 if (ns->supported_readables & (1 << i))
666 { 679 {
667 strcat (cmdback, " "); 680 strcat (cmdback, " ");
668 snprintf (temp, sizeof (temp), "%d", i); 681 snprintf (temp, sizeof (temp), "%d", i);
669 strcat (cmdback, temp); 682 strcat (cmdback, temp);
670 } 683 }
671 Write_String_To_Socket (ns, cmdback, strlen (cmdback));
672}
673 684
674/** 685 ns->send_packet (cmdback);
675 * A lot like the old AskSmooth (in fact, now called by AskSmooth).
676 * Basically, it makes no sense to wait for the client to request a
677 * a piece of data from us that we know the client wants. So
678 * if we know the client wants it, might as well push it to the
679 * client.
680 */
681static void
682SendSmooth (NewSocket * ns, uint16 face)
683{
684 uint16 smoothface;
685 unsigned char reply[MAX_BUF];
686 SockList sl;
687
688 /* If we can't find a face, return and set it so we won't try to send this
689 * again.
690 */
691 if ((!FindSmooth (face, &smoothface)) && (!FindSmooth (smooth_face->number, &smoothface)))
692 {
693
694 LOG (llevError, "could not findsmooth for %d. Neither default (%s)\n", face, &smooth_face->name);
695 ns->faces_sent[face] |= NS_FACESENT_SMOOTH;
696 return;
697 }
698
699 if (!(ns->faces_sent[smoothface] & NS_FACESENT_FACE))
700 esrv_send_face (ns, smoothface, 0);
701
702 ns->faces_sent[face] |= NS_FACESENT_SMOOTH;
703
704 sl.buf = reply;
705 strcpy ((char *) sl.buf, "smooth ");
706 sl.len = strlen ((char *) sl.buf);
707 SockList_AddShort (&sl, face);
708 SockList_AddShort (&sl, smoothface);
709 Send_With_Handling (ns, &sl);
710} 686}
711 687
712 /** 688/**
713 * Tells client the picture it has to use 689 * Tells client the picture it has to use
714 * to smooth a picture number given as argument. 690 * to smooth a picture number given as argument.
715 */ 691 */
716void 692void
717AskSmooth (char *buf, int len, NewSocket * ns) 693AskSmooth (char *buf, int len, client *ns)
718{ 694{
719 uint16 facenbr; 695 ns->send_face (atoi (buf));
720
721 facenbr = atoi (buf);
722 SendSmooth (ns, facenbr);
723} 696}
724
725
726
727
728 697
729/** 698/**
730 * This handles the general commands from the client (ie, north, fire, cast, 699 * This handles the general commands from the client (ie, north, fire, cast,
731 * etc.) 700 * etc.)
732 */ 701 */
733void 702void
734PlayerCmd (char *buf, int len, player *pl) 703PlayerCmd (char *buf, int len, player *pl)
735{ 704{
736
737 /* The following should never happen with a proper or honest client.
738 * Therefore, the error message doesn't have to be too clear - if
739 * someone is playing with a hacked/non working client, this gives them
740 * an idea of the problem, but they deserve what they get
741 */
742 if (pl->state != ST_PLAYING)
743 {
744 new_draw_info_format (NDI_UNIQUE, 0, pl->ob, "You can not issue commands - state is not ST_PLAYING (%s)", buf);
745 return;
746 }
747 /* Check if there is a count. In theory, a zero count could also be 705 /* Check if there is a count. In theory, a zero count could also be
748 * sent, so check for that also. 706 * sent, so check for that also.
749 */ 707 */
750 if (atoi (buf) || buf[0] == '0') 708 if (atoi (buf) || buf[0] == '0')
751 { 709 {
752 pl->count = atoi ((char *) buf); 710 pl->count = atoi ((char *) buf);
711
753 buf = strchr (buf, ' '); /* advance beyond the numbers */ 712 buf = strchr (buf, ' '); /* advance beyond the numbers */
754 if (!buf) 713 if (!buf)
755 {
756#ifdef ESRV_DEBUG
757 LOG (llevDebug, "PlayerCmd: Got count but no command.\n");
758#endif
759 return; 714 return;
760 } 715
761 buf++; 716 buf++;
762 } 717 }
763 /* This should not happen anymore. */ 718
764 if (pl->ob->speed_left < -1.0)
765 {
766 LOG (llevError, "Player has negative time - shouldn't do command.\n");
767 }
768 /* In c_new.c */
769 execute_newserver_command (pl->ob, (char *) buf); 719 execute_newserver_command (pl->ob, (char *) buf);
770 /* Perhaps something better should be done with a left over count.
771 * Cleaning up the input should probably be done first - all actions
772 * for the command that issued the count should be done before any other
773 * commands.
774 */
775 720
776 pl->count = 0;
777
778}
779
780
781/**
782 * This handles the general commands from the client (ie, north, fire, cast,
783 * etc.). It is a lot like PlayerCmd above, but is called with the
784 * 'ncom' method which gives more information back to the client so it
785 * can throttle.
786 */
787void
788NewPlayerCmd (uint8 * buf, int len, player *pl)
789{
790 int time, repeat;
791 short packet;
792 unsigned char command[MAX_BUF];
793 SockList sl;
794
795 if (len < 7)
796 {
797 LOG (llevDebug, "Corrupt ncom command <%s> not long enough - discarding\n", buf);
798 return;
799 }
800
801 packet = GetShort_String (buf);
802 repeat = GetInt_String (buf + 2);
803 /* -1 is special - no repeat, but don't update */
804 if (repeat != -1)
805 {
806 pl->count = repeat;
807 }
808 if ((len - 4) >= MAX_BUF)
809 len = MAX_BUF - 5;
810
811 strncpy ((char *) command, (char *) buf + 6, len - 4);
812 command[len - 4] = '\0';
813
814 /* The following should never happen with a proper or honest client.
815 * Therefore, the error message doesn't have to be too clear - if
816 * someone is playing with a hacked/non working client, this gives them
817 * an idea of the problem, but they deserve what they get
818 */
819 if (pl->state != ST_PLAYING)
820 {
821 new_draw_info_format (NDI_UNIQUE, 0, pl->ob, "You can not issue commands - state is not ST_PLAYING (%s)", buf);
822 return;
823 }
824
825 /* This should not happen anymore. */
826 if (pl->ob->speed_left < -1.0)
827 {
828 LOG (llevError, "Player has negative time - shouldn't do command.\n");
829 }
830 /* In c_new.c */
831 execute_newserver_command (pl->ob, (char *) command);
832 /* Perhaps something better should be done with a left over count. 721 /* Perhaps something better should be done with a left over count.
833 * Cleaning up the input should probably be done first - all actions 722 * Cleaning up the input should probably be done first - all actions
834 * for the command that issued the count should be done before any other 723 * for the command that issued the count should be done before any other
835 * commands. 724 * commands.
836 */ 725 */
837 pl->count = 0; 726 pl->count = 0;
727}
728
729
730/**
731 * This handles the general commands from the client (ie, north, fire, cast,
732 * etc.). It is a lot like PlayerCmd above, but is called with the
733 * 'ncom' method which gives more information back to the client so it
734 * can throttle.
735 */
736void
737NewPlayerCmd (char *buf, int len, player *pl)
738{
739 if (len <= 6)
740 {
741 LOG (llevDebug, "Corrupt ncom command <%s> not long enough - discarding\n", buf);
742 return;
743 }
744
745 uint16 cmdid = net_uint16 ((uint8 *)buf);
746 sint32 repeat = net_sint32 ((uint8 *)buf + 2);
747
748 /* -1 is special - no repeat, but don't update */
749 if (repeat != -1)
750 pl->count = repeat;
751
752 buf += 6; //len -= 6;
753
754 execute_newserver_command (pl->ob, buf);
755
756 /* Perhaps something better should be done with a left over count.
757 * Cleaning up the input should probably be done first - all actions
758 * for the command that issued the count should be done before any other
759 * commands.
760 */
761 pl->count = 0;
762
763 //TODO: schmorp thinks whatever this calculates, it makes no sense at all
764 int time = fabs (pl->ob->speed) < 0.001
765 ? time = MAX_TIME * 100
766 : time = (int) (MAX_TIME / fabs (pl->ob->speed));
838 767
839 /* Send confirmation of command execution now */ 768 /* Send confirmation of command execution now */
840 sl.buf = command; 769 packet sl ("comc");
841 strcpy ((char *) sl.buf, "comc "); 770 sl << uint16 (cmdid) << uint32 (time);
842 sl.len = 5; 771 pl->ns->send_packet (sl);
843 SockList_AddShort (&sl, packet);
844 if (FABS (pl->ob->speed) < 0.001)
845 time = MAX_TIME * 100;
846 else
847 time = (int) (MAX_TIME / FABS (pl->ob->speed));
848 SockList_AddInt (&sl, time);
849 Send_With_Handling (&pl->socket, &sl);
850} 772}
851
852 773
853/** This is a reply to a previous query. */ 774/** This is a reply to a previous query. */
854void 775void
855ReplyCmd (char *buf, int len, player *pl) 776ReplyCmd (char *buf, int len, client *ns)
856{ 777{
778 if (ns->state == ST_CUSTOM)
779 {
780 INVOKE_CLIENT (REPLY, ns, ARG_DATA (buf, len));
781 return;
782 }
783
784 if (!ns->pl)
785 return; //TODO: depends on the exact reply we are after
786 //TODO: but right now, we always have a ns->pl
787
788 player *pl = ns->pl;
789
857 /* This is to synthesize how the data would be stored if it 790 /* This is to synthesize how the data would be stored if it
858 * was normally entered. A bit of a hack, and should be cleaned up 791 * was normally entered. A bit of a hack, and should be cleaned up
859 * once all the X11 code is removed from the server. 792 * once all the X11 code is removed from the server.
860 * 793 *
861 * We pass 13 to many of the functions because this way they 794 * We pass 13 to many of the functions because this way they
862 * think it was the carriage return that was entered, and the 795 * think it was the carriage return that was entered, and the
863 * function then does not try to do additional input. 796 * function then does not try to do additional input.
864 */ 797 */
865 snprintf (pl->write_buf, sizeof (pl->write_buf), ":%s", buf); 798 snprintf (pl->write_buf, sizeof (pl->write_buf), ":%s", buf);
866 799
867 /* this avoids any hacking here */ 800 /* this avoids any hacking here */
868 801
869 switch (pl->state) 802 switch (ns->state)
870 { 803 {
871 case ST_PLAYING: 804 case ST_PLAYING:
872 LOG (llevError, "Got reply message with ST_PLAYING input state\n"); 805 LOG (llevError, "Got reply message with ST_PLAYING input state\n");
873 break; 806 break;
874 807
875 case ST_PLAY_AGAIN:
876 /* We can check this for return value (2==quit). Maybe we
877 * should, and do something appropriate?
878 */
879 receive_play_again (pl->ob, buf[0]);
880 break;
881
882 case ST_ROLL_STAT:
883 key_roll_stat (pl->ob, buf[0]);
884 break;
885
886 case ST_CHANGE_CLASS: 808 case ST_CHANGE_CLASS:
887
888 key_change_class (pl->ob, buf[0]); 809 key_change_class (pl->ob, buf[0]);
889 break; 810 break;
890 811
891 case ST_CONFIRM_QUIT:
892 key_confirm_quit (pl->ob, buf[0]);
893 break;
894
895 case ST_CONFIGURE:
896 LOG (llevError, "In client input handling, but into configure state\n");
897 pl->state = ST_PLAYING;
898 break;
899
900 case ST_GET_NAME:
901 receive_player_name (pl->ob, 13);
902 break;
903
904 case ST_GET_PASSWORD:
905 case ST_CONFIRM_PASSWORD:
906 receive_player_password (pl->ob, 13);
907 break;
908
909 case ST_GET_PARTY_PASSWORD: /* Get password for party */ 812 case ST_GET_PARTY_PASSWORD: /* Get password for party */
910 receive_party_password (pl->ob, 13); 813 receive_party_password (pl->ob, 13);
911 break; 814 break;
912 815
913 default: 816 default:
914 LOG (llevError, "Unknown input state: %d\n", pl->state); 817 LOG (llevError, "Unknown input state: %d\n", ns->state);
915 } 818 }
916} 819}
917 820
918/** 821/**
919 * Client tells its version. If there is a mismatch, we close the 822 * Client tells its version. If there is a mismatch, we close the
… …
921 * something older than the server. If we assume the client will be 824 * something older than the server. If we assume the client will be
922 * backwards compatible, having it be a later version should not be a 825 * backwards compatible, having it be a later version should not be a
923 * problem. 826 * problem.
924 */ 827 */
925void 828void
926VersionCmd (char *buf, int len, NewSocket * ns) 829VersionCmd (char *buf, int len, client * ns)
927{ 830{
928 char *cp;
929 char version_warning[256];
930
931 if (!buf) 831 if (!buf)
932 { 832 {
933 LOG (llevError, "CS: received corrupted version command\n"); 833 LOG (llevError, "CS: received corrupted version command\n");
934 return; 834 return;
935 } 835 }
936 836
937 ns->cs_version = atoi (buf); 837 ns->cs_version = atoi (buf);
938 ns->sc_version = ns->cs_version; 838 ns->sc_version = ns->cs_version;
839
840 LOG (llevDebug, "connection from client <%s>\n", buf);
841
842 //TODO: should log here just for statistics
843
939 if (VERSION_CS != ns->cs_version) 844 //if (VERSION_CS != ns->cs_version)
940 { 845 // unchecked;
941#ifdef ESRV_DEBUG 846
942 LOG (llevDebug, "CS: csversion mismatch (%d,%d)\n", VERSION_CS, ns->cs_version);
943#endif
944 }
945 cp = strchr (buf + 1, ' '); 847 char *cp = strchr (buf + 1, ' ');
946 if (!cp) 848 if (!cp)
947 return; 849 return;
850
948 ns->sc_version = atoi (cp); 851 ns->sc_version = atoi (cp);
852
949 if (VERSION_SC != ns->sc_version) 853 //if (VERSION_SC != ns->sc_version)
950 { 854 // unchecked;
951#ifdef ESRV_DEBUG 855
952 LOG (llevDebug, "CS: scversion mismatch (%d,%d)\n", VERSION_SC, ns->sc_version);
953#endif
954 }
955 cp = strchr (cp + 1, ' '); 856 cp = strchr (cp + 1, ' ');
857
956 if (cp) 858 if (cp)
957 { 859 {
958 LOG (llevDebug, "CS: connection from client of type <%s>, ip %s\n", cp, ns->host); 860 assign (ns->version, cp + 1);
959 861
960 snprintf (ns->client, sizeof (ns->client), "%s", cp + 1); 862 if (ns->sc_version < 1026)
961 863 ns->send_packet_printf ("drawinfo %d %s", NDI_RED,
962 /* This is first implementation - i skip all beta DX clients with it
963 * Add later stuff here for other clients
964 */
965
966 /* these are old dxclients */
967 /* Version 1024 added support for singular + plural name values -
968 * requiing this minimal value reduces complexity of that code, and it
969 * has been around for a long time.
970 */
971 if (!strcmp (" CF DX CLIENT", cp) || ns->sc_version < 1024)
972 {
973 sprintf (version_warning, "drawinfo %d %s", NDI_RED,
974 "**** VERSION WARNING ****\n**** CLIENT IS TOO OLD!! UPDATE THE CLIENT!! ****"); 864 "**** VERSION WARNING ****\n**** CLIENT IS TOO OLD!! UPDATE THE CLIENT!! ****");
975 Write_String_To_Socket (ns, version_warning, strlen (version_warning));
976 }
977
978 } 865 }
979} 866}
980 867
981/** sound related functions. */ 868/** sound related functions. */
982
983void 869void
984SetSound (char *buf, int len, NewSocket * ns) 870SetSound (char *buf, int len, client * ns)
985{ 871{
986 ns->sound = atoi (buf); 872 ns->sound = atoi (buf);
987} 873}
988 874
989/** client wants the map resent */ 875/** client wants the map resent */
990
991void 876void
992MapRedrawCmd (char *buf, int len, player *pl) 877MapRedrawCmd (char *buf, int len, player *pl)
993{ 878{
994
995/* This function is currently disabled; just clearing the map state results in 879/* This function is currently disabled; just clearing the map state results in
996 * display errors. It should clear the cache and send a newmap command. 880 * display errors. It should clear the cache and send a newmap command.
997 * Unfortunately this solution does not work because some client versions send 881 * Unfortunately this solution does not work because some client versions send
998 * a mapredraw command after receiving a newmap command. 882 * a mapredraw command after receiving a newmap command.
999 */ 883 */
1000#if 0
1001 /* Okay, this is MAJOR UGLY. but the only way I know how to
1002 * clear the "cache"
1003 */
1004 memset (&pl->socket.lastmap, 0, sizeof (struct Map));
1005 draw_client_map (pl->ob);
1006#endif
1007} 884}
1008 885
1009/** 886/**
1010 * Moves an object (typically, container to inventory). 887 * Moves an object (typically, container to inventory).
1011 * syntax is: move (to) (tag) (nrof) 888 * syntax is: move (to) (tag) (nrof)
… …
1014MoveCmd (char *buf, int len, player *pl) 891MoveCmd (char *buf, int len, player *pl)
1015{ 892{
1016 int vals[3], i; 893 int vals[3], i;
1017 894
1018 /* A little funky here. We only cycle for 2 records, because 895 /* A little funky here. We only cycle for 2 records, because
1019 * we obviously am not going to find a space after the third 896 * we obviously are not going to find a space after the third
1020 * record. Perhaps we should just replace this with a 897 * record. Perhaps we should just replace this with a
1021 * sscanf? 898 * sscanf?
1022 */ 899 */
1023 for (i = 0; i < 2; i++) 900 for (i = 0; i < 2; i++)
1024 { 901 {
1025 vals[i] = atoi (buf); 902 vals[i] = atoi (buf);
903
1026 if (!(buf = strchr (buf, ' '))) 904 if (!(buf = strchr (buf, ' ')))
1027 { 905 {
1028 LOG (llevError, "Incomplete move command: %s\n", buf); 906 LOG (llevError, "Incomplete move command: %s\n", buf);
1029 return; 907 return;
1030 } 908 }
909
1031 buf++; 910 buf++;
1032 } 911 }
912
1033 vals[2] = atoi (buf); 913 vals[2] = atoi (buf);
1034 914
1035/* LOG(llevDebug,"Move item %d (nrof=%d) to %d.\n", vals[1], vals[2], vals[0]);*/ 915/* LOG(llevDebug,"Move item %d (nrof=%d) to %d.\n", vals[1], vals[2], vals[0]);*/
1036 esrv_move_object (pl->ob, vals[0], vals[1], vals[2]); 916 esrv_move_object (pl->ob, vals[0], vals[1], vals[2]);
1037} 917}
1038
1039
1040 918
1041/****************************************************************************** 919/******************************************************************************
1042 * 920 *
1043 * Start of commands the server sends to the client. 921 * Start of commands the server sends to the client.
1044 * 922 *
… …
1047/** 925/**
1048 * Asks the client to query the user. This way, the client knows 926 * Asks the client to query the user. This way, the client knows
1049 * it needs to send something back (vs just printing out a message) 927 * it needs to send something back (vs just printing out a message)
1050 */ 928 */
1051void 929void
1052send_query (NewSocket * ns, uint8 flags, char *text) 930send_query (client *ns, uint8 flags, char *text)
1053{ 931{
1054 char buf[MAX_BUF];
1055
1056 sprintf (buf, "query %d %s", flags, text ? text : ""); 932 ns->send_packet_printf ("query %d %s", flags, text ? text : "");
1057 Write_String_To_Socket (ns, buf, strlen (buf));
1058} 933}
1059 934
1060#define AddIfInt64(Old,New,Type) if (Old != New) {\ 935#define AddIfInt64(Old,New,Type) if (Old != New) {\
1061 Old = New; \ 936 Old = New; \
1062 SockList_AddChar(&sl, Type); \ 937 sl << uint8 (Type) << uint64 (New); \
1063 SockList_AddInt64(&sl, New); \
1064 } 938 }
1065 939
1066#define AddIfInt(Old,New,Type) if (Old != New) {\ 940#define AddIfInt(Old,New,Type) if (Old != New) {\
1067 Old = New; \ 941 Old = New; \
1068 SockList_AddChar(&sl, Type); \ 942 sl << uint8 (Type) << uint32 (New); \
1069 SockList_AddInt(&sl, New); \
1070 } 943 }
1071 944
1072#define AddIfShort(Old,New,Type) if (Old != New) {\ 945#define AddIfShort(Old,New,Type) if (Old != New) {\
1073 Old = New; \ 946 Old = New; \
1074 SockList_AddChar(&sl, Type); \ 947 sl << uint8 (Type) << uint16 (New); \
1075 SockList_AddShort(&sl, New); \
1076 } 948 }
1077 949
1078#define AddIfFloat(Old,New,Type) if (Old != New) {\ 950#define AddIfFloat(Old,New,Type) if (Old != New) {\
1079 Old = New; \ 951 Old = New; \
1080 SockList_AddChar(&sl, Type); \ 952 sl << uint8 (Type) << uint32 (New*FLOAT_MULTI); \
1081 SockList_AddInt(&sl,(long)(New*FLOAT_MULTI));\
1082 } 953 }
1083 954
1084#define AddIfString(Old,New,Type) if (Old == NULL || strcmp(Old,New)) {\ 955#define AddIfString(Old,New,Type) if (Old == NULL || strcmp(Old,New)) {\
1085 if (Old) free(Old);\
1086 Old = strdup_local(New);\ 956 free(Old); Old = strdup (New);\
1087 SockList_AddChar(&sl, Type); \ 957 sl << uint8 (Type) << data8 (New); \
1088 SockList_AddChar(&sl, ( char )strlen(New)); \
1089 strcpy((char*)sl.buf + sl.len, New); \
1090 sl.len += strlen(New); \
1091 } 958 }
1092 959
1093/** 960/**
1094 * Sends a statistics update. We look at the old values, 961 * Sends a statistics update. We look at the old values,
1095 * and only send what has changed. Stat mapping values are in newclient.h 962 * and only send what has changed. Stat mapping values are in newclient.h
… …
1097 * commands for now. 964 * commands for now.
1098 */ 965 */
1099void 966void
1100esrv_update_stats (player *pl) 967esrv_update_stats (player *pl)
1101{ 968{
1102 SockList sl;
1103 char buf[MAX_BUF]; 969 char buf[MAX_BUF];
1104 uint16 flags; 970 uint16 flags;
1105 971
1106 sl.buf = (unsigned char *) malloc (MAXSOCKBUF); 972 client *ns = pl->ns;
1107 strcpy ((char *) sl.buf, "stats "); 973 if (!ns)
1108 sl.len = strlen ((char *) sl.buf); 974 return;
1109 975
1110 if (pl->ob != NULL) 976 object *ob = pl->ob;
1111 { 977 if (!ob)
978 return;
979
980 packet sl ("stats");
981
1112 AddIfShort (pl->last_stats.hp, pl->ob->stats.hp, CS_STAT_HP); 982 AddIfShort (ns->last_stats.hp, ob->stats.hp, CS_STAT_HP);
1113 AddIfShort (pl->last_stats.maxhp, pl->ob->stats.maxhp, CS_STAT_MAXHP); 983 AddIfShort (ns->last_stats.maxhp, ob->stats.maxhp, CS_STAT_MAXHP);
1114 AddIfShort (pl->last_stats.sp, pl->ob->stats.sp, CS_STAT_SP); 984 AddIfShort (ns->last_stats.sp, ob->stats.sp, CS_STAT_SP);
1115 AddIfShort (pl->last_stats.maxsp, pl->ob->stats.maxsp, CS_STAT_MAXSP); 985 AddIfShort (ns->last_stats.maxsp, ob->stats.maxsp, CS_STAT_MAXSP);
1116 AddIfShort (pl->last_stats.grace, pl->ob->stats.grace, CS_STAT_GRACE); 986 AddIfShort (ns->last_stats.grace, ob->stats.grace, CS_STAT_GRACE);
1117 AddIfShort (pl->last_stats.maxgrace, pl->ob->stats.maxgrace, CS_STAT_MAXGRACE); 987 AddIfShort (ns->last_stats.maxgrace, ob->stats.maxgrace, CS_STAT_MAXGRACE);
1118 AddIfShort (pl->last_stats.Str, pl->ob->stats.Str, CS_STAT_STR); 988 AddIfShort (ns->last_stats.Str, ob->stats.Str, CS_STAT_STR);
1119 AddIfShort (pl->last_stats.Int, pl->ob->stats.Int, CS_STAT_INT);
1120 AddIfShort (pl->last_stats.Pow, pl->ob->stats.Pow, CS_STAT_POW);
1121 AddIfShort (pl->last_stats.Wis, pl->ob->stats.Wis, CS_STAT_WIS);
1122 AddIfShort (pl->last_stats.Dex, pl->ob->stats.Dex, CS_STAT_DEX); 989 AddIfShort (ns->last_stats.Dex, ob->stats.Dex, CS_STAT_DEX);
1123 AddIfShort (pl->last_stats.Con, pl->ob->stats.Con, CS_STAT_CON); 990 AddIfShort (ns->last_stats.Con, ob->stats.Con, CS_STAT_CON);
991 AddIfShort (ns->last_stats.Int, ob->stats.Int, CS_STAT_INT);
992 AddIfShort (ns->last_stats.Wis, ob->stats.Wis, CS_STAT_WIS);
993 AddIfShort (ns->last_stats.Pow, ob->stats.Pow, CS_STAT_POW);
1124 AddIfShort (pl->last_stats.Cha, pl->ob->stats.Cha, CS_STAT_CHA); 994 AddIfShort (ns->last_stats.Cha, ob->stats.Cha, CS_STAT_CHA);
1125 }
1126 if (pl->socket.exp64)
1127 {
1128 uint8 s;
1129 995
1130 for (s = 0; s < NUM_SKILLS; s++) 996 for (int s = 0; s < NUM_SKILLS; s++)
1131 { 997 if (object *skill = pl->last_skill_ob[s])
1132 if (pl->last_skill_ob[s] && pl->last_skill_exp[s] != pl->last_skill_ob[s]->stats.exp) 998 if (skill->stats.exp != ns->last_skill_exp [s])
1133 { 999 {
1000 ns->last_skill_exp [s] = skill->stats.exp;
1134 1001
1135 /* Always send along the level if exp changes. This is only 1002 /* Always send along the level if exp changes. This is only
1136 * 1 extra byte, but keeps processing simpler. 1003 * 1 extra byte, but keeps processing simpler.
1137 */ 1004 */
1138 SockList_AddChar (&sl, (char) (s + CS_STAT_SKILLINFO)); 1005 sl << uint8 (s + CS_STAT_SKILLINFO)
1139 SockList_AddChar (&sl, (char) pl->last_skill_ob[s]->level); 1006 << uint8 (skill->level)
1140 SockList_AddInt64 (&sl, pl->last_skill_ob[s]->stats.exp); 1007 << uint64 (skill->stats.exp);
1141 pl->last_skill_exp[s] = pl->last_skill_ob[s]->stats.exp;
1142 } 1008 }
1143 } 1009
1144 }
1145 if (pl->socket.exp64)
1146 {
1147 AddIfInt64 (pl->last_stats.exp, pl->ob->stats.exp, CS_STAT_EXP64); 1010 AddIfInt64 (ns->last_stats.exp, ob->stats.exp, CS_STAT_EXP64);
1148 }
1149 else
1150 {
1151 AddIfInt (pl->last_stats.exp, (int) pl->ob->stats.exp, CS_STAT_EXP);
1152 }
1153 AddIfShort (pl->last_level, (char) pl->ob->level, CS_STAT_LEVEL); 1011 AddIfShort (ns->last_level, ob->level, CS_STAT_LEVEL);
1154 AddIfShort (pl->last_stats.wc, pl->ob->stats.wc, CS_STAT_WC); 1012 AddIfShort (ns->last_stats.wc, ob->stats.wc, CS_STAT_WC);
1155 AddIfShort (pl->last_stats.ac, pl->ob->stats.ac, CS_STAT_AC); 1013 AddIfShort (ns->last_stats.ac, ob->stats.ac, CS_STAT_AC);
1156 AddIfShort (pl->last_stats.dam, pl->ob->stats.dam, CS_STAT_DAM); 1014 AddIfShort (ns->last_stats.dam, ob->stats.dam, CS_STAT_DAM);
1157 AddIfFloat (pl->last_speed, pl->ob->speed, CS_STAT_SPEED); 1015 AddIfFloat (ns->last_speed, ob->speed, CS_STAT_SPEED);
1158 AddIfShort (pl->last_stats.food, pl->ob->stats.food, CS_STAT_FOOD); 1016 AddIfShort (ns->last_stats.food, ob->stats.food, CS_STAT_FOOD);
1159 AddIfFloat (pl->last_weapon_sp, pl->weapon_sp, CS_STAT_WEAP_SP); 1017 AddIfFloat (ns->last_weapon_sp, pl->weapon_sp, CS_STAT_WEAP_SP);
1160 AddIfInt (pl->last_weight_limit, (sint32) weight_limit[pl->ob->stats.Str], CS_STAT_WEIGHT_LIM); 1018 AddIfInt (ns->last_weight_limit, weight_limit[ob->stats.Str], CS_STAT_WEIGHT_LIM);
1019
1161 flags = 0; 1020 flags = 0;
1021
1162 if (pl->fire_on) 1022 if (pl->fire_on)
1163 flags |= SF_FIREON; 1023 flags |= SF_FIREON;
1024
1164 if (pl->run_on) 1025 if (pl->run_on)
1165 flags |= SF_RUNON; 1026 flags |= SF_RUNON;
1166 1027
1167 AddIfShort (pl->last_flags, flags, CS_STAT_FLAGS); 1028 AddIfShort (ns->last_flags, flags, CS_STAT_FLAGS);
1029
1168 if (pl->socket.sc_version < 1025) 1030 if (ns->sc_version < 1025)
1169 {
1170 AddIfShort (pl->last_resist[ATNR_PHYSICAL], pl->ob->resist[ATNR_PHYSICAL], CS_STAT_ARMOUR); 1031 { AddIfShort (ns->last_resist[ATNR_PHYSICAL], ob->resist[ATNR_PHYSICAL], CS_STAT_ARMOUR) }
1171 }
1172 else 1032 else
1173 {
1174 int i;
1175
1176 for (i = 0; i < NROFATTACKS; i++) 1033 for (int i = 0; i < NROFATTACKS; i++)
1177 { 1034 {
1178 /* Skip ones we won't send */ 1035 /* Skip ones we won't send */
1179 if (atnr_cs_stat[i] == -1) 1036 if (atnr_cs_stat[i] == -1)
1180 continue; 1037 continue;
1038
1181 AddIfShort (pl->last_resist[i], pl->ob->resist[i], (char) atnr_cs_stat[i]); 1039 AddIfShort (ns->last_resist[i], ob->resist[i], atnr_cs_stat[i]);
1182 } 1040 }
1183 } 1041
1184 if (pl->socket.monitor_spells) 1042 if (pl->ns->monitor_spells)
1185 { 1043 {
1186 AddIfInt (pl->last_path_attuned, pl->ob->path_attuned, CS_STAT_SPELL_ATTUNE); 1044 AddIfInt (ns->last_path_attuned, ob->path_attuned, CS_STAT_SPELL_ATTUNE);
1187 AddIfInt (pl->last_path_repelled, pl->ob->path_repelled, CS_STAT_SPELL_REPEL); 1045 AddIfInt (ns->last_path_repelled, ob->path_repelled, CS_STAT_SPELL_REPEL);
1188 AddIfInt (pl->last_path_denied, pl->ob->path_denied, CS_STAT_SPELL_DENY); 1046 AddIfInt (ns->last_path_denied, ob->path_denied, CS_STAT_SPELL_DENY);
1189 } 1047 }
1048
1190 rangetostring (pl->ob, buf); /* we want use the new fire & run system in new client */ 1049 rangetostring (ob, buf); /* we want use the new fire & run system in new client */
1191 AddIfString (pl->socket.stats.range, buf, CS_STAT_RANGE); 1050 AddIfString (ns->stats.range, buf, CS_STAT_RANGE);
1192 set_title (pl->ob, buf); 1051 set_title (ob, buf);
1193 AddIfString (pl->socket.stats.title, buf, CS_STAT_TITLE); 1052 AddIfString (ns->stats.title, buf, CS_STAT_TITLE);
1194 1053
1195 /* Only send it away if we have some actual data */ 1054 /* Only send it away if we have some actual data */
1196 if (sl.len > 6) 1055 if (sl.length () > 6)
1197 { 1056 ns->send_packet (sl);
1198#ifdef ESRV_DEBUG
1199 LOG (llevDebug, "Sending stats command, %d bytes long.\n", sl.len);
1200#endif
1201 Send_With_Handling (&pl->socket, &sl);
1202 }
1203 free (sl.buf);
1204} 1057}
1205
1206 1058
1207/** 1059/**
1208 * Tells the client that here is a player it should start using. 1060 * Tells the client that here is a player it should start using.
1209 */ 1061 */
1210void 1062void
1211esrv_new_player (player *pl, uint32 weight) 1063esrv_new_player (player *pl, uint32 weight)
1212{ 1064{
1213 SockList sl; 1065 packet sl ("player");
1214 1066
1067 sl << uint32 (pl->ob->count)
1068 << uint32 (weight)
1069 << uint32 (pl->ob->face)
1070 << data8 (pl->ob->name);
1071
1215 pl->last_weight = weight; 1072 pl->ns->last_weight = weight;
1216 1073 pl->ns->send_packet (sl);
1217 sl.buf = (unsigned char *) malloc (MAXSOCKBUF);
1218
1219 strcpy ((char *) sl.buf, "player ");
1220 sl.len = strlen ((char *) sl.buf);
1221 SockList_AddInt (&sl, pl->ob->count);
1222 SockList_AddInt (&sl, weight);
1223 SockList_AddInt (&sl, pl->ob->face->number);
1224
1225 SockList_AddChar (&sl, (char) strlen (pl->ob->name));
1226 strcpy ((char *) sl.buf + sl.len, pl->ob->name);
1227 sl.len += strlen (pl->ob->name);
1228
1229 Send_With_Handling (&pl->socket, &sl);
1230 free (sl.buf);
1231 SET_FLAG (pl->ob, FLAG_CLIENT_SENT); 1074 SET_FLAG (pl->ob, FLAG_CLIENT_SENT);
1232} 1075}
1233
1234
1235/**
1236 * Need to send an animation sequence to the client.
1237 * We will send appropriate face commands to the client if we haven't
1238 * sent them the face yet (this can become quite costly in terms of
1239 * how much we are sending - on the other hand, this should only happen
1240 * when the player logs in and picks stuff up.
1241 */
1242void
1243esrv_send_animation (NewSocket * ns, short anim_num)
1244{
1245 SockList sl;
1246 int i;
1247
1248 /* Do some checking on the anim_num we got. Note that the animations
1249 * are added in contigous order, so if the number is in the valid
1250 * range, it must be a valid animation.
1251 */
1252 if (anim_num < 0 || anim_num > num_animations)
1253 {
1254 LOG (llevError, "esrv_send_anim (%d) out of bounds??\n", anim_num);
1255 return;
1256 }
1257
1258 sl.buf = (unsigned char *) malloc (MAXSOCKBUF);
1259 strcpy ((char *) sl.buf, "anim ");
1260 sl.len = 5;
1261 SockList_AddShort (&sl, anim_num);
1262 SockList_AddShort (&sl, 0); /* flags - not used right now */
1263 /* Build up the list of faces. Also, send any information (ie, the
1264 * the face itself) down to the client.
1265 */
1266 for (i = 0; i < animations[anim_num].num_animations; i++)
1267 {
1268 if (!(ns->faces_sent[animations[anim_num].faces[i]] & NS_FACESENT_FACE))
1269 esrv_send_face (ns, animations[anim_num].faces[i], 0);
1270 SockList_AddShort (&sl, animations[anim_num].faces[i]); /* flags - not used right now */
1271 }
1272 Send_With_Handling (ns, &sl);
1273 free (sl.buf);
1274 ns->anims_sent[anim_num] = 1;
1275}
1276
1277 1076
1278/****************************************************************************** 1077/******************************************************************************
1279 * 1078 *
1280 * Start of map related commands. 1079 * Start of map related commands.
1281 * 1080 *
1282 ******************************************************************************/ 1081 ******************************************************************************/
1283 1082
1284/**
1285 * This adds face_num to a map cell at x,y. If the client doesn't have
1286 * the face yet, we will also send it.
1287 */
1288static void
1289esrv_map_setbelow (NewSocket * ns, int x, int y, short face_num, struct Map *newmap)
1290{
1291 if (newmap->cells[x][y].count >= MAP_LAYERS)
1292 {
1293 LOG (llevError, "Too many faces in map cell %d %d\n", x, y);
1294 return;
1295 abort ();
1296 }
1297 newmap->cells[x][y].faces[newmap->cells[x][y].count] = face_num;
1298 newmap->cells[x][y].count++;
1299 if (!(ns->faces_sent[face_num] & NS_FACESENT_FACE))
1300 esrv_send_face (ns, face_num, 0);
1301}
1302
1303struct LayerCell
1304{
1305 uint16 xy;
1306 short face;
1307};
1308
1309struct MapLayer
1310{
1311 int count;
1312 struct LayerCell lcells[MAP_CLIENT_X * MAP_CLIENT_Y];
1313};
1314
1315/** Checkes if map cells have changed */
1316static int
1317mapcellchanged (NewSocket * ns, int i, int j, struct Map *newmap)
1318{
1319 int k;
1320
1321 if (ns->lastmap.cells[i][j].count != newmap->cells[i][j].count)
1322 return 1;
1323 for (k = 0; k < newmap->cells[i][j].count; k++)
1324 {
1325 if (ns->lastmap.cells[i][j].faces[k] != newmap->cells[i][j].faces[k])
1326 {
1327 return 1;
1328 }
1329 }
1330 return 0;
1331}
1332
1333/**
1334 * Basically, what this does is pack the data into layers.
1335 * cnum is the client number, cur is the the buffer we put all of
1336 * this data into. we return the end of the data. layers is
1337 * how many layers of data we should back.
1338 */
1339static uint8 *
1340compactlayer (NewSocket * ns, unsigned char *cur, int numlayers, struct Map *newmap)
1341{
1342 int x, y, k;
1343 int face;
1344 unsigned char *fcur;
1345 struct MapLayer layers[MAP_LAYERS];
1346
1347 for (k = 0; k < MAP_LAYERS; k++)
1348 layers[k].count = 0;
1349 fcur = cur;
1350 for (x = 0; x < ns->mapx; x++)
1351 {
1352 for (y = 0; y < ns->mapy; y++)
1353 {
1354 if (!mapcellchanged (ns, x, y, newmap))
1355 continue;
1356 if (newmap->cells[x][y].count == 0)
1357 {
1358 *cur = x * ns->mapy + y; /* mark empty space */
1359 cur++;
1360 continue;
1361 }
1362 for (k = 0; k < newmap->cells[x][y].count; k++)
1363 {
1364 layers[k].lcells[layers[k].count].xy = x * ns->mapy + y;
1365 layers[k].lcells[layers[k].count].face = newmap->cells[x][y].faces[k];
1366 layers[k].count++;
1367 }
1368 }
1369 }
1370 /* If no data, return now. */
1371 if (fcur == cur && layers[0].count == 0)
1372 return cur;
1373 *cur = 255; /* mark end of explicitly cleared cells */
1374 cur++;
1375 /* First pack by layers. */
1376 for (k = 0; k < numlayers; k++)
1377 {
1378 if (layers[k].count == 0)
1379 break; /* once a layer is entirely empty, no layer below it can
1380 have anything in it either */
1381 /* Pack by entries in thie layer */
1382 for (x = 0; x < layers[k].count;)
1383 {
1384 fcur = cur;
1385 *cur = layers[k].lcells[x].face >> 8;
1386 cur++;
1387 *cur = layers[k].lcells[x].face & 0xFF;
1388 cur++;
1389 face = layers[k].lcells[x].face;
1390 /* Now, we back the redundant data into 1 byte xy pairings */
1391 for (y = x; y < layers[k].count; y++)
1392 {
1393 if (layers[k].lcells[y].face == face)
1394 {
1395 *cur = (uint8) layers[k].lcells[y].xy;
1396 cur++;
1397 layers[k].lcells[y].face = -1;
1398 }
1399 }
1400 *(cur - 1) = *(cur - 1) | 128; /* mark for end of xy's; 11*11 < 128 */
1401 /* forward over the now redundant data */
1402 while (x < layers[k].count && layers[k].lcells[x].face == -1)
1403 x++;
1404 }
1405 *fcur = *fcur | 128; /* mark for end of faces at this layer */
1406 }
1407 return cur;
1408}
1409
1410static void
1411esrv_map_doneredraw (NewSocket * ns, struct Map *newmap)
1412{
1413 static long frames, bytes, tbytes, tframes;
1414 char *cur;
1415 SockList sl;
1416
1417
1418 sl.buf = (unsigned char *) malloc (MAXSOCKBUF);
1419 strcpy ((char *) sl.buf, "map ");
1420 sl.len = strlen ((char *) sl.buf);
1421
1422 cur = (char *) compactlayer (ns, (unsigned char *) sl.buf + sl.len, MAP_LAYERS, newmap);
1423 sl.len = cur - (char *) sl.buf;
1424
1425/* LOG(llevDebug, "Sending map command.\n");*/
1426
1427 if (sl.len > (int) strlen ("map ") || ns->sent_scroll)
1428 {
1429 /* All of this is just accounting stuff */
1430 if (tframes > 100)
1431 {
1432 tframes = tbytes = 0;
1433 }
1434 tframes++;
1435 frames++;
1436 tbytes += sl.len;
1437 bytes += sl.len;
1438 memcpy (&ns->lastmap, newmap, sizeof (struct Map));
1439 Send_With_Handling (ns, &sl);
1440 ns->sent_scroll = 0;
1441 }
1442 free (sl.buf);
1443}
1444
1445
1446/** Clears a map cell */ 1083/** Clears a map cell */
1447static void 1084static void
1448map_clearcell (struct MapCell *cell, int face0, int face1, int face2, int count) 1085map_clearcell (struct MapCell *cell, int count)
1449{ 1086{
1450 cell->faces[0] = face0; 1087 cell->faces[0] = 0;
1451 cell->faces[1] = face1; 1088 cell->faces[1] = 0;
1452 cell->faces[2] = face2; 1089 cell->faces[2] = 0;
1090 cell->smooth[0] = 0;
1091 cell->smooth[1] = 0;
1092 cell->smooth[2] = 0;
1453 cell->count = count; 1093 cell->count = count;
1454 cell->stat_hp = 0; 1094 cell->stat_hp = 0;
1095 cell->flags = 0;
1455 cell->player = 0; 1096 cell->player = 0;
1456} 1097}
1457 1098
1458#define MAX_HEAD_POS MAX(MAX_CLIENT_X, MAX_CLIENT_Y)
1459#define MAX_LAYERS 3 1099#define MAX_LAYERS 3
1460
1461/* Using a global really isn't a good approach, but saves the over head of
1462 * allocating and deallocating such a block of data each time run through,
1463 * and saves the space of allocating this in the socket object when we only
1464 * need it for this cycle. If the serve is ever threaded, this needs to be
1465 * re-examined.
1466 */
1467
1468static object *heads[MAX_HEAD_POS * MAX_HEAD_POS * MAX_LAYERS];
1469
1470/**
1471 * Returns true if any of the heads for this
1472 * space is set. Returns false if all are blank - this is used
1473 * for empty space checking.
1474 */
1475static inline int
1476have_head (int ax, int ay)
1477{
1478
1479 if (heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS] ||
1480 heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS + 1] || heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS + 2])
1481 return 1;
1482 return 0;
1483}
1484
1485/**
1486 * check_head is a bit simplistic version of update_space below.
1487 * basically, it only checks the that the head on space ax,ay at layer
1488 * needs to get sent - if so, it adds the data, sending the head
1489 * if needed, and returning 1. If this no data needs to get
1490 * sent, it returns zero.
1491 */
1492static int
1493check_head (SockList & sl, NewSocket & ns, int ax, int ay, int layer)
1494{
1495 short face_num;
1496
1497 if (heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS + layer])
1498 face_num = heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS + layer]->face->number;
1499 else
1500 face_num = 0;
1501
1502 if (face_num != ns.lastmap.cells[ax][ay].faces[layer])
1503 {
1504 SockList_AddShort (&sl, face_num);
1505 if (face_num && !(ns.faces_sent[face_num] & NS_FACESENT_FACE))
1506 esrv_send_face (&ns, face_num, 0);
1507 heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS + layer] = NULL;
1508 ns.lastmap.cells[ax][ay].faces[layer] = face_num;
1509 return 1;
1510 }
1511
1512 return 0; /* No change */
1513}
1514 1100
1515/** 1101/**
1516 * Removes the need to replicate the same code for each layer. 1102 * Removes the need to replicate the same code for each layer.
1517 * this returns true if this space is now in fact different than 1103 * this returns true if this space is now in fact different than
1518 * it was. 1104 * it was.
1519 * sl is the socklist this data is going into. 1105 * sl is the socklist this data is going into.
1520 * ns is the socket we are working on - all the info we care 1106 * ns is the socket we are working on - all the info we care
1521 * about is in this socket structure, so now need not pass the 1107 * about is in this socket structure, so now need not pass the
1522 * entire player object. 1108 * entire player object.
1523 * mx and my are map coordinate offsets for map mp
1524 * sx and sy are the offsets into the socket structure that
1525 * holds the old values.
1526 * layer is the layer to update, with 2 being the floor and 0 the 1109 * layer is the layer to update, with 2 being the floor and 0 the
1527 * top layer (this matches what the GET_MAP_FACE and GET_MAP_FACE_OBJ) 1110 * top layer (this matches what the GET_MAP_FACE and GET_MAP_FACE_OBJ)
1528 * take. Interesting to note that before this function, the map1 function 1111 * take. Interesting to note that before this function, the map1 function
1529 * numbers the spaces differently - I think this was a leftover from 1112 * numbers the spaces differently - I think this was a leftover from
1530 * the map command, where the faces stack up. Sinces that is no longer 1113 * the map command, where the faces stack up. Sinces that is no longer
1531 * the case, it seems to make more sense to have these layer values 1114 * the case, it seems to make more sense to have these layer values
1532 * actually match. 1115 * actually match.
1533 */ 1116 */
1534
1535static int 1117static int
1536update_space (SockList * sl, NewSocket * ns, mapstruct *mp, int mx, int my, int sx, int sy, int layer) 1118update_space (packet &sl, client &ns, mapspace &ms, MapCell &lastcell, int layer)
1537{ 1119{
1538 object *ob, *head; 1120 object *ob = ms.faces_obj [layer];
1539 uint16 face_num;
1540 int bx, by, i;
1541
1542 /* If there is a multipart object stored away, treat that as more important.
1543 * If not, then do the normal processing.
1544 */
1545
1546 head = heads[(sy * MAX_HEAD_POS + sx) * MAX_LAYERS + layer];
1547
1548 /* Check to see if this head is part of the set of objects
1549 * we would normally send for this space. If so, then
1550 * don't use the head value. We need to do the check
1551 * here and not when setting up the heads[] value for two reasons -
1552 * 1) the heads[] values will get used even if the space is not visible.
1553 * 2) its possible the head is not on the same map as a part, and I'd
1554 * rather not need to do the map translation overhead.
1555 * 3) We need to do some extra checking to make sure that we will
1556 * otherwise send the image as this layer, eg, either it matches
1557 * the head value, or is not multipart.
1558 */
1559 if (head && !head->more)
1560 {
1561 for (i = 0; i < MAP_LAYERS; i++)
1562 {
1563 ob = GET_MAP_FACE_OBJ (mp, mx, my, i);
1564 if (!ob)
1565 continue;
1566
1567 if (ob->head)
1568 ob = ob->head;
1569
1570 if (ob == head)
1571 {
1572 heads[(sy * MAX_HEAD_POS + sx) * MAX_LAYERS + layer] = NULL;
1573 head = NULL;
1574 break;
1575 }
1576 }
1577 }
1578
1579 ob = head;
1580 if (!ob)
1581 ob = GET_MAP_FACE_OBJ (mp, mx, my, layer);
1582 1121
1583 /* If there is no object for this space, or if the face for the object 1122 /* If there is no object for this space, or if the face for the object
1584 * is the blank face, set the face number to zero. 1123 * is the blank face, set the face number to zero.
1585 * else if we have the stored head object for this space, that takes 1124 * else if we have the stored head object for this space, that takes
1586 * precedence over the other object for this space. 1125 * precedence over the other object for this space.
1587 * otherwise, we do special head processing 1126 * otherwise, we do special head processing
1588 */ 1127 */
1589 if (!ob || ob->face == blank_face) 1128 uint16 face_num = ob && ob->face != blank_face ? ob->face : 0;
1590 face_num = 0;
1591 else if (head)
1592 {
1593 /* if this is a head that had previously been stored */
1594 face_num = ob->face->number;
1595 }
1596 else
1597 {
1598 /* if the faces for the different parts of a multipart object
1599 * are the same, we only want to send the bottom right most
1600 * portion of the object. That info is in the tail_.. values
1601 * of the head. Note that for the head itself, ob->head will
1602 * be null, so we only do this block if we are working on
1603 * a tail piece.
1604 */
1605
1606 /* tail_x and tail_y will only be set in the head object. If
1607 * this is the head object and these are set, we proceed
1608 * with logic to only send bottom right. Similarly, if
1609 * this is one of the more parts but the head has those values
1610 * set, we want to do the processing. There can be cases where
1611 * the head is not visible but one of its parts is, so we just
1612 * can always expect that ob->arch->tail_x will be true for all
1613 * object we may want to display.
1614 */
1615 if ((ob->arch->tail_x || ob->arch->tail_y) || (ob->head && (ob->head->arch->tail_x || ob->head->arch->tail_y)))
1616 {
1617
1618 if (ob->head)
1619 head = ob->head;
1620 else
1621 head = ob;
1622
1623 /* Basically figure out where the offset is from where we are right
1624 * now. the ob->arch->clone.{x,y} values hold the offset that this current
1625 * piece is from the head, and the tail is where the tail is from the
1626 * head. Note that bx and by will equal sx and sy if we are already working
1627 * on the bottom right corner. If ob is the head, the clone values
1628 * will be zero, so the right thing will still happen.
1629 */
1630 bx = sx + head->arch->tail_x - ob->arch->clone.x;
1631 by = sy + head->arch->tail_y - ob->arch->clone.y;
1632
1633 /* I don't think this can ever happen, but better to check for it just
1634 * in case.
1635 */
1636 if (bx < sx || by < sy)
1637 {
1638 LOG (llevError, "update_space: bx (%d) or by (%d) is less than sx (%d) or sy (%d)\n", bx, by, sx, sy);
1639 face_num = 0;
1640 }
1641 /* single part object, multipart object with non merged faces,
1642 * of multipart object already at lower right.
1643 */
1644 else if (bx == sx && by == sy)
1645 {
1646 face_num = ob->face->number;
1647
1648 /* if this face matches one stored away, clear that one away.
1649 * this code relies on the fact that the map1 commands
1650 * goes from 2 down to 0.
1651 */
1652 for (i = 0; i < MAP_LAYERS; i++)
1653 if (heads[(sy * MAX_HEAD_POS + sx) * MAX_LAYERS + i] &&
1654 heads[(sy * MAX_HEAD_POS + sx) * MAX_LAYERS + i]->face->number == face_num)
1655 heads[(sy * MAX_HEAD_POS + sx) * MAX_LAYERS + i] = NULL;
1656 }
1657 else
1658 {
1659 /* If this head is stored away, clear it - otherwise,
1660 * there can be cases where a object is on multiple layers -
1661 * we only want to send it once.
1662 */
1663 face_num = head->face->number;
1664 for (i = 0; i < MAP_LAYERS; i++)
1665 if (heads[(by * MAX_HEAD_POS + bx) * MAX_LAYERS + i] &&
1666 heads[(by * MAX_HEAD_POS + bx) * MAX_LAYERS + i]->face->number == face_num)
1667 heads[(by * MAX_HEAD_POS + bx) * MAX_LAYERS + i] = NULL;
1668
1669 /* First, try to put the new head on the same layer. If that is used up,
1670 * then find another layer.
1671 */
1672 if (heads[(by * MAX_HEAD_POS + bx) * MAX_LAYERS + layer] == NULL)
1673 {
1674 heads[(by * MAX_HEAD_POS + bx) * MAX_LAYERS + layer] = head;
1675 }
1676 else
1677 for (i = 0; i < MAX_LAYERS; i++)
1678 {
1679 if (heads[(by * MAX_HEAD_POS + bx) * MAX_LAYERS + i] == NULL ||
1680 heads[(by * MAX_HEAD_POS + bx) * MAX_LAYERS + i] == head)
1681 {
1682 heads[(by * MAX_HEAD_POS + bx) * MAX_LAYERS + i] = head;
1683 }
1684 }
1685 face_num = 0; /* Don't send this object - we'll send the head later */
1686 }
1687 }
1688 else
1689 {
1690 /* In this case, we are already at the lower right or single part object,
1691 * so nothing special
1692 */
1693 face_num = ob->face->number;
1694
1695 /* clear out any head entries that have the same face as this one */
1696 for (bx = 0; bx < layer; bx++)
1697 if (heads[(sy * MAX_HEAD_POS + sx) * MAX_LAYERS + bx] &&
1698 heads[(sy * MAX_HEAD_POS + sx) * MAX_LAYERS + bx]->face->number == face_num)
1699 heads[(sy * MAX_HEAD_POS + sx) * MAX_LAYERS + bx] = NULL;
1700 }
1701 } /* else not already head object or blank face */
1702
1703 /* This is a real hack. Basically, if we have nothing to send for this layer,
1704 * but there is a head on the next layer, send that instead.
1705 * Without this, what happens is you can get the case where the player stands
1706 * on the same space as the head. However, if you have overlapping big objects
1707 * of the same type, what happens then is it doesn't think it needs to send
1708 * This tends to make stacking also work/look better.
1709 */
1710 if (!face_num && layer > 0 && heads[(sy * MAX_HEAD_POS + sx) * MAX_LAYERS + layer - 1])
1711 {
1712 face_num = heads[(sy * MAX_HEAD_POS + sx) * MAX_LAYERS + layer - 1]->face->number;
1713 heads[(sy * MAX_HEAD_POS + sx) * MAX_LAYERS + layer - 1] = NULL;
1714 }
1715
1716 /* Another hack - because of heads and whatnot, this face may match one
1717 * we already sent for a lower layer. In that case, don't send
1718 * this one.
1719 */
1720 if (face_num && layer + 1 < MAP_LAYERS && ns->lastmap.cells[sx][sy].faces[layer + 1] == face_num)
1721 {
1722 face_num = 0;
1723 }
1724 1129
1725 /* We've gotten what face we want to use for the object. Now see if 1130 /* We've gotten what face we want to use for the object. Now see if
1726 * if it has changed since we last sent it to the client. 1131 * if it has changed since we last sent it to the client.
1727 */ 1132 */
1728 if (ns->lastmap.cells[sx][sy].faces[layer] != face_num) 1133 if (lastcell.faces[layer] != face_num)
1729 { 1134 {
1730 ns->lastmap.cells[sx][sy].faces[layer] = face_num; 1135 lastcell.faces[layer] = face_num;
1731 if (!(ns->faces_sent[face_num] & NS_FACESENT_FACE)) 1136
1137 if (!ns.faces_sent[face_num])
1138 if (ob)
1139 ns.send_faces (ob);
1140 else
1732 esrv_send_face (ns, face_num, 0); 1141 ns.send_face (face_num);
1733 SockList_AddShort (sl, face_num); 1142
1143 sl << uint16 (face_num);
1734 return 1; 1144 return 1;
1735 } 1145 }
1736 /* Nothing changed */
1737 return 0;
1738}
1739 1146
1740/**
1741 * This function is mainly a copy of update_space,
1742 * except it handles update of the smoothing updates,
1743 * not the face updates.
1744 * Removes the need to replicate the same code for each layer.
1745 * this returns true if this smooth is now in fact different
1746 * than it was.
1747 * sl is the socklist this data is going into.
1748 * ns is the socket we are working on - all the info we care
1749 * about is in this socket structure, so know need to pass the
1750 * entire player object.
1751 * mx and my are map coordinate offsets for map mp
1752 * sx and sy are the offsets into the socket structure that
1753 * holds the old values.
1754 * layer is the layer to update, with 2 being the floor and 0 the
1755 * top layer (this matches what the GET_MAP_FACE and GET_MAP_FACE_OBJ
1756 * take.
1757 */
1758
1759static inline int
1760update_smooth (SockList * sl, NewSocket * ns, mapstruct *mp, int mx, int my, int sx, int sy, int layer)
1761{
1762 object *ob;
1763 int smoothlevel; /* old face_num; */
1764
1765 ob = GET_MAP_FACE_OBJ (mp, mx, my, layer);
1766
1767 /* If there is no object for this space, or if the face for the object
1768 * is the blank face, set the smoothlevel to zero.
1769 */
1770 if (!ob || ob->face == blank_face || MAP_NOSMOOTH (mp))
1771 smoothlevel = 0;
1772 else
1773 {
1774 smoothlevel = ob->smoothlevel;
1775 if (smoothlevel && !(ns->faces_sent[ob->face->number] & NS_FACESENT_SMOOTH))
1776 SendSmooth (ns, ob->face->number);
1777 } /* else not already head object or blank face */
1778
1779 /* We've gotten what face we want to use for the object. Now see if
1780 * if it has changed since we last sent it to the client.
1781 */
1782 if (smoothlevel > 255)
1783 smoothlevel = 255;
1784 else if (smoothlevel < 0)
1785 smoothlevel = 0;
1786 if (ns->lastmap.cells[sx][sy].smooth[layer] != smoothlevel)
1787 {
1788 ns->lastmap.cells[sx][sy].smooth[layer] = smoothlevel;
1789 SockList_AddChar (sl, (uint8) (smoothlevel & 0xFF));
1790 return 1;
1791 }
1792 /* Nothing changed */ 1147 /* Nothing changed */
1793 return 0; 1148 return 0;
1794} 1149}
1795 1150
1796/** 1151/**
1797 * Returns the size of a data for a map square as returned by 1152 * Returns the size of a data for a map square as returned by
1798 * mapextended. There are CLIENTMAPX*CLIENTMAPY*LAYERS entries 1153 * mapextended. There are CLIENTMAPX*CLIENTMAPY*LAYERS entries
1799 * available. 1154 * available.
1800 */ 1155 */
1801int 1156int
1802getExtendedMapInfoSize (NewSocket * ns) 1157getExtendedMapInfoSize (client * ns)
1803{ 1158{
1804 int result = 0; 1159 int result = 0;
1805 1160
1806 if (ns->ext_mapinfos) 1161 if (ns->ext_mapinfos)
1807 { 1162 {
1808 if (ns->EMI_smooth) 1163 if (ns->EMI_smooth)
1809 result += 1; /*One byte for smoothlevel */ 1164 result += 1; /*One byte for smoothlevel */
1810 } 1165 }
1166
1811 return result; 1167 return result;
1168}
1169
1170// prefetch (and touch) all maps within a specific distancd
1171static void
1172prefetch_surrounding_maps (maptile *map, int distance)
1173{
1174 map->last_access = runtime;
1175
1176 if (--distance)
1177 for (int dir = 4; --dir; )
1178 if (const shstr &path = map->tile_path [dir])
1179 if (maptile *&neigh = map->tile_map [dir])
1180 prefetch_surrounding_maps (neigh, distance);
1181 else
1182 neigh = maptile::find_async (path, map);
1183}
1184
1185// prefetch a generous area around the player
1186static void
1187prefetch_surrounding_maps (object *op)
1188{
1189 prefetch_surrounding_maps (op->map, 3);
1812} 1190}
1813 1191
1814/** 1192/**
1815 * This function uses the new map1 protocol command to send the map 1193 * This function uses the new map1 protocol command to send the map
1816 * to the client. It is necessary because the old map command supports 1194 * to the client. It is necessary because the old map command supports
… …
1822 * we need 2 bytes for coordinates and 2 bytes for faces, such a trade off 1200 * we need 2 bytes for coordinates and 2 bytes for faces, such a trade off
1823 * maps no sense. Instead, we actually really only use 12 bits for coordinates, 1201 * maps no sense. Instead, we actually really only use 12 bits for coordinates,
1824 * and use the other 4 bits for other informatiion. For full documentation 1202 * and use the other 4 bits for other informatiion. For full documentation
1825 * of what we send, see the doc/Protocol file. 1203 * of what we send, see the doc/Protocol file.
1826 * I will describe internally what we do: 1204 * I will describe internally what we do:
1827 * the socket->lastmap shows how the map last looked when sent to the client. 1205 * the ns->lastmap shows how the map last looked when sent to the client.
1828 * in the lastmap structure, there is a cells array, which is set to the 1206 * in the lastmap structure, there is a cells array, which is set to the
1829 * maximum viewable size (As set in config.h). 1207 * maximum viewable size (As set in config.h).
1830 * in the cells, there are faces and a count value. 1208 * in the cells, there are faces and a count value.
1831 * we use the count value to hold the darkness value. If -1, then this space 1209 * we use the count value to hold the darkness value. If -1, then this space
1832 * is not viewable. 1210 * is not viewable.
… …
1834 * look like. 1212 * look like.
1835 */ 1213 */
1836void 1214void
1837draw_client_map1 (object *pl) 1215draw_client_map1 (object *pl)
1838{ 1216{
1839 int x, y, ax, ay, d, startlen, max_x, max_y, oldlen; 1217 int x, y, ax, ay, startlen, max_x, max_y, oldlen;
1840 sint16 nx, ny; 1218 sint16 nx, ny;
1841 int estartlen, eoldlen; 1219 int estartlen, eoldlen;
1842 SockList sl;
1843 SockList esl; /*For extended Map info */
1844 uint16 mask, emask;
1845 uint8 eentrysize; 1220 uint8 eentrysize;
1846 uint16 ewhatstart, ewhatflag; 1221 uint16 ewhatstart, ewhatflag;
1847 uint8 extendedinfos; 1222 uint8 extendedinfos;
1848 mapstruct *m; 1223 maptile *m;
1849 1224
1850 NewSocket & socket = pl->contr->socket; 1225 client &socket = *pl->contr->ns;
1226
1227 if (!pl->active)
1228 return;
1851 1229
1852 check_map_change (pl->contr); 1230 check_map_change (pl->contr);
1231 prefetch_surrounding_maps (pl);
1853 1232
1854 sl.buf = (unsigned char *) malloc (MAXSOCKBUF); 1233 packet sl (socket.mapmode == Map1Cmd ? "map1" : "map1a");
1855 if (socket.mapmode == Map1Cmd) 1234 packet esl;
1856 strcpy ((char *) sl.buf, "map1 "); 1235
1857 else
1858 strcpy ((char *) sl.buf, "map1a ");
1859 sl.len = strlen ((char *) sl.buf);
1860 startlen = sl.len; 1236 startlen = sl.length ();
1237
1861 /*Extendedmapinfo structure initialisation */ 1238 /*Extendedmapinfo structure initialisation */
1862 if (socket.ext_mapinfos) 1239 if (socket.ext_mapinfos)
1863 { 1240 {
1864 esl.buf = (unsigned char *) malloc (MAXSOCKBUF);
1865 strcpy ((char *) esl.buf, "mapextended ");
1866 esl.len = strlen ((char *) esl.buf);
1867 extendedinfos = EMI_NOREDRAW; 1241 extendedinfos = EMI_NOREDRAW;
1242
1868 if (socket.EMI_smooth) 1243 if (socket.EMI_smooth)
1869 extendedinfos |= EMI_SMOOTH; 1244 extendedinfos |= EMI_SMOOTH;
1245
1870 ewhatstart = esl.len; 1246 ewhatstart = esl.length ();
1871 ewhatflag = extendedinfos; /*The EMI_NOREDRAW bit 1247 ewhatflag = extendedinfos; /*The EMI_NOREDRAW bit
1872 could need to be taken away */ 1248 could need to be taken away */
1873 SockList_AddChar (&esl, extendedinfos);
1874 eentrysize = getExtendedMapInfoSize (&socket); 1249 eentrysize = getExtendedMapInfoSize (&socket);
1875 SockList_AddChar (&esl, eentrysize); 1250 esl << "mapextended "
1251 << uint8 (extendedinfos)
1252 << uint8 (eentrysize);
1253
1876 estartlen = esl.len; 1254 estartlen = esl.length ();
1877 } 1255 }
1878 else 1256 else
1879 { 1257 {
1880 /* suppress compiler warnings */ 1258 /* suppress compiler warnings */
1881 ewhatstart = 0; 1259 ewhatstart = 0;
1882 ewhatflag = 0; 1260 ewhatflag = 0;
1883 estartlen = 0; 1261 estartlen = 0;
1884 } 1262 }
1885 /* Init data to zero */
1886 memset (heads, 0, sizeof (object *) * MAX_HEAD_POS * MAX_HEAD_POS * MAX_LAYERS);
1887 1263
1888 /* x,y are the real map locations. ax, ay are viewport relative 1264 /* x,y are the real map locations. ax, ay are viewport relative
1889 * locations. 1265 * locations.
1890 */ 1266 */
1891 ay = 0; 1267 ay = 0;
… …
1893 /* We could do this logic as conditionals in the if statement, 1269 /* We could do this logic as conditionals in the if statement,
1894 * but that started to get a bit messy to look at. 1270 * but that started to get a bit messy to look at.
1895 */ 1271 */
1896 max_x = pl->x + (socket.mapx + 1) / 2; 1272 max_x = pl->x + (socket.mapx + 1) / 2;
1897 max_y = pl->y + (socket.mapy + 1) / 2; 1273 max_y = pl->y + (socket.mapy + 1) / 2;
1898 if (socket.mapmode == Map1aCmd) 1274
1899 { 1275 maptile *plmap = pl->map;
1900 max_x += MAX_HEAD_OFFSET;
1901 max_y += MAX_HEAD_OFFSET;
1902 }
1903 1276
1904 for (y = pl->y - socket.mapy / 2; y < max_y; y++, ay++) 1277 for (y = pl->y - socket.mapy / 2; y < max_y; y++, ay++)
1905 { 1278 {
1906 ax = 0; 1279 ax = 0;
1907 for (x = pl->x - socket.mapx / 2; x < max_x; x++, ax++) 1280 for (x = pl->x - socket.mapx / 2; x < max_x; x++, ax++)
1908 { 1281 {
1909 1282 int emask, mask;
1910 emask = mask = (ax & 0x3f) << 10 | (ay & 0x3f) << 4; 1283 emask = mask = (ax & 0x3f) << 10 | (ay & 0x3f) << 4;
1911 1284
1912 /* If this space is out of the normal viewable area, we only check
1913 * the heads value ax or ay will only be greater than what
1914 * the client wants if using the map1a command - this is because
1915 * if the map1a command is not used, max_x and max_y will be
1916 * set to lower values.
1917 */
1918 if (ax >= socket.mapx || ay >= socket.mapy)
1919 {
1920 int i, got_one;
1921
1922 oldlen = sl.len;
1923
1924 SockList_AddShort (&sl, mask);
1925
1926 if (check_head (sl, socket, ax, ay, 2))
1927 mask |= 0x4;
1928 if (check_head (sl, socket, ax, ay, 1))
1929 mask |= 0x2;
1930 if (check_head (sl, socket, ax, ay, 0))
1931 mask |= 0x1;
1932
1933 /* If all we are doing is sending 0 (blank) faces, we don't
1934 * actually need to send that - just the coordinates
1935 * with no faces tells the client to blank out the
1936 * space.
1937 */
1938 got_one = 0;
1939 for (i = oldlen + 2; i < sl.len; i++)
1940 {
1941 if (sl.buf[i])
1942 got_one = 1;
1943 }
1944
1945 if (got_one && (mask & 0xf))
1946 {
1947 sl.buf[oldlen + 1] = mask & 0xff;
1948 }
1949 else
1950 { /*either all faces blank, either no face at all */
1951 if (mask & 0xf) /*at least 1 face, we know it's blank, only send coordinates */
1952 sl.len = oldlen + 2;
1953 else
1954 sl.len = oldlen;
1955 }
1956 /*What concerns extendinfos, nothing to be done for now
1957 * (perhaps effects layer later)
1958 */
1959 continue; /* don't do processing below */
1960 }
1961
1962 MapCell & lastcell = socket.lastmap.cells[ax][ay]; 1285 MapCell &lastcell = socket.lastmap.cells[ax][ay];
1963
1964 d = pl->contr->blocked_los[ax][ay];
1965 1286
1966 /* If the coordinates are not valid, or it is too dark to see, 1287 /* If the coordinates are not valid, or it is too dark to see,
1967 * we tell the client as such 1288 * we tell the client as such
1968 */ 1289 */
1969 nx = x; 1290 nx = x;
1970 ny = y; 1291 ny = y;
1971 m = get_map_from_coord (pl->map, &nx, &ny); 1292 m = get_map_from_coord (plmap, &nx, &ny);
1293
1972 if (!m) 1294 if (!m)
1973 { 1295 {
1974 /* space is out of map. Update space and clear values 1296 /* space is out of map. Update space and clear values
1975 * if this hasn't already been done. If the space is out 1297 * if this hasn't already been done. If the space is out
1976 * of the map, it shouldn't have a head 1298 * of the map, it shouldn't have a head
1977 */ 1299 */
1978 if (lastcell.count != -1) 1300 if (lastcell.count != -1)
1979 { 1301 {
1980 SockList_AddShort (&sl, mask); 1302 sl << uint16 (mask);
1981 map_clearcell (&lastcell, 0, 0, 0, -1); 1303 map_clearcell (&lastcell, -1);
1982 } 1304 }
1305
1306 continue;
1983 } 1307 }
1308
1309 m->touch ();
1310
1311 int d = pl->contr->blocked_los[ax][ay];
1312
1984 else if (d > 3) 1313 if (d > 3)
1985 { 1314 {
1315
1986 int need_send = 0, count; 1316 int need_send = 0, count;
1987 1317
1988 /* This block deals with spaces that are not visible for whatever 1318 /* This block deals with spaces that are not visible for whatever
1989 * reason. Still may need to send the head for this space. 1319 * reason. Still may need to send the head for this space.
1990 */ 1320 */
1991 1321
1992 oldlen = sl.len; 1322 oldlen = sl.length ();
1993 1323
1994 SockList_AddShort (&sl, mask); 1324 sl << uint16 (mask);
1325
1995 if (lastcell.count != -1) 1326 if (lastcell.count != -1)
1996 need_send = 1; 1327 need_send = 1;
1328
1997 count = -1; 1329 count = -1;
1998 1330
1999 if (socket.mapmode == Map1aCmd && have_head (ax, ay)) 1331 /* properly clear a previously sent big face */
2000 { 1332 if (lastcell.faces[0] || lastcell.faces[1] || lastcell.faces[2]
2001 /* Now check to see if any heads need to be sent */ 1333 || lastcell.stat_hp || lastcell.flags || lastcell.player)
1334 need_send = 1;
2002 1335
2003 if (check_head (sl, socket, ax, ay, 2)) 1336 map_clearcell (&lastcell, count);
2004 mask |= 0x4;
2005 if (check_head (sl, socket, ax, ay, 1))
2006 mask |= 0x2;
2007 if (check_head (sl, socket, ax, ay, 0))
2008 mask |= 0x1;
2009 1337
2010 lastcell.count = count; 1338 if ((mask & 0xf) || need_send)
2011 1339 sl[oldlen + 1] = mask & 0xff;
2012 }
2013 else 1340 else
2014 {
2015 struct MapCell *cell = &lastcell;
2016
2017 /* properly clear a previously sent big face */
2018 if (cell->faces[0] != 0 || cell->faces[1] != 0 || cell->faces[2] != 0)
2019 need_send = 1;
2020 map_clearcell (&lastcell, 0, 0, 0, count);
2021 }
2022
2023 if ((mask & 0xf) || need_send)
2024 {
2025 sl.buf[oldlen + 1] = mask & 0xff;
2026 }
2027 else
2028 {
2029 sl.len = oldlen; 1341 sl.reset (oldlen);
2030 }
2031 } 1342 }
2032 else 1343 else
2033 { 1344 {
2034 /* In this block, the space is visible or there are head objects 1345 /* In this block, the space is visible.
2035 * we need to send.
2036 */ 1346 */
2037 1347
2038 /* Rather than try to figure out what everything that we might 1348 /* Rather than try to figure out what everything that we might
2039 * need to send is, then form the packet after that, 1349 * need to send is, then form the packet after that,
2040 * we presume that we will in fact form a packet, and update 1350 * we presume that we will in fact form a packet, and update
2041 * the bits by what we do actually send. If we send nothing, 1351 * the bits by what we do actually send. If we send nothing,
2042 * we just back out sl.len to the old value, and no harm 1352 * we just back out sl.length () to the old value, and no harm
2043 * is done. 1353 * is done.
2044 * I think this is simpler than doing a bunch of checks to see 1354 * I think this is simpler than doing a bunch of checks to see
2045 * what if anything we need to send, setting the bits, then 1355 * what if anything we need to send, setting the bits, then
2046 * doing those checks again to add the real data. 1356 * doing those checks again to add the real data.
2047 */ 1357 */
2048 oldlen = sl.len; 1358 oldlen = sl.length ();
2049 mask = (ax & 0x3f) << 10 | (ay & 0x3f) << 4;
2050 eoldlen = esl.len; 1359 eoldlen = esl.length ();
2051 emask = (ax & 0x3f) << 10 | (ay & 0x3f) << 4;
2052 SockList_AddShort (&sl, mask);
2053 1360
2054 if (socket.ext_mapinfos) 1361 sl << uint16 (mask);
2055 SockList_AddShort (&esl, emask);
2056 1362
2057 unsigned char dummy; 1363 unsigned char dummy;
2058 unsigned char *last_ext = &dummy; 1364 unsigned char *last_ext = &dummy;
2059 1365
2060 /* Darkness changed */ 1366 /* Darkness changed */
… …
2063 mask |= 0x8; 1369 mask |= 0x8;
2064 1370
2065 if (socket.extmap) 1371 if (socket.extmap)
2066 { 1372 {
2067 *last_ext |= 0x80; 1373 *last_ext |= 0x80;
2068 last_ext = sl.buf + sl.len; 1374 last_ext = &sl[sl.length ()];
2069 SockList_AddChar (&sl, d); 1375 sl << uint8 (d);
2070 } 1376 }
2071 else 1377 else
2072 SockList_AddChar (&sl, 255 - 64 * d); 1378 sl << uint8 (255 - 64 * d);
2073 } 1379 }
2074 1380
2075 lastcell.count = d; 1381 lastcell.count = d;
1382
1383 mapspace &ms = m->at (nx, ny);
2076 1384
2077 if (socket.extmap) 1385 if (socket.extmap)
2078 { 1386 {
2079 uint8 stat_hp = 0; 1387 uint8 stat_hp = 0;
2080 uint8 stat_width = 0; 1388 uint8 stat_width = 0;
1389 uint8 flags = 0;
2081 tag_t player = 0; 1390 UUID player = 0;
2082 1391
2083 // send hp information, if applicable 1392 // send hp information, if applicable
2084 if (object *op = GET_MAP_FACE_OBJ (m, nx, ny, 0)) 1393 if (object *op = ms.faces_obj [0])
2085 { 1394 {
2086 if (op->head || op->invisible) 1395 if (op->head || op->invisible)
2087 ; // do not show 1396 ; // do not show
2088 else if (op->type == PLAYER 1397 else if (op->type == PLAYER
2089 || QUERY_FLAG (op, FLAG_MONSTER) || QUERY_FLAG (op, FLAG_ALIVE) || QUERY_FLAG (op, FLAG_GENERATOR)) 1398 || QUERY_FLAG (op, FLAG_MONSTER) || QUERY_FLAG (op, FLAG_ALIVE) || QUERY_FLAG (op, FLAG_GENERATOR))
… …
2093 stat_hp = 255 - (op->stats.hp * 255 + 254) / op->stats.maxhp; 1402 stat_hp = 255 - (op->stats.hp * 255 + 254) / op->stats.maxhp;
2094 stat_width = op->arch->tail_x; 1403 stat_width = op->arch->tail_x;
2095 } 1404 }
2096 } 1405 }
2097 1406
1407 if (op->msg && op->msg[0] == '@')
1408 flags |= 1;
1409
2098 if (op->type == PLAYER && op != pl) 1410 if (op->type == PLAYER && op != pl)
2099 player = op->count; 1411 player = op->count;
2100 } 1412 }
2101 1413
2102 if (lastcell.stat_hp != stat_hp) 1414 if (lastcell.stat_hp != stat_hp)
2103 { 1415 {
2104 lastcell.stat_hp = stat_hp; 1416 lastcell.stat_hp = stat_hp;
2105 1417
2106 mask |= 0x8; 1418 mask |= 0x8;
2107 *last_ext |= 0x80; 1419 *last_ext |= 0x80;
2108 last_ext = sl.buf + sl.len; 1420 last_ext = &sl[sl.length ()];
2109 SockList_AddChar (&sl, 5); 1421
2110 SockList_AddChar (&sl, stat_hp); 1422 sl << uint8 (5) << uint8 (stat_hp);
2111 1423
2112 if (stat_width > 1) 1424 if (stat_width > 1)
2113 { 1425 {
2114 *last_ext |= 0x80; 1426 *last_ext |= 0x80;
2115 last_ext = sl.buf + sl.len; 1427 last_ext = &sl[sl.length ()];
2116 SockList_AddChar (&sl, 6); 1428
2117 SockList_AddChar (&sl, stat_width); 1429 sl << uint8 (6) << uint8 (stat_width);
2118 } 1430 }
2119 } 1431 }
2120 1432
2121 if (lastcell.player !=player) 1433 if (lastcell.player != player)
2122 { 1434 {
2123 lastcell.player = player; 1435 lastcell.player = player;
2124 1436
2125 mask |= 0x8; 1437 mask |= 0x8;
2126 *last_ext |= 0x80; 1438 *last_ext |= 0x80;
2127 last_ext = sl.buf + sl.len; 1439 last_ext = &sl[sl.length ()];
2128 SockList_AddChar (&sl, 0x47); 1440
2129 SockList_AddChar (&sl, 4); 1441 sl << uint8 (0x47) << uint8 (8) << (uint64)player;
2130 SockList_AddInt (&sl, player); 1442 }
1443
1444 if (lastcell.flags != flags)
1445 {
1446 lastcell.flags = flags;
1447
1448 mask |= 0x8;
1449 *last_ext |= 0x80;
1450 last_ext = &sl[sl.length ()];
1451
1452 sl << uint8 (8) << uint8 (flags);
2131 } 1453 }
2132 } 1454 }
2133 1455
2134 /* Floor face */ 1456 /* Floor face */
2135 if (update_space (&sl, &socket, m, nx, ny, ax, ay, 2)) 1457 if (update_space (sl, socket, ms, lastcell, 2))
2136 mask |= 0x4; 1458 mask |= 0x4;
2137 1459
2138 if (socket.EMI_smooth)
2139 if (update_smooth (&esl, &socket, m, nx, ny, ax, ay, 2))
2140 emask |= 0x4;
2141
2142 /* Middle face */ 1460 /* Middle face */
2143 if (update_space (&sl, &socket, m, nx, ny, ax, ay, 1)) 1461 if (update_space (sl, socket, ms, lastcell, 1))
2144 mask |= 0x2; 1462 mask |= 0x2;
2145 1463
2146 if (socket.EMI_smooth) 1464 if (ms.player () == pl
2147 if (update_smooth (&esl, &socket, m, nx, ny, ax, ay, 1)) 1465 && (pl->invisible & (pl->invisible < 50 ? 1 : 7)))
2148 emask |= 0x2;
2149
2150 if (nx == pl->x && ny == pl->y && pl->invisible & (pl->invisible < 50 ? 4 : 1))
2151 { 1466 {
1467 // force player to be visible to himself if invisible
2152 if (lastcell.faces[0] != pl->face->number) 1468 if (lastcell.faces[0] != pl->face)
2153 { 1469 {
2154 lastcell.faces[0] = pl->face->number; 1470 lastcell.faces[0] = pl->face;
1471
2155 mask |= 0x1; 1472 mask |= 0x1;
2156 if (!(socket.faces_sent[pl->face->number] & NS_FACESENT_FACE)) 1473 sl << uint16 (pl->face);
2157 esrv_send_face (&socket, pl->face->number, 0); 1474
2158 SockList_AddShort (&sl, pl->face->number); 1475 socket.send_faces (pl);
2159 } 1476 }
2160 } 1477 }
2161 /* Top face */ 1478 /* Top face */
2162 else
2163 {
2164 if (update_space (&sl, &socket, m, nx, ny, ax, ay, 0)) 1479 else if (update_space (sl, socket, ms, lastcell, 0))
2165 mask |= 0x1; 1480 mask |= 0x1;
2166 if (socket.EMI_smooth)
2167 if (update_smooth (&esl, &socket, m, nx, ny, ax, ay, 0))
2168 {
2169 emask |= 0x1;
2170 }
2171 } 1481
1482
2172 /* Check to see if we are in fact sending anything for this 1483 /* Check to see if we are in fact sending anything for this
2173 * space by checking the mask. If so, update the mask. 1484 * space by checking the mask. If so, update the mask.
2174 * if not, reset the len to that from before adding the mask 1485 * if not, reset the len to that from before adding the mask
2175 * value, so we don't send those bits. 1486 * value, so we don't send those bits.
2176 */ 1487 */
2177 if (mask & 0xf) 1488 if (mask & 0xf)
1489 sl[oldlen + 1] = mask & 0xff;
1490 else
1491 sl.reset (oldlen);
1492
1493 if (socket.ext_mapinfos)
1494 esl << uint16 (emask);
1495
1496 if (socket.EMI_smooth)
2178 { 1497 {
2179 sl.buf[oldlen + 1] = mask & 0xff; 1498 for (int layer = 2+1; layer--; )
2180 }
2181 else
2182 { 1499 {
2183 sl.len = oldlen; 1500 object *ob = ms.faces_obj [layer];
1501
1502 // If there is no object for this space, or if the face for the object
1503 // is the blank face, set the smoothlevel to zero.
1504 int smoothlevel = ob && ob->face != blank_face ? ob->smoothlevel : 0;
1505
1506 // We've gotten what face we want to use for the object. Now see if
1507 // if it has changed since we last sent it to the client.
1508 if (lastcell.smooth[layer] != smoothlevel)
1509 {
1510 lastcell.smooth[layer] = smoothlevel;
1511 esl << uint8 (smoothlevel);
1512 emask |= 1 << layer;
1513 }
2184 } 1514 }
1515
2185 if (emask & 0xf) 1516 if (emask & 0xf)
2186 {
2187 esl.buf[eoldlen + 1] = emask & 0xff; 1517 esl[eoldlen + 1] = emask & 0xff;
2188 }
2189 else 1518 else
2190 {
2191 esl.len = eoldlen; 1519 esl.reset (eoldlen);
2192 } 1520 }
2193 } /* else this is a viewable space */ 1521 } /* else this is a viewable space */
2194 } /* for x loop */ 1522 } /* for x loop */
2195 } /* for y loop */ 1523 } /* for y loop */
2196 1524
2197 /* Verify that we in fact do need to send this */ 1525 /* Verify that we in fact do need to send this */
2198 if (socket.ext_mapinfos) 1526 if (socket.ext_mapinfos)
2199 { 1527 {
2200 if (!(sl.len > startlen || socket.sent_scroll)) 1528 if (!(sl.length () > startlen || socket.sent_scroll))
2201 { 1529 {
2202 /* No map data will follow, so don't say the client 1530 /* No map data will follow, so don't say the client
2203 * it doesn't need draw! 1531 * it doesn't need draw!
2204 */ 1532 */
2205 ewhatflag &= (~EMI_NOREDRAW); 1533 ewhatflag &= ~EMI_NOREDRAW;
2206 esl.buf[ewhatstart + 1] = ewhatflag & 0xff; 1534 esl[ewhatstart + 1] = ewhatflag & 0xff;
2207 } 1535 }
1536
2208 if (esl.len > estartlen) 1537 if (esl.length () > estartlen)
2209 { 1538 socket.send_packet (esl);
2210 Send_With_Handling (&socket, &esl);
2211 }
2212 free (esl.buf);
2213 } 1539 }
1540
2214 if (sl.len > startlen || socket.sent_scroll) 1541 if (sl.length () > startlen || socket.sent_scroll)
2215 { 1542 {
2216 Send_With_Handling (&socket, &sl); 1543 socket.send_packet (sl);
2217 socket.sent_scroll = 0; 1544 socket.sent_scroll = 0;
2218 } 1545 }
2219 free (sl.buf);
2220} 1546}
2221 1547
2222/** 1548/**
2223 * Draws client map. 1549 * Draws client map.
2224 */ 1550 */
2225void 1551void
2226draw_client_map (object *pl) 1552draw_client_map (object *pl)
2227{ 1553{
2228 int i, j; 1554 int i, j;
2229 sint16 ax, ay, nx, ny; /* ax and ay goes from 0 to max-size of arrays */ 1555 sint16 ax, ay; /* ax and ay goes from 0 to max-size of arrays */
2230 New_Face *face, *floor;
2231 New_Face *floor2;
2232 int d, mflags; 1556 int mflags;
2233 struct Map newmap; 1557 struct Map newmap;
2234 mapstruct *m, *pm; 1558 maptile *m, *pm;
2235 1559
2236 if (pl->type != PLAYER) 1560 if (pl->type != PLAYER)
2237 { 1561 {
2238 LOG (llevError, "draw_client_map called with non player/non eric-server\n"); 1562 LOG (llevError, "draw_client_map called with non player/non eric-server\n");
2239 return; 1563 return;
… …
2248 if (pm == NULL || pm->in_memory != MAP_IN_MEMORY) 1572 if (pm == NULL || pm->in_memory != MAP_IN_MEMORY)
2249 return; 1573 return;
2250 1574
2251 memset (&newmap, 0, sizeof (struct Map)); 1575 memset (&newmap, 0, sizeof (struct Map));
2252 1576
2253 for (j = (pl->y - pl->contr->socket.mapy / 2); j < (pl->y + (pl->contr->socket.mapy + 1) / 2); j++) 1577 for (j = (pl->y - pl->contr->ns->mapy / 2); j < (pl->y + (pl->contr->ns->mapy + 1) / 2); j++)
2254 {
2255 for (i = (pl->x - pl->contr->socket.mapx / 2); i < (pl->x + (pl->contr->socket.mapx + 1) / 2); i++) 1578 for (i = (pl->x - pl->contr->ns->mapx / 2); i < (pl->x + (pl->contr->ns->mapx + 1) / 2); i++)
2256 { 1579 {
2257 ax = i; 1580 ax = i;
2258 ay = j; 1581 ay = j;
2259 m = pm; 1582 m = pm;
2260 mflags = get_map_flags (m, &m, ax, ay, &ax, &ay); 1583 mflags = get_map_flags (m, &m, ax, ay, &ax, &ay);
1584
2261 if (mflags & P_OUT_OF_MAP) 1585 if (mflags & P_OUT_OF_MAP)
2262 continue; 1586 continue;
2263 if (mflags & P_NEED_UPDATE) 1587
2264 update_position (m, ax, ay);
2265 /* If a map is visible to the player, we don't want to swap it out 1588 /* If a map is visible to the player, we don't want to swap it out
2266 * just to reload it. This should really call something like 1589 * just to reload it. This should really call something like
2267 * swap_map, but this is much more efficient and 'good enough' 1590 * swap_map, but this is much more efficient and 'good enough'
2268 */ 1591 */
2269 if (mflags & P_NEW_MAP) 1592 if (mflags & P_NEW_MAP)
2270 m->timeout = 50; 1593 m->timeout = 50;
2271 } 1594 }
2272 } 1595
2273 /* do LOS after calls to update_position */ 1596 /* do LOS after calls to update_position */
2274 if (pl->contr->do_los) 1597 if (pl->contr->do_los)
2275 { 1598 {
2276 update_los (pl); 1599 update_los (pl);
2277 pl->contr->do_los = 0; 1600 pl->contr->do_los = 0;
2278 } 1601 }
2279 1602
2280 if (pl->contr->socket.mapmode == Map1Cmd || pl->contr->socket.mapmode == Map1aCmd)
2281 {
2282 /* Big maps need a different drawing mechanism to work */ 1603 /* Big maps need a different drawing mechanism to work */
2283 draw_client_map1 (pl); 1604 draw_client_map1 (pl);
2284 return;
2285 }
2286
2287 if (pl->invisible & (pl->invisible < 50 ? 4 : 1))
2288 {
2289 esrv_map_setbelow (&pl->contr->socket, pl->contr->socket.mapx / 2, pl->contr->socket.mapy / 2, pl->face->number, &newmap);
2290 }
2291
2292 /* j and i are the y and x coordinates of the real map (which is
2293 * basically some number of spaces around the player)
2294 * ax and ay are values from within the viewport (ie, 0, 0 is upper
2295 * left corner) and are thus disconnected from the map values.
2296 * Subtract 1 from the max values so that we properly handle cases where
2297 * player has specified an even map. Otherwise, we try to send them too
2298 * much, ie, if mapx is 10, we would try to send from -5 to 5, which is actually
2299 * 11 spaces. Now, we would send from -5 to 4, which is properly. If mapx is
2300 * odd, this still works fine.
2301 */
2302 ay = 0;
2303 for (j = pl->y - pl->contr->socket.mapy / 2; j <= pl->y + (pl->contr->socket.mapy - 1) / 2; j++, ay++)
2304 {
2305 ax = 0;
2306 for (i = pl->x - pl->contr->socket.mapx / 2; i <= pl->x + (pl->contr->socket.mapx - 1) / 2; i++, ax++)
2307 {
2308
2309 d = pl->contr->blocked_los[ax][ay];
2310 /* note the out_of_map and d>3 checks are both within the same
2311 * negation check.
2312 */
2313 nx = i;
2314 ny = j;
2315 m = get_map_from_coord (pm, &nx, &ny);
2316 if (m && d < 4)
2317 {
2318 face = GET_MAP_FACE (m, nx, ny, 0);
2319 floor2 = GET_MAP_FACE (m, nx, ny, 1);
2320 floor = GET_MAP_FACE (m, nx, ny, 2);
2321
2322 /* If all is blank, send a blank face. */
2323 if ((!face || face == blank_face) && (!floor2 || floor2 == blank_face) && (!floor || floor == blank_face))
2324 {
2325 esrv_map_setbelow (&pl->contr->socket, ax, ay, blank_face->number, &newmap);
2326 }
2327 else
2328 { /* actually have something interesting */
2329 /* send the darkness mask, if any. */
2330 if (d && pl->contr->socket.darkness)
2331 esrv_map_setbelow (&pl->contr->socket, ax, ay, dark_faces[d - 1]->number, &newmap);
2332
2333 if (face && face != blank_face)
2334 esrv_map_setbelow (&pl->contr->socket, ax, ay, face->number, &newmap);
2335 if (floor2 && floor2 != blank_face)
2336 esrv_map_setbelow (&pl->contr->socket, ax, ay, floor2->number, &newmap);
2337 if (floor && floor != blank_face)
2338 esrv_map_setbelow (&pl->contr->socket, ax, ay, floor->number, &newmap);
2339 }
2340 } /* Is a valid space */
2341 }
2342 }
2343 esrv_map_doneredraw (&pl->contr->socket, &newmap);
2344
2345 check_map_change (pl->contr);
2346} 1605}
2347 1606
2348 1607
2349/*****************************************************************************/ 1608/*****************************************************************************/
2350 1609
… …
2356 1615
2357/*****************************************************************************/ 1616/*****************************************************************************/
2358void 1617void
2359send_plugin_custom_message (object *pl, char *buf) 1618send_plugin_custom_message (object *pl, char *buf)
2360{ 1619{
2361 cs_write_string (&pl->contr->socket, buf, strlen (buf)); 1620 pl->contr->ns->send_packet (buf);
2362} 1621}
2363 1622
2364/** 1623/**
2365 * This sends the skill number to name mapping. We ignore 1624 * This sends the skill number to name mapping. We ignore
2366 * the params - we always send the same info no matter what. 1625 * the params - we always send the same info no matter what.
2367 */ 1626 */
2368void 1627void
2369send_skill_info (NewSocket * ns, char *params) 1628send_skill_info (client *ns, char *params)
2370{ 1629{
2371 SockList sl; 1630 packet sl;
2372 int i; 1631 sl << "replyinfo skill_info\n";
2373 1632
2374 sl.buf = (unsigned char *) malloc (MAXSOCKBUF);
2375 strcpy ((char *) sl.buf, "replyinfo skill_info\n");
2376 for (i = 1; i < NUM_SKILLS; i++) 1633 for (int i = 1; i < NUM_SKILLS; i++)
2377 { 1634 sl.printf ("%d:%s\n", i + CS_STAT_SKILLINFO, &skill_names[i]);
2378 sprintf ((char *) sl.buf + strlen ((char *) sl.buf), "%d:%s\n", i + CS_STAT_SKILLINFO, &skill_names[i]); 1635
2379 }
2380 sl.len = strlen ((char *) sl.buf);
2381 if (sl.len >= MAXSOCKBUF) 1636 if (sl.length () >= MAXSOCKBUF)
2382 { 1637 {
2383 LOG (llevError, "Buffer overflow in send_skill_info!\n"); 1638 LOG (llevError, "Buffer overflow in send_skill_info!\n");
2384 fatal (0); 1639 fatal (0);
2385 } 1640 }
2386 Send_With_Handling (ns, &sl); 1641
2387 free (sl.buf); 1642 ns->send_packet (sl);
2388} 1643}
2389 1644
2390/** 1645/**
2391 * This sends the spell path to name mapping. We ignore 1646 * This sends the spell path to name mapping. We ignore
2392 * the params - we always send the same info no matter what. 1647 * the params - we always send the same info no matter what.
2393 */ 1648 */
2394void 1649void
2395send_spell_paths (NewSocket * ns, char *params) 1650send_spell_paths (client * ns, char *params)
2396{ 1651{
2397 SockList sl; 1652 packet sl;
2398 int i;
2399 1653
2400 sl.buf = (unsigned char *) malloc (MAXSOCKBUF); 1654 sl << "replyinfo spell_paths\n";
2401 strcpy ((char *) sl.buf, "replyinfo spell_paths\n"); 1655
2402 for (i = 0; i < NRSPELLPATHS; i++) 1656 for (int i = 0; i < NRSPELLPATHS; i++)
2403 sprintf ((char *) sl.buf + strlen ((char *) sl.buf), "%d:%s\n", 1 << i, spellpathnames[i]); 1657 sl.printf ("%d:%s\n", 1 << i, spellpathnames[i]);
2404 sl.len = strlen ((char *) sl.buf); 1658
2405 if (sl.len >= MAXSOCKBUF) 1659 if (sl.length () >= MAXSOCKBUF)
2406 { 1660 {
2407 LOG (llevError, "Buffer overflow in send_spell_paths!\n"); 1661 LOG (llevError, "Buffer overflow in send_spell_paths!\n");
2408 fatal (0); 1662 fatal (0);
2409 } 1663 }
2410 Send_With_Handling (ns, &sl); 1664
2411 free (sl.buf); 1665 ns->send_packet (sl);
2412} 1666}
2413 1667
2414/** 1668/**
2415 * This looks for any spells the player may have that have changed their stats. 1669 * This looks for any spells the player may have that have changed their stats.
2416 * it then sends an updspell packet for each spell that has changed in this way 1670 * it then sends an updspell packet for each spell that has changed in this way
2417 */ 1671 */
2418void 1672void
2419esrv_update_spells (player *pl) 1673esrv_update_spells (player *pl)
2420{ 1674{
2421 SockList sl; 1675 if (!pl->ns)
2422 int flags = 0;
2423 object *spell;
2424
2425 if (!pl->socket.monitor_spells)
2426 return; 1676 return;
1677
1678 if (!pl->ns->monitor_spells)
1679 return;
1680
2427 for (spell = pl->ob->inv; spell != NULL; spell = spell->below) 1681 for (object *spell = pl->ob->inv; spell; spell = spell->below)
2428 { 1682 {
2429 if (spell->type == SPELL) 1683 if (spell->type == SPELL)
2430 { 1684 {
1685 int flags = 0;
1686
2431 /* check if we need to update it */ 1687 /* check if we need to update it */
2432 if (spell->last_sp != SP_level_spellpoint_cost (pl->ob, spell, SPELL_MANA)) 1688 if (spell->last_sp != SP_level_spellpoint_cost (pl->ob, spell, SPELL_MANA))
2433 { 1689 {
2434 spell->last_sp = SP_level_spellpoint_cost (pl->ob, spell, SPELL_MANA); 1690 spell->last_sp = SP_level_spellpoint_cost (pl->ob, spell, SPELL_MANA);
2435 flags |= UPD_SP_MANA; 1691 flags |= UPD_SP_MANA;
2436 } 1692 }
1693
2437 if (spell->last_grace != SP_level_spellpoint_cost (pl->ob, spell, SPELL_GRACE)) 1694 if (spell->last_grace != SP_level_spellpoint_cost (pl->ob, spell, SPELL_GRACE))
2438 { 1695 {
2439 spell->last_grace = SP_level_spellpoint_cost (pl->ob, spell, SPELL_GRACE); 1696 spell->last_grace = SP_level_spellpoint_cost (pl->ob, spell, SPELL_GRACE);
2440 flags |= UPD_SP_GRACE; 1697 flags |= UPD_SP_GRACE;
2441 } 1698 }
1699
2442 if (spell->last_eat != spell->stats.dam + SP_level_dam_adjust (pl->ob, spell)) 1700 if (spell->last_eat != spell->stats.dam + SP_level_dam_adjust (pl->ob, spell))
2443 { 1701 {
2444 spell->last_eat = spell->stats.dam + SP_level_dam_adjust (pl->ob, spell); 1702 spell->last_eat = spell->stats.dam + SP_level_dam_adjust (pl->ob, spell);
2445 flags |= UPD_SP_DAMAGE; 1703 flags |= UPD_SP_DAMAGE;
2446 } 1704 }
1705
2447 if (flags != 0) 1706 if (flags)
2448 { 1707 {
2449 sl.buf = (unsigned char *) malloc (MAXSOCKBUF); 1708 packet sl;
2450 strcpy ((char *) sl.buf, "updspell "); 1709
2451 sl.len = strlen ((char *) sl.buf); 1710 sl << "updspell "
2452 SockList_AddChar (&sl, flags); 1711 << uint8 (flags)
2453 SockList_AddInt (&sl, spell->count); 1712 << uint32 (spell->count);
2454 if (flags & UPD_SP_MANA) 1713
2455 SockList_AddShort (&sl, spell->last_sp); 1714 if (flags & UPD_SP_MANA ) sl << uint16 (spell->last_sp);
2456 if (flags & UPD_SP_GRACE) 1715 if (flags & UPD_SP_GRACE ) sl << uint16 (spell->last_grace);
2457 SockList_AddShort (&sl, spell->last_grace); 1716 if (flags & UPD_SP_DAMAGE) sl << uint16 (spell->last_eat);
2458 if (flags & UPD_SP_DAMAGE) 1717
2459 SockList_AddShort (&sl, spell->last_eat); 1718 pl->ns->send_packet (sl);
2460 flags = 0;
2461 Send_With_Handling (&pl->socket, &sl);
2462 free (sl.buf);
2463 } 1719 }
2464 } 1720 }
2465 } 1721 }
2466} 1722}
2467 1723
2468void 1724void
2469esrv_remove_spell (player *pl, object *spell) 1725esrv_remove_spell (player *pl, object *spell)
2470{ 1726{
2471 SockList sl;
2472
2473 if (!pl->socket.monitor_spells) 1727 if (!pl->ns->monitor_spells)
2474 return; 1728 return;
1729
2475 if (!pl || !spell || spell->env != pl->ob) 1730 if (!pl || !spell || spell->env != pl->ob)
2476 { 1731 {
2477 LOG (llevError, "Invalid call to esrv_remove_spell"); 1732 LOG (llevError, "Invalid call to esrv_remove_spell");
2478 return; 1733 return;
2479 } 1734 }
2480 sl.buf = (unsigned char *) malloc (MAXSOCKBUF); 1735
2481 strcpy ((char *) sl.buf, "delspell "); 1736 packet sl ("delspell");
2482 sl.len = strlen ((char *) sl.buf); 1737
2483 SockList_AddInt (&sl, spell->count); 1738 sl << uint32 (spell->count);
2484 Send_With_Handling (&pl->socket, &sl); 1739
2485 free (sl.buf); 1740 pl->ns->send_packet (sl);
2486} 1741}
2487 1742
2488/* appends the spell *spell to the Socklist we will send the data to. */ 1743/* appends the spell *spell to the Socklist we will send the data to. */
2489static void 1744static void
2490append_spell (player *pl, SockList * sl, object *spell) 1745append_spell (player *pl, packet &sl, object *spell)
2491{ 1746{
2492 int len, i, skill = 0; 1747 int i, skill = 0;
2493 1748
2494 if (!(spell->name)) 1749 if (!(spell->name))
2495 { 1750 {
2496 LOG (llevError, "item number %d is a spell with no name.\n", spell->count); 1751 LOG (llevError, "item number %d is a spell with no name.\n", spell->count);
2497 return; 1752 return;
2498 } 1753 }
2499 SockList_AddInt (sl, spell->count); 1754
2500 SockList_AddShort (sl, spell->level);
2501 SockList_AddShort (sl, spell->casting_time);
2502 /* store costs and damage in the object struct, to compare to later */ 1755 /* store costs and damage in the object struct, to compare to later */
2503 spell->last_sp = SP_level_spellpoint_cost (pl->ob, spell, SPELL_MANA); 1756 spell->last_sp = SP_level_spellpoint_cost (pl->ob, spell, SPELL_MANA);
2504 spell->last_grace = SP_level_spellpoint_cost (pl->ob, spell, SPELL_GRACE); 1757 spell->last_grace = SP_level_spellpoint_cost (pl->ob, spell, SPELL_GRACE);
2505 spell->last_eat = spell->stats.dam + SP_level_dam_adjust (pl->ob, spell); 1758 spell->last_eat = spell->stats.dam + SP_level_dam_adjust (pl->ob, spell);
2506 /* send the current values */
2507 SockList_AddShort (sl, spell->last_sp);
2508 SockList_AddShort (sl, spell->last_grace);
2509 SockList_AddShort (sl, spell->last_eat);
2510 1759
2511 /* figure out which skill it uses, if it uses one */ 1760 /* figure out which skill it uses, if it uses one */
2512 if (spell->skill) 1761 if (spell->skill)
2513 { 1762 {
2514 for (i = 1; i < NUM_SKILLS; i++) 1763 for (i = 1; i < NUM_SKILLS; i++)
… …
2516 { 1765 {
2517 skill = i + CS_STAT_SKILLINFO; 1766 skill = i + CS_STAT_SKILLINFO;
2518 break; 1767 break;
2519 } 1768 }
2520 } 1769 }
2521 SockList_AddChar (sl, skill);
2522 1770
2523 SockList_AddInt (sl, spell->path_attuned); 1771 // spells better have a face
2524 SockList_AddInt (sl, (spell->face) ? spell->face->number : 0);
2525
2526 len = strlen (spell->name);
2527 SockList_AddChar (sl, (char) len);
2528 memcpy (sl->buf + sl->len, spell->name, len);
2529 sl->len += len;
2530
2531 if (!spell->msg) 1772 if (!spell->face)
2532 {
2533 SockList_AddShort (sl, 0);
2534 } 1773 {
2535 else 1774 LOG (llevError, "%s: spell has no face, but face is mandatory.\n", &spell->name);
1775 spell->face = face_find ("burnout.x11", blank_face);
2536 { 1776 }
2537 len = strlen (spell->msg); 1777
2538 SockList_AddShort (sl, len); 1778 /* send the current values */
2539 memcpy (sl->buf + sl->len, spell->msg, len); 1779 sl << uint32 (spell->count)
2540 sl->len += len; 1780 << uint16 (spell->level)
2541 } 1781 << uint16 (spell->casting_time)
1782 << uint16 (spell->last_sp)
1783 << uint16 (spell->last_grace)
1784 << uint16 (spell->last_eat)
1785 << uint8 (skill)
1786 << uint32 (spell->path_attuned)
1787 << uint32 (spell->face)
1788 << data8 (spell->name)
1789 << data16 (spell->msg);
2542} 1790}
2543 1791
2544/** 1792/**
2545 * This tells the client to add the spell *ob, if *ob is NULL, then add 1793 * This tells the client to add the spell *ob, if *ob is NULL, then add
2546 * all spells in the player's inventory. 1794 * all spells in the player's inventory.
2547 */ 1795 */
2548void 1796void
2549esrv_add_spells (player *pl, object *spell) 1797esrv_add_spells (player *pl, object *spell)
2550{ 1798{
2551 SockList sl;
2552
2553 if (!pl) 1799 if (!pl)
2554 { 1800 {
2555 LOG (llevError, "esrv_add_spells, tried to add a spell to a NULL player"); 1801 LOG (llevError, "esrv_add_spells, tried to add a spell to a NULL player");
2556 return; 1802 return;
2557 } 1803 }
1804
2558 if (!pl->socket.monitor_spells) 1805 if (!pl->ns->monitor_spells)
2559 return; 1806 return;
2560 sl.buf = (unsigned char *) malloc (MAXSOCKBUF); 1807
2561 strcpy ((char *) sl.buf, "addspell "); 1808 packet sl ("addspell");
2562 sl.len = strlen ((char *) sl.buf); 1809
2563 if (!spell) 1810 if (!spell)
2564 { 1811 {
2565 for (spell = pl->ob->inv; spell != NULL; spell = spell->below) 1812 for (spell = pl->ob->inv; spell; spell = spell->below)
2566 { 1813 {
2567 /* were we to simply keep appending data here, we could exceed 1814 /* were we to simply keep appending data here, we could exceed
2568 * MAXSOCKBUF if the player has enough spells to add, we know that 1815 * MAXSOCKBUF if the player has enough spells to add, we know that
2569 * append_spells will always append 19 data bytes, plus 4 length 1816 * append_spells will always append 19 data bytes, plus 4 length
2570 * bytes and 3 strings (because that is the spec) so we need to 1817 * bytes and 3 strings (because that is the spec) so we need to
… …
2577 * is hundreds of bytes off, so correcting 22 vs 26 doesn't seem 1824 * is hundreds of bytes off, so correcting 22 vs 26 doesn't seem
2578 * like it will fix this 1825 * like it will fix this
2579 */ 1826 */
2580 if (spell->type != SPELL) 1827 if (spell->type != SPELL)
2581 continue; 1828 continue;
1829
2582 if (sl.len >= (MAXSOCKBUF - (26 + strlen (spell->name) + (spell->msg ? strlen (spell->msg) : 0)))) 1830 if (sl.length () >= (MAXSOCKBUF - (26 + strlen (spell->name) + (spell->msg ? strlen (spell->msg) : 0))))
2583 { 1831 {
2584 Send_With_Handling (&pl->socket, &sl); 1832 pl->ns->send_packet (sl);
2585 strcpy ((char *) sl.buf, "addspell "); 1833
2586 sl.len = strlen ((char *) sl.buf); 1834 sl.reset ();
1835 sl << "addspell ";
2587 } 1836 }
1837
2588 append_spell (pl, &sl, spell); 1838 append_spell (pl, sl, spell);
2589 } 1839 }
2590 } 1840 }
2591 else if (spell->type != SPELL) 1841 else if (spell->type != SPELL)
2592 { 1842 {
2593 LOG (llevError, "Asked to send a non-spell object as a spell"); 1843 LOG (llevError, "Asked to send a non-spell object as a spell");
2594 return; 1844 return;
2595 } 1845 }
2596 else 1846 else
2597 append_spell (pl, &sl, spell); 1847 append_spell (pl, sl, spell);
1848
2598 if (sl.len >= MAXSOCKBUF) 1849 if (sl.length () >= MAXSOCKBUF)
2599 { 1850 {
2600 LOG (llevError, "Buffer overflow in esrv_add_spells!\n"); 1851 LOG (llevError, "Buffer overflow in esrv_add_spells!\n");
2601 fatal (0); 1852 fatal (0);
2602 } 1853 }
1854
2603 /* finally, we can send the packet */ 1855 /* finally, we can send the packet */
2604 Send_With_Handling (&pl->socket, &sl); 1856 pl->ns->send_packet (sl);
2605 free (sl.buf);
2606} 1857}
1858

Diff Legend

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