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

Diff Legend

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