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.83 by root, Mon Apr 2 18:04:47 2007 UTC vs.
Revision 1.183 by root, Sat May 7 20:03:28 2011 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 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] =
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	pl->ns->force_newmap = false;	150	pl->ns->force_newmap = false;
138
139	if (pl->ns->newmapcmd == 1)
140	pl->ns->send_packet ("newmap");	151	pl->ns->send_packet ("newmap");
141
142	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	}
143	}	183	}
144		184
145	/** check for map/region change and send new map data */	185	/** check for map/region change and send new map data */
146	static void	186	static void
147	check_map_change (player *pl)	187	check_map_change (player *pl)
148	{	188	{
149	client &socket = *pl->ns;	189	client &socket = *pl->ns;
150	object *ob = pl->ob;	190	object *ob = pl->viewpoint;
151	char buf[MAX_BUF]; /* eauugggh */
152		191
153	if (socket.force_newmap)	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;
154	{	197	}
155	// force newmap is used for clients that do not redraw their map	198
156	// after image uploads.	199	// first try to aovid 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	{
157	socket.current_map = ob->map;	209	socket.current_map = ob->map;
158	clear_map (pl);	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	}
159	}	217	}
160	else if (socket.current_map != ob->map)	218
		219	if (socket.current_map != ob->map || socket.force_newmap)
161	{	220	{
162	clear_map (pl);	221	clear_map (pl);
163	socket.current_map = ob->map;	222	socket.current_map = ob->map;
164		223	send_map_info (pl);
165	if (socket.mapinfocmd)
166	{
167	if (ob->map && ob->map->path[0])
168	{
169	int flags = 0;
170
171	if (ob->map->tile_path[0])
172	flags |= 1;
173	if (ob->map->tile_path[1])
174	flags |= 2;
175	if (ob->map->tile_path[2])
176	flags |= 4;
177	if (ob->map->tile_path[3])
178	flags |= 8;
179
180	snprintf (buf, MAX_BUF, "mapinfo - spatial %d %d %d %d %d %s",
181	flags, socket.mapx / 2 - ob->x, socket.mapy / 2 - ob->y, ob->map->width, ob->map->height, &ob->map->path);
182	}
183	else
184	snprintf (buf, MAX_BUF, "mapinfo current");
185
186	socket.send_packet (buf);
187	}
188	}	224	}
189	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)
190	{	226	{
191	int dx = ob->x - socket.current_x;	227	int dx = ob->x - socket.current_x;
192	int dy = ob->y - socket.current_y;	228	int dy = ob->y - socket.current_y;
193		229
194	if (socket.buggy_mapscroll && (abs (dx) > 8 || abs (dy) > 8))
195	clear_map (pl); // current (<= 1.9.1) clients have unchecked buffer overflows
196	else
197	{
198	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);
199	socket.floorbox_reset ();	231	socket.floorbox_reset ();
200	}
201	}	232	}
202		233
203	socket.current_x = ob->x;	234	socket.current_x = ob->x;
204	socket.current_y = ob->y;	235	socket.current_y = ob->y;
		236	}
205		237
206	region *reg = ob->region ();	238	/**
207	if (socket.current_region != reg)	239	* This sends the skill number to name mapping. We ignore
208	{	240	* the params - we always send the same info no matter what.
209	socket.current_region = reg;	241	*/
210	socket.send_packet_printf ("drawinfo 0 You are now %s.\n(use whereami for more details)", &reg->longname);	242	static void
211	}	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);
212	}	275	}
213		276
214	/**	277	/**
215	* RequestInfo is sort of a meta command. There is some specific	278	* RequestInfo is sort of a meta command. There is some specific
216	* request of information, but we call other functions to provide	279	* request of information, but we call other functions to provide
217	* that information.	280	* that information.
218	*/	281	*/
219	void	282	void
220	RequestInfo (char *buf, int len, client * ns)	283	RequestInfo (char *buf, int len, client *ns)
221	{	284	{
222	char *params = NULL, *cp;	285	char *params;
223
224	/* No match */
225	char bigbuf[MAX_BUF];
226	int slen;
227
228	/* Set up replyinfo before we modify any of the buffers - this is used
229	* if we don't find a match.
230	*/
231	strcpy (bigbuf, "replyinfo ");
232	slen = strlen (bigbuf);
233	safe_strcat (bigbuf, buf, &slen, MAX_BUF);
234		286
235	/* find the first space, make it null, and update the	287	/* find the first space, make it null, and update the
236	* params pointer.	288	* params pointer.
237	*/	289	*/
238	for (cp = buf; *cp != '\0'; cp++)	290	for (params = buf; *params; params++)
239	if (*cp == ' ')	291	if (*params == ' ')
240	{	292	{
241	*cp = '\0';
242	params = cp + 1;	293	*params++ = 0;
243	break;	294	break;
244	}	295	}
245		296
246	if (!strcmp (buf, "image_info"))
247	send_image_info (ns, params);
248	else if (!strcmp (buf, "image_sums"))
249	send_image_sums (ns, params);
250	else if (!strcmp (buf, "skill_info"))	297	if (!strcmp (buf, "skill_info"))
251	send_skill_info (ns, params);	298	send_skill_info (ns, params);
252	else if (!strcmp (buf, "spell_paths"))	299	else if (!strcmp (buf, "spell_paths"))
253	send_spell_paths (ns, params);	300	send_spell_paths (ns, params);
254	else	301	else
255	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	}
256	}	309	}
257		310
258	void	311	void
259	ExtCmd (char *buf, int len, player *pl)	312	ExtCmd (char *buf, int len, player *pl)
260	{	313	{
…		…
263		316
264	void	317	void
265	ExtiCmd (char *buf, int len, client *ns)	318	ExtiCmd (char *buf, int len, client *ns)
266	{	319	{
267	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 (dir >= 0 && dir < 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;
268	}	419	}
269		420
270	void	421	void
271	MapInfoCmd (char *buf, int len, player *pl)	422	MapInfoCmd (char *buf, int len, player *pl)
272	{	423	{
273	// <mapinfo tag spatial tile-path	424	// <mapinfo tag spatial tile-path
274	// >mapinfo tag spatial flags x y w h hash	425	// >mapinfo tag spatial flags x y w h hash
275		426
276	char bigbuf[MAX_BUF], *token;
277
278	token = buf;	427	char *token = buf;
279	// copy token	428
280	if (!(buf = strchr (buf, ' ')))	429	if (!(buf = strchr (buf, ' ')))
281	return;	430	return;
282		431
283	*buf++ = 0;
284
285	if (!strncmp (buf, "spatial ", 8))	432	if (!strncmp (buf, " spatial ", 9))
286	{	433	{
287	buf += 8;	434	char *copy = strdup (token);
		435	copy [buf - token] = 0;
288		436
289	// initial map and its origin	437	#if 0
290	maptile *map = pl->ob->map;	438	// this makes only sense when we flush the buffer immediately
291	sint16 dx, dy;	439	if (pl->ns->mapinfo_try (copy))
292	int mapx = pl->ns->mapx / 2 - pl->ob->x;	440	free (copy);
293	int mapy = pl->ns->mapy / 2 - pl->ob->y;
294	int max_distance = 8; // limit maximum path length to something generous
295
296	while (*buf && map && max_distance)
297	{
298	int dir = *buf++;
299
300	switch (dir)
301	{
302	case '1':
303	dx = 0;
304	dy = -1;
305	map = map->xy_find (dx, dy);
306	map && (mapy -= map->height);
307	break;
308	case '2':
309	mapx += map->width;
310	dx = map->width;
311	dy = 0;
312	map = map->xy_find (dx, dy);
313	break;
314	case '3':
315	mapy += map->height;
316	dx = 0;
317	dy = map->height;
318	map = map->xy_find (dx, dy);
319	break;
320	case '4':
321	dx = -1;
322	dy = 0;
323	map = map->xy_find (dx, dy);
324	map && (mapx -= map->width);
325	break;
326	}
327
328	--max_distance;
329	}
330
331	if (!max_distance)
332	snprintf (bigbuf, MAX_BUF, "mapinfo %s error", token);
333	else if (map && map->path[0])
334	{
335	int flags = 0;
336
337	if (map->tile_path[0])
338	flags |= 1;
339	if (map->tile_path[1])
340	flags |= 2;
341	if (map->tile_path[2])
342	flags |= 4;
343	if (map->tile_path[3])
344	flags |= 8;
345
346	snprintf (bigbuf, MAX_BUF, "mapinfo %s spatial %d %d %d %d %d %s", token, flags, mapx, mapy, map->width, map->height, &map->path);
347	}
348	else	441	else
349	snprintf (bigbuf, MAX_BUF, "mapinfo %s nomap", token);	442	#endif
		443	pl->ns->mapinfo_queue.push_back (copy);
350	}	444	}
351	else	445	else
352	snprintf (bigbuf, MAX_BUF, "mapinfo %s unsupported", token);	446	pl->ns->send_packet_printf ("mapinfo %s unsupported", token);
353
354	pl->ns->send_packet (bigbuf);
355	}	447	}
356		448
357	/** This is the Setup cmd */	449	/** This is the Setup cmd */
358	void	450	void
359	SetUp (char *buf, int len, client * ns)	451	SetUp (char *buf, int len, client * ns)
…		…
371	AddMeCmd (char *buf, int len, client *ns)	463	AddMeCmd (char *buf, int len, client *ns)
372	{	464	{
373	INVOKE_CLIENT (ADDME, ns, ARG_DATA (buf, len));	465	INVOKE_CLIENT (ADDME, ns, ARG_DATA (buf, len));
374	}	466	}
375		467
376	/** Reply to ExtendedInfos command */	468	//+GPL
377	void
378	ToggleExtendedInfos (char *buf, int len, client * ns)
379	{
380	char cmdback[MAX_BUF];
381	char command[50];
382	int info, nextinfo;
383
384	cmdback[0] = '\0';
385	nextinfo = 0;
386
387	while (1)
388	{
389	/* 1. Extract an info */
390	info = nextinfo;
391
392	while ((info < len) && (buf[info] == ' '))
393	info++;
394
395	if (info >= len)
396	break;
397
398	nextinfo = info + 1;
399
400	while ((nextinfo < len) && (buf[nextinfo] != ' '))
401	nextinfo++;
402
403	if (nextinfo - info >= 49) /*Erroneous info asked */
404	continue;
405
406	strncpy (command, &(buf[info]), nextinfo - info);
407
408	/* 2. Interpret info */
409	if (!strcmp ("smooth", command))
410	/* Toggle smoothing */
411	ns->EMI_smooth = !ns->EMI_smooth;
412	else
413	/*bad value */;
414
415	/*3. Next info */
416	}
417
418	strcpy (cmdback, "ExtendedInfoSet");
419
420	if (ns->EMI_smooth)
421	{
422	strcat (cmdback, " ");
423	strcat (cmdback, "smoothing");
424	}
425
426	ns->send_packet (cmdback);
427	}
428
429	/*
430	#define MSG_TYPE_BOOK 1
431	#define MSG_TYPE_CARD 2
432	#define MSG_TYPE_PAPER 3
433	#define MSG_TYPE_SIGN 4
434	#define MSG_TYPE_MONUMENT 5
435	#define MSG_TYPE_SCRIPTED_DIALOG 6*/
436
437	/** Reply to ExtendedInfos command */
438	void
439	ToggleExtendedText (char *buf, int len, client * ns)
440	{
441	char cmdback[MAX_BUF];
442	char temp[10];
443	char command[50];
444	int info, nextinfo, i, flag;
445
446	cmdback[0] = '\0';
447
448	nextinfo = 0;
449	while (1)
450	{
451	/* 1. Extract an info */
452	info = nextinfo;
453
454	while ((info < len) && (buf[info] == ' '))
455	info++;
456
457	if (info >= len)
458	break;
459
460	nextinfo = info + 1;
461
462	while ((nextinfo < len) && (buf[nextinfo] != ' '))
463	nextinfo++;
464
465	if (nextinfo - info >= 49) /*Erroneous info asked */
466	continue;
467
468	strncpy (command, &(buf[info]), nextinfo - info);
469	command[nextinfo - info] = '\0';
470	/* 2. Interpret info */
471	i = sscanf (command, "%d", &flag);
472
473	if ((i == 1) && (flag > 0) && (flag <= MSG_TYPE_LAST))
474	ns->supported_readables |= (1 << flag);
475	/*3. Next info */
476	}
477
478	/* Send resulting state */
479	strcpy (cmdback, "ExtendedTextSet");
480
481	for (i = 0; i <= MSG_TYPE_LAST; i++)
482	if (ns->supported_readables & (1 << i))
483	{
484	strcat (cmdback, " ");
485	snprintf (temp, sizeof (temp), "%d", i);
486	strcat (cmdback, temp);
487	}
488
489	ns->send_packet (cmdback);
490	}
491
492	/**
493	* client requested an image. send it rate-limited
494	* before flushing.
495	*/
496	void
497	AskFaceCmd (char *buf, int len, client *ns)
498	{
499	ns->askface.push_back (atoi (buf));
500	}
501
502	/**
503	* Tells client the picture it has to use
504	* to smooth a picture number given as argument.
505	*/
506	void
507	AskSmooth (char *buf, int len, client *ns)
508	{
509	ns->send_face (atoi (buf));
510	}
511		469
512	/**	470	/**
513	* 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,
514	* etc.)	472	* etc.)
515	*/	473	*/
…		…
528	return;	486	return;
529		487
530	buf++;	488	buf++;
531	}	489	}
532		490
533	execute_newserver_command (pl->ob, (char *) buf);	491	execute_newserver_command (pl->ob, (char *)buf);
534		492
535	/* Perhaps something better should be done with a left over count.	493	/* Perhaps something better should be done with a left over count.
536	* Cleaning up the input should probably be done first - all actions	494	* Cleaning up the input should probably be done first - all actions
537	* 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
538	* commands.	496	* commands.
539	*/	497	*/
540	pl->count = 0;	498	pl->count = 0;
541	}	499	}
542		500
543
544	/**	501	/**
545	* 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,
546	* 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
547	* '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
548	* can throttle.	505	* can throttle.
…		…
550	void	507	void
551	NewPlayerCmd (char *buf, int len, player *pl)	508	NewPlayerCmd (char *buf, int len, player *pl)
552	{	509	{
553	if (len <= 6)	510	if (len <= 6)
554	{	511	{
555	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);
556	return;	513	return;
557	}	514	}
558		515
559	uint16 cmdid = net_uint16 ((uint8 *)buf);	516	uint16 cmdid = net_uint16 ((uint8 *)buf);
560	sint32 repeat = net_sint32 ((uint8 *)buf + 2);	517	sint32 repeat = net_sint32 ((uint8 *)buf + 2);
…		…
573	* commands.	530	* commands.
574	*/	531	*/
575	pl->count = 0;	532	pl->count = 0;
576		533
577	//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
578	int time = fabs (pl->ob->speed) < 0.001	535	int time = pl->ob->has_active_speed ()
579	? time = MAX_TIME * 100
580	: time = (int) (MAX_TIME / fabs (pl->ob->speed));	536	? (int) (MAX_TIME / pl->ob->speed)
		537	: MAX_TIME * 100;
581		538
582	/* Send confirmation of command execution now */	539	/* Send confirmation of command execution now */
583	packet sl ("comc");	540	packet sl ("comc");
584	sl << uint16 (cmdid) << uint32 (time);	541	sl << uint16 (cmdid) << uint32 (time);
585	pl->ns->send_packet (sl);	542	pl->ns->send_packet (sl);
…		…
617	{	574	{
618	case ST_PLAYING:	575	case ST_PLAYING:
619	LOG (llevError, "Got reply message with ST_PLAYING input state\n");	576	LOG (llevError, "Got reply message with ST_PLAYING input state\n");
620	break;	577	break;
621		578
622	case ST_CHANGE_CLASS:
623	key_change_class (pl->ob, buf[0]);
624	break;
625
626	case ST_GET_PARTY_PASSWORD: /* Get password for party */	579	case ST_GET_PARTY_PASSWORD: /* Get password for party */
627	receive_party_password (pl->ob, 13);	580	receive_party_password (pl->ob, 13);
628	break;	581	break;
629		582
630	default:	583	default:
631	LOG (llevError, "Unknown input state: %d\n", ns->state);	584	LOG (llevError, "Unknown input state: %d\n", ns->state);
632	}	585	}
633	}	586	}
634		587
635	/**	588	/**
636	* Client tells its version. If there is a mismatch, we close the	589	* Client tells its version info.
637	* socket. In real life, all we should care about is the client having
638	* something older than the server. If we assume the client will be
639	* backwards compatible, having it be a later version should not be a
640	* problem.
641	*/	590	*/
642	void	591	void
643	VersionCmd (char *buf, int len, client * ns)	592	VersionCmd (char *buf, int len, client *ns)
644	{	593	{
645	if (!buf)	594	INVOKE_CLIENT (VERSION, ns, ARG_DATA (buf, len));
646	{
647	LOG (llevError, "CS: received corrupted version command\n");
648	return;
649	}
650
651	ns->cs_version = atoi (buf);
652	ns->sc_version = ns->cs_version;
653
654	LOG (llevDebug, "connection from client <%s>\n", buf);
655
656	//TODO: should log here just for statistics
657
658	//if (VERSION_CS != ns->cs_version)
659	// unchecked;
660
661	char *cp = strchr (buf + 1, ' ');
662	if (!cp)
663	return;
664
665	ns->sc_version = atoi (cp);
666
667	//if (VERSION_SC != ns->sc_version)
668	// unchecked;
669
670	cp = strchr (cp + 1, ' ');
671
672	if (cp)
673	{
674	assign (ns->version, cp + 1);
675
676	if (ns->sc_version < 1026)
677	ns->send_packet_printf ("drawinfo %d %s", NDI_RED,
678	"**** VERSION WARNING ****\n**** CLIENT IS TOO OLD!! UPDATE THE CLIENT!! ****");
679	}
680	}	595	}
681		596
682	/** sound related functions. */	597	/** sound related functions. */
683	void	598	void
684	SetSound (char *buf, int len, client * ns)	599	SetSound (char *buf, int len, client * ns)
…		…
702	* syntax is: move (to) (tag) (nrof)	617	* syntax is: move (to) (tag) (nrof)
703	*/	618	*/
704	void	619	void
705	MoveCmd (char *buf, int len, player *pl)	620	MoveCmd (char *buf, int len, player *pl)
706	{	621	{
707	int vals[3], i;	622	int to, tag, nrof;
708		623
709	/* A little funky here. We only cycle for 2 records, because	624	if (3 != sscanf (buf, "%d %d %d", &to, &tag, &nrof))
710	* we obviously are not going to find a space after the third
711	* record. Perhaps we should just replace this with a
712	* sscanf?
713	*/
714	for (i = 0; i < 2; i++)
715	{	625	{
716	vals[i] = atoi (buf);
717
718	if (!(buf = strchr (buf, ' ')))
719	{
720	LOG (llevError, "Incomplete move command: %s\n", buf);	626	LOG (llevError, "Incomplete move command: %s\n", buf);
721	return;	627	return;
722	}
723
724	buf++;
725	}	628	}
726		629
727	vals[2] = atoi (buf);	630	esrv_move_object (pl->ob, to, tag, nrof);
728
729	/* LOG(llevDebug,"Move item %d (nrof=%d) to %d.\n", vals[1], vals[2], vals[0]);*/
730	esrv_move_object (pl->ob, vals[0], vals[1], vals[2]);
731	}	631	}
732		632
733	/******************************************************************************	633	/******************************************************************************
734	*	634	*
735	* Start of commands the server sends to the client.	635	* Start of commands the server sends to the client.
…		…
744	send_query (client *ns, uint8 flags, const char *text)	644	send_query (client *ns, uint8 flags, const char *text)
745	{	645	{
746	ns->send_packet_printf ("query %d %s", flags, text ? text : "");	646	ns->send_packet_printf ("query %d %s", flags, text ? text : "");
747	}	647	}
748		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);
		685	}
		686
749	#define AddIfInt64(Old,New,Type) if (Old != New) {\	687	#define AddIfInt64(Old,New,Type) if (Old != New) {\
750	Old = New; \	688	Old = New; \
751	sl << uint8 (Type) << uint64 (New); \	689	sl << uint8 (Type) << uint64 (New); \
752	}	690	}
753		691
…		…
759	#define AddIfShort(Old,New,Type) if (Old != New) {\	697	#define AddIfShort(Old,New,Type) if (Old != New) {\
760	Old = New; \	698	Old = New; \
761	sl << uint8 (Type) << uint16 (New); \	699	sl << uint8 (Type) << uint16 (New); \
762	}	700	}
763		701
764	#define AddIfFloat(Old,New,Type) if (Old != New) {\	702	#define AddIfFloat(Old,New,Type,mult) if (Old != New) {\
765	Old = New; \	703	Old = New; \
766	sl << uint8 (Type) << uint32 (New*FLOAT_MULTI); \	704	sl << uint8 (Type) << uint32 (New*FLOAT_MULTI*mult); \
767	}	705	}
768		706
769	#define AddIfString(Old,New,Type) if (Old == NULL || strcmp(Old,New)) {\	707	#define AddIfString(Old,New,Type) if (Old == NULL || strcmp(Old,New)) {\
770	free(Old); Old = strdup (New);\	708	free(Old); Old = strdup (New);\
771	sl << uint8 (Type) << data8 (New); \	709	sl << uint8 (Type) << data8 (New); \
…		…
778	* commands for now.	716	* commands for now.
779	*/	717	*/
780	void	718	void
781	esrv_update_stats (player *pl)	719	esrv_update_stats (player *pl)
782	{	720	{
783	char buf[MAX_BUF];
784	uint16 flags;
785
786	client *ns = pl->ns;	721	client *ns = pl->ns;
787	if (!ns)	722	if (!ns)
788	return;	723	return;
789		724
790	object *ob = pl->ob;	725	object *ob = pl->observe;
791	if (!ob)	726	if (!ob)
792	return;	727	return;
		728
		729	player *opl = ob->contr ? static_cast<player *>(ob->contr) : pl;
793		730
794	packet sl ("stats");	731	packet sl ("stats");
795		732
796	AddIfShort (ns->last_stats.hp, ob->stats.hp, CS_STAT_HP);	733	AddIfShort (ns->last_stats.hp, ob->stats.hp, CS_STAT_HP);
797	AddIfShort (ns->last_stats.maxhp, ob->stats.maxhp, CS_STAT_MAXHP);	734	AddIfShort (ns->last_stats.maxhp, ob->stats.maxhp, CS_STAT_MAXHP);
…		…
805	AddIfShort (ns->last_stats.Int, ob->stats.Int, CS_STAT_INT);	742	AddIfShort (ns->last_stats.Int, ob->stats.Int, CS_STAT_INT);
806	AddIfShort (ns->last_stats.Wis, ob->stats.Wis, CS_STAT_WIS);	743	AddIfShort (ns->last_stats.Wis, ob->stats.Wis, CS_STAT_WIS);
807	AddIfShort (ns->last_stats.Pow, ob->stats.Pow, CS_STAT_POW);	744	AddIfShort (ns->last_stats.Pow, ob->stats.Pow, CS_STAT_POW);
808	AddIfShort (ns->last_stats.Cha, ob->stats.Cha, CS_STAT_CHA);	745	AddIfShort (ns->last_stats.Cha, ob->stats.Cha, CS_STAT_CHA);
809		746
810	for (int s = 0; s < NUM_SKILLS; s++)	747	for (int s = 0; s < CS_NUM_SKILLS; s++)
811	if (object *skill = pl->last_skill_ob[s])	748	if (object *skill = opl->last_skill_ob [s])
812	if (skill->stats.exp != ns->last_skill_exp [s])	749	if (skill->stats.exp != ns->last_skill_exp [s])
813	{	750	{
814	ns->last_skill_exp [s] = skill->stats.exp;	751	ns->last_skill_exp [s] = skill->stats.exp;
815		752
816	/* Always send along the level if exp changes. This is only	753	/* Always send along the level if exp changes. This is only
817	* 1 extra byte, but keeps processing simpler.	754	* 1 extra byte, but keeps processing simpler.
818	*/	755	*/
819	sl << uint8 (s + CS_STAT_SKILLINFO)	756	sl << uint8 (CS_STAT_SKILLINFO + s)
820	<< uint8 (skill->level)	757	<< uint8 (skill->level)
821	<< uint64 (skill->stats.exp);	758	<< uint64 (skill->stats.exp);
822	}	759	}
823		760
824	AddIfInt64 (ns->last_stats.exp, ob->stats.exp, CS_STAT_EXP64);	761	AddIfInt64 (ns->last_stats.exp, ob->stats.exp, CS_STAT_EXP64);
825	AddIfShort (ns->last_level, ob->level, CS_STAT_LEVEL);	762	AddIfShort (ns->last_level, ob->level, CS_STAT_LEVEL);
826	AddIfShort (ns->last_stats.wc, ob->stats.wc, CS_STAT_WC);	763	AddIfShort (ns->last_stats.wc, ob->stats.wc, CS_STAT_WC);
827	AddIfShort (ns->last_stats.ac, ob->stats.ac, CS_STAT_AC);	764	AddIfShort (ns->last_stats.ac, ob->stats.ac, CS_STAT_AC);
828	AddIfShort (ns->last_stats.dam, ob->stats.dam, CS_STAT_DAM);	765	AddIfShort (ns->last_stats.dam, ob->stats.dam, CS_STAT_DAM);
829	AddIfFloat (ns->last_speed, ob->speed, CS_STAT_SPEED);	766	AddIfFloat (ns->last_speed, ob->speed, CS_STAT_SPEED, 1.f / TICK);
830	AddIfShort (ns->last_stats.food, ob->stats.food, CS_STAT_FOOD);	767	AddIfShort (ns->last_stats.food, ob->stats.food, CS_STAT_FOOD);
831	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);
832	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);
833		770
834	flags = 0;	771	int flags = (opl->fire_on ? SF_FIREON : 0)
835		772	| (opl->run_on ? SF_RUNON : 0);
836	if (pl->fire_on)
837	flags |= SF_FIREON;
838
839	if (pl->run_on)
840	flags |= SF_RUNON;
841		773
842	AddIfShort (ns->last_flags, flags, CS_STAT_FLAGS);	774	AddIfShort (ns->last_flags, flags, CS_STAT_FLAGS);
843		775
844	if (ns->sc_version < 1025)
845	{ AddIfShort (ns->last_resist[ATNR_PHYSICAL], ob->resist[ATNR_PHYSICAL], CS_STAT_ARMOUR) }
846	else
847	for (int i = 0; i < NROFATTACKS; i++)	776	for (int i = 0; i < NROFATTACKS; i++)
848	{
849	/* Skip ones we won't send */	777	/* Skip ones we won't send */
850	if (atnr_cs_stat[i] == -1)	778	if (atnr_cs_stat[i] >= 0)
851	continue;
852
853	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]);
854	}
855		780
856	if (pl->ns->monitor_spells)	781	if (pl->ns->monitor_spells)
857	{	782	{
858	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);
859	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);
860	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);
861	}	786	}
862		787
		788	char buf[MAX_BUF];
863	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 */
864	AddIfString (ns->stats.range, buf, CS_STAT_RANGE);	790	AddIfString (ns->stats.range, buf, CS_STAT_RANGE);
865	set_title (ob, buf);	791	set_title (ob, buf);
866	AddIfString (ns->stats.title, buf, CS_STAT_TITLE);	792	AddIfString (ns->stats.title, buf, CS_STAT_TITLE);
867		793
868	/* Only send it away if we have some actual data */	794	/* Only send it away if we have some actual data */
…		…
872		798
873	/**	799	/**
874	* 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.
875	*/	801	*/
876	void	802	void
877	esrv_new_player (player *pl, uint32 weight)	803	esrv_new_player (player *pl)
878	{	804	{
		805	sint32 weight = pl->ob->client_weight ();
		806
879	packet sl ("player");	807	packet sl ("player");
880		808
881	sl << uint32 (pl->ob->count)	809	sl << uint32 (pl->ob->count)
882	<< uint32 (weight)	810	<< uint32 (weight)
883	<< uint32 (pl->ob->face)	811	<< uint32 (pl->ob->face)
884	<< data8 (pl->ob->name);	812	<< data8 (pl->ob->name);
885		813
886	pl->ns->last_weight = weight;	814	pl->ns->last_weight = weight;
887	pl->ns->send_packet (sl);	815	pl->ns->send_packet (sl);
888	SET_FLAG (pl->ob, FLAG_CLIENT_SENT);
889	}	816	}
890		817
891	/******************************************************************************	818	/******************************************************************************
892	*	819	*
893	* Start of map related commands.	820	* Start of map related commands.
…		…
950		877
951	if (!ns.faces_sent[face_num])	878	if (!ns.faces_sent[face_num])
952	if (ob)	879	if (ob)
953	ns.send_faces (ob);	880	ns.send_faces (ob);
954	else	881	else
955	ns.send_face (face_num);	882	ns.send_face (face_num, 10);
956		883
957	sl << uint16 (face_num);	884	sl << uint16 (face_num);
958	return 1;	885	return 1;
959	}	886	}
960		887
961	/* Nothing changed */	888	/* Nothing changed */
962	return 0;	889	return 0;
963	}	890	}
964		891
965	/**	892	//-GPL
966	* Returns the size of a data for a map square as returned by
967	* mapextended. There are CLIENTMAPX*CLIENTMAPY*LAYERS entries
968	* available.
969	*/
970	int
971	getExtendedMapInfoSize (client * ns)
972	{
973	int result = 0;
974		893
975	if (ns->ext_mapinfos)	894	// prefetch some flat area around the player
976	{
977	if (ns->EMI_smooth)
978	result += 1; /*One byte for smoothlevel */
979	}
980
981	return result;
982	}
983
984	// prefetch (and touch) all maps within a specific distancd
985	static void	895	static void
986	prefetch_surrounding_maps (maptile *map, int distance)	896	prefetch_surrounding_area (object *op, maptile *map, int range)
987	{	897	{
988	map->last_access = runtime;	898	for (maprect *rect = map->split_to_tiles (mapwalk_buf,
989		899	op->x - range , op->y - range ,
990	if (--distance)	900	op->x + range + 1, op->y + range + 1);
991	for (int dir = 4; --dir; )	901	rect->m;
992	if (const shstr &path = map->tile_path [dir])	902	++rect)
993	if (maptile *&neigh = map->tile_map [dir])	903	{
994	prefetch_surrounding_maps (neigh, distance);	904	rect->m->touch ();
995	else	905	rect->m->activate ();
996	neigh = maptile::find_async (path, map);	906	}
997	}	907	}
998		908
999	// prefetch a generous area around the player	909	// prefetch a generous area around the player, also up and down
1000	static void	910	void
1001	prefetch_surrounding_maps (object *op)	911	object::prefetch_surrounding_maps ()
1002	{	912	{
1003	prefetch_surrounding_maps (op->map, 3);	913	prefetch_surrounding_area (this, map, 40);
1004	}
1005		914
		915	if (maptile *m = map->tile_available (TILE_DOWN))
		916	prefetch_surrounding_area (this, m, 20);
		917
		918	if (maptile *m = map->tile_available (TILE_UP))
		919	prefetch_surrounding_area (this, m, 20);
		920	}
		921
		922	//+GPL
		923
1006	/**	924	/**
1007	* This function uses the new map1 protocol command to send the map	925	* Draws client map.
1008	* to the client. It is necessary because the old map command supports
1009	* a maximum map size of 15x15.
1010	* This function is much simpler than the old one. This is because
1011	* the old function optimized to send as few face identifiers as possible,
1012	* at the expense of sending more coordinate location (coordinates were
1013	* only 1 byte, faces 2 bytes, so this was a worthwhile savings). Since
1014	* we need 2 bytes for coordinates and 2 bytes for faces, such a trade off
1015	* maps no sense. Instead, we actually really only use 12 bits for coordinates,
1016	* and use the other 4 bits for other informatiion. For full documentation
1017	* of what we send, see the doc/Protocol file.
1018	* I will describe internally what we do:
1019	* the ns->lastmap shows how the map last looked when sent to the client.
1020	* in the lastmap structure, there is a cells array, which is set to the
1021	* maximum viewable size (As set in config.h).
1022	* in the cells, there are faces and a count value.
1023	* we use the count value to hold the darkness value. If -1, then this space
1024	* is not viewable.
1025	* we use faces[0] faces[1] faces[2] to hold what the three layers
1026	* look like.
1027	*/	926	*/
1028	void	927	void
1029	draw_client_map1 (object *pl)	928	draw_client_map (player *pl)
1030	{	929	{
1031	int x, y, ax, ay, startlen, max_x, max_y, oldlen;	930	object *ob = pl->viewpoint;
1032	sint16 nx, ny;
1033	int estartlen, eoldlen;
1034	uint8 eentrysize;
1035	uint16 ewhatstart, ewhatflag;
1036	uint8 extendedinfos;
1037	maptile *m;
1038
1039	client &socket = *pl->contr->ns;
1040
1041	if (!pl->active)	931	if (!pl->observe->active)
1042	return;	932	return;
1043
1044	check_map_change (pl->contr);
1045	prefetch_surrounding_maps (pl);
1046
1047	packet sl (socket.mapmode == Map1Cmd ? "map1" : "map1a");
1048	packet esl;
1049
1050	startlen = sl.length ();
1051
1052	/*Extendedmapinfo structure initialisation */
1053	if (socket.ext_mapinfos)
1054	{
1055	extendedinfos = EMI_NOREDRAW;
1056
1057	if (socket.EMI_smooth)
1058	extendedinfos |= EMI_SMOOTH;
1059
1060	ewhatstart = esl.length ();
1061	ewhatflag = extendedinfos; /*The EMI_NOREDRAW bit
1062	could need to be taken away */
1063	eentrysize = getExtendedMapInfoSize (&socket);
1064	esl << "mapextended "
1065	<< uint8 (extendedinfos)
1066	<< uint8 (eentrysize);
1067
1068	estartlen = esl.length ();
1069	}
1070
1071	/* x,y are the real map locations. ax, ay are viewport relative
1072	* locations.
1073	*/
1074	ay = 0;
1075
1076	/* We could do this logic as conditionals in the if statement,
1077	* but that started to get a bit messy to look at.
1078	*/
1079	max_x = pl->x + (socket.mapx + 1) / 2;
1080	max_y = pl->y + (socket.mapy + 1) / 2;
1081
1082	maptile *plmap = pl->map;
1083
1084	for (y = pl->y - socket.mapy / 2; y < max_y; y++, ay++)
1085	{
1086	ax = 0;
1087	for (x = pl->x - socket.mapx / 2; x < max_x; x++, ax++)
1088	{
1089	int emask, mask;
1090	emask = mask = (ax & 0x3f) << 10 | (ay & 0x3f) << 4;
1091
1092	MapCell &lastcell = socket.lastmap.cells[ax][ay];
1093
1094	/* If the coordinates are not valid, or it is too dark to see,
1095	* we tell the client as such
1096	*/
1097	nx = x;
1098	ny = y;
1099	m = get_map_from_coord (plmap, &nx, &ny);
1100
1101	if (!m)
1102	{
1103	/* space is out of map. Update space and clear values
1104	* if this hasn't already been done. If the space is out
1105	* of the map, it shouldn't have a head
1106	*/
1107	if (lastcell.count != -1)
1108	{
1109	sl << uint16 (mask);
1110	map_clearcell (&lastcell, -1);
1111	}
1112
1113	continue;
1114	}
1115
1116	m->touch ();
1117
1118	int d = pl->contr->blocked_los[ax][ay];
1119
1120	if (d > 3)
1121	{
1122
1123	int need_send = 0, count;
1124
1125	/* This block deals with spaces that are not visible for whatever
1126	* reason. Still may need to send the head for this space.
1127	*/
1128
1129	oldlen = sl.length ();
1130
1131	sl << uint16 (mask);
1132
1133	if (lastcell.count != -1)
1134	need_send = 1;
1135
1136	count = -1;
1137
1138	/* properly clear a previously sent big face */
1139	if (lastcell.faces[0] || lastcell.faces[1] || lastcell.faces[2]
1140	|| lastcell.stat_hp || lastcell.flags || lastcell.player)
1141	need_send = 1;
1142
1143	map_clearcell (&lastcell, count);
1144
1145	if ((mask & 0xf) || need_send)
1146	sl[oldlen + 1] = mask & 0xff;
1147	else
1148	sl.reset (oldlen);
1149	}
1150	else
1151	{
1152	/* In this block, the space is visible.
1153	*/
1154
1155	/* Rather than try to figure out what everything that we might
1156	* need to send is, then form the packet after that,
1157	* we presume that we will in fact form a packet, and update
1158	* the bits by what we do actually send. If we send nothing,
1159	* we just back out sl.length () to the old value, and no harm
1160	* is done.
1161	* I think this is simpler than doing a bunch of checks to see
1162	* what if anything we need to send, setting the bits, then
1163	* doing those checks again to add the real data.
1164	*/
1165	oldlen = sl.length ();
1166	eoldlen = esl.length ();
1167
1168	sl << uint16 (mask);
1169
1170	unsigned char dummy;
1171	unsigned char *last_ext = &dummy;
1172
1173	/* Darkness changed */
1174	if (lastcell.count != d && socket.darkness)
1175	{
1176	mask |= 0x8;
1177
1178	if (socket.extmap)
1179	{
1180	*last_ext |= 0x80;
1181	last_ext = &sl[sl.length ()];
1182	sl << uint8 (d);
1183	}
1184	else
1185	sl << uint8 (255 - 64 * d);
1186	}
1187
1188	lastcell.count = d;
1189
1190	mapspace &ms = m->at (nx, ny);
1191
1192	if (socket.extmap)
1193	{
1194	uint8 stat_hp = 0;
1195	uint8 stat_width = 0;
1196	uint8 flags = 0;
1197	UUID player = 0;
1198
1199	// send hp information, if applicable
1200	if (object *op = ms.faces_obj [0])
1201	{
1202	if (op->head || op->invisible)
1203	; // do not show
1204	else if (op->type == PLAYER
1205	|| QUERY_FLAG (op, FLAG_MONSTER) || QUERY_FLAG (op, FLAG_ALIVE) || QUERY_FLAG (op, FLAG_GENERATOR))
1206	{
1207	if (op->stats.maxhp > 0 && (unsigned) op->stats.maxhp > (unsigned) op->stats.hp)
1208	{
1209	stat_hp = 255 - (op->stats.hp * 255 + 254) / op->stats.maxhp;
1210	stat_width = op->arch->tail_x;
1211	}
1212	}
1213
1214	if (op->msg && op->msg[0] == '@')
1215	flags |= 1;
1216
1217	if (op->type == PLAYER && op != pl)
1218	player = op->count;
1219	}
1220
1221	if (lastcell.stat_hp != stat_hp)
1222	{
1223	lastcell.stat_hp = stat_hp;
1224
1225	mask |= 0x8;
1226	*last_ext |= 0x80;
1227	last_ext = &sl[sl.length ()];
1228
1229	sl << uint8 (5) << uint8 (stat_hp);
1230
1231	if (stat_width > 1)
1232	{
1233	*last_ext |= 0x80;
1234	last_ext = &sl[sl.length ()];
1235
1236	sl << uint8 (6) << uint8 (stat_width);
1237	}
1238	}
1239
1240	if (lastcell.player != player)
1241	{
1242	lastcell.player = player;
1243
1244	mask |= 0x8;
1245	*last_ext |= 0x80;
1246	last_ext = &sl[sl.length ()];
1247
1248	sl << uint8 (0x47) << uint8 (8) << (uint64)player;
1249	}
1250
1251	if (lastcell.flags != flags)
1252	{
1253	lastcell.flags = flags;
1254
1255	mask |= 0x8;
1256	*last_ext |= 0x80;
1257	last_ext = &sl[sl.length ()];
1258
1259	sl << uint8 (8) << uint8 (flags);
1260	}
1261	}
1262
1263	/* Floor face */
1264	if (update_space (sl, socket, ms, lastcell, 2))
1265	mask |= 0x4;
1266
1267	/* Middle face */
1268	if (update_space (sl, socket, ms, lastcell, 1))
1269	mask |= 0x2;
1270
1271	if (ms.player () == pl
1272	&& (pl->invisible & (pl->invisible < 50 ? 1 : 7)))
1273	{
1274	// force player to be visible to himself if invisible
1275	if (lastcell.faces[0] != pl->face)
1276	{
1277	lastcell.faces[0] = pl->face;
1278
1279	mask |= 0x1;
1280	sl << uint16 (pl->face);
1281
1282	socket.send_faces (pl);
1283	}
1284	}
1285	/* Top face */
1286	else if (update_space (sl, socket, ms, lastcell, 0))
1287	mask |= 0x1;
1288
1289
1290	/* Check to see if we are in fact sending anything for this
1291	* space by checking the mask. If so, update the mask.
1292	* if not, reset the len to that from before adding the mask
1293	* value, so we don't send those bits.
1294	*/
1295	if (mask & 0xf)
1296	sl[oldlen + 1] = mask & 0xff;
1297	else
1298	sl.reset (oldlen);
1299
1300	if (socket.ext_mapinfos)
1301	esl << uint16 (emask);
1302
1303	if (socket.EMI_smooth)
1304	{
1305	for (int layer = 2+1; layer--; )
1306	{
1307	object *ob = ms.faces_obj [layer];
1308
1309	// If there is no object for this space, or if the face for the object
1310	// is the blank face, set the smoothlevel to zero.
1311	int smoothlevel = ob && ob->face != blank_face ? ob->smoothlevel : 0;
1312
1313	// We've gotten what face we want to use for the object. Now see if
1314	// if it has changed since we last sent it to the client.
1315	if (lastcell.smooth[layer] != smoothlevel)
1316	{
1317	lastcell.smooth[layer] = smoothlevel;
1318	esl << uint8 (smoothlevel);
1319	emask |= 1 << layer;
1320	}
1321	}
1322
1323	if (emask & 0xf)
1324	esl[eoldlen + 1] = emask & 0xff;
1325	else
1326	esl.reset (eoldlen);
1327	}
1328	} /* else this is a viewable space */
1329	} /* for x loop */
1330	} /* for y loop */
1331
1332	/* Verify that we in fact do need to send this */
1333	if (socket.ext_mapinfos)
1334	{
1335	if (!(sl.length () > startlen || socket.sent_scroll))
1336	{
1337	/* No map data will follow, so don't say the client
1338	* it doesn't need draw!
1339	*/
1340	ewhatflag &= ~EMI_NOREDRAW;
1341	esl[ewhatstart + 1] = ewhatflag & 0xff;
1342	}
1343
1344	if (esl.length () > estartlen)
1345	socket.send_packet (esl);
1346	}
1347
1348	if (sl.length () > startlen || socket.sent_scroll)
1349	{
1350	socket.send_packet (sl);
1351	socket.sent_scroll = 0;
1352	}
1353	}
1354
1355	/**
1356	* Draws client map.
1357	*/
1358	void
1359	draw_client_map (object *pl)
1360	{
1361	int i, j;
1362	sint16 ax, ay; /* ax and ay goes from 0 to max-size of arrays */
1363	int mflags;
1364	struct Map newmap;
1365	maptile *m, *pm;
1366
1367	if (pl->type != PLAYER)
1368	{
1369	LOG (llevError, "draw_client_map called with non player/non eric-server\n");
1370	return;
1371	}
1372
1373	pm = pl->map;
1374		933
1375	/* If player is just joining the game, he isn't here yet, so the map	934	/* If player is just joining the game, he isn't here yet, so the map
1376	* can get swapped out. If so, don't try to send them a map. All will	935	* can get swapped out. If so, don't try to send them a map. All will
1377	* be OK once they really log in.	936	* be OK once they really log in.
1378	*/	937	*/
1379	if (pm == NULL || pm->in_memory != MAP_IN_MEMORY)	938	if (!ob->map || ob->map->state != MAP_ACTIVE)
1380	return;	939	return;
1381		940
1382	memset (&newmap, 0, sizeof (struct Map));	941	int startlen, oldlen;
1383		942
1384	for (j = (pl->y - pl->contr->ns->mapy / 2); j < (pl->y + (pl->contr->ns->mapy + 1) / 2); j++)	943	check_map_change (pl);
1385	for (i = (pl->x - pl->contr->ns->mapx / 2); i < (pl->x + (pl->contr->ns->mapx + 1) / 2); i++)	944	pl->ob->prefetch_surrounding_maps ();
		945
		946	/* do LOS after calls to update_position */
		947	/* unfortunately, we need to udpate los when observing, currently */
		948	if (pl->do_los || pl->viewpoint != pl->ob)
		949	{
		950	pl->do_los = 0;
		951	pl->update_los ();
		952	}
		953
		954	/**
		955	* This function uses the new map1 protocol command to send the map
		956	* to the client. It is necessary because the old map command supports
		957	* a maximum map size of 15x15.
		958	* This function is much simpler than the old one. This is because
		959	* the old function optimized to send as few face identifiers as possible,
		960	* at the expense of sending more coordinate location (coordinates were
		961	* only 1 byte, faces 2 bytes, so this was a worthwhile savings). Since
		962	* we need 2 bytes for coordinates and 2 bytes for faces, such a trade off
		963	* maps no sense. Instead, we actually really only use 12 bits for coordinates,
		964	* and use the other 4 bits for other informatiion. For full documentation
		965	* of what we send, see the doc/Protocol file.
		966	* I will describe internally what we do:
		967	* the ns->lastmap shows how the map last looked when sent to the client.
		968	* in the lastmap structure, there is a cells array, which is set to the
		969	* maximum viewable size (As set in config.h).
		970	* in the cells, there are faces and a count value.
		971	* we use the count value to hold the darkness value. If -1, then this space
		972	* is not viewable.
		973	* we use faces[0] faces[1] faces[2] to hold what the three layers
		974	* look like.
		975	*/
		976
		977	client &socket = *pl->ns;
		978
		979	packet sl ("map1a");
		980
		981	startlen = sl.length ();
		982
		983	int hx = socket.mapx / 2;
		984	int hy = socket.mapy / 2;
		985
		986	ordered_mapwalk_begin (ob, -hx, -hy, hx, hy)
		987	int ax = dx + hx;
		988	int ay = dy + hy;
		989
		990	int mask = (ax << 10) | (ay << 4);
		991	MapCell &lastcell = socket.lastmap.cells[ax][ay];
		992
		993	/* If the coordinates are not valid, or it is too dark to see,
		994	* we tell the client as such
		995	*/
		996	if (!m)
1386	{	997	{
1387	ax = i;	998	/* space is out of map. Update space and clear values
1388	ay = j;	999	* if this hasn't already been done. If the space is out
1389	m = pm;	1000	* of the map, it shouldn't have a head.
1390	mflags = get_map_flags (m, &m, ax, ay, &ax, &ay);
1391
1392	if (mflags & P_OUT_OF_MAP)
1393	continue;
1394
1395	/* If a map is visible to the player, we don't want to swap it out
1396	* just to reload it. This should really call something like
1397	* swap_map, but this is much more efficient and 'good enough'
1398	*/	1001	*/
1399	if (mflags & P_NEW_MAP)	1002	if (lastcell.count != -1)
1400	m->timeout = 50;	1003	{
		1004	sl << uint16 (mask);
		1005	map_clearcell (&lastcell, -1);
		1006	}
		1007
		1008	continue;
1401	}	1009	}
1402		1010
1403	/* do LOS after calls to update_position */	1011	int d = pl->blocked_los_uc (dx, dy);
1404	if (pl->contr->do_los)	1012
		1013	if (d > 3)
1405	{	1014	{
1406	update_los (pl);	1015	/* This block deals with spaces that are not visible for whatever
1407	pl->contr->do_los = 0;	1016	* reason. Still may need to send the head for this space.
		1017	*/
		1018	if (lastcell.count != -1
		1019	|| lastcell.faces[0]
		1020	|| lastcell.faces[1]
		1021	|| lastcell.faces[2]
		1022	|| lastcell.stat_hp
		1023	|| lastcell.flags
		1024	|| lastcell.player)
		1025	sl << uint16 (mask);
		1026
		1027	/* properly clear a previously sent big face */
		1028	map_clearcell (&lastcell, -1);
1408	}	1029	}
1409		1030	else
1410	/* Big maps need a different drawing mechanism to work */
1411	draw_client_map1 (pl);
1412	}
1413
1414
1415	/*****************************************************************************/
1416
1417	/* GROS: The following one is used to allow a plugin to send a generic cmd to*/
1418
1419	/* a player. Of course, the client need to know the command to be able to */
1420
1421	/* manage it ! */
1422
1423	/*****************************************************************************/
1424	void
1425	send_plugin_custom_message (object *pl, char *buf)
1426	{
1427	pl->contr->ns->send_packet (buf);
1428	}
1429
1430	/**
1431	* This sends the skill number to name mapping. We ignore
1432	* the params - we always send the same info no matter what.
1433	*/
1434	void
1435	send_skill_info (client *ns, char *params)
1436	{
1437	packet sl;
1438	sl << "replyinfo skill_info\n";
1439
1440	for (int i = 1; i < NUM_SKILLS; i++)
1441	sl.printf ("%d:%s\n", i + CS_STAT_SKILLINFO, &skill_names[i]);
1442
1443	if (sl.length () >= MAXSOCKBUF)
1444	{	1031	{
1445	LOG (llevError, "Buffer overflow in send_skill_info!\n");	1032	/* In this block, the space is visible.
1446	fatal (0);	1033	*/
		1034
		1035	/* Rather than try to figure out what everything that we might
		1036	* need to send is, then form the packet after that,
		1037	* we presume that we will in fact form a packet, and update
		1038	* the bits by what we do actually send. If we send nothing,
		1039	* we just back out sl.length () to the old value, and no harm
		1040	* is done.
		1041	* I think this is simpler than doing a bunch of checks to see
		1042	* what if anything we need to send, setting the bits, then
		1043	* doing those checks again to add the real data.
		1044	*/
		1045	oldlen = sl.length ();
		1046
		1047	sl << uint16 (mask);
		1048
		1049	unsigned char dummy;
		1050	unsigned char *last_ext = &dummy;
		1051
		1052	/* Darkness changed */
		1053	if (lastcell.count != d)
		1054	{
		1055	mask |= 0x8;
		1056
		1057	*last_ext |= 0x80;
		1058	last_ext = &sl[sl.length ()];
		1059	sl << uint8 (d);
		1060	}
		1061
		1062	lastcell.count = d;
		1063
		1064	mapspace &ms = m->at (nx, ny);
		1065	ms.update ();
		1066
		1067	// extmap handling
		1068	uint8 stat_hp = 0;
		1069	uint8 stat_width = 0;
		1070	uint8 flags = 0;
		1071	tag_t player = 0;
		1072
		1073	// send hp information, if applicable
		1074	if (object *op = ms.faces_obj [0])
		1075	if (op->is_head () && !op->invisible)
		1076	{
		1077	if (op->stats.maxhp > op->stats.hp
		1078	&& op->stats.maxhp > 0
		1079	&& (op->type == PLAYER
		1080	|| op->type == DOOR // does not work, have maxhp 0
		1081	|| op->flag [FLAG_MONSTER]
		1082	|| op->flag [FLAG_ALIVE]
		1083	|| op->flag [FLAG_GENERATOR]))
		1084	{
		1085	stat_hp = 255 - (op->stats.hp * 255 + 254) / op->stats.maxhp;
		1086	stat_width = op->arch->max_x - op->arch->x; //TODO: should be upper-left edge
		1087	}
		1088
		1089	if (expect_false (op->has_dialogue ()))
		1090	flags |= 1;
		1091
		1092	if (expect_false (op->type == PLAYER))
		1093	player = op == ob ? pl->ob->count
		1094	: op == pl->ob ? ob->count
		1095	: op->count;
		1096	}
		1097
		1098	if (expect_false (lastcell.stat_hp != stat_hp))
		1099	{
		1100	lastcell.stat_hp = stat_hp;
		1101
		1102	mask |= 0x8;
		1103	*last_ext |= 0x80;
		1104	last_ext = &sl[sl.length ()];
		1105
		1106	sl << uint8 (5) << uint8 (stat_hp);
		1107
		1108	if (stat_width > 1)
		1109	{
		1110	*last_ext |= 0x80;
		1111	last_ext = &sl[sl.length ()];
		1112
		1113	sl << uint8 (6) << uint8 (stat_width);
		1114	}
		1115	}
		1116
		1117	if (expect_false (lastcell.player != player))
		1118	{
		1119	lastcell.player = player;
		1120
		1121	mask |= 0x8;
		1122	*last_ext |= 0x80;
		1123	last_ext = &sl[sl.length ()];
		1124
		1125	sl << uint8 (0x47) << uint8 (4) << (uint32)player;
		1126	}
		1127
		1128	if (expect_false (lastcell.flags != flags))
		1129	{
		1130	lastcell.flags = flags;
		1131
		1132	mask |= 0x8;
		1133	*last_ext |= 0x80;
		1134	last_ext = &sl[sl.length ()];
		1135
		1136	sl << uint8 (8) << uint8 (flags);
		1137	}
		1138
		1139	// faces
		1140
		1141	/* Floor face */
		1142	if (update_space (sl, socket, ms, lastcell, 2))
		1143	mask |= 0x4;
		1144
		1145	/* Middle face */
		1146	if (update_space (sl, socket, ms, lastcell, 1))
		1147	mask |= 0x2;
		1148
		1149	if (expect_false (ob->invisible)
		1150	&& ob->invisible & (ob->invisible < 50 ? 1 : 7)
		1151	&& ms.player () == ob)
		1152	{
		1153	// force player to be visible to himself if invisible
		1154	if (lastcell.faces[0] != ob->face)
		1155	{
		1156	lastcell.faces[0] = ob->face;
		1157
		1158	mask |= 0x1;
		1159	sl << uint16 (ob->face);
		1160
		1161	socket.send_faces (ob);
		1162	}
		1163	}
		1164	/* Top face */
		1165	else if (update_space (sl, socket, ms, lastcell, 0))
		1166	mask |= 0x1;
		1167
		1168	/* Check to see if we are in fact sending anything for this
		1169	* space by checking the mask. If so, update the mask.
		1170	* if not, reset the len to that from before adding the mask
		1171	* value, so we don't send those bits.
		1172	*/
		1173	if (mask & 0xf)
		1174	sl[oldlen + 1] = mask & 0xff;
		1175	else
		1176	sl.reset (oldlen);
		1177	} /* else this is a viewable space */
		1178	ordered_mapwalk_end
		1179
		1180	socket.flush_fx ();
		1181
		1182	if (sl.length () > startlen || socket.sent_scroll)
1447	}	1183	{
1448
1449	ns->send_packet (sl);	1184	socket.send_packet (sl);
1450	}	1185	socket.sent_scroll = 0;
1451
1452	/**
1453	* This sends the spell path to name mapping. We ignore
1454	* the params - we always send the same info no matter what.
1455	*/
1456	void
1457	send_spell_paths (client * ns, char *params)
1458	{
1459	packet sl;
1460
1461	sl << "replyinfo spell_paths\n";
1462
1463	for (int i = 0; i < NRSPELLPATHS; i++)
1464	sl.printf ("%d:%s\n", 1 << i, spellpathnames[i]);
1465
1466	if (sl.length () >= MAXSOCKBUF)
1467	{	1186	}
1468	LOG (llevError, "Buffer overflow in send_spell_paths!\n");
1469	fatal (0);
1470	}
1471
1472	ns->send_packet (sl);
1473	}	1187	}
1474		1188
1475	/**	1189	/**
1476	* This looks for any spells the player may have that have changed their stats.	1190	* This looks for any spells the player may have that have changed their stats.
1477	* it then sends an updspell packet for each spell that has changed in this way	1191	* it then sends an updspell packet for each spell that has changed in this way
…		…
1480	esrv_update_spells (player *pl)	1194	esrv_update_spells (player *pl)
1481	{	1195	{
1482	if (!pl->ns)	1196	if (!pl->ns)
1483	return;	1197	return;
1484		1198
		1199	pl->ns->update_spells = false;
		1200
1485	if (!pl->ns->monitor_spells)	1201	if (!pl->ns->monitor_spells)
1486	return;	1202	return;
1487		1203
1488	for (object *spell = pl->ob->inv; spell; spell = spell->below)	1204	for (object *spell = pl->ob->inv; spell; spell = spell->below)
1489	{
1490	if (spell->type == SPELL)	1205	if (spell->type == SPELL)
1491	{	1206	{
1492	int flags = 0;	1207	int flags = 0;
		1208	int val;
1493		1209
1494	/* check if we need to update it */	1210	/* check if we need to update it */
1495	if (spell->last_sp != SP_level_spellpoint_cost (pl->ob, spell, SPELL_MANA))	1211	val = SP_level_spellpoint_cost (pl->ob, spell, SPELL_MANA);
		1212	if (spell->cached_sp != val)
1496	{	1213	{
1497	spell->last_sp = SP_level_spellpoint_cost (pl->ob, spell, SPELL_MANA);	1214	spell->cached_sp = val;
1498	flags |= UPD_SP_MANA;	1215	flags |= UPD_SP_MANA;
1499	}	1216	}
1500		1217
1501	if (spell->last_grace != SP_level_spellpoint_cost (pl->ob, spell, SPELL_GRACE))	1218	val = SP_level_spellpoint_cost (pl->ob, spell, SPELL_GRACE);
		1219	if (spell->cached_grace != val)
1502	{	1220	{
1503	spell->last_grace = SP_level_spellpoint_cost (pl->ob, spell, SPELL_GRACE);	1221	spell->cached_grace = val;
1504	flags |= UPD_SP_GRACE;	1222	flags |= UPD_SP_GRACE;
1505	}	1223	}
1506		1224
1507	if (spell->last_eat != spell->stats.dam + SP_level_dam_adjust (pl->ob, spell))	1225	val = casting_level (pl->ob, spell);
		1226	if (spell->cached_eat != val)
1508	{	1227	{
1509	spell->last_eat = spell->stats.dam + SP_level_dam_adjust (pl->ob, spell);	1228	spell->cached_eat = val;
1510	flags |= UPD_SP_DAMAGE;	1229	flags |= UPD_SP_LEVEL;
1511	}	1230	}
1512		1231
1513	if (flags)	1232	if (flags)
1514	{	1233	{
1515	packet sl;	1234	packet sl;
1516		1235
1517	sl << "updspell "	1236	sl << "updspell "
1518	<< uint8 (flags)	1237	<< uint8 (flags)
1519	<< uint32 (spell->count);	1238	<< uint32 (spell->count);
1520		1239
1521	if (flags & UPD_SP_MANA ) sl << uint16 (spell->last_sp);	1240	if (flags & UPD_SP_MANA ) sl << uint16 (spell->cached_sp);
1522	if (flags & UPD_SP_GRACE ) sl << uint16 (spell->last_grace);	1241	if (flags & UPD_SP_GRACE) sl << uint16 (spell->cached_grace);
1523	if (flags & UPD_SP_DAMAGE) sl << uint16 (spell->last_eat);	1242	if (flags & UPD_SP_LEVEL) sl << uint16 (spell->cached_eat);
1524		1243
1525	pl->ns->send_packet (sl);	1244	pl->ns->send_packet (sl);
1526	}	1245	}
1527	}	1246	}
1528	}
1529	}	1247	}
1530		1248
1531	void	1249	void
1532	esrv_remove_spell (player *pl, object *spell)	1250	esrv_remove_spell (player *pl, object *spell)
1533	{	1251	{
…		…
1558	LOG (llevError, "item number %d is a spell with no name.\n", spell->count);	1276	LOG (llevError, "item number %d is a spell with no name.\n", spell->count);
1559	return;	1277	return;
1560	}	1278	}
1561		1279
1562	/* store costs and damage in the object struct, to compare to later */	1280	/* store costs and damage in the object struct, to compare to later */
1563	spell->last_sp = SP_level_spellpoint_cost (pl->ob, spell, SPELL_MANA);	1281	spell->cached_sp = SP_level_spellpoint_cost (pl->ob, spell, SPELL_MANA);
1564	spell->last_grace = SP_level_spellpoint_cost (pl->ob, spell, SPELL_GRACE);	1282	spell->cached_grace = SP_level_spellpoint_cost (pl->ob, spell, SPELL_GRACE);
1565	spell->last_eat = spell->stats.dam + SP_level_dam_adjust (pl->ob, spell);	1283	spell->cached_eat = casting_level (pl->ob, spell);
1566		1284
1567	/* figure out which skill it uses, if it uses one */	1285	/* figure out which skill it uses, if it uses one */
1568	if (spell->skill)	1286	if (spell->skill)
1569	{	1287	if (object *tmp = pl->find_skill (spell->skill))
1570	for (i = 1; i < NUM_SKILLS; i++)	1288	skill = CS_STAT_SKILLINFO + SKILL_INDEX (tmp);
1571	if (!strcmp (spell->skill, skill_names[i]))
1572	{
1573	skill = i + CS_STAT_SKILLINFO;
1574	break;
1575	}
1576	}
1577		1289
1578	// spells better have a face	1290	// spells better have a face
1579	if (!spell->face)	1291	if (!spell->face)
1580	{	1292	{
1581	LOG (llevError, "%s: spell has no face, but face is mandatory.\n", &spell->name);	1293	LOG (llevError, "%s: spell has no face, but face is mandatory.\n", &spell->name);
1582	spell->face = face_find ("burnout.x11", blank_face);	1294	spell->face = face_find ("burnout.x11", blank_face);
1583	}	1295	}
		1296
		1297	pl->ns->send_face (spell->face);
1584		1298
1585	/* send the current values */	1299	/* send the current values */
1586	sl << uint32 (spell->count)	1300	sl << uint32 (spell->count)
1587	<< uint16 (spell->level)	1301	<< uint16 (spell->level)
1588	<< uint16 (spell->casting_time)	1302	<< uint16 (spell->casting_time)
1589	<< uint16 (spell->last_sp)	1303	<< uint16 (spell->cached_sp)
1590	<< uint16 (spell->last_grace)	1304	<< uint16 (spell->cached_grace)
1591	<< uint16 (spell->last_eat)	1305	<< uint16 (spell->cached_eat)
1592	<< uint8 (skill)	1306	<< uint8 (skill)
1593	<< uint32 (spell->path_attuned)	1307	<< uint32 (spell->path_attuned)
1594	<< uint32 (spell->face)	1308	<< uint32 (spell->face)
1595	<< data8 (spell->name)	1309	<< data8 (spell->name)
1596	<< data16 (spell->msg);	1310	<< data16 (spell->msg);
…		…
1624	* bytes and 3 strings (because that is the spec) so we need to	1338	* bytes and 3 strings (because that is the spec) so we need to
1625	* check that the length of those 3 strings, plus the 23 bytes,	1339	* check that the length of those 3 strings, plus the 23 bytes,
1626	* won't take us over the length limit for the socket, if it does,	1340	* won't take us over the length limit for the socket, if it does,
1627	* we need to send what we already have, and restart packet formation	1341	* we need to send what we already have, and restart packet formation
1628	*/	1342	*/
		1343	if (spell->type != SPELL)
		1344	continue;
		1345
1629	/* Seeing crashes by overflowed buffers. Quick arithemetic seems	1346	/* Seeing crashes by overflowed buffers. Quick arithemetic seems
1630	* to show add_spell is 26 bytes + 2 strings. However, the overun	1347	* to show add_spell is 26 bytes + 2 strings. However, the overun
1631	* is hundreds of bytes off, so correcting 22 vs 26 doesn't seem	1348	* is hundreds of bytes off, so correcting 22 vs 26 doesn't seem
1632	* like it will fix this	1349	* like it will fix this
1633	*/	1350	*/
1634	if (spell->type != SPELL)
1635	continue;
1636
1637	if (sl.length () >= (MAXSOCKBUF - (26 + strlen (spell->name) + (spell->msg ? strlen (spell->msg) : 0))))	1351	if (sl.length () > (MAXSOCKBUF - (26 + strlen (spell->name) + (spell->msg ? strlen (spell->msg) : 0))))
1638	{	1352	{
		1353	pl->ns->flush_fx ();
1639	pl->ns->send_packet (sl);	1354	pl->ns->send_packet (sl);
1640		1355
1641	sl.reset ();	1356	sl.reset ();
1642	sl << "addspell ";	1357	sl << "addspell ";
1643	}	1358	}
…		…
1651	return;	1366	return;
1652	}	1367	}
1653	else	1368	else
1654	append_spell (pl, sl, spell);	1369	append_spell (pl, sl, spell);
1655		1370
1656	if (sl.length () >= MAXSOCKBUF)	1371	if (sl.length () > MAXSOCKBUF)
1657	{
1658	LOG (llevError, "Buffer overflow in esrv_add_spells!\n");	1372	cleanup ("buffer overflow in esrv_add_spells!");
1659	fatal (0);
1660	}
1661		1373
1662	/* finally, we can send the packet */	1374	/* finally, we can send the packet */
		1375	pl->ns->flush_fx ();
1663	pl->ns->send_packet (sl);	1376	pl->ns->send_packet (sl);
1664	}	1377	}
1665		1378
		1379	//-GPL
		1380

Diff Legend

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