ViewVC Help

View File | Revision Log | Show Annotations | Download File

/cvs/deliantra/server/socket/request.C

Comparing deliantra/server/socket/request.C (file contents):
Revision 1.25 by root, Thu Sep 21 14:51:16 2006 UTC vs.
Revision 1.130 by root, Tue May 20 03:14:19 2008 UTC

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

Diff Legend

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