ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/deliantra/server/socket/request.C
(Generate patch)

Comparing deliantra/server/socket/request.C (file contents):
Revision 1.4 by root, Fri Aug 18 02:23:28 2006 UTC vs.
Revision 1.27 by root, Wed Dec 13 18:08:02 2006 UTC

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

Diff Legend

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