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.1 by elmex, Sun Aug 13 17:16:06 2006 UTC vs.
Revision 1.66 by root, Thu Feb 15 04:04:23 2007 UTC

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

Diff Legend

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