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.112 by root, Sun Jul 1 05:00:20 2007 UTC vs.
Revision 1.176 by root, Thu Apr 29 15:59:10 2010 UTC

1	/*	1	/*
2	* This file is part of Crossfire TRT, the Roguelike Realtime MORPG.	2	* This file is part of Deliantra, the Roguelike Realtime MMORPG.
3	*	3	*
4	* Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Crossfire TRT team	4	* Copyright (©) 2005,2006,2007,2008,2009,2010 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
5	* Copyright (©) 2001,2007 Mark Wedel	5	* Copyright (©) 2001 Mark Wedel
6	* Copyright (©) 1992,2007 Frank Tore Johansen	6	* Copyright (©) 1992 Frank Tore Johansen
7	*	7	*
8	* Crossfire TRT 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 3 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, see <http://www.gnu.org/licenses/>.	19	* and the GNU General Public License along with this program. If not, see
		20	* <http://www.gnu.org/licenses/>.
20	*	21	*
21	* The authors can be reached via e-mail to <crossfire@schmorp.de>	22	* The authors can be reached via e-mail to <support@deliantra.net>
22	*/	23	*/
		24
		25	//+GPL
23		26
24	/**	27	/**
25	* \file	28	* \file
26	* Client handling.	29	* Client handling.
27	*	30	*
…		…
41		44
42	#include <global.h>	45	#include <global.h>
43	#include <sproto.h>	46	#include <sproto.h>
44		47
45	#include <living.h>	48	#include <living.h>
46	#include <commands.h>
47		49
48	/* 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,
49	* it should work here.	51	* it should work here.
50	*/	52	*/
51	#include <sys/types.h>	53	#include <sys/types.h>
…		…
63	* This table translates the attack numbers as used within the	65	* This table translates the attack numbers as used within the
64	* 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
65	* 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
66	* client.	68	* client.
67	*/	69	*/
68	short atnr_cs_stat[NROFATTACKS] = { CS_STAT_RES_PHYS,	70	static short atnr_cs_stat[NROFATTACKS] =
69	CS_STAT_RES_MAG, CS_STAT_RES_FIRE, CS_STAT_RES_ELEC,	71	{
70	CS_STAT_RES_COLD, CS_STAT_RES_CONF, CS_STAT_RES_ACID,	72	CS_STAT_RES_PHYS,
71	CS_STAT_RES_DRAIN, -1 /* weaponmagic */ ,	73	CS_STAT_RES_MAG,
72	CS_STAT_RES_GHOSTHIT, CS_STAT_RES_POISON,	74	CS_STAT_RES_FIRE,
73	CS_STAT_RES_SLOW, CS_STAT_RES_PARA, CS_STAT_TURN_UNDEAD,	75	CS_STAT_RES_ELEC,
74	CS_STAT_RES_FEAR, -1 /* Cancellation */ ,	76	CS_STAT_RES_COLD,
75	CS_STAT_RES_DEPLETE, CS_STAT_RES_DEATH,	77	CS_STAT_RES_CONF,
76	-1 /* Chaos */ , -1 /* Counterspell */ ,	78	CS_STAT_RES_ACID,
77	-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,
78	CS_STAT_RES_BLIND,	94	CS_STAT_RES_BLIND,
79	-1, /* Internal */	95	-1, /* Internal */
80	-1, /* life stealing */	96	-1, /* life stealing */
81	-1 /* Disease - not fully done yet */	97	-1 /* Disease - not fully done yet */
82	};	98	};
…		…
98	*/	114	*/
99	mx = ns->mapx;	115	mx = ns->mapx;
100	my = ns->mapy;	116	my = ns->mapy;
101		117
102	/* 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
103	* (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,
104	* if the destination x or y coordinate is outside the viewable	120	* if the destination x or y coordinate is outside the viewable
105	* area, we clear the values - otherwise, the old values	121	* area, we clear the values - otherwise, the old values
106	* 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.
107	*/	123	*/
108	for (x = 0; x < mx; x++)	124	for (x = 0; x < mx; x++)
109	{
110	for (y = 0; y < my; y++)	125	for (y = 0; y < my; y++)
111	{
112	if (x >= ns->mapx || y >= ns->mapy)	126	if (x >= ns->mapx || y >= ns->mapy)
113	/* clear cells outside the viewable area */	127	/* clear cells outside the viewable area */
114	memset (&newmap.cells[x][y], 0, sizeof (struct MapCell));	128	memset (&newmap.cells[x][y], 0, sizeof (struct MapCell));
115	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)
116	/* clear newly visible tiles within the viewable area */	130	/* clear newly visible tiles within the viewable area */
117	memset (&(newmap.cells[x][y]), 0, sizeof (struct MapCell));	131	memset (&(newmap.cells[x][y]), 0, sizeof (struct MapCell));
118	else	132	else
119	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));
120	}
121	}
122		134
123	memcpy (&(ns->lastmap), &newmap, sizeof (struct Map));	135	memcpy (&(ns->lastmap), &newmap, sizeof (struct Map));
124		136
125	/* 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
126	* empty).	138	* empty).
…		…
129	}	141	}
130		142
131	static void	143	static void
132	clear_map (player *pl)	144	clear_map (player *pl)
133	{	145	{
		146	pl->ns->mapinfo_queue_clear ();
		147
134	memset (&pl->ns->lastmap, 0, sizeof (pl->ns->lastmap));	148	memset (&pl->ns->lastmap, 0, sizeof (pl->ns->lastmap));
135		149
136	pl->ns->force_newmap = false;	150	pl->ns->force_newmap = false;
137		151
138	if (pl->ns->newmapcmd == 1)	152	if (pl->ns->newmapcmd == 1)
139	pl->ns->send_packet ("newmap");	153	pl->ns->send_packet ("newmap");
140		154
141	pl->ns->floorbox_reset ();	155	pl->ns->floorbox_reset ();
		156	}
		157
		158	static void
		159	send_map_info (player *pl)
		160	{
		161	client &socket = *pl->ns;
		162	object *ob = pl->viewpoint;
		163
		164	if (socket.mapinfocmd)
		165	{
		166	if (ob->map && ob->map->path[0])
		167	{
		168	int flags = 0;
		169
		170	if (ob->map->tile_path[0]) flags |= 1;
		171	if (ob->map->tile_path[1]) flags |= 2;
		172	if (ob->map->tile_path[2]) flags |= 4;
		173	if (ob->map->tile_path[3]) flags |= 8;
		174
		175	socket.send_packet_printf ("mapinfo - spatial %d %d %d %d %d %s",
		176	flags, socket.mapx / 2 - ob->x, socket.mapy / 2 - ob->y,
		177	ob->map->width, ob->map->height, &ob->map->path);
		178	}
		179	else
		180	socket.send_packet ("mapinfo current");
		181	}
142	}	182	}
143		183
144	/** check for map/region change and send new map data */	184	/** check for map/region change and send new map data */
145	static void	185	static void
146	check_map_change (player *pl)	186	check_map_change (player *pl)
147	{	187	{
148	client &socket = *pl->ns;	188	client &socket = *pl->ns;
149	object *ob = pl->observe;	189	object *ob = pl->viewpoint;
		190
		191	region *reg = ob->region ();
		192	if (socket.current_region != reg)
		193	{
		194	INVOKE_PLAYER (REGION_CHANGE, pl, ARG_REGION (reg), ARG_REGION (socket.current_region));
		195	socket.current_region = reg;
		196	}
		197
		198	// first try to aovid a full newmap on tiled map scrolls
		199	if (socket.current_map != ob->map && !socket.force_newmap)
		200	{
		201	rv_vector rv;
		202
		203	get_rangevector_from_mapcoord (socket.current_map, socket.current_x, socket.current_y, ob, &rv, 0);
		204
		205	// manhattan distance is very handy here
		206	if (rv.distance < 8) // 8 works nicely for speed << 70 and buggy gcfclient
		207	{
		208	socket.current_map = ob->map;
		209	socket.current_x = ob->x;
		210	socket.current_y = ob->y;
		211
		212	socket_map_scroll (&socket, rv.distance_x, rv.distance_y);
		213	socket.floorbox_reset ();
		214	send_map_info (pl);
		215	}
		216	}
150		217
151	if (socket.current_map != ob->map || socket.force_newmap)	218	if (socket.current_map != ob->map || socket.force_newmap)
152	{	219	{
153	clear_map (pl);	220	clear_map (pl);
154	socket.current_map = ob->map;	221	socket.current_map = ob->map;
155		222	send_map_info (pl);
156	if (socket.mapinfocmd)
157	{
158	if (ob->map && ob->map->path[0])
159	{
160	int flags = 0;
161
162	if (ob->map->tile_path[0]) flags |= 1;
163	if (ob->map->tile_path[1]) flags |= 2;
164	if (ob->map->tile_path[2]) flags |= 4;
165	if (ob->map->tile_path[3]) flags |= 8;
166
167	socket.send_packet_printf ("mapinfo - spatial %d %d %d %d %d %s",
168	flags, socket.mapx / 2 - ob->x, socket.mapy / 2 - ob->y,
169	ob->map->width, ob->map->height, &ob->map->path);
170	}
171	else
172	socket.send_packet ("mapinfo current");
173	}
174	}	223	}
175	else if (socket.current_x != ob->x || socket.current_y != ob->y)	224	else if (socket.current_x != ob->x || socket.current_y != ob->y)
176	{	225	{
177	int dx = ob->x - socket.current_x;	226	int dx = ob->x - socket.current_x;
178	int dy = ob->y - socket.current_y;	227	int dy = ob->y - socket.current_y;
179		228
180	if (socket.buggy_mapscroll && (abs (dx) > 8 || abs (dy) > 8))
181	clear_map (pl); // current (<= 1.9.1) clients have unchecked buffer overflows
182	else
183	{
184	socket_map_scroll (&socket, ob->x - socket.current_x, ob->y - socket.current_y);	229	socket_map_scroll (&socket, ob->x - socket.current_x, ob->y - socket.current_y);
185	socket.floorbox_reset ();	230	socket.floorbox_reset ();
186	}
187	}	231	}
188		232
189	socket.current_x = ob->x;	233	socket.current_x = ob->x;
190	socket.current_y = ob->y;	234	socket.current_y = ob->y;
		235	}
191		236
192	region *reg = ob->region ();	237	/**
193	if (socket.current_region != reg)	238	* This sends the skill number to name mapping. We ignore
194	{	239	* the params - we always send the same info no matter what.
195	socket.current_region = reg;	240	*/
196	socket.send_packet_printf ("drawinfo 0 You are now %s.\n(use whereami for more details)", &reg->longname);	241	static void
197	}	242	send_skill_info (client *ns, char *params)
		243	{
		244	packet sl;
		245	sl << "replyinfo skill_info\n";
		246
		247	for (int i = 0; i < skillvec.size (); ++i)
		248	sl.printf ("%d:%s\n", CS_STAT_SKILLINFO + i, &skillvec [i]->name);
		249
		250	if (sl.length () > MAXSOCKBUF)
		251	cleanup ("buffer overflow in send_skill_info!");
		252
		253	ns->send_packet (sl);
		254	}
		255
		256	/**
		257	* This sends the spell path to name mapping. We ignore
		258	* the params - we always send the same info no matter what.
		259	*/
		260	static void
		261	send_spell_paths (client * ns, char *params)
		262	{
		263	packet sl;
		264
		265	sl << "replyinfo spell_paths\n";
		266
		267	for (int i = 0; i < NRSPELLPATHS; i++)
		268	sl.printf ("%d:%s\n", 1 << i, spellpathnames[i]);
		269
		270	if (sl.length () > MAXSOCKBUF)
		271	cleanup ("buffer overflow in send_spell_paths!");
		272
		273	ns->send_packet (sl);
198	}	274	}
199		275
200	/**	276	/**
201	* RequestInfo is sort of a meta command. There is some specific	277	* RequestInfo is sort of a meta command. There is some specific
202	* request of information, but we call other functions to provide	278	* request of information, but we call other functions to provide
203	* that information.	279	* that information.
204	*/	280	*/
205	void	281	void
206	RequestInfo (char *buf, int len, client * ns)	282	RequestInfo (char *buf, int len, client *ns)
207	{	283	{
208	char *params = NULL, *cp;	284	char *params;
209
210	/* No match */
211	char bigbuf[MAX_BUF];
212	int slen;
213
214	/* Set up replyinfo before we modify any of the buffers - this is used
215	* if we don't find a match.
216	*/
217	strcpy (bigbuf, "replyinfo ");
218	slen = strlen (bigbuf);
219	safe_strcat (bigbuf, buf, &slen, MAX_BUF);
220		285
221	/* find the first space, make it null, and update the	286	/* find the first space, make it null, and update the
222	* params pointer.	287	* params pointer.
223	*/	288	*/
224	for (cp = buf; *cp != '\0'; cp++)	289	for (params = buf; *params; params++)
225	if (*cp == ' ')	290	if (*params == ' ')
226	{	291	{
227	*cp = '\0';
228	params = cp + 1;	292	*params++ = 0;
229	break;	293	break;
230	}	294	}
231		295
232	if (!strcmp (buf, "image_info"))
233	send_image_info (ns, params);
234	else if (!strcmp (buf, "image_sums"))
235	send_image_sums (ns, params);
236	else if (!strcmp (buf, "skill_info"))	296	if (!strcmp (buf, "skill_info"))
237	send_skill_info (ns, params);	297	send_skill_info (ns, params);
238	else if (!strcmp (buf, "spell_paths"))	298	else if (!strcmp (buf, "spell_paths"))
239	send_spell_paths (ns, params);	299	send_spell_paths (ns, params);
240	else	300	else
241	ns->send_packet (bigbuf, len);	301	{
		302	// undo tokenisation above and send replyinfo with the request unchanged
		303	if (*params)
		304	*--params = ' ';
		305
		306	ns->send_packet_printf ("replyinfo %s", buf);
		307	}
242	}	308	}
243		309
244	void	310	void
245	ExtCmd (char *buf, int len, player *pl)	311	ExtCmd (char *buf, int len, player *pl)
246	{	312	{
…		…
249		315
250	void	316	void
251	ExtiCmd (char *buf, int len, client *ns)	317	ExtiCmd (char *buf, int len, client *ns)
252	{	318	{
253	INVOKE_CLIENT (EXTICMD, ns, ARG_DATA (buf, len));	319	INVOKE_CLIENT (EXTICMD, ns, ARG_DATA (buf, len));
		320	}
		321
		322	//-GPL
		323
		324	void
		325	client::mapinfo_queue_clear ()
		326	{
		327	for (auto (i, mapinfo_queue.begin ()); i != mapinfo_queue.end (); ++i)
		328	free (*i);
		329
		330	mapinfo_queue.clear ();
		331	}
		332
		333	bool
		334	client::mapinfo_try (char *buf)
		335	{
		336	char *token = buf;
		337	buf += strlen (buf) + 9;
		338
		339	// initial map and its origin
		340	maptile *map = pl->viewpoint->map;
		341	int mapx = pl->ns->mapx / 2 - pl->viewpoint->x;
		342	int mapy = pl->ns->mapy / 2 - pl->viewpoint->y;
		343	int max_distance = 8; // limit maximum path length to something generous
		344
		345	while (*buf && map && max_distance)
		346	{
		347	int dir = *buf++ - '1';
		348
		349	if (dir >= 0 && dir <= 3)
		350	{
		351	if (!map->tile_path [dir])
		352	map = 0;
		353	else if (map->tile_available (dir, false))
		354	{
		355	maptile *neigh = map->tile_map [dir];
		356
		357	switch (dir)
		358	{
		359	case 0: mapy -= neigh->height; break;
		360	case 2: mapy += map ->height; break;
		361	case 3: mapx -= neigh->width ; break;
		362	case 1: mapx += map ->width ; break;
		363	}
		364
		365	map = neigh;
		366	--max_distance;
		367	}
		368	else
		369	return 0;
		370	}
		371	else
		372	max_distance = 0;
		373	}
		374
		375	if (!max_distance)
		376	send_packet_printf ("mapinfo %s error", token);
		377	else if (!map || !map->path)
		378	send_packet_printf ("mapinfo %s nomap", token);
		379	else
		380	{
		381	int flags = 0;
		382
		383	if (map->tile_path[0]) flags |= 1;
		384	if (map->tile_path[1]) flags |= 2;
		385	if (map->tile_path[2]) flags |= 4;
		386	if (map->tile_path[3]) flags |= 8;
		387
		388	send_packet_printf ("mapinfo %s spatial %d %d %d %d %d %s", token, flags, mapx, mapy, map->width, map->height, &map->path);
		389	}
		390
		391	return 1;
		392	}
		393
		394	void
		395	client::mapinfo_queue_run ()
		396	{
		397	if (mapinfo_queue.empty () || !pl)
		398	return;
		399
		400	for (int i = 0; i < mapinfo_queue.size (); ++i)
		401	if (mapinfo_try (mapinfo_queue [i]))
		402	{
		403	free (mapinfo_queue [i]);
		404	mapinfo_queue.erase (i);
		405	}
		406	else
		407	++i;
254	}	408	}
255		409
256	void	410	void
257	MapInfoCmd (char *buf, int len, player *pl)	411	MapInfoCmd (char *buf, int len, player *pl)
258	{	412	{
259	// <mapinfo tag spatial tile-path	413	// <mapinfo tag spatial tile-path
260	// >mapinfo tag spatial flags x y w h hash	414	// >mapinfo tag spatial flags x y w h hash
261		415
262	char bigbuf[MAX_BUF], *token;
263
264	token = buf;	416	char *token = buf;
265	// copy token	417
266	if (!(buf = strchr (buf, ' ')))	418	if (!(buf = strchr (buf, ' ')))
267	return;	419	return;
268		420
269	*buf++ = 0;
270
271	if (!strncmp (buf, "spatial ", 8))	421	if (!strncmp (buf, " spatial ", 9))
272	{	422	{
273	buf += 8;	423	char *copy = strdup (token);
		424	copy [buf - token] = 0;
274		425
275	// initial map and its origin	426	#if 0
276	maptile *map = pl->ob->map;	427	// this makes only sense when we flush the buffer immediately
277	sint16 dx, dy;	428	if (pl->ns->mapinfo_try (copy))
278	int mapx = pl->ns->mapx / 2 - pl->ob->x;	429	free (copy);
279	int mapy = pl->ns->mapy / 2 - pl->ob->y;
280	int max_distance = 8; // limit maximum path length to something generous
281
282	while (*buf && map && max_distance)
283	{
284	int dir = *buf++;
285
286	switch (dir)
287	{
288	case '1':
289	dx = 0;
290	dy = -1;
291	map = map->xy_find (dx, dy);
292	map && (mapy -= map->height);
293	break;
294	case '2':
295	mapx += map->width;
296	dx = map->width;
297	dy = 0;
298	map = map->xy_find (dx, dy);
299	break;
300	case '3':
301	mapy += map->height;
302	dx = 0;
303	dy = map->height;
304	map = map->xy_find (dx, dy);
305	break;
306	case '4':
307	dx = -1;
308	dy = 0;
309	map = map->xy_find (dx, dy);
310	map && (mapx -= map->width);
311	break;
312	}
313
314	--max_distance;
315	}
316
317	if (!max_distance)
318	snprintf (bigbuf, MAX_BUF, "mapinfo %s error", token);
319	else if (map && map->path[0])
320	{
321	int flags = 0;
322
323	if (map->tile_path[0]) flags |= 1;
324	if (map->tile_path[1]) flags |= 2;
325	if (map->tile_path[2]) flags |= 4;
326	if (map->tile_path[3]) flags |= 8;
327
328	snprintf (bigbuf, MAX_BUF, "mapinfo %s spatial %d %d %d %d %d %s", token, flags, mapx, mapy, map->width, map->height, &map->path);
329	}
330	else	430	else
331	snprintf (bigbuf, MAX_BUF, "mapinfo %s nomap", token);	431	#endif
		432	pl->ns->mapinfo_queue.push_back (copy);
332	}	433	}
333	else	434	else
334	snprintf (bigbuf, MAX_BUF, "mapinfo %s unsupported", token);	435	pl->ns->send_packet_printf ("mapinfo %s unsupported", token);
335
336	pl->ns->send_packet (bigbuf);
337	}	436	}
338		437
339	/** This is the Setup cmd */	438	/** This is the Setup cmd */
340	void	439	void
341	SetUp (char *buf, int len, client * ns)	440	SetUp (char *buf, int len, client * ns)
…		…
353	AddMeCmd (char *buf, int len, client *ns)	452	AddMeCmd (char *buf, int len, client *ns)
354	{	453	{
355	INVOKE_CLIENT (ADDME, ns, ARG_DATA (buf, len));	454	INVOKE_CLIENT (ADDME, ns, ARG_DATA (buf, len));
356	}	455	}
357		456
358	/** Reply to ExtendedInfos command */	457	//+GPL
359	void
360	ToggleExtendedInfos (char *buf, int len, client * ns)
361	{
362	char cmdback[MAX_BUF];
363	char command[50];
364	int info, nextinfo;
365
366	cmdback[0] = '\0';
367	nextinfo = 0;
368
369	while (1)
370	{
371	/* 1. Extract an info */
372	info = nextinfo;
373
374	while ((info < len) && (buf[info] == ' '))
375	info++;
376
377	if (info >= len)
378	break;
379
380	nextinfo = info + 1;
381
382	while ((nextinfo < len) && (buf[nextinfo] != ' '))
383	nextinfo++;
384
385	if (nextinfo - info >= 49) /*Erroneous info asked */
386	continue;
387
388	strncpy (command, &(buf[info]), nextinfo - info);
389
390	/* 2. Interpret info */
391	if (!strcmp ("smooth", command))
392	/* Toggle smoothing */
393	ns->EMI_smooth = !ns->EMI_smooth;
394	else
395	/*bad value */;
396
397	/*3. Next info */
398	}
399
400	strcpy (cmdback, "ExtendedInfoSet");
401
402	if (ns->EMI_smooth)
403	{
404	strcat (cmdback, " ");
405	strcat (cmdback, "smoothing");
406	}
407
408	ns->send_packet (cmdback);
409	}
410
411	/*
412	#define MSG_TYPE_BOOK 1
413	#define MSG_TYPE_CARD 2
414	#define MSG_TYPE_PAPER 3
415	#define MSG_TYPE_SIGN 4
416	#define MSG_TYPE_MONUMENT 5
417	#define MSG_TYPE_SCRIPTED_DIALOG 6*/
418
419	/** Reply to ExtendedInfos command */
420	void
421	ToggleExtendedText (char *buf, int len, client * ns)
422	{
423	char cmdback[MAX_BUF];
424	char temp[10];
425	char command[50];
426	int info, nextinfo, i, flag;
427
428	cmdback[0] = '\0';
429
430	nextinfo = 0;
431	while (1)
432	{
433	/* 1. Extract an info */
434	info = nextinfo;
435
436	while ((info < len) && (buf[info] == ' '))
437	info++;
438
439	if (info >= len)
440	break;
441
442	nextinfo = info + 1;
443
444	while ((nextinfo < len) && (buf[nextinfo] != ' '))
445	nextinfo++;
446
447	if (nextinfo - info >= 49) /*Erroneous info asked */
448	continue;
449
450	strncpy (command, &(buf[info]), nextinfo - info);
451	command[nextinfo - info] = '\0';
452	/* 2. Interpret info */
453	i = sscanf (command, "%d", &flag);
454
455	if ((i == 1) && (flag > 0) && (flag <= MSG_TYPE_LAST))
456	ns->supported_readables |= (1 << flag);
457	/*3. Next info */
458	}
459
460	/* Send resulting state */
461	strcpy (cmdback, "ExtendedTextSet");
462
463	for (i = 0; i <= MSG_TYPE_LAST; i++)
464	if (ns->supported_readables & (1 << i))
465	{
466	strcat (cmdback, " ");
467	snprintf (temp, sizeof (temp), "%d", i);
468	strcat (cmdback, temp);
469	}
470
471	ns->send_packet (cmdback);
472	}
473		458
474	/**	459	/**
475	* This handles the general commands from the client (ie, north, fire, cast,	460	* This handles the general commands from the client (ie, north, fire, cast,
476	* etc.)	461	* etc.)
477	*/	462	*/
…		…
490	return;	475	return;
491		476
492	buf++;	477	buf++;
493	}	478	}
494		479
495	execute_newserver_command (pl->ob, (char *) buf);	480	execute_newserver_command (pl->ob, (char *)buf);
496		481
497	/* Perhaps something better should be done with a left over count.	482	/* Perhaps something better should be done with a left over count.
498	* Cleaning up the input should probably be done first - all actions	483	* Cleaning up the input should probably be done first - all actions
499	* for the command that issued the count should be done before any other	484	* for the command that issued the count should be done before any other
500	* commands.	485	* commands.
…		…
511	void	496	void
512	NewPlayerCmd (char *buf, int len, player *pl)	497	NewPlayerCmd (char *buf, int len, player *pl)
513	{	498	{
514	if (len <= 6)	499	if (len <= 6)
515	{	500	{
516	LOG (llevDebug, "Corrupt ncom command <%s> not long enough - discarding\n", buf);	501	LOG (llevDebug, "%s: corrupt ncom command <%s>: not long enough (%d) - discarding\n", pl->ns->host, buf, len);
517	return;	502	return;
518	}	503	}
519		504
520	uint16 cmdid = net_uint16 ((uint8 *)buf);	505	uint16 cmdid = net_uint16 ((uint8 *)buf);
521	sint32 repeat = net_sint32 ((uint8 *)buf + 2);	506	sint32 repeat = net_sint32 ((uint8 *)buf + 2);
…		…
534	* commands.	519	* commands.
535	*/	520	*/
536	pl->count = 0;	521	pl->count = 0;
537		522
538	//TODO: schmorp thinks whatever this calculates, it makes no sense at all	523	//TODO: schmorp thinks whatever this calculates, it makes no sense at all
539	int time = fabs (pl->ob->speed) < 0.001	524	int time = pl->ob->has_active_speed ()
540	? time = MAX_TIME * 100
541	: time = (int) (MAX_TIME / fabs (pl->ob->speed));	525	? (int) (MAX_TIME / pl->ob->speed)
		526	: MAX_TIME * 100;
542		527
543	/* Send confirmation of command execution now */	528	/* Send confirmation of command execution now */
544	packet sl ("comc");	529	packet sl ("comc");
545	sl << uint16 (cmdid) << uint32 (time);	530	sl << uint16 (cmdid) << uint32 (time);
546	pl->ns->send_packet (sl);	531	pl->ns->send_packet (sl);
…		…
588	LOG (llevError, "Unknown input state: %d\n", ns->state);	573	LOG (llevError, "Unknown input state: %d\n", ns->state);
589	}	574	}
590	}	575	}
591		576
592	/**	577	/**
593	* Client tells its version. If there is a mismatch, we close the	578	* Client tells its version info.
594	* socket. In real life, all we should care about is the client having
595	* something older than the server. If we assume the client will be
596	* backwards compatible, having it be a later version should not be a
597	* problem.
598	*/	579	*/
599	void	580	void
600	VersionCmd (char *buf, int len, client * ns)	581	VersionCmd (char *buf, int len, client *ns)
601	{	582	{
602	if (!buf)	583	INVOKE_CLIENT (VERSION, ns, ARG_DATA (buf, len));
603	{
604	LOG (llevError, "CS: received corrupted version command\n");
605	return;
606	}
607
608	ns->cs_version = atoi (buf);
609	ns->sc_version = ns->cs_version;
610
611	LOG (llevDebug, "connection from client <%s>\n", buf);
612
613	//TODO: should log here just for statistics
614
615	//if (VERSION_CS != ns->cs_version)
616	// unchecked;
617
618	char *cp = strchr (buf + 1, ' ');
619	if (!cp)
620	return;
621
622	ns->sc_version = atoi (cp);
623
624	//if (VERSION_SC != ns->sc_version)
625	// unchecked;
626
627	cp = strchr (cp + 1, ' ');
628
629	if (cp)
630	{
631	ns->version = cp + 1;
632
633	if (ns->sc_version < 1026)
634	ns->send_packet_printf ("drawinfo %d %s", NDI_RED,
635	"**** VERSION WARNING ****\n**** CLIENT IS TOO OLD!! UPDATE THE CLIENT!! ****");
636	}
637	}	584	}
638		585
639	/** sound related functions. */	586	/** sound related functions. */
640	void	587	void
641	SetSound (char *buf, int len, client * ns)	588	SetSound (char *buf, int len, client * ns)
…		…
659	* syntax is: move (to) (tag) (nrof)	606	* syntax is: move (to) (tag) (nrof)
660	*/	607	*/
661	void	608	void
662	MoveCmd (char *buf, int len, player *pl)	609	MoveCmd (char *buf, int len, player *pl)
663	{	610	{
664	int vals[3], i;	611	int to, tag, nrof;
665		612
666	/* A little funky here. We only cycle for 2 records, because	613	if (3 != sscanf (buf, "%d %d %d", &to, &tag, &nrof))
667	* we obviously are not going to find a space after the third
668	* record. Perhaps we should just replace this with a
669	* sscanf?
670	*/
671	for (i = 0; i < 2; i++)
672	{	614	{
673	vals[i] = atoi (buf);
674
675	if (!(buf = strchr (buf, ' ')))
676	{
677	LOG (llevError, "Incomplete move command: %s\n", buf);	615	LOG (llevError, "Incomplete move command: %s\n", buf);
678	return;	616	return;
679	}
680
681	buf++;
682	}	617	}
683		618
684	vals[2] = atoi (buf);	619	esrv_move_object (pl->ob, to, tag, nrof);
685
686	/* LOG(llevDebug,"Move item %d (nrof=%d) to %d.\n", vals[1], vals[2], vals[0]);*/
687	esrv_move_object (pl->ob, vals[0], vals[1], vals[2]);
688	}	620	}
689		621
690	/******************************************************************************	622	/******************************************************************************
691	*	623	*
692	* Start of commands the server sends to the client.	624	* Start of commands the server sends to the client.
…		…
707	* Get player's current range attack in obuf.	639	* Get player's current range attack in obuf.
708	*/	640	*/
709	static void	641	static void
710	rangetostring (player *pl, char *obuf)	642	rangetostring (player *pl, char *obuf)
711	{	643	{
712	dynbuf_text buf;	644	dynbuf_text &buf = msg_dynbuf; buf.clear ();
		645
		646	#if 0
		647	// print ranged/chosen_skill etc. objects every call
		648	printf ("%s %s => %s (%s)\n",
		649	pl->ranged_ob ? &pl->ranged_ob->name : "-",
		650	pl->combat_ob ? &pl->combat_ob->name : "-",
		651	pl->ob->current_weapon ? &pl->ob->current_weapon->name : "-",
		652	pl->ob->chosen_skill ? &pl->ob->chosen_skill->name : "-"
		653	);
		654	#endif
713		655
714	if (pl->ranged_ob)	656	if (pl->ranged_ob)
715	buf << " Range" << (pl->ob->current_weapon == pl->ranged_ob ? "*" : "") << ": " << pl->ranged_ob->name;	657	buf << " Range" << (pl->ob->current_weapon == pl->ranged_ob ? "*" : "") << ": " << pl->ranged_ob->name;
716		658
717	if (pl->combat_ob)	659	if (pl->combat_ob)
…		…
763	* commands for now.	705	* commands for now.
764	*/	706	*/
765	void	707	void
766	esrv_update_stats (player *pl)	708	esrv_update_stats (player *pl)
767	{	709	{
768	char buf[MAX_BUF];
769	uint16 flags;
770
771	client *ns = pl->ns;	710	client *ns = pl->ns;
772	if (!ns)	711	if (!ns)
773	return;	712	return;
774		713
775	object *ob = pl->observe;	714	object *ob = pl->observe;
…		…
792	AddIfShort (ns->last_stats.Int, ob->stats.Int, CS_STAT_INT);	731	AddIfShort (ns->last_stats.Int, ob->stats.Int, CS_STAT_INT);
793	AddIfShort (ns->last_stats.Wis, ob->stats.Wis, CS_STAT_WIS);	732	AddIfShort (ns->last_stats.Wis, ob->stats.Wis, CS_STAT_WIS);
794	AddIfShort (ns->last_stats.Pow, ob->stats.Pow, CS_STAT_POW);	733	AddIfShort (ns->last_stats.Pow, ob->stats.Pow, CS_STAT_POW);
795	AddIfShort (ns->last_stats.Cha, ob->stats.Cha, CS_STAT_CHA);	734	AddIfShort (ns->last_stats.Cha, ob->stats.Cha, CS_STAT_CHA);
796		735
797	for (int s = 0; s < NUM_SKILLS; s++)	736	for (int s = 0; s < CS_NUM_SKILLS; s++)
798	if (object *skill = opl->last_skill_ob[s])	737	if (object *skill = opl->last_skill_ob [s])
799	if (skill->stats.exp != ns->last_skill_exp [s])	738	if (skill->stats.exp != ns->last_skill_exp [s])
800	{	739	{
801	ns->last_skill_exp [s] = skill->stats.exp;	740	ns->last_skill_exp [s] = skill->stats.exp;
802		741
803	/* Always send along the level if exp changes. This is only	742	/* Always send along the level if exp changes. This is only
804	* 1 extra byte, but keeps processing simpler.	743	* 1 extra byte, but keeps processing simpler.
805	*/	744	*/
806	sl << uint8 (s + CS_STAT_SKILLINFO)	745	sl << uint8 (CS_STAT_SKILLINFO + s)
807	<< uint8 (skill->level)	746	<< uint8 (skill->level)
808	<< uint64 (skill->stats.exp);	747	<< uint64 (skill->stats.exp);
809	}	748	}
810		749
811	AddIfInt64 (ns->last_stats.exp, ob->stats.exp, CS_STAT_EXP64);	750	AddIfInt64 (ns->last_stats.exp, ob->stats.exp, CS_STAT_EXP64);
812	AddIfShort (ns->last_level, ob->level, CS_STAT_LEVEL);	751	AddIfShort (ns->last_level, ob->level, CS_STAT_LEVEL);
813	AddIfShort (ns->last_stats.wc, ob->stats.wc, CS_STAT_WC);	752	AddIfShort (ns->last_stats.wc, ob->stats.wc, CS_STAT_WC);
814	AddIfShort (ns->last_stats.ac, ob->stats.ac, CS_STAT_AC);	753	AddIfShort (ns->last_stats.ac, ob->stats.ac, CS_STAT_AC);
815	AddIfShort (ns->last_stats.dam, ob->stats.dam, CS_STAT_DAM);	754	AddIfShort (ns->last_stats.dam, ob->stats.dam, CS_STAT_DAM);
816	AddIfFloat (ns->last_speed, ob->speed, CS_STAT_SPEED, 1.f/TICK);	755	AddIfFloat (ns->last_speed, ob->speed, CS_STAT_SPEED, 1.f / TICK);
817	AddIfShort (ns->last_stats.food, ob->stats.food, CS_STAT_FOOD);	756	AddIfShort (ns->last_stats.food, ob->stats.food, CS_STAT_FOOD);
818	AddIfFloat (ns->last_weapon_sp, pl->weapon_sp, CS_STAT_WEAP_SP, 1.f/TICK);	757	AddIfFloat (ns->last_weapon_sp, pl->weapon_sp, CS_STAT_WEAP_SP, 1.f / TICK);
819	AddIfInt (ns->last_weight_limit, weight_limit[ob->stats.Str], CS_STAT_WEIGHT_LIM);	758	AddIfInt (ns->last_weight_limit, weight_limit[ob->stats.Str], CS_STAT_WEIGHT_LIM);
820		759
821	flags = 0;	760	int flags = (opl->fire_on ? SF_FIREON : 0)
822		761	| (opl->run_on ? SF_RUNON : 0);
823	if (opl->fire_on)
824	flags |= SF_FIREON;
825
826	if (opl->run_on)
827	flags |= SF_RUNON;
828		762
829	AddIfShort (ns->last_flags, flags, CS_STAT_FLAGS);	763	AddIfShort (ns->last_flags, flags, CS_STAT_FLAGS);
830		764
831	if (ns->sc_version < 1025)
832	{ AddIfShort (ns->last_resist[ATNR_PHYSICAL], ob->resist[ATNR_PHYSICAL], CS_STAT_ARMOUR) }
833	else
834	for (int i = 0; i < NROFATTACKS; i++)	765	for (int i = 0; i < NROFATTACKS; i++)
835	{
836	/* Skip ones we won't send */	766	/* Skip ones we won't send */
837	if (atnr_cs_stat[i] == -1)	767	if (atnr_cs_stat[i] >= 0)
838	continue;
839
840	AddIfShort (ns->last_resist[i], ob->resist[i], atnr_cs_stat[i]);	768	AddIfShort (ns->last_resist[i], ob->resist[i], atnr_cs_stat[i]);
841	}
842		769
843	if (pl->ns->monitor_spells)	770	if (pl->ns->monitor_spells)
844	{	771	{
845	AddIfInt (ns->last_path_attuned, ob->path_attuned, CS_STAT_SPELL_ATTUNE);	772	AddIfInt (ns->last_path_attuned, ob->path_attuned, CS_STAT_SPELL_ATTUNE);
846	AddIfInt (ns->last_path_repelled, ob->path_repelled, CS_STAT_SPELL_REPEL);	773	AddIfInt (ns->last_path_repelled, ob->path_repelled, CS_STAT_SPELL_REPEL);
847	AddIfInt (ns->last_path_denied, ob->path_denied, CS_STAT_SPELL_DENY);	774	AddIfInt (ns->last_path_denied, ob->path_denied, CS_STAT_SPELL_DENY);
848	}	775	}
849		776
		777	char buf[MAX_BUF];
850	rangetostring (opl, buf); /* we want use the new fire & run system in new client */	778	rangetostring (opl, buf); /* we want use the new fire & run system in new client */
851	AddIfString (ns->stats.range, buf, CS_STAT_RANGE);	779	AddIfString (ns->stats.range, buf, CS_STAT_RANGE);
852	set_title (ob, buf);	780	set_title (ob, buf);
853	AddIfString (ns->stats.title, buf, CS_STAT_TITLE);	781	AddIfString (ns->stats.title, buf, CS_STAT_TITLE);
854		782
…		…
859		787
860	/**	788	/**
861	* Tells the client that here is a player it should start using.	789	* Tells the client that here is a player it should start using.
862	*/	790	*/
863	void	791	void
864	esrv_new_player (player *pl, uint32 weight)	792	esrv_new_player (player *pl)
865	{	793	{
		794	sint32 weight = pl->ob->client_weight ();
		795
866	packet sl ("player");	796	packet sl ("player");
867		797
868	sl << uint32 (pl->ob->count)	798	sl << uint32 (pl->ob->count)
869	<< uint32 (weight)	799	<< uint32 (weight)
870	<< uint32 (pl->ob->face)	800	<< uint32 (pl->ob->face)
871	<< data8 (pl->ob->name);	801	<< data8 (pl->ob->name);
872		802
873	pl->ns->last_weight = weight;	803	pl->ns->last_weight = weight;
874	pl->ns->send_packet (sl);	804	pl->ns->send_packet (sl);
875	SET_FLAG (pl->ob, FLAG_CLIENT_SENT);
876	}	805	}
877		806
878	/******************************************************************************	807	/******************************************************************************
879	*	808	*
880	* Start of map related commands.	809	* Start of map related commands.
…		…
937		866
938	if (!ns.faces_sent[face_num])	867	if (!ns.faces_sent[face_num])
939	if (ob)	868	if (ob)
940	ns.send_faces (ob);	869	ns.send_faces (ob);
941	else	870	else
942	ns.send_face (face_num);	871	ns.send_face (face_num, 10);
943		872
944	sl << uint16 (face_num);	873	sl << uint16 (face_num);
945	return 1;	874	return 1;
946	}	875	}
947		876
948	/* Nothing changed */	877	/* Nothing changed */
949	return 0;	878	return 0;
950	}	879	}
951		880
952	/**	881	//-GPL
953	* Returns the size of a data for a map square as returned by
954	* mapextended. There are CLIENTMAPX*CLIENTMAPY*LAYERS entries
955	* available.
956	*/
957	int
958	getExtendedMapInfoSize (client * ns)
959	{
960	int result = 0;
961		882
962	if (ns->ext_mapinfos)	883	// prefetch maps in an area of PREFETCH x PREFETCH around the player
963	{	884	#define PREFETCH 40
964	if (ns->EMI_smooth)
965	result += 1; /*One byte for smoothlevel */
966	}
967
968	return result;
969	}
970
971	// prefetch (and touch) all maps within a specific distancd
972	static void
973	prefetch_surrounding_maps (maptile *map, int distance)
974	{
975	map->last_access = runtime;
976
977	if (--distance)
978	for (int dir = 4; --dir; )
979	if (const shstr &path = map->tile_path [dir])
980	if (maptile *&neigh = map->tile_map [dir])
981	prefetch_surrounding_maps (neigh, distance);
982	else
983	neigh = maptile::find_async (path, map);
984	}
985		885
986	// prefetch a generous area around the player	886	// prefetch a generous area around the player
987	static void	887	static void
988	prefetch_surrounding_maps (object *op)	888	prefetch_surrounding_maps (object *op)
989	{	889	{
990	prefetch_surrounding_maps (op->map, 3);	890	for (maprect *rect = op->map->split_to_tiles (mapwalk_buf,
		891	op->x - PREFETCH , op->y - PREFETCH ,
		892	op->x + PREFETCH + 1, op->y + PREFETCH + 1);
		893	rect->m;
		894	++rect)
		895	rect->m->touch ();
991	}	896	}
		897
		898	//+GPL
992		899
993	/**	900	/**
994	* Draws client map.	901	* Draws client map.
995	*/	902	*/
996	void	903	void
997	draw_client_map (player *pl)	904	draw_client_map (player *pl)
998	{	905	{
999	object *ob = pl->observe;	906	object *ob = pl->viewpoint;
1000	if (!ob->active)	907	if (!pl->observe->active)
1001	return;	908	return;
1002
1003	maptile *plmap = ob->map;
1004		909
1005	/* If player is just joining the game, he isn't here yet, so the map	910	/* If player is just joining the game, he isn't here yet, so the map
1006	* can get swapped out. If so, don't try to send them a map. All will	911	* can get swapped out. If so, don't try to send them a map. All will
1007	* be OK once they really log in.	912	* be OK once they really log in.
1008	*/	913	*/
1009	if (!plmap || plmap->in_memory != MAP_IN_MEMORY)	914	if (!ob->map || ob->map->in_memory != MAP_ACTIVE)
1010	return;	915	return;
1011		916
1012	int x, y, ax, ay, startlen, max_x, max_y, oldlen;
1013	int estartlen, eoldlen;	917	int startlen, oldlen;
1014	uint8 eentrysize;
1015	uint16 ewhatstart, ewhatflag;
1016	uint8 extendedinfos;
1017		918
1018	check_map_change (pl);	919	check_map_change (pl);
1019	prefetch_surrounding_maps (pl->ob);	920	prefetch_surrounding_maps (pl->ob);
1020		921
1021	/* do LOS after calls to update_position */	922	/* do LOS after calls to update_position */
1022	if (ob != pl->ob)	923	/* unfortunately, we need to udpate los when observing, currently */
1023	clear_los (pl);	924	if (pl->do_los || pl->viewpoint != pl->ob)
1024	else if (pl->do_los)
1025	{	925	{
1026	update_los (ob);
1027	pl->do_los = 0;	926	pl->do_los = 0;
		927	pl->update_los ();
1028	}	928	}
1029		929
1030	/**	930	/**
1031	* This function uses the new map1 protocol command to send the map	931	* This function uses the new map1 protocol command to send the map
1032	* to the client. It is necessary because the old map command supports	932	* to the client. It is necessary because the old map command supports
…		…
1051	*/	951	*/
1052		952
1053	client &socket = *pl->ns;	953	client &socket = *pl->ns;
1054		954
1055	packet sl (socket.mapmode == Map1Cmd ? "map1" : "map1a");	955	packet sl (socket.mapmode == Map1Cmd ? "map1" : "map1a");
1056	packet esl;
1057		956
1058	startlen = sl.length ();	957	startlen = sl.length ();
1059		958
1060	/*Extendedmapinfo structure initialisation */	959	int hx = socket.mapx / 2;
1061	if (socket.ext_mapinfos)	960	int hy = socket.mapy / 2;
1062	{
1063	extendedinfos = EMI_NOREDRAW;
1064		961
1065	if (socket.EMI_smooth)	962	ordered_mapwalk_begin (ob, -hx, -hy, hx, hy)
1066	extendedinfos |= EMI_SMOOTH;	963	int ax = dx + hx;
		964	int ay = dy + hy;
1067		965
1068	ewhatstart = esl.length ();	966	int mask = (ax << 10) | (ay << 4);
1069	ewhatflag = extendedinfos; /*The EMI_NOREDRAW bit	967	MapCell &lastcell = socket.lastmap.cells[ax][ay];
1070	could need to be taken away */
1071	eentrysize = getExtendedMapInfoSize (&socket);
1072	esl << "mapextended "
1073	<< uint8 (extendedinfos)
1074	<< uint8 (eentrysize);
1075		968
1076	estartlen = esl.length ();	969	/* If the coordinates are not valid, or it is too dark to see,
1077	}	970	* we tell the client as such
1078
1079	/* x,y are the real map locations. ax, ay are viewport relative
1080	* locations.
1081	*/	971	*/
1082	ay = 0;	972	if (!m)
1083
1084	/* We could do this logic as conditionals in the if statement,
1085	* but that started to get a bit messy to look at.
1086	*/
1087	max_x = ob->x + (socket.mapx + 1) / 2;
1088	max_y = ob->y + (socket.mapy + 1) / 2;
1089
1090	for (y = ob->y - socket.mapy / 2; y < max_y; y++, ay++)
1091	{	973	{
1092	sint16 nx, ny;	974	/* space is out of map. Update space and clear values
1093	maptile *m = 0;	975	* if this hasn't already been done. If the space is out
1094		976	* of the map, it shouldn't have a head.
1095	ax = 0;	977	*/
1096	for (x = ob->x - socket.mapx / 2; x < max_x; x++, ax++)	978	if (lastcell.count != -1)
1097	{	979	{
1098	// check to see if we can simply go one right quickly	980	sl << uint16 (mask);
		981	map_clearcell (&lastcell, -1);
1099	++nx;	982	}
1100	if (m && nx >= m->width)	983
		984	continue;
		985	}
		986
		987	int d = pl->blocked_los_uc (dx, dy);
		988
		989	if (d > 3)
		990	{
		991	/* This block deals with spaces that are not visible for whatever
		992	* reason. Still may need to send the head for this space.
		993	*/
		994	if (lastcell.count != -1
		995	|| lastcell.faces[0]
		996	|| lastcell.faces[1]
		997	|| lastcell.faces[2]
		998	|| lastcell.stat_hp
		999	|| lastcell.flags
		1000	|| lastcell.player)
		1001	sl << uint16 (mask);
		1002
		1003	/* properly clear a previously sent big face */
		1004	map_clearcell (&lastcell, -1);
		1005	}
		1006	else
		1007	{
		1008	/* In this block, the space is visible.
		1009	*/
		1010
		1011	/* Rather than try to figure out what everything that we might
		1012	* need to send is, then form the packet after that,
		1013	* we presume that we will in fact form a packet, and update
		1014	* the bits by what we do actually send. If we send nothing,
		1015	* we just back out sl.length () to the old value, and no harm
		1016	* is done.
		1017	* I think this is simpler than doing a bunch of checks to see
		1018	* what if anything we need to send, setting the bits, then
		1019	* doing those checks again to add the real data.
		1020	*/
		1021	oldlen = sl.length ();
		1022
		1023	sl << uint16 (mask);
		1024
		1025	unsigned char dummy;
		1026	unsigned char *last_ext = &dummy;
		1027
		1028	/* Darkness changed */
		1029	if (lastcell.count != d)
		1030	{
1101	m = 0;	1031	mask |= 0x8;
1102		1032
1103	if (!m)	1033	*last_ext |= 0x80;
		1034	last_ext = &sl[sl.length ()];
		1035	sl << uint8 (d);
		1036	}
		1037
		1038	lastcell.count = d;
		1039
		1040	mapspace &ms = m->at (nx, ny);
		1041	ms.update ();
		1042
		1043	// extmap handling
		1044	uint8 stat_hp = 0;
		1045	uint8 stat_width = 0;
		1046	uint8 flags = 0;
		1047	tag_t player = 0;
		1048
		1049	// send hp information, if applicable
		1050	if (object *op = ms.faces_obj [0])
		1051	if (op->is_head () && !op->invisible)
1104	{	1052	{
1105	nx = x; ny = y; m = plmap;	1053	if (op->stats.maxhp > op->stats.hp
1106		1054	&& op->stats.maxhp > 0
1107	if (!xy_normalise (m, nx, ny))	1055	&& (op->type == PLAYER
		1056	|| op->type == DOOR // does not work, have maxhp 0
		1057	|| op->flag [FLAG_MONSTER]
		1058	|| op->flag [FLAG_ALIVE]
		1059	|| op->flag [FLAG_GENERATOR]))
1108	m = 0;	1060	{
		1061	stat_hp = 255 - (op->stats.hp * 255 + 254) / op->stats.maxhp;
		1062	stat_width = op->arch->max_x - op->arch->x; //TODO: should be upper-left edge
		1063	}
		1064
		1065	if (expect_false (op->has_dialogue ()))
		1066	flags |= 1;
		1067
		1068	if (expect_false (op->type == PLAYER))
		1069	player = op == ob ? pl->ob->count
		1070	: op == pl->ob ? ob->count
		1071	: op->count;
1109	}	1072	}
1110		1073
1111	int emask, mask;	1074	if (expect_false (lastcell.stat_hp != stat_hp))
1112	emask = mask = (ax & 0x3f) << 10 | (ay & 0x3f) << 4;
1113
1114	MapCell &lastcell = socket.lastmap.cells[ax][ay];
1115
1116	/* If the coordinates are not valid, or it is too dark to see,
1117	* we tell the client as such
1118	*/
1119	if (!m)
1120	{	1075	{
1121	/* space is out of map. Update space and clear values	1076	lastcell.stat_hp = stat_hp;
1122	* if this hasn't already been done. If the space is out	1077
1123	* of the map, it shouldn't have a head	1078	mask |= 0x8;
1124	*/	1079	*last_ext |= 0x80;
1125	if (lastcell.count != -1)	1080	last_ext = &sl[sl.length ()];
		1081
		1082	sl << uint8 (5) << uint8 (stat_hp);
		1083
		1084	if (stat_width > 1)
1126	{	1085	{
1127	sl << uint16 (mask);
1128	map_clearcell (&lastcell, -1);
1129	}
1130
1131	continue;
1132	}
1133
1134	m->touch ();
1135
1136	int d = pl->blocked_los[ax][ay];
1137
1138	if (d > 3)
1139	{
1140
1141	int need_send = 0, count;
1142
1143	/* This block deals with spaces that are not visible for whatever
1144	* reason. Still may need to send the head for this space.
1145	*/
1146
1147	oldlen = sl.length ();
1148
1149	sl << uint16 (mask);
1150
1151	if (lastcell.count != -1)
1152	need_send = 1;
1153
1154	count = -1;
1155
1156	/* properly clear a previously sent big face */
1157	if (lastcell.faces[0] || lastcell.faces[1] || lastcell.faces[2]
1158	|| lastcell.stat_hp || lastcell.flags || lastcell.player)
1159	need_send = 1;
1160
1161	map_clearcell (&lastcell, count);
1162
1163	if ((mask & 0xf) || need_send)
1164	sl[oldlen + 1] = mask & 0xff;
1165	else
1166	sl.reset (oldlen);
1167	}
1168	else
1169	{
1170	/* In this block, the space is visible.
1171	*/
1172
1173	/* Rather than try to figure out what everything that we might
1174	* need to send is, then form the packet after that,
1175	* we presume that we will in fact form a packet, and update
1176	* the bits by what we do actually send. If we send nothing,
1177	* we just back out sl.length () to the old value, and no harm
1178	* is done.
1179	* I think this is simpler than doing a bunch of checks to see
1180	* what if anything we need to send, setting the bits, then
1181	* doing those checks again to add the real data.
1182	*/
1183	oldlen = sl.length ();
1184	eoldlen = esl.length ();
1185
1186	sl << uint16 (mask);
1187
1188	unsigned char dummy;
1189	unsigned char *last_ext = &dummy;
1190
1191	/* Darkness changed */
1192	if (lastcell.count != d && socket.darkness)
1193	{
1194	mask |= 0x8;
1195
1196	if (socket.extmap)
1197	{
1198	*last_ext |= 0x80;	1086	*last_ext |= 0x80;
1199	last_ext = &sl[sl.length ()];	1087	last_ext = &sl[sl.length ()];
1200	sl << uint8 (d);	1088
1201	}	1089	sl << uint8 (6) << uint8 (stat_width);
1202	else
1203	sl << uint8 (255 - 64 * d);
1204	}	1090	}
		1091	}
1205		1092
1206	lastcell.count = d;	1093	if (expect_false (lastcell.player != player))
1207
1208	mapspace &ms = m->at (nx, ny);
1209	ms.update ();
1210
1211	if (socket.extmap)
1212	{	1094	{
1213	uint8 stat_hp = 0;	1095	lastcell.player = player;
1214	uint8 stat_width = 0;
1215	uint8 flags = 0;
1216	tag_t player = 0;
1217		1096
1218	// send hp information, if applicable
1219	if (object *op = ms.faces_obj [0])
1220	{
1221	if (op->head || op->invisible)
1222	; // do not show
1223	else if (op->type == PLAYER
1224	|| QUERY_FLAG (op, FLAG_MONSTER) || QUERY_FLAG (op, FLAG_ALIVE) || QUERY_FLAG (op, FLAG_GENERATOR))
1225	{
1226	if (op->stats.maxhp > 0 && (unsigned) op->stats.maxhp > (unsigned) op->stats.hp)
1227	{
1228	stat_hp = 255 - (op->stats.hp * 255 + 254) / op->stats.maxhp;
1229	stat_width = op->arch->max_x - op->arch->x; //TODO: should be upper-left edge
1230	}
1231	}
1232
1233	if (op->msg && op->msg[0] == '@')
1234	flags |= 1;
1235
1236	if (op->type == PLAYER && op != ob)
1237	player = op->count;
1238	}
1239
1240	if (lastcell.stat_hp != stat_hp)
1241	{
1242	lastcell.stat_hp = stat_hp;
1243
1244	mask |= 0x8;	1097	mask |= 0x8;
1245	*last_ext |= 0x80;	1098	*last_ext |= 0x80;
1246	last_ext = &sl[sl.length ()];	1099	last_ext = &sl[sl.length ()];
1247		1100
1248	sl << uint8 (5) << uint8 (stat_hp);
1249
1250	if (stat_width > 1)
1251	{
1252	*last_ext |= 0x80;
1253	last_ext = &sl[sl.length ()];
1254
1255	sl << uint8 (6) << uint8 (stat_width);
1256	}
1257	}
1258
1259	if (lastcell.player != player)
1260	{
1261	lastcell.player = player;
1262
1263	mask |= 0x8;
1264	*last_ext |= 0x80;
1265	last_ext = &sl[sl.length ()];
1266
1267	sl << uint8 (0x47) << uint8 (4) << (uint32)player;	1101	sl << uint8 (0x47) << uint8 (4) << (uint32)player;
1268	}	1102	}
1269		1103
1270	if (lastcell.flags != flags)	1104	if (expect_false (lastcell.flags != flags))
1271	{	1105	{
1272	lastcell.flags = flags;	1106	lastcell.flags = flags;
1273		1107
1274	mask |= 0x8;	1108	mask |= 0x8;
1275	*last_ext |= 0x80;	1109	*last_ext |= 0x80;
1276	last_ext = &sl[sl.length ()];	1110	last_ext = &sl[sl.length ()];
1277		1111
1278	sl << uint8 (8) << uint8 (flags);	1112	sl << uint8 (8) << uint8 (flags);
1279	}
1280	}	1113	}
1281		1114
		1115	// faces
		1116
1282	/* Floor face */	1117	/* Floor face */
1283	if (update_space (sl, socket, ms, lastcell, 2))	1118	if (update_space (sl, socket, ms, lastcell, 2))
1284	mask |= 0x4;	1119	mask |= 0x4;
1285		1120
1286	/* Middle face */	1121	/* Middle face */
1287	if (update_space (sl, socket, ms, lastcell, 1))	1122	if (update_space (sl, socket, ms, lastcell, 1))
1288	mask |= 0x2;	1123	mask |= 0x2;
1289		1124
		1125	if (expect_false (ob->invisible)
		1126	&& ob->invisible & (ob->invisible < 50 ? 1 : 7)
1290	if (ms.player () == ob	1127	&& ms.player () == ob)
1291	&& (ob->invisible & (ob->invisible < 50 ? 1 : 7)))
1292	{	1128	{
1293	// force player to be visible to himself if invisible	1129	// force player to be visible to himself if invisible
1294	if (lastcell.faces[0] != ob->face)	1130	if (lastcell.faces[0] != ob->face)
1295	{	1131	{
1296	lastcell.faces[0] = ob->face;	1132	lastcell.faces[0] = ob->face;
1297		1133
1298	mask |= 0x1;
1299	sl << uint16 (ob->face);
1300
1301	socket.send_faces (ob);
1302	}
1303	}
1304	/* Top face */
1305	else if (update_space (sl, socket, ms, lastcell, 0))
1306	mask |= 0x1;	1134	mask |= 0x1;
		1135	sl << uint16 (ob->face);
1307		1136
		1137	socket.send_faces (ob);
		1138	}
		1139	}
		1140	/* Top face */
		1141	else if (update_space (sl, socket, ms, lastcell, 0))
		1142	mask |= 0x1;
		1143
1308	/* Check to see if we are in fact sending anything for this	1144	/* Check to see if we are in fact sending anything for this
1309	* space by checking the mask. If so, update the mask.	1145	* space by checking the mask. If so, update the mask.
1310	* if not, reset the len to that from before adding the mask	1146	* if not, reset the len to that from before adding the mask
1311	* value, so we don't send those bits.	1147	* value, so we don't send those bits.
1312	*/	1148	*/
1313	if (mask & 0xf)	1149	if (mask & 0xf)
1314	sl[oldlen + 1] = mask & 0xff;	1150	sl[oldlen + 1] = mask & 0xff;
1315	else	1151	else
1316	sl.reset (oldlen);	1152	sl.reset (oldlen);
1317
1318	if (socket.ext_mapinfos)
1319	esl << uint16 (emask);
1320
1321	if (socket.EMI_smooth)
1322	{
1323	for (int layer = 2+1; layer--; )
1324	{
1325	object *ob = ms.faces_obj [layer];
1326
1327	// If there is no object for this space, or if the face for the object
1328	// is the blank face, set the smoothlevel to zero.
1329	int smoothlevel = ob && ob->face != blank_face ? ob->smoothlevel : 0;
1330
1331	// We've gotten what face we want to use for the object. Now see if
1332	// if it has changed since we last sent it to the client.
1333	if (lastcell.smooth[layer] != smoothlevel)
1334	{
1335	lastcell.smooth[layer] = smoothlevel;
1336	esl << uint8 (smoothlevel);
1337	emask |= 1 << layer;
1338	}
1339	}
1340
1341	if (emask & 0xf)
1342	esl[eoldlen + 1] = emask & 0xff;
1343	else
1344	esl.reset (eoldlen);
1345	}
1346	} /* else this is a viewable space */	1153	} /* else this is a viewable space */
1347	} /* for x loop */	1154	ordered_mapwalk_end
1348	} /* for y loop */
1349		1155
1350	socket.flush_fx ();	1156	socket.flush_fx ();
1351
1352	/* Verify that we in fact do need to send this */
1353	if (socket.ext_mapinfos)
1354	{
1355	if (!(sl.length () > startlen || socket.sent_scroll))
1356	{
1357	/* No map data will follow, so don't say the client
1358	* it doesn't need draw!
1359	*/
1360	ewhatflag &= ~EMI_NOREDRAW;
1361	esl[ewhatstart + 1] = ewhatflag & 0xff;
1362	}
1363
1364	if (esl.length () > estartlen)
1365	socket.send_packet (esl);
1366	}
1367		1157
1368	if (sl.length () > startlen || socket.sent_scroll)	1158	if (sl.length () > startlen || socket.sent_scroll)
1369	{	1159	{
1370	socket.send_packet (sl);	1160	socket.send_packet (sl);
1371	socket.sent_scroll = 0;	1161	socket.sent_scroll = 0;
1372	}	1162	}
1373	}	1163	}
1374		1164
1375	/*****************************************************************************/
1376	/* GROS: The following one is used to allow a plugin to send a generic cmd to*/
1377	/* a player. Of course, the client need to know the command to be able to */
1378	/* manage it ! */
1379	/*****************************************************************************/
1380	void
1381	send_plugin_custom_message (object *pl, char *buf)
1382	{
1383	pl->contr->ns->send_packet (buf);
1384	}
1385
1386	/**
1387	* This sends the skill number to name mapping. We ignore
1388	* the params - we always send the same info no matter what.
1389	*/
1390	void
1391	send_skill_info (client *ns, char *params)
1392	{
1393	packet sl;
1394	sl << "replyinfo skill_info\n";
1395
1396	for (int i = 1; i < NUM_SKILLS; i++)
1397	sl.printf ("%d:%s\n", i + CS_STAT_SKILLINFO, &skill_names[i]);
1398
1399	if (sl.length () >= MAXSOCKBUF)
1400	{
1401	LOG (llevError, "Buffer overflow in send_skill_info!\n");
1402	fatal (0);
1403	}
1404
1405	ns->send_packet (sl);
1406	}
1407
1408	/**
1409	* This sends the spell path to name mapping. We ignore
1410	* the params - we always send the same info no matter what.
1411	*/
1412	void
1413	send_spell_paths (client * ns, char *params)
1414	{
1415	packet sl;
1416
1417	sl << "replyinfo spell_paths\n";
1418
1419	for (int i = 0; i < NRSPELLPATHS; i++)
1420	sl.printf ("%d:%s\n", 1 << i, spellpathnames[i]);
1421
1422	if (sl.length () >= MAXSOCKBUF)
1423	{
1424	LOG (llevError, "Buffer overflow in send_spell_paths!\n");
1425	fatal (0);
1426	}
1427
1428	ns->send_packet (sl);
1429	}
1430
1431	/**	1165	/**
1432	* This looks for any spells the player may have that have changed their stats.	1166	* This looks for any spells the player may have that have changed their stats.
1433	* it then sends an updspell packet for each spell that has changed in this way	1167	* it then sends an updspell packet for each spell that has changed in this way
1434	*/	1168	*/
1435	void	1169	void
1436	esrv_update_spells (player *pl)	1170	esrv_update_spells (player *pl)
1437	{	1171	{
1438	if (!pl->ns)	1172	if (!pl->ns)
1439	return;	1173	return;
1440		1174
		1175	pl->ns->update_spells = false;
		1176
1441	if (!pl->ns->monitor_spells)	1177	if (!pl->ns->monitor_spells)
1442	return;	1178	return;
1443		1179
1444	for (object *spell = pl->ob->inv; spell; spell = spell->below)	1180	for (object *spell = pl->ob->inv; spell; spell = spell->below)
1445	{
1446	if (spell->type == SPELL)	1181	if (spell->type == SPELL)
1447	{	1182	{
1448	int flags = 0;	1183	int flags = 0;
		1184	int val;
1449		1185
1450	/* check if we need to update it */	1186	/* check if we need to update it */
1451	if (spell->last_sp != SP_level_spellpoint_cost (pl->ob, spell, SPELL_MANA))	1187	val = SP_level_spellpoint_cost (pl->ob, spell, SPELL_MANA);
		1188	if (spell->cached_sp != val)
1452	{	1189	{
1453	spell->last_sp = SP_level_spellpoint_cost (pl->ob, spell, SPELL_MANA);	1190	spell->cached_sp = val;
1454	flags |= UPD_SP_MANA;	1191	flags |= UPD_SP_MANA;
1455	}	1192	}
1456		1193
1457	if (spell->last_grace != SP_level_spellpoint_cost (pl->ob, spell, SPELL_GRACE))	1194	val = SP_level_spellpoint_cost (pl->ob, spell, SPELL_GRACE);
		1195	if (spell->cached_grace != val)
1458	{	1196	{
1459	spell->last_grace = SP_level_spellpoint_cost (pl->ob, spell, SPELL_GRACE);	1197	spell->cached_grace = val;
1460	flags |= UPD_SP_GRACE;	1198	flags |= UPD_SP_GRACE;
1461	}	1199	}
1462		1200
1463	if (spell->last_eat != spell->stats.dam + SP_level_dam_adjust (pl->ob, spell))	1201	val = casting_level (pl->ob, spell);
		1202	if (spell->cached_eat != val)
1464	{	1203	{
1465	spell->last_eat = spell->stats.dam + SP_level_dam_adjust (pl->ob, spell);	1204	spell->cached_eat = val;
1466	flags |= UPD_SP_DAMAGE;	1205	flags |= UPD_SP_LEVEL;
1467	}	1206	}
1468		1207
1469	if (flags)	1208	if (flags)
1470	{	1209	{
1471	packet sl;	1210	packet sl;
1472		1211
1473	sl << "updspell "	1212	sl << "updspell "
1474	<< uint8 (flags)	1213	<< uint8 (flags)
1475	<< uint32 (spell->count);	1214	<< uint32 (spell->count);
1476		1215
1477	if (flags & UPD_SP_MANA ) sl << uint16 (spell->last_sp);	1216	if (flags & UPD_SP_MANA ) sl << uint16 (spell->cached_sp);
1478	if (flags & UPD_SP_GRACE ) sl << uint16 (spell->last_grace);	1217	if (flags & UPD_SP_GRACE) sl << uint16 (spell->cached_grace);
1479	if (flags & UPD_SP_DAMAGE) sl << uint16 (spell->last_eat);	1218	if (flags & UPD_SP_LEVEL) sl << uint16 (spell->cached_eat);
1480		1219
1481	pl->ns->send_packet (sl);	1220	pl->ns->send_packet (sl);
1482	}	1221	}
1483	}	1222	}
1484	}
1485	}	1223	}
1486		1224
1487	void	1225	void
1488	esrv_remove_spell (player *pl, object *spell)	1226	esrv_remove_spell (player *pl, object *spell)
1489	{	1227	{
…		…
1514	LOG (llevError, "item number %d is a spell with no name.\n", spell->count);	1252	LOG (llevError, "item number %d is a spell with no name.\n", spell->count);
1515	return;	1253	return;
1516	}	1254	}
1517		1255
1518	/* store costs and damage in the object struct, to compare to later */	1256	/* store costs and damage in the object struct, to compare to later */
1519	spell->last_sp = SP_level_spellpoint_cost (pl->ob, spell, SPELL_MANA);	1257	spell->cached_sp = SP_level_spellpoint_cost (pl->ob, spell, SPELL_MANA);
1520	spell->last_grace = SP_level_spellpoint_cost (pl->ob, spell, SPELL_GRACE);	1258	spell->cached_grace = SP_level_spellpoint_cost (pl->ob, spell, SPELL_GRACE);
1521	spell->last_eat = spell->stats.dam + SP_level_dam_adjust (pl->ob, spell);	1259	spell->cached_eat = casting_level (pl->ob, spell);
1522		1260
1523	/* figure out which skill it uses, if it uses one */	1261	/* figure out which skill it uses, if it uses one */
1524	if (spell->skill)	1262	if (spell->skill)
1525	{	1263	if (object *tmp = pl->find_skill (spell->skill))
1526	for (i = 1; i < NUM_SKILLS; i++)	1264	skill = CS_STAT_SKILLINFO + SKILL_INDEX (tmp);
1527	if (!strcmp (spell->skill, skill_names[i]))
1528	{
1529	skill = i + CS_STAT_SKILLINFO;
1530	break;
1531	}
1532	}
1533		1265
1534	// spells better have a face	1266	// spells better have a face
1535	if (!spell->face)	1267	if (!spell->face)
1536	{	1268	{
1537	LOG (llevError, "%s: spell has no face, but face is mandatory.\n", &spell->name);	1269	LOG (llevError, "%s: spell has no face, but face is mandatory.\n", &spell->name);
1538	spell->face = face_find ("burnout.x11", blank_face);	1270	spell->face = face_find ("burnout.x11", blank_face);
1539	}	1271	}
		1272
		1273	pl->ns->send_face (spell->face);
1540		1274
1541	/* send the current values */	1275	/* send the current values */
1542	sl << uint32 (spell->count)	1276	sl << uint32 (spell->count)
1543	<< uint16 (spell->level)	1277	<< uint16 (spell->level)
1544	<< uint16 (spell->casting_time)	1278	<< uint16 (spell->casting_time)
1545	<< uint16 (spell->last_sp)	1279	<< uint16 (spell->cached_sp)
1546	<< uint16 (spell->last_grace)	1280	<< uint16 (spell->cached_grace)
1547	<< uint16 (spell->last_eat)	1281	<< uint16 (spell->cached_eat)
1548	<< uint8 (skill)	1282	<< uint8 (skill)
1549	<< uint32 (spell->path_attuned)	1283	<< uint32 (spell->path_attuned)
1550	<< uint32 (spell->face)	1284	<< uint32 (spell->face)
1551	<< data8 (spell->name)	1285	<< data8 (spell->name)
1552	<< data16 (spell->msg);	1286	<< data16 (spell->msg);
…		…
1580	* bytes and 3 strings (because that is the spec) so we need to	1314	* bytes and 3 strings (because that is the spec) so we need to
1581	* check that the length of those 3 strings, plus the 23 bytes,	1315	* check that the length of those 3 strings, plus the 23 bytes,
1582	* won't take us over the length limit for the socket, if it does,	1316	* won't take us over the length limit for the socket, if it does,
1583	* we need to send what we already have, and restart packet formation	1317	* we need to send what we already have, and restart packet formation
1584	*/	1318	*/
		1319	if (spell->type != SPELL)
		1320	continue;
		1321
1585	/* Seeing crashes by overflowed buffers. Quick arithemetic seems	1322	/* Seeing crashes by overflowed buffers. Quick arithemetic seems
1586	* to show add_spell is 26 bytes + 2 strings. However, the overun	1323	* to show add_spell is 26 bytes + 2 strings. However, the overun
1587	* is hundreds of bytes off, so correcting 22 vs 26 doesn't seem	1324	* is hundreds of bytes off, so correcting 22 vs 26 doesn't seem
1588	* like it will fix this	1325	* like it will fix this
1589	*/	1326	*/
1590	if (spell->type != SPELL)
1591	continue;
1592
1593	if (sl.length () >= (MAXSOCKBUF - (26 + strlen (spell->name) + (spell->msg ? strlen (spell->msg) : 0))))	1327	if (sl.length () > (MAXSOCKBUF - (26 + strlen (spell->name) + (spell->msg ? strlen (spell->msg) : 0))))
1594	{	1328	{
		1329	pl->ns->flush_fx ();
1595	pl->ns->send_packet (sl);	1330	pl->ns->send_packet (sl);
1596		1331
1597	sl.reset ();	1332	sl.reset ();
1598	sl << "addspell ";	1333	sl << "addspell ";
1599	}	1334	}
…		…
1607	return;	1342	return;
1608	}	1343	}
1609	else	1344	else
1610	append_spell (pl, sl, spell);	1345	append_spell (pl, sl, spell);
1611		1346
1612	if (sl.length () >= MAXSOCKBUF)	1347	if (sl.length () > MAXSOCKBUF)
1613	{
1614	LOG (llevError, "Buffer overflow in esrv_add_spells!\n");	1348	cleanup ("buffer overflow in esrv_add_spells!");
1615	fatal (0);
1616	}
1617		1349
1618	/* finally, we can send the packet */	1350	/* finally, we can send the packet */
		1351	pl->ns->flush_fx ();
1619	pl->ns->send_packet (sl);	1352	pl->ns->send_packet (sl);
1620	}	1353	}
1621		1354
		1355	//-GPL
		1356

Diff Legend

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