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

Comparing deliantra/server/socket/request.C (file contents):
Revision 1.10 by root, Fri Aug 25 17:11:54 2006 UTC vs.
Revision 1.34 by root, Thu Dec 14 01:59:10 2006 UTC

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

Diff Legend

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