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.17 by root, Tue Sep 12 19:20:09 2006 UTC vs.
Revision 1.156 by root, Fri Nov 6 12:49:19 2009 UTC

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

Diff Legend

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