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.12 by root, Tue Aug 29 08:01:38 2006 UTC vs.
Revision 1.28 by root, Wed Dec 13 18:51:50 2006 UTC

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

Diff Legend

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