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.42 by root, Sat Dec 16 03:08:26 2006 UTC

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

Diff Legend

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