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.10 by root, Fri Aug 25 17:11:54 2006 UTC vs.
Revision 1.60 by root, Sun Jan 7 02:39:15 2007 UTC

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

Diff Legend

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