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

Diff Legend

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