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.4 by root, Fri Aug 18 02:23:28 2006 UTC vs.
Revision 1.50 by root, Thu Dec 21 23:37:06 2006 UTC

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

Diff Legend

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