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.26 by pippijn, Mon Dec 11 19:46:47 2006 UTC vs.
Revision 1.147 by root, Sat Dec 27 08:41:44 2008 UTC

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

Diff Legend

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