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.79 by root, Thu Mar 15 16:25:45 2007 UTC vs.
Revision 1.171 by root, Sun Apr 11 00:34:07 2010 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 (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team	4	* Copyright (©) 2005,2006,2007,2008,2009,2010 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
5	* Copyright (C) 2001 Mark Wedel	5	* Copyright (©) 2001 Mark Wedel
6	* Copyright (C) 1992 Frank Tore Johansen	6	* Copyright (©) 1992 Frank Tore Johansen
7	*	7	*
8	* This program is free software; you can redistribute it and/or modify	8	* Deliantra is free software: you can redistribute it and/or modify it under
9	* it under the terms of the GNU General Public License as published by	9	* the terms of the Affero GNU General Public License as published by the
10	* the Free Software Foundation; either version 2 of the License, or	10	* Free Software Foundation, either version 3 of the License, or (at your
11	* (at your option) any later version.	11	* option) any later version.
12	*	12	*
13	* 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,
14	* but WITHOUT ANY WARRANTY; without even the implied warranty of	14	* but WITHOUT ANY WARRANTY; without even the implied warranty of
15	* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the	15	* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16	* GNU General Public License for more details.	16	* GNU General Public License for more details.
17	*	17	*
18	* You should have received a copy of the GNU General Public License	18	* You should have received a copy of the Affero GNU General Public License
19	* along with this program; if not, write to the Free Software	19	* and the GNU General Public License along with this program. If not, see
20	* Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.	20	* <http://www.gnu.org/licenses/>.
21	*	21	*
22	* The author can be reached via e-mail to <crossfire@schmorp.de>	22	* The authors can be reached via e-mail to <support@deliantra.net>
23	*/	23	*/
		24
		25	//+GPL
24		26
25	/**	27	/**
26	* \file	28	* \file
27	* Client handling.	29	* Client handling.
28	*	30	*
…		…
42		44
43	#include <global.h>	45	#include <global.h>
44	#include <sproto.h>	46	#include <sproto.h>
45		47
46	#include <living.h>	48	#include <living.h>
47	#include <commands.h>
48		49
49	/* This block is basically taken from socket.c - I assume if it works there,	50	/* This block is basically taken from socket.c - I assume if it works there,
50	* it should work here.	51	* it should work here.
51	*/	52	*/
52	#include <sys/types.h>	53	#include <sys/types.h>
…		…
64	* This table translates the attack numbers as used within the	65	* This table translates the attack numbers as used within the
65	* program to the value we use when sending STATS command to the	66	* program to the value we use when sending STATS command to the
66	* client. If a value is -1, then we don't send that to the	67	* client. If a value is -1, then we don't send that to the
67	* client.	68	* client.
68	*/	69	*/
69	short atnr_cs_stat[NROFATTACKS] = { CS_STAT_RES_PHYS,	70	static short atnr_cs_stat[NROFATTACKS] = { CS_STAT_RES_PHYS,
70	CS_STAT_RES_MAG, CS_STAT_RES_FIRE, CS_STAT_RES_ELEC,	71	CS_STAT_RES_MAG, CS_STAT_RES_FIRE, CS_STAT_RES_ELEC,
71	CS_STAT_RES_COLD, CS_STAT_RES_CONF, CS_STAT_RES_ACID,	72	CS_STAT_RES_COLD, CS_STAT_RES_CONF, CS_STAT_RES_ACID,
72	CS_STAT_RES_DRAIN, -1 /* weaponmagic */ ,	73	CS_STAT_RES_DRAIN, -1 /* weaponmagic */ ,
73	CS_STAT_RES_GHOSTHIT, CS_STAT_RES_POISON,	74	CS_STAT_RES_GHOSTHIT, CS_STAT_RES_POISON,
74	CS_STAT_RES_SLOW, CS_STAT_RES_PARA, CS_STAT_TURN_UNDEAD,	75	CS_STAT_RES_SLOW, CS_STAT_RES_PARA, CS_STAT_TURN_UNDEAD,
…		…
99	*/	100	*/
100	mx = ns->mapx;	101	mx = ns->mapx;
101	my = ns->mapy;	102	my = ns->mapy;
102		103
103	/* the x and y here are coordinates for the new map, i.e. if we moved	104	/* the x and y here are coordinates for the new map, i.e. if we moved
104	* (dx,dy), newmap[x][y] = oldmap[x-dx][y-dy]. For this reason,	105	* (dx,dy), newmap[x][y] = oldmap[x-dx][y-dy]. For this reason,
105	* if the destination x or y coordinate is outside the viewable	106	* if the destination x or y coordinate is outside the viewable
106	* area, we clear the values - otherwise, the old values	107	* area, we clear the values - otherwise, the old values
107	* are preserved, and the check_head thinks it needs to clear them.	108	* are preserved, and the check_head thinks it needs to clear them.
108	*/	109	*/
109	for (x = 0; x < mx; x++)	110	for (x = 0; x < mx; x++)
110	{
111	for (y = 0; y < my; y++)	111	for (y = 0; y < my; y++)
112	{
113	if (x >= ns->mapx || y >= ns->mapy)	112	if (x >= ns->mapx || y >= ns->mapy)
114	/* clear cells outside the viewable area */	113	/* clear cells outside the viewable area */
115	memset (&newmap.cells[x][y], 0, sizeof (struct MapCell));	114	memset (&newmap.cells[x][y], 0, sizeof (struct MapCell));
116	else if ((x + dx) < 0 || (x + dx) >= ns->mapx || (y + dy) < 0 || (y + dy) >= ns->mapy)	115	else if ((x + dx) < 0 || (x + dx) >= ns->mapx || (y + dy) < 0 || (y + dy) >= ns->mapy)
117	/* clear newly visible tiles within the viewable area */	116	/* clear newly visible tiles within the viewable area */
118	memset (&(newmap.cells[x][y]), 0, sizeof (struct MapCell));	117	memset (&(newmap.cells[x][y]), 0, sizeof (struct MapCell));
119	else	118	else
120	memcpy (&(newmap.cells[x][y]), &(ns->lastmap.cells[x + dx][y + dy]), sizeof (struct MapCell));	119	memcpy (&(newmap.cells[x][y]), &(ns->lastmap.cells[x + dx][y + dy]), sizeof (struct MapCell));
121	}
122	}
123		120
124	memcpy (&(ns->lastmap), &newmap, sizeof (struct Map));	121	memcpy (&(ns->lastmap), &newmap, sizeof (struct Map));
125		122
126	/* Make sure that the next "map1" command will be sent (even if it is	123	/* Make sure that the next "map1" command will be sent (even if it is
127	* empty).	124	* empty).
…		…
130	}	127	}
131		128
132	static void	129	static void
133	clear_map (player *pl)	130	clear_map (player *pl)
134	{	131	{
		132	pl->ns->mapinfo_queue_clear ();
		133
135	memset (&pl->ns->lastmap, 0, sizeof (pl->ns->lastmap));	134	memset (&pl->ns->lastmap, 0, sizeof (pl->ns->lastmap));
136		135
137	pl->ns->force_newmap = false;	136	pl->ns->force_newmap = false;
138		137
139	if (pl->ns->newmapcmd == 1)	138	if (pl->ns->newmapcmd == 1)
140	pl->ns->send_packet ("newmap");	139	pl->ns->send_packet ("newmap");
141		140
142	pl->ns->floorbox_reset ();	141	pl->ns->floorbox_reset ();
		142	}
		143
		144	static void
		145	send_map_info (player *pl)
		146	{
		147	client &socket = *pl->ns;
		148	object *ob = pl->viewpoint;
		149
		150	if (socket.mapinfocmd)
		151	{
		152	if (ob->map && ob->map->path[0])
		153	{
		154	int flags = 0;
		155
		156	if (ob->map->tile_path[0]) flags |= 1;
		157	if (ob->map->tile_path[1]) flags |= 2;
		158	if (ob->map->tile_path[2]) flags |= 4;
		159	if (ob->map->tile_path[3]) flags |= 8;
		160
		161	socket.send_packet_printf ("mapinfo - spatial %d %d %d %d %d %s",
		162	flags, socket.mapx / 2 - ob->x, socket.mapy / 2 - ob->y,
		163	ob->map->width, ob->map->height, &ob->map->path);
		164	}
		165	else
		166	socket.send_packet ("mapinfo current");
		167	}
143	}	168	}
144		169
145	/** check for map/region change and send new map data */	170	/** check for map/region change and send new map data */
146	static void	171	static void
147	check_map_change (player *pl)	172	check_map_change (player *pl)
148	{	173	{
149	client &socket = *pl->ns;	174	client &socket = *pl->ns;
150	object *ob = pl->ob;	175	object *ob = pl->viewpoint;
151	char buf[MAX_BUF]; /* eauugggh */
152		176
153	if (socket.force_newmap && 0)	177	region *reg = ob->region ();
		178	if (socket.current_region != reg)
		179	{
		180	INVOKE_PLAYER (REGION_CHANGE, pl, ARG_REGION (reg), ARG_REGION (socket.current_region));
		181	socket.current_region = reg;
154	{	182	}
155	// force newmap is used for clients that do not redraw their map	183
156	// after image uploads.	184	// first try to aovid a full newmap on tiled map scrolls
		185	if (socket.current_map != ob->map && !socket.force_newmap)
		186	{
		187	rv_vector rv;
		188
		189	get_rangevector_from_mapcoord (socket.current_map, socket.current_x, socket.current_y, ob, &rv, 0);
		190
		191	// manhattan distance is very handy here
		192	if (rv.distance < 8) // 8 works nicely for speed << 70 and buggy gcfclient
		193	{
		194	socket.current_map = ob->map;
		195	socket.current_x = ob->x;
		196	socket.current_y = ob->y;
		197
		198	socket_map_scroll (&socket, rv.distance_x, rv.distance_y);
		199	socket.floorbox_reset ();
		200	send_map_info (pl);
		201	}
		202	}
		203
		204	if (socket.current_map != ob->map || socket.force_newmap)
		205	{
		206	clear_map (pl);
157	socket.current_map = ob->map;	207	socket.current_map = ob->map;
158	clear_map (pl);	208	send_map_info (pl);
159	}
160	else if (socket.current_map != ob->map)
161	{
162	clear_map (pl);
163
164	if (socket.mapinfocmd)
165	{
166	if (ob->map && ob->map->path[0])
167	{
168	int flags = 0;
169
170	if (ob->map->tile_path[0])
171	flags |= 1;
172	if (ob->map->tile_path[1])
173	flags |= 2;
174	if (ob->map->tile_path[2])
175	flags |= 4;
176	if (ob->map->tile_path[3])
177	flags |= 8;
178
179	snprintf (buf, MAX_BUF, "mapinfo - spatial %d %d %d %d %d %s",
180	flags, socket.mapx / 2 - ob->x, socket.mapy / 2 - ob->y, ob->map->width, ob->map->height, &ob->map->path);
181	}
182	else
183	snprintf (buf, MAX_BUF, "mapinfo current");
184
185	socket.send_packet (buf);
186	}
187	}	209	}
188	else if (socket.current_x != ob->x || socket.current_y != ob->y)	210	else if (socket.current_x != ob->x || socket.current_y != ob->y)
189	{	211	{
190	int dx = ob->x - socket.current_x;	212	int dx = ob->x - socket.current_x;
191	int dy = ob->y - socket.current_y;	213	int dy = ob->y - socket.current_y;
192		214
193	if (socket.buggy_mapscroll && (abs (dx) > 8 || abs (dy) > 8))
194	clear_map (pl); // current (<= 1.9.1) clients have unchecked buffer overflows
195	else
196	{
197	socket_map_scroll (&socket, ob->x - socket.current_x, ob->y - socket.current_y);	215	socket_map_scroll (&socket, ob->x - socket.current_x, ob->y - socket.current_y);
198	socket.floorbox_reset ();	216	socket.floorbox_reset ();
199	}
200	}	217	}
201		218
202	socket.current_x = ob->x;	219	socket.current_x = ob->x;
203	socket.current_y = ob->y;	220	socket.current_y = ob->y;
		221	}
204		222
205	region *reg = ob->region ();	223	/**
206	if (socket.current_region != reg)	224	* This sends the skill number to name mapping. We ignore
207	{	225	* the params - we always send the same info no matter what.
208	socket.current_region = reg;	226	*/
209	socket.send_packet_printf ("drawinfo 0 You are now %s.\n(use whereami for more details)", &reg->longname);	227	static void
		228	send_skill_info (client *ns, char *params)
		229	{
		230	packet sl;
		231	sl << "replyinfo skill_info\n";
		232
		233	for (int i = 1; i < NUM_SKILLS; i++)
		234	sl.printf ("%d:%s\n", i + CS_STAT_SKILLINFO, &skill_names [i]);
		235
		236	if (sl.length () > MAXSOCKBUF)
210	}	237	{
		238	LOG (llevError, "Buffer overflow in send_skill_info!\n");
		239	fatal (0);
		240	}
		241
		242	ns->send_packet (sl);
		243	}
		244
		245	/**
		246	* This sends the spell path to name mapping. We ignore
		247	* the params - we always send the same info no matter what.
		248	*/
		249	static void
		250	send_spell_paths (client * ns, char *params)
		251	{
		252	packet sl;
		253
		254	sl << "replyinfo spell_paths\n";
		255
		256	for (int i = 0; i < NRSPELLPATHS; i++)
		257	sl.printf ("%d:%s\n", 1 << i, spellpathnames[i]);
		258
		259	if (sl.length () > MAXSOCKBUF)
		260	{
		261	LOG (llevError, "Buffer overflow in send_spell_paths!\n");
		262	fatal (0);
		263	}
		264
		265	ns->send_packet (sl);
211	}	266	}
212		267
213	/**	268	/**
214	* RequestInfo is sort of a meta command. There is some specific	269	* RequestInfo is sort of a meta command. There is some specific
215	* request of information, but we call other functions to provide	270	* request of information, but we call other functions to provide
216	* that information.	271	* that information.
217	*/	272	*/
218	void	273	void
219	RequestInfo (char *buf, int len, client * ns)	274	RequestInfo (char *buf, int len, client *ns)
220	{	275	{
221	char *params = NULL, *cp;	276	char *params;
222
223	/* No match */
224	char bigbuf[MAX_BUF];
225	int slen;
226
227	/* Set up replyinfo before we modify any of the buffers - this is used
228	* if we don't find a match.
229	*/
230	strcpy (bigbuf, "replyinfo ");
231	slen = strlen (bigbuf);
232	safe_strcat (bigbuf, buf, &slen, MAX_BUF);
233		277
234	/* find the first space, make it null, and update the	278	/* find the first space, make it null, and update the
235	* params pointer.	279	* params pointer.
236	*/	280	*/
237	for (cp = buf; *cp != '\0'; cp++)	281	for (params = buf; *params; params++)
238	if (*cp == ' ')	282	if (*params == ' ')
239	{	283	{
240	*cp = '\0';
241	params = cp + 1;	284	*params++ = 0;
242	break;	285	break;
243	}	286	}
244		287
245	if (!strcmp (buf, "image_info"))
246	send_image_info (ns, params);
247	else if (!strcmp (buf, "image_sums"))
248	send_image_sums (ns, params);
249	else if (!strcmp (buf, "skill_info"))	288	if (!strcmp (buf, "skill_info"))
250	send_skill_info (ns, params);	289	send_skill_info (ns, params);
251	else if (!strcmp (buf, "spell_paths"))	290	else if (!strcmp (buf, "spell_paths"))
252	send_spell_paths (ns, params);	291	send_spell_paths (ns, params);
253	else	292	else
254	ns->send_packet (bigbuf, len);	293	{
		294	// undo tokenisation above and send replyinfo with the request unchanged
		295	if (*params)
		296	*--params = ' ';
		297
		298	ns->send_packet_printf ("replyinfo %s", buf);
		299	}
255	}	300	}
256		301
257	void	302	void
258	ExtCmd (char *buf, int len, player *pl)	303	ExtCmd (char *buf, int len, player *pl)
259	{	304	{
…		…
262		307
263	void	308	void
264	ExtiCmd (char *buf, int len, client *ns)	309	ExtiCmd (char *buf, int len, client *ns)
265	{	310	{
266	INVOKE_CLIENT (EXTICMD, ns, ARG_DATA (buf, len));	311	INVOKE_CLIENT (EXTICMD, ns, ARG_DATA (buf, len));
		312	}
		313
		314	//-GPL
		315
		316	void
		317	client::mapinfo_queue_clear ()
		318	{
		319	for (auto (i, mapinfo_queue.begin ()); i != mapinfo_queue.end (); ++i)
		320	free (*i);
		321
		322	mapinfo_queue.clear ();
		323	}
		324
		325	bool
		326	client::mapinfo_try (char *buf)
		327	{
		328	char *token = buf;
		329	buf += strlen (buf) + 9;
		330
		331	// initial map and its origin
		332	maptile *map = pl->viewpoint->map;
		333	int mapx = pl->ns->mapx / 2 - pl->viewpoint->x;
		334	int mapy = pl->ns->mapy / 2 - pl->viewpoint->y;
		335	int max_distance = 8; // limit maximum path length to something generous
		336
		337	while (*buf && map && max_distance)
		338	{
		339	int dir = *buf++ - '1';
		340
		341	if (dir >= 0 && dir <= 3)
		342	{
		343	if (!map->tile_path [dir])
		344	map = 0;
		345	else if (map->tile_available (dir, false))
		346	{
		347	maptile *neigh = map->tile_map [dir];
		348
		349	switch (dir)
		350	{
		351	case 0: mapy -= neigh->height; break;
		352	case 2: mapy += map ->height; break;
		353	case 3: mapx -= neigh->width ; break;
		354	case 1: mapx += map ->width ; break;
		355	}
		356
		357	map = neigh;
		358	--max_distance;
		359	}
		360	else
		361	return 0;
		362	}
		363	else
		364	max_distance = 0;
		365	}
		366
		367	if (!max_distance)
		368	send_packet_printf ("mapinfo %s error", token);
		369	else if (!map || !map->path)
		370	send_packet_printf ("mapinfo %s nomap", token);
		371	else
		372	{
		373	int flags = 0;
		374
		375	if (map->tile_path[0]) flags |= 1;
		376	if (map->tile_path[1]) flags |= 2;
		377	if (map->tile_path[2]) flags |= 4;
		378	if (map->tile_path[3]) flags |= 8;
		379
		380	send_packet_printf ("mapinfo %s spatial %d %d %d %d %d %s", token, flags, mapx, mapy, map->width, map->height, &map->path);
		381	}
		382
		383	return 1;
		384	}
		385
		386	void
		387	client::mapinfo_queue_run ()
		388	{
		389	if (mapinfo_queue.empty () || !pl)
		390	return;
		391
		392	for (int i = 0; i < mapinfo_queue.size (); ++i)
		393	if (mapinfo_try (mapinfo_queue [i]))
		394	{
		395	free (mapinfo_queue [i]);
		396	mapinfo_queue.erase (i);
		397	}
		398	else
		399	++i;
267	}	400	}
268		401
269	void	402	void
270	MapInfoCmd (char *buf, int len, player *pl)	403	MapInfoCmd (char *buf, int len, player *pl)
271	{	404	{
272	// <mapinfo tag spatial tile-path	405	// <mapinfo tag spatial tile-path
273	// >mapinfo tag spatial flags x y w h hash	406	// >mapinfo tag spatial flags x y w h hash
274		407
275	char bigbuf[MAX_BUF], *token;
276
277	token = buf;	408	char *token = buf;
278	// copy token	409
279	if (!(buf = strchr (buf, ' ')))	410	if (!(buf = strchr (buf, ' ')))
280	return;	411	return;
281		412
282	*buf++ = 0;
283
284	if (!strncmp (buf, "spatial ", 8))	413	if (!strncmp (buf, " spatial ", 9))
285	{	414	{
286	buf += 8;	415	char *copy = strdup (token);
		416	copy [buf - token] = 0;
287		417
288	// initial map and its origin	418	#if 0
289	maptile *map = pl->ob->map;	419	// this makes only sense when we flush the buffer immediately
290	sint16 dx, dy;	420	if (pl->ns->mapinfo_try (copy))
291	int mapx = pl->ns->mapx / 2 - pl->ob->x;	421	free (copy);
292	int mapy = pl->ns->mapy / 2 - pl->ob->y;
293	int max_distance = 8; // limit maximum path length to something generous
294
295	while (*buf && map && max_distance)
296	{
297	int dir = *buf++;
298
299	switch (dir)
300	{
301	case '1':
302	dx = 0;
303	dy = -1;
304	map = map->xy_find (dx, dy);
305	map && (mapy -= map->height);
306	break;
307	case '2':
308	mapx += map->width;
309	dx = map->width;
310	dy = 0;
311	map = map->xy_find (dx, dy);
312	break;
313	case '3':
314	mapy += map->height;
315	dx = 0;
316	dy = map->height;
317	map = map->xy_find (dx, dy);
318	break;
319	case '4':
320	dx = -1;
321	dy = 0;
322	map = map->xy_find (dx, dy);
323	map && (mapx -= map->width);
324	break;
325	}
326
327	--max_distance;
328	}
329
330	if (!max_distance)
331	snprintf (bigbuf, MAX_BUF, "mapinfo %s error", token);
332	else if (map && map->path[0])
333	{
334	int flags = 0;
335
336	if (map->tile_path[0])
337	flags |= 1;
338	if (map->tile_path[1])
339	flags |= 2;
340	if (map->tile_path[2])
341	flags |= 4;
342	if (map->tile_path[3])
343	flags |= 8;
344
345	snprintf (bigbuf, MAX_BUF, "mapinfo %s spatial %d %d %d %d %d %s", token, flags, mapx, mapy, map->width, map->height, &map->path);
346	}
347	else	422	else
348	snprintf (bigbuf, MAX_BUF, "mapinfo %s nomap", token);	423	#endif
		424	pl->ns->mapinfo_queue.push_back (copy);
349	}	425	}
350	else	426	else
351	snprintf (bigbuf, MAX_BUF, "mapinfo %s unsupported", token);	427	pl->ns->send_packet_printf ("mapinfo %s unsupported", token);
352
353	pl->ns->send_packet (bigbuf);
354	}	428	}
355		429
356	/** This is the Setup cmd - easy first implementation */	430	/** This is the Setup cmd */
357	void	431	void
358	SetUp (char *buf, int len, client * ns)	432	SetUp (char *buf, int len, client * ns)
359	{	433	{
360	int s, slen;	434	INVOKE_CLIENT (SETUP, ns, ARG_DATA (buf, len));
361	char *cmd, *param, cmdback[HUGE_BUF];
362
363	/* run through the cmds of setup
364	* syntax is setup <cmdname1> <parameter> <cmdname2> <parameter> ...
365	*
366	* we send the status of the cmd back, or a FALSE is the cmd is the server unknown
367	* The client then must sort this out
368	*/
369
370	//LOG (llevInfo, "Get SetupCmd:: %s\n", buf);
371
372	strcpy (cmdback, "setup");
373	for (s = 0; s < len; )
374	{
375	cmd = &buf[s];
376
377	/* find the next space, and put a null there */
378	for (; buf[s] && buf[s] != ' '; s++)
379	;
380
381	buf[s++] = 0;
382
383	while (buf[s] == ' ')
384	s++;
385
386	if (s >= len)
387	break;
388
389	param = &buf[s];
390
391	for (; buf[s] && buf[s] != ' '; s++)
392	;
393
394	buf[s++] = 0;
395
396	while (buf[s] == ' ')
397	s++;
398
399	slen = strlen (cmdback);
400	safe_strcat (cmdback, " ", &slen, HUGE_BUF);
401	safe_strcat (cmdback, cmd, &slen, HUGE_BUF);
402	safe_strcat (cmdback, " ", &slen, HUGE_BUF);
403
404	if (!strcmp (cmd, "sound"))
405	{
406	ns->sound = atoi (param);
407	safe_strcat (cmdback, param, &slen, HUGE_BUF);
408	}
409	else if (!strcmp (cmd, "exp64"))
410	safe_strcat (cmdback, param, &slen, HUGE_BUF);
411	else if (!strcmp (cmd, "spellmon"))
412	{
413	ns->monitor_spells = atoi (param);
414	safe_strcat (cmdback, param, &slen, HUGE_BUF);
415	}
416	else if (!strcmp (cmd, "darkness"))
417	{
418	ns->darkness = atoi (param);
419	safe_strcat (cmdback, param, &slen, HUGE_BUF);
420	}
421	else if (!strcmp (cmd, "map1cmd"))
422	{
423	if (atoi (param))
424	ns->mapmode = Map1Cmd;
425	/* if beyond this size, need to use map1cmd no matter what */
426	if (ns->mapx > 11 || ns->mapy > 11)
427	ns->mapmode = Map1Cmd;
428	safe_strcat (cmdback, ns->mapmode == Map1Cmd ? "1" : "0", &slen, HUGE_BUF);
429	}
430	else if (!strcmp (cmd, "map1acmd"))
431	{
432	if (atoi (param))
433	ns->mapmode = Map1aCmd;
434	/* if beyond this size, need to use map1acmd no matter what */
435	if (ns->mapx > 11 || ns->mapy > 11)
436	ns->mapmode = Map1aCmd;
437	safe_strcat (cmdback, ns->mapmode == Map1aCmd ? "1" : "0", &slen, HUGE_BUF);
438	}
439	else if (!strcmp (cmd, "newmapcmd"))
440	{
441	ns->newmapcmd = atoi (param);
442	safe_strcat (cmdback, param, &slen, HUGE_BUF);
443	}
444	else if (!strcmp (cmd, "mapinfocmd"))
445	{
446	ns->mapinfocmd = atoi (param);
447	safe_strcat (cmdback, "1", &slen, HUGE_BUF);
448	}
449	else if (!strcmp (cmd, "extcmd"))
450	{
451	ns->extcmd = atoi (param);
452	safe_strcat (cmdback, "1", &slen, HUGE_BUF);
453	}
454	else if (!strcmp (cmd, "extmap"))
455	{
456	ns->extmap = atoi (param);
457	safe_strcat (cmdback, "1", &slen, HUGE_BUF);
458	}
459	else if (!strcmp (cmd, "facecache"))
460	{
461	ns->facecache = atoi (param);
462	safe_strcat (cmdback, param, &slen, HUGE_BUF);
463	}
464	else if (!strcmp (cmd, "faceset"))
465	{
466	char tmpbuf[20];
467	int q = atoi (param);
468
469	if (is_valid_faceset (q))
470	ns->faceset = q;
471
472	sprintf (tmpbuf, "%d", ns->faceset);
473	safe_strcat (cmdback, tmpbuf, &slen, HUGE_BUF);
474	/* if the client is using faceset, it knows about image2 command */
475	ns->image2 = 1;
476	}
477	else if (!strcmp (cmd, "itemcmd"))
478	{
479	/* Version of the item protocol command to use. Currently,
480	* only supported versions are 1 and 2. Using a numeric
481	* value will make it very easy to extend this in the future.
482	*/
483	char tmpbuf[20];
484	int q = atoi (param);
485
486	if (q < 1 || q > 2)
487	{
488	strcpy (tmpbuf, "FALSE");
489	}
490	else
491	{
492	ns->itemcmd = q;
493	sprintf (tmpbuf, "%d", ns->itemcmd);
494	}
495	safe_strcat (cmdback, tmpbuf, &slen, HUGE_BUF);
496	}
497	else if (!strcmp (cmd, "mapsize"))
498	{
499	int x, y = 0;
500	char tmpbuf[MAX_BUF], *cp;
501
502	x = atoi (param);
503	for (cp = param; *cp != 0; cp++)
504	if (*cp == 'x' || *cp == 'X')
505	{
506	y = atoi (cp + 1);
507	break;
508	}
509
510	if (x < 9 || y < 9 || x > MAP_CLIENT_X || y > MAP_CLIENT_Y)
511	{
512	sprintf (tmpbuf, " %dx%d", MAP_CLIENT_X, MAP_CLIENT_Y);
513	safe_strcat (cmdback, tmpbuf, &slen, HUGE_BUF);
514	}
515	else
516	{
517	ns->mapx = x;
518	ns->mapy = y;
519	/* better to send back what we are really using and not the
520	* param as given to us in case it gets parsed differently.
521	*/
522	sprintf (tmpbuf, "%dx%d", x, y);
523	safe_strcat (cmdback, tmpbuf, &slen, HUGE_BUF);
524	/* If beyond this size and still using orig map command, need to
525	* go to map1cmd.
526	*/
527	if ((x > 11 || y > 11) && ns->mapmode == Map0Cmd)
528	ns->mapmode = Map1Cmd;
529	}
530	}
531	else if (!strcmp (cmd, "extendedMapInfos"))
532	{
533	/* Added by tchize
534	* prepare to use the mapextended command
535	*/
536	char tmpbuf[20];
537
538	ns->ext_mapinfos = (atoi (param));
539	sprintf (tmpbuf, "%d", ns->ext_mapinfos);
540	safe_strcat (cmdback, tmpbuf, &slen, HUGE_BUF);
541	}
542	else if (!strcmp (cmd, "extendedTextInfos"))
543	{
544	/* Added by tchize
545	* prepare to use the extended text commands
546	* Client toggle this to non zero to get exttext
547	*/
548	char tmpbuf[20];
549
550	ns->has_readable_type = (atoi (param));
551	sprintf (tmpbuf, "%d", ns->has_readable_type);
552	safe_strcat (cmdback, tmpbuf, &slen, HUGE_BUF);
553	}
554	else
555	{
556	/* Didn't get a setup command we understood -
557	* report a failure to the client.
558	*/
559	safe_strcat (cmdback, "FALSE", &slen, HUGE_BUF);
560	}
561	} /* for processing all the setup commands */
562
563	LOG (llevInfo, "SendBack SetupCmd:: %s\n", cmdback);
564	ns->send_packet (cmdback);
565	}	435	}
566		436
567	/**	437	/**
568	* The client has requested to be added to the game.	438	* The client has requested to be added to the game.
569	* This is what takes care of it. We tell the client how things worked out.	439	* This is what takes care of it. We tell the client how things worked out.
…		…
571	* it either has to be here or init_sockets needs to be exported.	441	* it either has to be here or init_sockets needs to be exported.
572	*/	442	*/
573	void	443	void
574	AddMeCmd (char *buf, int len, client *ns)	444	AddMeCmd (char *buf, int len, client *ns)
575	{	445	{
576	// face caching is mandatory
577	if (!ns->facecache)
578	{
579	ns->send_drawinfo (
580	"\n"
581	"\n"
582	"***\n"
583	"*** WARNING:\n"
584	"*** Your client does not support face/image caching,\n"
585	"*** or it has been disabled. Face caching is mandatory\n"
586	"*** so please enable it or use a newer client.\n"
587	"***\n"
588	"*** Look at your client preferences:\n"
589	"***\n"
590	"*** CFPlus: all known versions automatically enable the facecache.\n"
591	"*** cfclient: use the -cache commandline option.\n"
592	"*** cfclient: map will not redraw automatically (bug).\n"
593	"*** gcfclient: use -cache commandline option, or enable\n"
594	"*** gcfclient: Client=>Configure=>Map & Image=>Cache Images.\n"
595	"*** jcrossclient: your client is broken, use CFPlus or gcfclient.\n"
596	"***\n"
597	"***\n",
598	NDI_RED
599	);
600
601	if (strstr (ns->version, "jcrossclient"))
602	/* let them, for now*/;
603	else
604	{
605	ns->flush ();
606	//ns->destroy ();
607	}
608	//ns->facecache = true;
609	}
610
611	INVOKE_CLIENT (ADDME, ns, ARG_DATA (buf, len));	446	INVOKE_CLIENT (ADDME, ns, ARG_DATA (buf, len));
612	}	447	}
613		448
614	/** Reply to ExtendedInfos command */	449	//+GPL
615	void
616	ToggleExtendedInfos (char *buf, int len, client * ns)
617	{
618	char cmdback[MAX_BUF];
619	char command[50];
620	int info, nextinfo;
621
622	cmdback[0] = '\0';
623	nextinfo = 0;
624
625	while (1)
626	{
627	/* 1. Extract an info */
628	info = nextinfo;
629
630	while ((info < len) && (buf[info] == ' '))
631	info++;
632
633	if (info >= len)
634	break;
635
636	nextinfo = info + 1;
637
638	while ((nextinfo < len) && (buf[nextinfo] != ' '))
639	nextinfo++;
640
641	if (nextinfo - info >= 49) /*Erroneous info asked */
642	continue;
643
644	strncpy (command, &(buf[info]), nextinfo - info);
645
646	/* 2. Interpret info */
647	if (!strcmp ("smooth", command))
648	/* Toggle smoothing */
649	ns->EMI_smooth = !ns->EMI_smooth;
650	else
651	/*bad value */;
652
653	/*3. Next info */
654	}
655
656	strcpy (cmdback, "ExtendedInfoSet");
657
658	if (ns->EMI_smooth)
659	{
660	strcat (cmdback, " ");
661	strcat (cmdback, "smoothing");
662	}
663
664	ns->send_packet (cmdback);
665	}
666
667	/*
668	#define MSG_TYPE_BOOK 1
669	#define MSG_TYPE_CARD 2
670	#define MSG_TYPE_PAPER 3
671	#define MSG_TYPE_SIGN 4
672	#define MSG_TYPE_MONUMENT 5
673	#define MSG_TYPE_SCRIPTED_DIALOG 6*/
674
675	/** Reply to ExtendedInfos command */
676	void
677	ToggleExtendedText (char *buf, int len, client * ns)
678	{
679	char cmdback[MAX_BUF];
680	char temp[10];
681	char command[50];
682	int info, nextinfo, i, flag;
683
684	cmdback[0] = '\0';
685
686	nextinfo = 0;
687	while (1)
688	{
689	/* 1. Extract an info */
690	info = nextinfo;
691
692	while ((info < len) && (buf[info] == ' '))
693	info++;
694
695	if (info >= len)
696	break;
697
698	nextinfo = info + 1;
699
700	while ((nextinfo < len) && (buf[nextinfo] != ' '))
701	nextinfo++;
702
703	if (nextinfo - info >= 49) /*Erroneous info asked */
704	continue;
705
706	strncpy (command, &(buf[info]), nextinfo - info);
707	command[nextinfo - info] = '\0';
708	/* 2. Interpret info */
709	i = sscanf (command, "%d", &flag);
710
711	if ((i == 1) && (flag > 0) && (flag <= MSG_TYPE_LAST))
712	ns->supported_readables |= (1 << flag);
713	/*3. Next info */
714	}
715
716	/* Send resulting state */
717	strcpy (cmdback, "ExtendedTextSet");
718
719	for (i = 0; i <= MSG_TYPE_LAST; i++)
720	if (ns->supported_readables & (1 << i))
721	{
722	strcat (cmdback, " ");
723	snprintf (temp, sizeof (temp), "%d", i);
724	strcat (cmdback, temp);
725	}
726
727	ns->send_packet (cmdback);
728	}
729
730	/**
731	* client requested an image. send it rate-limited
732	* before flushing.
733	*/
734	void
735	AskFaceCmd (char *buf, int len, client *ns)
736	{
737	ns->askface.push_back (atoi (buf));
738	}
739
740	/**
741	* Tells client the picture it has to use
742	* to smooth a picture number given as argument.
743	*/
744	void
745	AskSmooth (char *buf, int len, client *ns)
746	{
747	ns->send_face (atoi (buf));
748	}
749		450
750	/**	451	/**
751	* This handles the general commands from the client (ie, north, fire, cast,	452	* This handles the general commands from the client (ie, north, fire, cast,
752	* etc.)	453	* etc.)
753	*/	454	*/
…		…
766	return;	467	return;
767		468
768	buf++;	469	buf++;
769	}	470	}
770		471
771	execute_newserver_command (pl->ob, (char *) buf);	472	execute_newserver_command (pl->ob, (char *)buf);
772		473
773	/* Perhaps something better should be done with a left over count.	474	/* Perhaps something better should be done with a left over count.
774	* Cleaning up the input should probably be done first - all actions	475	* Cleaning up the input should probably be done first - all actions
775	* for the command that issued the count should be done before any other	476	* for the command that issued the count should be done before any other
776	* commands.	477	* commands.
777	*/	478	*/
778	pl->count = 0;	479	pl->count = 0;
779	}	480	}
780		481
781
782	/**	482	/**
783	* This handles the general commands from the client (ie, north, fire, cast,	483	* This handles the general commands from the client (ie, north, fire, cast,
784	* etc.). It is a lot like PlayerCmd above, but is called with the	484	* etc.). It is a lot like PlayerCmd above, but is called with the
785	* 'ncom' method which gives more information back to the client so it	485	* 'ncom' method which gives more information back to the client so it
786	* can throttle.	486	* can throttle.
…		…
788	void	488	void
789	NewPlayerCmd (char *buf, int len, player *pl)	489	NewPlayerCmd (char *buf, int len, player *pl)
790	{	490	{
791	if (len <= 6)	491	if (len <= 6)
792	{	492	{
793	LOG (llevDebug, "Corrupt ncom command <%s> not long enough - discarding\n", buf);	493	LOG (llevDebug, "%s: corrupt ncom command <%s>: not long enough (%d) - discarding\n", pl->ns->host, buf, len);
794	return;	494	return;
795	}	495	}
796		496
797	uint16 cmdid = net_uint16 ((uint8 *)buf);	497	uint16 cmdid = net_uint16 ((uint8 *)buf);
798	sint32 repeat = net_sint32 ((uint8 *)buf + 2);	498	sint32 repeat = net_sint32 ((uint8 *)buf + 2);
…		…
811	* commands.	511	* commands.
812	*/	512	*/
813	pl->count = 0;	513	pl->count = 0;
814		514
815	//TODO: schmorp thinks whatever this calculates, it makes no sense at all	515	//TODO: schmorp thinks whatever this calculates, it makes no sense at all
816	int time = fabs (pl->ob->speed) < 0.001	516	int time = pl->ob->has_active_speed ()
817	? time = MAX_TIME * 100
818	: time = (int) (MAX_TIME / fabs (pl->ob->speed));	517	? (int) (MAX_TIME / pl->ob->speed)
		518	: MAX_TIME * 100;
819		519
820	/* Send confirmation of command execution now */	520	/* Send confirmation of command execution now */
821	packet sl ("comc");	521	packet sl ("comc");
822	sl << uint16 (cmdid) << uint32 (time);	522	sl << uint16 (cmdid) << uint32 (time);
823	pl->ns->send_packet (sl);	523	pl->ns->send_packet (sl);
…		…
855	{	555	{
856	case ST_PLAYING:	556	case ST_PLAYING:
857	LOG (llevError, "Got reply message with ST_PLAYING input state\n");	557	LOG (llevError, "Got reply message with ST_PLAYING input state\n");
858	break;	558	break;
859		559
860	case ST_CHANGE_CLASS:
861	key_change_class (pl->ob, buf[0]);
862	break;
863
864	case ST_GET_PARTY_PASSWORD: /* Get password for party */	560	case ST_GET_PARTY_PASSWORD: /* Get password for party */
865	receive_party_password (pl->ob, 13);	561	receive_party_password (pl->ob, 13);
866	break;	562	break;
867		563
868	default:	564	default:
869	LOG (llevError, "Unknown input state: %d\n", ns->state);	565	LOG (llevError, "Unknown input state: %d\n", ns->state);
870	}	566	}
871	}	567	}
872		568
873	/**	569	/**
874	* Client tells its version. If there is a mismatch, we close the	570	* Client tells its version info.
875	* socket. In real life, all we should care about is the client having
876	* something older than the server. If we assume the client will be
877	* backwards compatible, having it be a later version should not be a
878	* problem.
879	*/	571	*/
880	void	572	void
881	VersionCmd (char *buf, int len, client * ns)	573	VersionCmd (char *buf, int len, client *ns)
882	{	574	{
883	if (!buf)	575	INVOKE_CLIENT (VERSION, ns, ARG_DATA (buf, len));
884	{
885	LOG (llevError, "CS: received corrupted version command\n");
886	return;
887	}
888
889	ns->cs_version = atoi (buf);
890	ns->sc_version = ns->cs_version;
891
892	LOG (llevDebug, "connection from client <%s>\n", buf);
893
894	//TODO: should log here just for statistics
895
896	//if (VERSION_CS != ns->cs_version)
897	// unchecked;
898
899	char *cp = strchr (buf + 1, ' ');
900	if (!cp)
901	return;
902
903	ns->sc_version = atoi (cp);
904
905	//if (VERSION_SC != ns->sc_version)
906	// unchecked;
907
908	cp = strchr (cp + 1, ' ');
909
910	if (cp)
911	{
912	assign (ns->version, cp + 1);
913
914	if (ns->sc_version < 1026)
915	ns->send_packet_printf ("drawinfo %d %s", NDI_RED,
916	"**** VERSION WARNING ****\n**** CLIENT IS TOO OLD!! UPDATE THE CLIENT!! ****");
917	}
918	}	576	}
919		577
920	/** sound related functions. */	578	/** sound related functions. */
921	void	579	void
922	SetSound (char *buf, int len, client * ns)	580	SetSound (char *buf, int len, client * ns)
…		…
940	* syntax is: move (to) (tag) (nrof)	598	* syntax is: move (to) (tag) (nrof)
941	*/	599	*/
942	void	600	void
943	MoveCmd (char *buf, int len, player *pl)	601	MoveCmd (char *buf, int len, player *pl)
944	{	602	{
945	int vals[3], i;	603	int to, tag, nrof;
946		604
947	/* A little funky here. We only cycle for 2 records, because	605	if (3 != sscanf (buf, "%d %d %d", &to, &tag, &nrof))
948	* we obviously are not going to find a space after the third
949	* record. Perhaps we should just replace this with a
950	* sscanf?
951	*/
952	for (i = 0; i < 2; i++)
953	{	606	{
954	vals[i] = atoi (buf);
955
956	if (!(buf = strchr (buf, ' ')))
957	{
958	LOG (llevError, "Incomplete move command: %s\n", buf);	607	LOG (llevError, "Incomplete move command: %s\n", buf);
959	return;	608	return;
960	}
961
962	buf++;
963	}	609	}
964		610
965	vals[2] = atoi (buf);	611	esrv_move_object (pl->ob, to, tag, nrof);
966
967	/* LOG(llevDebug,"Move item %d (nrof=%d) to %d.\n", vals[1], vals[2], vals[0]);*/
968	esrv_move_object (pl->ob, vals[0], vals[1], vals[2]);
969	}	612	}
970		613
971	/******************************************************************************	614	/******************************************************************************
972	*	615	*
973	* Start of commands the server sends to the client.	616	* Start of commands the server sends to the client.
…		…
977	/**	620	/**
978	* Asks the client to query the user. This way, the client knows	621	* Asks the client to query the user. This way, the client knows
979	* it needs to send something back (vs just printing out a message)	622	* it needs to send something back (vs just printing out a message)
980	*/	623	*/
981	void	624	void
982	send_query (client *ns, uint8 flags, char *text)	625	send_query (client *ns, uint8 flags, const char *text)
983	{	626	{
984	ns->send_packet_printf ("query %d %s", flags, text ? text : "");	627	ns->send_packet_printf ("query %d %s", flags, text ? text : "");
		628	}
		629
		630	/**
		631	* Get player's current range attack in obuf.
		632	*/
		633	static void
		634	rangetostring (player *pl, char *obuf)
		635	{
		636	dynbuf_text &buf = msg_dynbuf; buf.clear ();
		637
		638	#if 0
		639	// print ranged/chosen_skill etc. objects every call
		640	printf ("%s %s => %s (%s)\n",
		641	pl->ranged_ob ? &pl->ranged_ob->name : "-",
		642	pl->combat_ob ? &pl->combat_ob->name : "-",
		643	pl->ob->current_weapon ? &pl->ob->current_weapon->name : "-",
		644	pl->ob->chosen_skill ? &pl->ob->chosen_skill->name : "-"
		645	);
		646	#endif
		647
		648	if (pl->ranged_ob)
		649	buf << " Range" << (pl->ob->current_weapon == pl->ranged_ob ? "*" : "") << ": " << pl->ranged_ob->name;
		650
		651	if (pl->combat_ob)
		652	buf << " Combat" << (pl->ob->current_weapon == pl->combat_ob ? "*" : "") << ": " << pl->combat_ob->name;
		653
		654	#if 0
		655	//TODO: remove this when slot system is working, this is only for debugging
		656	if (pl->ob->chosen_skill)
		657	buf << " Skill*: " << pl->ob->chosen_skill->name;
		658	#endif
		659
		660	//TODO: maybe golem should become the current_weapon, quite simply?
		661	if (pl->golem)
		662	buf << " Golem*: " << pl->golem->name;
		663
		664	buf << '\0';
		665	buf.linearise (obuf);
985	}	666	}
986		667
987	#define AddIfInt64(Old,New,Type) if (Old != New) {\	668	#define AddIfInt64(Old,New,Type) if (Old != New) {\
988	Old = New; \	669	Old = New; \
989	sl << uint8 (Type) << uint64 (New); \	670	sl << uint8 (Type) << uint64 (New); \
…		…
997	#define AddIfShort(Old,New,Type) if (Old != New) {\	678	#define AddIfShort(Old,New,Type) if (Old != New) {\
998	Old = New; \	679	Old = New; \
999	sl << uint8 (Type) << uint16 (New); \	680	sl << uint8 (Type) << uint16 (New); \
1000	}	681	}
1001		682
1002	#define AddIfFloat(Old,New,Type) if (Old != New) {\	683	#define AddIfFloat(Old,New,Type,mult) if (Old != New) {\
1003	Old = New; \	684	Old = New; \
1004	sl << uint8 (Type) << uint32 (New*FLOAT_MULTI); \	685	sl << uint8 (Type) << uint32 (New*FLOAT_MULTI*mult); \
1005	}	686	}
1006		687
1007	#define AddIfString(Old,New,Type) if (Old == NULL || strcmp(Old,New)) {\	688	#define AddIfString(Old,New,Type) if (Old == NULL || strcmp(Old,New)) {\
1008	free(Old); Old = strdup (New);\	689	free(Old); Old = strdup (New);\
1009	sl << uint8 (Type) << data8 (New); \	690	sl << uint8 (Type) << data8 (New); \
…		…
1023		704
1024	client *ns = pl->ns;	705	client *ns = pl->ns;
1025	if (!ns)	706	if (!ns)
1026	return;	707	return;
1027		708
1028	object *ob = pl->ob;	709	object *ob = pl->observe;
1029	if (!ob)	710	if (!ob)
1030	return;	711	return;
		712
		713	player *opl = ob->contr ? static_cast<player *>(ob->contr) : pl;
1031		714
1032	packet sl ("stats");	715	packet sl ("stats");
1033		716
1034	AddIfShort (ns->last_stats.hp, ob->stats.hp, CS_STAT_HP);	717	AddIfShort (ns->last_stats.hp, ob->stats.hp, CS_STAT_HP);
1035	AddIfShort (ns->last_stats.maxhp, ob->stats.maxhp, CS_STAT_MAXHP);	718	AddIfShort (ns->last_stats.maxhp, ob->stats.maxhp, CS_STAT_MAXHP);
…		…
1044	AddIfShort (ns->last_stats.Wis, ob->stats.Wis, CS_STAT_WIS);	727	AddIfShort (ns->last_stats.Wis, ob->stats.Wis, CS_STAT_WIS);
1045	AddIfShort (ns->last_stats.Pow, ob->stats.Pow, CS_STAT_POW);	728	AddIfShort (ns->last_stats.Pow, ob->stats.Pow, CS_STAT_POW);
1046	AddIfShort (ns->last_stats.Cha, ob->stats.Cha, CS_STAT_CHA);	729	AddIfShort (ns->last_stats.Cha, ob->stats.Cha, CS_STAT_CHA);
1047		730
1048	for (int s = 0; s < NUM_SKILLS; s++)	731	for (int s = 0; s < NUM_SKILLS; s++)
1049	if (object *skill = pl->last_skill_ob[s])	732	if (object *skill = opl->last_skill_ob [s])
1050	if (skill->stats.exp != ns->last_skill_exp [s])	733	if (skill->stats.exp != ns->last_skill_exp [s])
1051	{	734	{
1052	ns->last_skill_exp [s] = skill->stats.exp;	735	ns->last_skill_exp [s] = skill->stats.exp;
1053		736
1054	/* Always send along the level if exp changes. This is only	737	/* Always send along the level if exp changes. This is only
…		…
1062	AddIfInt64 (ns->last_stats.exp, ob->stats.exp, CS_STAT_EXP64);	745	AddIfInt64 (ns->last_stats.exp, ob->stats.exp, CS_STAT_EXP64);
1063	AddIfShort (ns->last_level, ob->level, CS_STAT_LEVEL);	746	AddIfShort (ns->last_level, ob->level, CS_STAT_LEVEL);
1064	AddIfShort (ns->last_stats.wc, ob->stats.wc, CS_STAT_WC);	747	AddIfShort (ns->last_stats.wc, ob->stats.wc, CS_STAT_WC);
1065	AddIfShort (ns->last_stats.ac, ob->stats.ac, CS_STAT_AC);	748	AddIfShort (ns->last_stats.ac, ob->stats.ac, CS_STAT_AC);
1066	AddIfShort (ns->last_stats.dam, ob->stats.dam, CS_STAT_DAM);	749	AddIfShort (ns->last_stats.dam, ob->stats.dam, CS_STAT_DAM);
1067	AddIfFloat (ns->last_speed, ob->speed, CS_STAT_SPEED);	750	AddIfFloat (ns->last_speed, ob->speed, CS_STAT_SPEED, 1.f / TICK);
1068	AddIfShort (ns->last_stats.food, ob->stats.food, CS_STAT_FOOD);	751	AddIfShort (ns->last_stats.food, ob->stats.food, CS_STAT_FOOD);
1069	AddIfFloat (ns->last_weapon_sp, pl->weapon_sp, CS_STAT_WEAP_SP);	752	AddIfFloat (ns->last_weapon_sp, pl->weapon_sp, CS_STAT_WEAP_SP, 1.f / TICK);
1070	AddIfInt (ns->last_weight_limit, weight_limit[ob->stats.Str], CS_STAT_WEIGHT_LIM);	753	AddIfInt (ns->last_weight_limit, weight_limit[ob->stats.Str], CS_STAT_WEIGHT_LIM);
1071		754
1072	flags = 0;	755	flags = 0;
1073		756
1074	if (pl->fire_on)	757	if (opl->fire_on)
1075	flags |= SF_FIREON;	758	flags |= SF_FIREON;
1076		759
1077	if (pl->run_on)	760	if (opl->run_on)
1078	flags |= SF_RUNON;	761	flags |= SF_RUNON;
1079		762
1080	AddIfShort (ns->last_flags, flags, CS_STAT_FLAGS);	763	AddIfShort (ns->last_flags, flags, CS_STAT_FLAGS);
1081		764
1082	if (ns->sc_version < 1025)
1083	{ AddIfShort (ns->last_resist[ATNR_PHYSICAL], ob->resist[ATNR_PHYSICAL], CS_STAT_ARMOUR) }
1084	else
1085	for (int i = 0; i < NROFATTACKS; i++)	765	for (int i = 0; i < NROFATTACKS; i++)
1086	{	766	{
1087	/* Skip ones we won't send */	767	/* Skip ones we won't send */
1088	if (atnr_cs_stat[i] == -1)	768	if (atnr_cs_stat[i] == -1)
1089	continue;	769	continue;
1090		770
1091	AddIfShort (ns->last_resist[i], ob->resist[i], atnr_cs_stat[i]);	771	AddIfShort (ns->last_resist[i], ob->resist[i], atnr_cs_stat[i]);
1092	}	772	}
1093		773
1094	if (pl->ns->monitor_spells)	774	if (pl->ns->monitor_spells)
1095	{	775	{
1096	AddIfInt (ns->last_path_attuned, ob->path_attuned, CS_STAT_SPELL_ATTUNE);	776	AddIfInt (ns->last_path_attuned, ob->path_attuned, CS_STAT_SPELL_ATTUNE);
1097	AddIfInt (ns->last_path_repelled, ob->path_repelled, CS_STAT_SPELL_REPEL);	777	AddIfInt (ns->last_path_repelled, ob->path_repelled, CS_STAT_SPELL_REPEL);
1098	AddIfInt (ns->last_path_denied, ob->path_denied, CS_STAT_SPELL_DENY);	778	AddIfInt (ns->last_path_denied, ob->path_denied, CS_STAT_SPELL_DENY);
1099	}	779	}
1100		780
1101	rangetostring (ob, buf); /* we want use the new fire & run system in new client */	781	rangetostring (opl, buf); /* we want use the new fire & run system in new client */
1102	AddIfString (ns->stats.range, buf, CS_STAT_RANGE);	782	AddIfString (ns->stats.range, buf, CS_STAT_RANGE);
1103	set_title (ob, buf);	783	set_title (ob, buf);
1104	AddIfString (ns->stats.title, buf, CS_STAT_TITLE);	784	AddIfString (ns->stats.title, buf, CS_STAT_TITLE);
1105		785
1106	/* Only send it away if we have some actual data */	786	/* Only send it away if we have some actual data */
…		…
1110		790
1111	/**	791	/**
1112	* Tells the client that here is a player it should start using.	792	* Tells the client that here is a player it should start using.
1113	*/	793	*/
1114	void	794	void
1115	esrv_new_player (player *pl, uint32 weight)	795	esrv_new_player (player *pl)
1116	{	796	{
		797	sint32 weight = pl->ob->client_weight ();
		798
1117	packet sl ("player");	799	packet sl ("player");
1118		800
1119	sl << uint32 (pl->ob->count)	801	sl << uint32 (pl->ob->count)
1120	<< uint32 (weight)	802	<< uint32 (weight)
1121	<< uint32 (pl->ob->face)	803	<< uint32 (pl->ob->face)
1122	<< data8 (pl->ob->name);	804	<< data8 (pl->ob->name);
1123		805
1124	pl->ns->last_weight = weight;	806	pl->ns->last_weight = weight;
1125	pl->ns->send_packet (sl);	807	pl->ns->send_packet (sl);
1126	SET_FLAG (pl->ob, FLAG_CLIENT_SENT);
1127	}	808	}
1128		809
1129	/******************************************************************************	810	/******************************************************************************
1130	*	811	*
1131	* Start of map related commands.	812	* Start of map related commands.
…		…
1188		869
1189	if (!ns.faces_sent[face_num])	870	if (!ns.faces_sent[face_num])
1190	if (ob)	871	if (ob)
1191	ns.send_faces (ob);	872	ns.send_faces (ob);
1192	else	873	else
1193	ns.send_face (face_num);	874	ns.send_face (face_num, 10);
1194		875
1195	sl << uint16 (face_num);	876	sl << uint16 (face_num);
1196	return 1;	877	return 1;
1197	}	878	}
1198		879
1199	/* Nothing changed */	880	/* Nothing changed */
1200	return 0;	881	return 0;
1201	}	882	}
1202		883
1203	/**	884	//-GPL
1204	* Returns the size of a data for a map square as returned by
1205	* mapextended. There are CLIENTMAPX*CLIENTMAPY*LAYERS entries
1206	* available.
1207	*/
1208	int
1209	getExtendedMapInfoSize (client * ns)
1210	{
1211	int result = 0;
1212
1213	if (ns->ext_mapinfos)
1214	{
1215	if (ns->EMI_smooth)
1216	result += 1; /*One byte for smoothlevel */
1217	}
1218
1219	return result;
1220	}
1221		885
1222	// prefetch (and touch) all maps within a specific distancd	886	// prefetch (and touch) all maps within a specific distancd
1223	static void	887	static void
1224	prefetch_surrounding_maps (maptile *map, int distance)	888	prefetch_surrounding_maps (maptile *map, int distance)
1225	{	889	{
1226	map->last_access = runtime;	890	map->touch ();
1227		891
1228	if (--distance)	892	if (--distance)
1229	for (int dir = 4; --dir; )	893	for (int dir = 4; dir--; )
1230	if (const shstr &path = map->tile_path [dir])	894	if (const shstr &path = map->tile_path [dir])
1231	if (maptile *&neigh = map->tile_map [dir])	895	if (maptile *&neigh = map->tile_map [dir])
1232	prefetch_surrounding_maps (neigh, distance);	896	prefetch_surrounding_maps (neigh, distance);
1233	else	897	else
1234	neigh = maptile::find_async (path, map);	898	neigh = maptile::find_async (path, map);
…		…
1239	prefetch_surrounding_maps (object *op)	903	prefetch_surrounding_maps (object *op)
1240	{	904	{
1241	prefetch_surrounding_maps (op->map, 3);	905	prefetch_surrounding_maps (op->map, 3);
1242	}	906	}
1243		907
		908	//+GPL
		909
1244	/**	910	/**
1245	* This function uses the new map1 protocol command to send the map	911	* Draws client map.
1246	* to the client. It is necessary because the old map command supports
1247	* a maximum map size of 15x15.
1248	* This function is much simpler than the old one. This is because
1249	* the old function optimized to send as few face identifiers as possible,
1250	* at the expense of sending more coordinate location (coordinates were
1251	* only 1 byte, faces 2 bytes, so this was a worthwhile savings). Since
1252	* we need 2 bytes for coordinates and 2 bytes for faces, such a trade off
1253	* maps no sense. Instead, we actually really only use 12 bits for coordinates,
1254	* and use the other 4 bits for other informatiion. For full documentation
1255	* of what we send, see the doc/Protocol file.
1256	* I will describe internally what we do:
1257	* the ns->lastmap shows how the map last looked when sent to the client.
1258	* in the lastmap structure, there is a cells array, which is set to the
1259	* maximum viewable size (As set in config.h).
1260	* in the cells, there are faces and a count value.
1261	* we use the count value to hold the darkness value. If -1, then this space
1262	* is not viewable.
1263	* we use faces[0] faces[1] faces[2] to hold what the three layers
1264	* look like.
1265	*/	912	*/
1266	void	913	void
1267	draw_client_map1 (object *pl)	914	draw_client_map (player *pl)
1268	{	915	{
1269	int x, y, ax, ay, startlen, max_x, max_y, oldlen;	916	object *ob = pl->viewpoint;
1270	sint16 nx, ny;
1271	int estartlen, eoldlen;
1272	uint8 eentrysize;
1273	uint16 ewhatstart, ewhatflag;
1274	uint8 extendedinfos;
1275	maptile *m;
1276
1277	client &socket = *pl->contr->ns;
1278
1279	if (!pl->active)	917	if (!pl->observe->active)
1280	return;	918	return;
1281
1282	check_map_change (pl->contr);
1283	prefetch_surrounding_maps (pl);
1284
1285	packet sl (socket.mapmode == Map1Cmd ? "map1" : "map1a");
1286	packet esl;
1287
1288	startlen = sl.length ();
1289
1290	/*Extendedmapinfo structure initialisation */
1291	if (socket.ext_mapinfos)
1292	{
1293	extendedinfos = EMI_NOREDRAW;
1294
1295	if (socket.EMI_smooth)
1296	extendedinfos |= EMI_SMOOTH;
1297
1298	ewhatstart = esl.length ();
1299	ewhatflag = extendedinfos; /*The EMI_NOREDRAW bit
1300	could need to be taken away */
1301	eentrysize = getExtendedMapInfoSize (&socket);
1302	esl << "mapextended "
1303	<< uint8 (extendedinfos)
1304	<< uint8 (eentrysize);
1305
1306	estartlen = esl.length ();
1307	}
1308
1309	/* x,y are the real map locations. ax, ay are viewport relative
1310	* locations.
1311	*/
1312	ay = 0;
1313
1314	/* We could do this logic as conditionals in the if statement,
1315	* but that started to get a bit messy to look at.
1316	*/
1317	max_x = pl->x + (socket.mapx + 1) / 2;
1318	max_y = pl->y + (socket.mapy + 1) / 2;
1319
1320	maptile *plmap = pl->map;
1321
1322	for (y = pl->y - socket.mapy / 2; y < max_y; y++, ay++)
1323	{
1324	ax = 0;
1325	for (x = pl->x - socket.mapx / 2; x < max_x; x++, ax++)
1326	{
1327	int emask, mask;
1328	emask = mask = (ax & 0x3f) << 10 | (ay & 0x3f) << 4;
1329
1330	MapCell &lastcell = socket.lastmap.cells[ax][ay];
1331
1332	/* If the coordinates are not valid, or it is too dark to see,
1333	* we tell the client as such
1334	*/
1335	nx = x;
1336	ny = y;
1337	m = get_map_from_coord (plmap, &nx, &ny);
1338
1339	if (!m)
1340	{
1341	/* space is out of map. Update space and clear values
1342	* if this hasn't already been done. If the space is out
1343	* of the map, it shouldn't have a head
1344	*/
1345	if (lastcell.count != -1)
1346	{
1347	sl << uint16 (mask);
1348	map_clearcell (&lastcell, -1);
1349	}
1350
1351	continue;
1352	}
1353
1354	m->touch ();
1355
1356	int d = pl->contr->blocked_los[ax][ay];
1357
1358	if (d > 3)
1359	{
1360
1361	int need_send = 0, count;
1362
1363	/* This block deals with spaces that are not visible for whatever
1364	* reason. Still may need to send the head for this space.
1365	*/
1366
1367	oldlen = sl.length ();
1368
1369	sl << uint16 (mask);
1370
1371	if (lastcell.count != -1)
1372	need_send = 1;
1373
1374	count = -1;
1375
1376	/* properly clear a previously sent big face */
1377	if (lastcell.faces[0] || lastcell.faces[1] || lastcell.faces[2]
1378	|| lastcell.stat_hp || lastcell.flags || lastcell.player)
1379	need_send = 1;
1380
1381	map_clearcell (&lastcell, count);
1382
1383	if ((mask & 0xf) || need_send)
1384	sl[oldlen + 1] = mask & 0xff;
1385	else
1386	sl.reset (oldlen);
1387	}
1388	else
1389	{
1390	/* In this block, the space is visible.
1391	*/
1392
1393	/* Rather than try to figure out what everything that we might
1394	* need to send is, then form the packet after that,
1395	* we presume that we will in fact form a packet, and update
1396	* the bits by what we do actually send. If we send nothing,
1397	* we just back out sl.length () to the old value, and no harm
1398	* is done.
1399	* I think this is simpler than doing a bunch of checks to see
1400	* what if anything we need to send, setting the bits, then
1401	* doing those checks again to add the real data.
1402	*/
1403	oldlen = sl.length ();
1404	eoldlen = esl.length ();
1405
1406	sl << uint16 (mask);
1407
1408	unsigned char dummy;
1409	unsigned char *last_ext = &dummy;
1410
1411	/* Darkness changed */
1412	if (lastcell.count != d && socket.darkness)
1413	{
1414	mask |= 0x8;
1415
1416	if (socket.extmap)
1417	{
1418	*last_ext |= 0x80;
1419	last_ext = &sl[sl.length ()];
1420	sl << uint8 (d);
1421	}
1422	else
1423	sl << uint8 (255 - 64 * d);
1424	}
1425
1426	lastcell.count = d;
1427
1428	mapspace &ms = m->at (nx, ny);
1429
1430	if (socket.extmap)
1431	{
1432	uint8 stat_hp = 0;
1433	uint8 stat_width = 0;
1434	uint8 flags = 0;
1435	UUID player = 0;
1436
1437	// send hp information, if applicable
1438	if (object *op = ms.faces_obj [0])
1439	{
1440	if (op->head || op->invisible)
1441	; // do not show
1442	else if (op->type == PLAYER
1443	|| QUERY_FLAG (op, FLAG_MONSTER) || QUERY_FLAG (op, FLAG_ALIVE) || QUERY_FLAG (op, FLAG_GENERATOR))
1444	{
1445	if (op->stats.maxhp > 0 && (unsigned) op->stats.maxhp > (unsigned) op->stats.hp)
1446	{
1447	stat_hp = 255 - (op->stats.hp * 255 + 254) / op->stats.maxhp;
1448	stat_width = op->arch->tail_x;
1449	}
1450	}
1451
1452	if (op->msg && op->msg[0] == '@')
1453	flags |= 1;
1454
1455	if (op->type == PLAYER && op != pl)
1456	player = op->count;
1457	}
1458
1459	if (lastcell.stat_hp != stat_hp)
1460	{
1461	lastcell.stat_hp = stat_hp;
1462
1463	mask |= 0x8;
1464	*last_ext |= 0x80;
1465	last_ext = &sl[sl.length ()];
1466
1467	sl << uint8 (5) << uint8 (stat_hp);
1468
1469	if (stat_width > 1)
1470	{
1471	*last_ext |= 0x80;
1472	last_ext = &sl[sl.length ()];
1473
1474	sl << uint8 (6) << uint8 (stat_width);
1475	}
1476	}
1477
1478	if (lastcell.player != player)
1479	{
1480	lastcell.player = player;
1481
1482	mask |= 0x8;
1483	*last_ext |= 0x80;
1484	last_ext = &sl[sl.length ()];
1485
1486	sl << uint8 (0x47) << uint8 (8) << (uint64)player;
1487	}
1488
1489	if (lastcell.flags != flags)
1490	{
1491	lastcell.flags = flags;
1492
1493	mask |= 0x8;
1494	*last_ext |= 0x80;
1495	last_ext = &sl[sl.length ()];
1496
1497	sl << uint8 (8) << uint8 (flags);
1498	}
1499	}
1500
1501	/* Floor face */
1502	if (update_space (sl, socket, ms, lastcell, 2))
1503	mask |= 0x4;
1504
1505	/* Middle face */
1506	if (update_space (sl, socket, ms, lastcell, 1))
1507	mask |= 0x2;
1508
1509	if (ms.player () == pl
1510	&& (pl->invisible & (pl->invisible < 50 ? 1 : 7)))
1511	{
1512	// force player to be visible to himself if invisible
1513	if (lastcell.faces[0] != pl->face)
1514	{
1515	lastcell.faces[0] = pl->face;
1516
1517	mask |= 0x1;
1518	sl << uint16 (pl->face);
1519
1520	socket.send_faces (pl);
1521	}
1522	}
1523	/* Top face */
1524	else if (update_space (sl, socket, ms, lastcell, 0))
1525	mask |= 0x1;
1526
1527
1528	/* Check to see if we are in fact sending anything for this
1529	* space by checking the mask. If so, update the mask.
1530	* if not, reset the len to that from before adding the mask
1531	* value, so we don't send those bits.
1532	*/
1533	if (mask & 0xf)
1534	sl[oldlen + 1] = mask & 0xff;
1535	else
1536	sl.reset (oldlen);
1537
1538	if (socket.ext_mapinfos)
1539	esl << uint16 (emask);
1540
1541	if (socket.EMI_smooth)
1542	{
1543	for (int layer = 2+1; layer--; )
1544	{
1545	object *ob = ms.faces_obj [layer];
1546
1547	// If there is no object for this space, or if the face for the object
1548	// is the blank face, set the smoothlevel to zero.
1549	int smoothlevel = ob && ob->face != blank_face ? ob->smoothlevel : 0;
1550
1551	// We've gotten what face we want to use for the object. Now see if
1552	// if it has changed since we last sent it to the client.
1553	if (lastcell.smooth[layer] != smoothlevel)
1554	{
1555	lastcell.smooth[layer] = smoothlevel;
1556	esl << uint8 (smoothlevel);
1557	emask |= 1 << layer;
1558	}
1559	}
1560
1561	if (emask & 0xf)
1562	esl[eoldlen + 1] = emask & 0xff;
1563	else
1564	esl.reset (eoldlen);
1565	}
1566	} /* else this is a viewable space */
1567	} /* for x loop */
1568	} /* for y loop */
1569
1570	/* Verify that we in fact do need to send this */
1571	if (socket.ext_mapinfos)
1572	{
1573	if (!(sl.length () > startlen || socket.sent_scroll))
1574	{
1575	/* No map data will follow, so don't say the client
1576	* it doesn't need draw!
1577	*/
1578	ewhatflag &= ~EMI_NOREDRAW;
1579	esl[ewhatstart + 1] = ewhatflag & 0xff;
1580	}
1581
1582	if (esl.length () > estartlen)
1583	socket.send_packet (esl);
1584	}
1585
1586	if (sl.length () > startlen || socket.sent_scroll)
1587	{
1588	socket.send_packet (sl);
1589	socket.sent_scroll = 0;
1590	}
1591	}
1592
1593	/**
1594	* Draws client map.
1595	*/
1596	void
1597	draw_client_map (object *pl)
1598	{
1599	int i, j;
1600	sint16 ax, ay; /* ax and ay goes from 0 to max-size of arrays */
1601	int mflags;
1602	struct Map newmap;
1603	maptile *m, *pm;
1604
1605	if (pl->type != PLAYER)
1606	{
1607	LOG (llevError, "draw_client_map called with non player/non eric-server\n");
1608	return;
1609	}
1610
1611	pm = pl->map;
1612		919
1613	/* If player is just joining the game, he isn't here yet, so the map	920	/* If player is just joining the game, he isn't here yet, so the map
1614	* can get swapped out. If so, don't try to send them a map. All will	921	* can get swapped out. If so, don't try to send them a map. All will
1615	* be OK once they really log in.	922	* be OK once they really log in.
1616	*/	923	*/
1617	if (pm == NULL || pm->in_memory != MAP_IN_MEMORY)	924	if (!ob->map || ob->map->in_memory != MAP_ACTIVE)
1618	return;	925	return;
1619		926
1620	memset (&newmap, 0, sizeof (struct Map));	927	int startlen, oldlen;
1621		928
1622	for (j = (pl->y - pl->contr->ns->mapy / 2); j < (pl->y + (pl->contr->ns->mapy + 1) / 2); j++)	929	check_map_change (pl);
1623	for (i = (pl->x - pl->contr->ns->mapx / 2); i < (pl->x + (pl->contr->ns->mapx + 1) / 2); i++)	930	prefetch_surrounding_maps (pl->ob);
		931
		932	/* do LOS after calls to update_position */
		933	/* unfortunately, we need to udpate los when observing, currently */
		934	if (pl->do_los || pl->viewpoint != pl->ob)
		935	{
		936	pl->do_los = 0;
		937	pl->update_los ();
		938	}
		939
		940	/**
		941	* This function uses the new map1 protocol command to send the map
		942	* to the client. It is necessary because the old map command supports
		943	* a maximum map size of 15x15.
		944	* This function is much simpler than the old one. This is because
		945	* the old function optimized to send as few face identifiers as possible,
		946	* at the expense of sending more coordinate location (coordinates were
		947	* only 1 byte, faces 2 bytes, so this was a worthwhile savings). Since
		948	* we need 2 bytes for coordinates and 2 bytes for faces, such a trade off
		949	* maps no sense. Instead, we actually really only use 12 bits for coordinates,
		950	* and use the other 4 bits for other informatiion. For full documentation
		951	* of what we send, see the doc/Protocol file.
		952	* I will describe internally what we do:
		953	* the ns->lastmap shows how the map last looked when sent to the client.
		954	* in the lastmap structure, there is a cells array, which is set to the
		955	* maximum viewable size (As set in config.h).
		956	* in the cells, there are faces and a count value.
		957	* we use the count value to hold the darkness value. If -1, then this space
		958	* is not viewable.
		959	* we use faces[0] faces[1] faces[2] to hold what the three layers
		960	* look like.
		961	*/
		962
		963	client &socket = *pl->ns;
		964
		965	packet sl (socket.mapmode == Map1Cmd ? "map1" : "map1a");
		966
		967	startlen = sl.length ();
		968
		969	int hx = socket.mapx / 2;
		970	int hy = socket.mapy / 2;
		971
		972	ordered_mapwalk_begin (ob, -hx, -hy, hx, hy)
		973	int ax = dx + hx;
		974	int ay = dy + hy;
		975
		976	int mask = (ax << 10) | (ay << 4);
		977	MapCell &lastcell = socket.lastmap.cells[ax][ay];
		978
		979	/* If the coordinates are not valid, or it is too dark to see,
		980	* we tell the client as such
		981	*/
		982	if (!m)
1624	{	983	{
1625	ax = i;	984	/* space is out of map. Update space and clear values
1626	ay = j;	985	* if this hasn't already been done. If the space is out
1627	m = pm;	986	* of the map, it shouldn't have a head.
1628	mflags = get_map_flags (m, &m, ax, ay, &ax, &ay);
1629
1630	if (mflags & P_OUT_OF_MAP)
1631	continue;
1632
1633	/* If a map is visible to the player, we don't want to swap it out
1634	* just to reload it. This should really call something like
1635	* swap_map, but this is much more efficient and 'good enough'
1636	*/	987	*/
1637	if (mflags & P_NEW_MAP)	988	if (lastcell.count != -1)
1638	m->timeout = 50;	989	{
		990	sl << uint16 (mask);
		991	map_clearcell (&lastcell, -1);
		992	}
		993
		994	continue;
1639	}	995	}
1640		996
1641	/* do LOS after calls to update_position */	997	int d = pl->blocked_los_uc (dx, dy);
1642	if (pl->contr->do_los)	998
		999	if (d > 3)
1643	{	1000	{
1644	update_los (pl);	1001	/* This block deals with spaces that are not visible for whatever
1645	pl->contr->do_los = 0;	1002	* reason. Still may need to send the head for this space.
		1003	*/
		1004	if (lastcell.count != -1
		1005	|| lastcell.faces[0]
		1006	|| lastcell.faces[1]
		1007	|| lastcell.faces[2]
		1008	|| lastcell.stat_hp
		1009	|| lastcell.flags
		1010	|| lastcell.player)
		1011	sl << uint16 (mask);
		1012
		1013	/* properly clear a previously sent big face */
		1014	map_clearcell (&lastcell, -1);
1646	}	1015	}
1647		1016	else
1648	/* Big maps need a different drawing mechanism to work */
1649	draw_client_map1 (pl);
1650	}
1651
1652
1653	/*****************************************************************************/
1654
1655	/* GROS: The following one is used to allow a plugin to send a generic cmd to*/
1656
1657	/* a player. Of course, the client need to know the command to be able to */
1658
1659	/* manage it ! */
1660
1661	/*****************************************************************************/
1662	void
1663	send_plugin_custom_message (object *pl, char *buf)
1664	{
1665	pl->contr->ns->send_packet (buf);
1666	}
1667
1668	/**
1669	* This sends the skill number to name mapping. We ignore
1670	* the params - we always send the same info no matter what.
1671	*/
1672	void
1673	send_skill_info (client *ns, char *params)
1674	{
1675	packet sl;
1676	sl << "replyinfo skill_info\n";
1677
1678	for (int i = 1; i < NUM_SKILLS; i++)
1679	sl.printf ("%d:%s\n", i + CS_STAT_SKILLINFO, &skill_names[i]);
1680
1681	if (sl.length () >= MAXSOCKBUF)
1682	{	1017	{
1683	LOG (llevError, "Buffer overflow in send_skill_info!\n");	1018	/* In this block, the space is visible.
1684	fatal (0);	1019	*/
		1020
		1021	/* Rather than try to figure out what everything that we might
		1022	* need to send is, then form the packet after that,
		1023	* we presume that we will in fact form a packet, and update
		1024	* the bits by what we do actually send. If we send nothing,
		1025	* we just back out sl.length () to the old value, and no harm
		1026	* is done.
		1027	* I think this is simpler than doing a bunch of checks to see
		1028	* what if anything we need to send, setting the bits, then
		1029	* doing those checks again to add the real data.
		1030	*/
		1031	oldlen = sl.length ();
		1032
		1033	sl << uint16 (mask);
		1034
		1035	unsigned char dummy;
		1036	unsigned char *last_ext = &dummy;
		1037
		1038	/* Darkness changed */
		1039	if (lastcell.count != d)
		1040	{
		1041	mask |= 0x8;
		1042
		1043	*last_ext |= 0x80;
		1044	last_ext = &sl[sl.length ()];
		1045	sl << uint8 (d);
		1046	}
		1047
		1048	lastcell.count = d;
		1049
		1050	mapspace &ms = m->at (nx, ny);
		1051	ms.update ();
		1052
		1053	// extmap handling
		1054	uint8 stat_hp = 0;
		1055	uint8 stat_width = 0;
		1056	uint8 flags = 0;
		1057	tag_t player = 0;
		1058
		1059	// send hp information, if applicable
		1060	if (object *op = ms.faces_obj [0])
		1061	if (op->is_head () && !op->invisible)
		1062	{
		1063	if (op->stats.maxhp > op->stats.hp
		1064	&& op->stats.maxhp > 0
		1065	&& (op->type == PLAYER
		1066	|| op->type == DOOR // does not work, have maxhp 0
		1067	|| op->flag [FLAG_MONSTER]
		1068	|| op->flag [FLAG_ALIVE]
		1069	|| op->flag [FLAG_GENERATOR]))
		1070	{
		1071	stat_hp = 255 - (op->stats.hp * 255 + 254) / op->stats.maxhp;
		1072	stat_width = op->arch->max_x - op->arch->x; //TODO: should be upper-left edge
		1073	}
		1074
		1075	if (expect_false (op->has_dialogue ()))
		1076	flags |= 1;
		1077
		1078	if (expect_false (op->type == PLAYER))
		1079	player = op == ob ? pl->ob->count
		1080	: op == pl->ob ? ob->count
		1081	: op->count;
		1082	}
		1083
		1084	if (expect_false (lastcell.stat_hp != stat_hp))
		1085	{
		1086	lastcell.stat_hp = stat_hp;
		1087
		1088	mask |= 0x8;
		1089	*last_ext |= 0x80;
		1090	last_ext = &sl[sl.length ()];
		1091
		1092	sl << uint8 (5) << uint8 (stat_hp);
		1093
		1094	if (stat_width > 1)
		1095	{
		1096	*last_ext |= 0x80;
		1097	last_ext = &sl[sl.length ()];
		1098
		1099	sl << uint8 (6) << uint8 (stat_width);
		1100	}
		1101	}
		1102
		1103	if (expect_false (lastcell.player != player))
		1104	{
		1105	lastcell.player = player;
		1106
		1107	mask |= 0x8;
		1108	*last_ext |= 0x80;
		1109	last_ext = &sl[sl.length ()];
		1110
		1111	sl << uint8 (0x47) << uint8 (4) << (uint32)player;
		1112	}
		1113
		1114	if (expect_false (lastcell.flags != flags))
		1115	{
		1116	lastcell.flags = flags;
		1117
		1118	mask |= 0x8;
		1119	*last_ext |= 0x80;
		1120	last_ext = &sl[sl.length ()];
		1121
		1122	sl << uint8 (8) << uint8 (flags);
		1123	}
		1124
		1125	// faces
		1126
		1127	/* Floor face */
		1128	if (update_space (sl, socket, ms, lastcell, 2))
		1129	mask |= 0x4;
		1130
		1131	/* Middle face */
		1132	if (update_space (sl, socket, ms, lastcell, 1))
		1133	mask |= 0x2;
		1134
		1135	if (expect_false (ob->invisible)
		1136	&& ob->invisible & (ob->invisible < 50 ? 1 : 7)
		1137	&& ms.player () == ob)
		1138	{
		1139	// force player to be visible to himself if invisible
		1140	if (lastcell.faces[0] != ob->face)
		1141	{
		1142	lastcell.faces[0] = ob->face;
		1143
		1144	mask |= 0x1;
		1145	sl << uint16 (ob->face);
		1146
		1147	socket.send_faces (ob);
		1148	}
		1149	}
		1150	/* Top face */
		1151	else if (update_space (sl, socket, ms, lastcell, 0))
		1152	mask |= 0x1;
		1153
		1154	/* Check to see if we are in fact sending anything for this
		1155	* space by checking the mask. If so, update the mask.
		1156	* if not, reset the len to that from before adding the mask
		1157	* value, so we don't send those bits.
		1158	*/
		1159	if (mask & 0xf)
		1160	sl[oldlen + 1] = mask & 0xff;
		1161	else
		1162	sl.reset (oldlen);
		1163	} /* else this is a viewable space */
		1164	ordered_mapwalk_end
		1165
		1166	socket.flush_fx ();
		1167
		1168	if (sl.length () > startlen || socket.sent_scroll)
1685	}	1169	{
1686
1687	ns->send_packet (sl);	1170	socket.send_packet (sl);
1688	}	1171	socket.sent_scroll = 0;
1689
1690	/**
1691	* This sends the spell path to name mapping. We ignore
1692	* the params - we always send the same info no matter what.
1693	*/
1694	void
1695	send_spell_paths (client * ns, char *params)
1696	{
1697	packet sl;
1698
1699	sl << "replyinfo spell_paths\n";
1700
1701	for (int i = 0; i < NRSPELLPATHS; i++)
1702	sl.printf ("%d:%s\n", 1 << i, spellpathnames[i]);
1703
1704	if (sl.length () >= MAXSOCKBUF)
1705	{	1172	}
1706	LOG (llevError, "Buffer overflow in send_spell_paths!\n");
1707	fatal (0);
1708	}
1709
1710	ns->send_packet (sl);
1711	}	1173	}
1712		1174
1713	/**	1175	/**
1714	* This looks for any spells the player may have that have changed their stats.	1176	* This looks for any spells the player may have that have changed their stats.
1715	* it then sends an updspell packet for each spell that has changed in this way	1177	* it then sends an updspell packet for each spell that has changed in this way
…		…
1718	esrv_update_spells (player *pl)	1180	esrv_update_spells (player *pl)
1719	{	1181	{
1720	if (!pl->ns)	1182	if (!pl->ns)
1721	return;	1183	return;
1722		1184
		1185	pl->ns->update_spells = false;
		1186
1723	if (!pl->ns->monitor_spells)	1187	if (!pl->ns->monitor_spells)
1724	return;	1188	return;
1725		1189
1726	for (object *spell = pl->ob->inv; spell; spell = spell->below)	1190	for (object *spell = pl->ob->inv; spell; spell = spell->below)
1727	{
1728	if (spell->type == SPELL)	1191	if (spell->type == SPELL)
1729	{	1192	{
1730	int flags = 0;	1193	int flags = 0;
		1194	int val;
1731		1195
1732	/* check if we need to update it */	1196	/* check if we need to update it */
1733	if (spell->last_sp != SP_level_spellpoint_cost (pl->ob, spell, SPELL_MANA))	1197	val = SP_level_spellpoint_cost (pl->ob, spell, SPELL_MANA);
		1198	if (spell->cached_sp != val)
1734	{	1199	{
1735	spell->last_sp = SP_level_spellpoint_cost (pl->ob, spell, SPELL_MANA);	1200	spell->cached_sp = val;
1736	flags |= UPD_SP_MANA;	1201	flags |= UPD_SP_MANA;
1737	}	1202	}
1738		1203
1739	if (spell->last_grace != SP_level_spellpoint_cost (pl->ob, spell, SPELL_GRACE))	1204	val = SP_level_spellpoint_cost (pl->ob, spell, SPELL_GRACE);
		1205	if (spell->cached_grace != val)
1740	{	1206	{
1741	spell->last_grace = SP_level_spellpoint_cost (pl->ob, spell, SPELL_GRACE);	1207	spell->cached_grace = val;
1742	flags |= UPD_SP_GRACE;	1208	flags |= UPD_SP_GRACE;
1743	}	1209	}
1744		1210
1745	if (spell->last_eat != spell->stats.dam + SP_level_dam_adjust (pl->ob, spell))	1211	val = casting_level (pl->ob, spell);
		1212	if (spell->cached_eat != val)
1746	{	1213	{
1747	spell->last_eat = spell->stats.dam + SP_level_dam_adjust (pl->ob, spell);	1214	spell->cached_eat = val;
1748	flags |= UPD_SP_DAMAGE;	1215	flags |= UPD_SP_LEVEL;
1749	}	1216	}
1750		1217
1751	if (flags)	1218	if (flags)
1752	{	1219	{
1753	packet sl;	1220	packet sl;
1754		1221
1755	sl << "updspell "	1222	sl << "updspell "
1756	<< uint8 (flags)	1223	<< uint8 (flags)
1757	<< uint32 (spell->count);	1224	<< uint32 (spell->count);
1758		1225
1759	if (flags & UPD_SP_MANA ) sl << uint16 (spell->last_sp);	1226	if (flags & UPD_SP_MANA ) sl << uint16 (spell->cached_sp);
1760	if (flags & UPD_SP_GRACE ) sl << uint16 (spell->last_grace);	1227	if (flags & UPD_SP_GRACE) sl << uint16 (spell->cached_grace);
1761	if (flags & UPD_SP_DAMAGE) sl << uint16 (spell->last_eat);	1228	if (flags & UPD_SP_LEVEL) sl << uint16 (spell->cached_eat);
1762		1229
1763	pl->ns->send_packet (sl);	1230	pl->ns->send_packet (sl);
1764	}	1231	}
1765	}	1232	}
1766	}
1767	}	1233	}
1768		1234
1769	void	1235	void
1770	esrv_remove_spell (player *pl, object *spell)	1236	esrv_remove_spell (player *pl, object *spell)
1771	{	1237	{
…		…
1796	LOG (llevError, "item number %d is a spell with no name.\n", spell->count);	1262	LOG (llevError, "item number %d is a spell with no name.\n", spell->count);
1797	return;	1263	return;
1798	}	1264	}
1799		1265
1800	/* store costs and damage in the object struct, to compare to later */	1266	/* store costs and damage in the object struct, to compare to later */
1801	spell->last_sp = SP_level_spellpoint_cost (pl->ob, spell, SPELL_MANA);	1267	spell->cached_sp = SP_level_spellpoint_cost (pl->ob, spell, SPELL_MANA);
1802	spell->last_grace = SP_level_spellpoint_cost (pl->ob, spell, SPELL_GRACE);	1268	spell->cached_grace = SP_level_spellpoint_cost (pl->ob, spell, SPELL_GRACE);
1803	spell->last_eat = spell->stats.dam + SP_level_dam_adjust (pl->ob, spell);	1269	spell->cached_eat = casting_level (pl->ob, spell);
1804		1270
1805	/* figure out which skill it uses, if it uses one */	1271	/* figure out which skill it uses, if it uses one */
1806	if (spell->skill)	1272	if (spell->skill)
1807	{	1273	if (object *tmp = pl->find_skill (spell->skill))
1808	for (i = 1; i < NUM_SKILLS; i++)
1809	if (!strcmp (spell->skill, skill_names[i]))
1810	{
1811	skill = i + CS_STAT_SKILLINFO;	1274	skill = tmp->subtype + CS_STAT_SKILLINFO;
1812	break;
1813	}
1814	}
1815		1275
1816	// spells better have a face	1276	// spells better have a face
1817	if (!spell->face)	1277	if (!spell->face)
1818	{	1278	{
1819	LOG (llevError, "%s: spell has no face, but face is mandatory.\n", &spell->name);	1279	LOG (llevError, "%s: spell has no face, but face is mandatory.\n", &spell->name);
1820	spell->face = face_find ("burnout.x11", blank_face);	1280	spell->face = face_find ("burnout.x11", blank_face);
1821	}	1281	}
		1282
		1283	pl->ns->send_face (spell->face);
1822		1284
1823	/* send the current values */	1285	/* send the current values */
1824	sl << uint32 (spell->count)	1286	sl << uint32 (spell->count)
1825	<< uint16 (spell->level)	1287	<< uint16 (spell->level)
1826	<< uint16 (spell->casting_time)	1288	<< uint16 (spell->casting_time)
1827	<< uint16 (spell->last_sp)	1289	<< uint16 (spell->cached_sp)
1828	<< uint16 (spell->last_grace)	1290	<< uint16 (spell->cached_grace)
1829	<< uint16 (spell->last_eat)	1291	<< uint16 (spell->cached_eat)
1830	<< uint8 (skill)	1292	<< uint8 (skill)
1831	<< uint32 (spell->path_attuned)	1293	<< uint32 (spell->path_attuned)
1832	<< uint32 (spell->face)	1294	<< uint32 (spell->face)
1833	<< data8 (spell->name)	1295	<< data8 (spell->name)
1834	<< data16 (spell->msg);	1296	<< data16 (spell->msg);
…		…
1862	* bytes and 3 strings (because that is the spec) so we need to	1324	* bytes and 3 strings (because that is the spec) so we need to
1863	* check that the length of those 3 strings, plus the 23 bytes,	1325	* check that the length of those 3 strings, plus the 23 bytes,
1864	* won't take us over the length limit for the socket, if it does,	1326	* won't take us over the length limit for the socket, if it does,
1865	* we need to send what we already have, and restart packet formation	1327	* we need to send what we already have, and restart packet formation
1866	*/	1328	*/
		1329	if (spell->type != SPELL)
		1330	continue;
		1331
1867	/* Seeing crashes by overflowed buffers. Quick arithemetic seems	1332	/* Seeing crashes by overflowed buffers. Quick arithemetic seems
1868	* to show add_spell is 26 bytes + 2 strings. However, the overun	1333	* to show add_spell is 26 bytes + 2 strings. However, the overun
1869	* is hundreds of bytes off, so correcting 22 vs 26 doesn't seem	1334	* is hundreds of bytes off, so correcting 22 vs 26 doesn't seem
1870	* like it will fix this	1335	* like it will fix this
1871	*/	1336	*/
1872	if (spell->type != SPELL)
1873	continue;
1874
1875	if (sl.length () >= (MAXSOCKBUF - (26 + strlen (spell->name) + (spell->msg ? strlen (spell->msg) : 0))))	1337	if (sl.length () > (MAXSOCKBUF - (26 + strlen (spell->name) + (spell->msg ? strlen (spell->msg) : 0))))
1876	{	1338	{
		1339	pl->ns->flush_fx ();
1877	pl->ns->send_packet (sl);	1340	pl->ns->send_packet (sl);
1878		1341
1879	sl.reset ();	1342	sl.reset ();
1880	sl << "addspell ";	1343	sl << "addspell ";
1881	}	1344	}
…		…
1889	return;	1352	return;
1890	}	1353	}
1891	else	1354	else
1892	append_spell (pl, sl, spell);	1355	append_spell (pl, sl, spell);
1893		1356
1894	if (sl.length () >= MAXSOCKBUF)	1357	if (sl.length () > MAXSOCKBUF)
1895	{	1358	{
1896	LOG (llevError, "Buffer overflow in esrv_add_spells!\n");	1359	LOG (llevError, "Buffer overflow in esrv_add_spells!\n");
1897	fatal (0);	1360	fatal (0);
1898	}	1361	}
1899		1362
1900	/* finally, we can send the packet */	1363	/* finally, we can send the packet */
		1364	pl->ns->flush_fx ();
1901	pl->ns->send_packet (sl);	1365	pl->ns->send_packet (sl);
1902	}	1366	}
1903		1367
		1368	//-GPL
		1369

Diff Legend

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