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.91 by root, Mon Apr 30 04:25:30 2007 UTC vs.
Revision 1.156 by root, Fri Nov 6 12:49:19 2009 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 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
5	* Copyright (C) 2001 Mark Wedel	5	* Copyright (©) 2001,2007 Mark Wedel
6	* Copyright (C) 1992 Frank Tore Johansen	6	* Copyright (©) 1992,2007 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	*
…		…
64	* This table translates the attack numbers as used within the	66	* This table translates the attack numbers as used within the
65	* program to the value we use when sending STATS command to the	67	* 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	68	* client. If a value is -1, then we don't send that to the
67	* client.	69	* client.
68	*/	70	*/
69	short atnr_cs_stat[NROFATTACKS] = { CS_STAT_RES_PHYS,	71	static short atnr_cs_stat[NROFATTACKS] = { CS_STAT_RES_PHYS,
70	CS_STAT_RES_MAG, CS_STAT_RES_FIRE, CS_STAT_RES_ELEC,	72	CS_STAT_RES_MAG, CS_STAT_RES_FIRE, CS_STAT_RES_ELEC,
71	CS_STAT_RES_COLD, CS_STAT_RES_CONF, CS_STAT_RES_ACID,	73	CS_STAT_RES_COLD, CS_STAT_RES_CONF, CS_STAT_RES_ACID,
72	CS_STAT_RES_DRAIN, -1 /* weaponmagic */ ,	74	CS_STAT_RES_DRAIN, -1 /* weaponmagic */ ,
73	CS_STAT_RES_GHOSTHIT, CS_STAT_RES_POISON,	75	CS_STAT_RES_GHOSTHIT, CS_STAT_RES_POISON,
74	CS_STAT_RES_SLOW, CS_STAT_RES_PARA, CS_STAT_TURN_UNDEAD,	76	CS_STAT_RES_SLOW, CS_STAT_RES_PARA, CS_STAT_TURN_UNDEAD,
…		…
99	*/	101	*/
100	mx = ns->mapx;	102	mx = ns->mapx;
101	my = ns->mapy;	103	my = ns->mapy;
102		104
103	/* the x and y here are coordinates for the new map, i.e. if we moved	105	/* 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,	106	* (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	107	* if the destination x or y coordinate is outside the viewable
106	* area, we clear the values - otherwise, the old values	108	* area, we clear the values - otherwise, the old values
107	* are preserved, and the check_head thinks it needs to clear them.	109	* are preserved, and the check_head thinks it needs to clear them.
108	*/	110	*/
109	for (x = 0; x < mx; x++)	111	for (x = 0; x < mx; x++)
110	{
111	for (y = 0; y < my; y++)	112	for (y = 0; y < my; y++)
112	{
113	if (x >= ns->mapx || y >= ns->mapy)	113	if (x >= ns->mapx || y >= ns->mapy)
114	/* clear cells outside the viewable area */	114	/* clear cells outside the viewable area */
115	memset (&newmap.cells[x][y], 0, sizeof (struct MapCell));	115	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)	116	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 */	117	/* clear newly visible tiles within the viewable area */
118	memset (&(newmap.cells[x][y]), 0, sizeof (struct MapCell));	118	memset (&(newmap.cells[x][y]), 0, sizeof (struct MapCell));
119	else	119	else
120	memcpy (&(newmap.cells[x][y]), &(ns->lastmap.cells[x + dx][y + dy]), sizeof (struct MapCell));	120	memcpy (&(newmap.cells[x][y]), &(ns->lastmap.cells[x + dx][y + dy]), sizeof (struct MapCell));
121	}
122	}
123		121
124	memcpy (&(ns->lastmap), &newmap, sizeof (struct Map));	122	memcpy (&(ns->lastmap), &newmap, sizeof (struct Map));
125		123
126	/* Make sure that the next "map1" command will be sent (even if it is	124	/* Make sure that the next "map1" command will be sent (even if it is
127	* empty).	125	* empty).
…		…
130	}	128	}
131		129
132	static void	130	static void
133	clear_map (player *pl)	131	clear_map (player *pl)
134	{	132	{
		133	pl->ns->mapinfo_queue_clear ();
		134
135	memset (&pl->ns->lastmap, 0, sizeof (pl->ns->lastmap));	135	memset (&pl->ns->lastmap, 0, sizeof (pl->ns->lastmap));
136		136
137	pl->ns->force_newmap = false;	137	pl->ns->force_newmap = false;
138		138
139	if (pl->ns->newmapcmd == 1)	139	if (pl->ns->newmapcmd == 1)
140	pl->ns->send_packet ("newmap");	140	pl->ns->send_packet ("newmap");
141		141
142	pl->ns->floorbox_reset ();	142	pl->ns->floorbox_reset ();
		143	}
		144
		145	static void
		146	send_map_info (player *pl)
		147	{
		148	client &socket = *pl->ns;
		149	object *ob = pl->viewpoint;
		150
		151	if (socket.mapinfocmd)
		152	{
		153	if (ob->map && ob->map->path[0])
		154	{
		155	int flags = 0;
		156
		157	if (ob->map->tile_path[0]) flags |= 1;
		158	if (ob->map->tile_path[1]) flags |= 2;
		159	if (ob->map->tile_path[2]) flags |= 4;
		160	if (ob->map->tile_path[3]) flags |= 8;
		161
		162	socket.send_packet_printf ("mapinfo - spatial %d %d %d %d %d %s",
		163	flags, socket.mapx / 2 - ob->x, socket.mapy / 2 - ob->y,
		164	ob->map->width, ob->map->height, &ob->map->path);
		165	}
		166	else
		167	socket.send_packet ("mapinfo current");
		168	}
143	}	169	}
144		170
145	/** check for map/region change and send new map data */	171	/** check for map/region change and send new map data */
146	static void	172	static void
147	check_map_change (player *pl)	173	check_map_change (player *pl)
148	{	174	{
149	client &socket = *pl->ns;	175	client &socket = *pl->ns;
150	object *ob = pl->ob;	176	object *ob = pl->viewpoint;
151	char buf[MAX_BUF]; /* eauugggh */	177
		178	region *reg = ob->region ();
		179	if (socket.current_region != reg)
		180	{
		181	INVOKE_PLAYER (REGION_CHANGE, pl, ARG_REGION (reg), ARG_REGION (socket.current_region));
		182	socket.current_region = reg;
		183	}
		184
		185	// first try to aovid a full newmap on tiled map scrolls
		186	if (socket.current_map != ob->map && !socket.force_newmap)
		187	{
		188	rv_vector rv;
		189
		190	get_rangevector_from_mapcoord (socket.current_map, socket.current_x, socket.current_y, ob, &rv, 0);
		191
		192	// manhattan distance is very handy here
		193	if (rv.distance < 8) // 8 works nicely for speed << 70 and buggy gcfclient
		194	{
		195	socket.current_map = ob->map;
		196	socket.current_x = ob->x;
		197	socket.current_y = ob->y;
		198
		199	socket_map_scroll (&socket, rv.distance_x, rv.distance_y);
		200	socket.floorbox_reset ();
		201	send_map_info (pl);
		202	}
		203	}
152		204
153	if (socket.current_map != ob->map || socket.force_newmap)	205	if (socket.current_map != ob->map || socket.force_newmap)
154	{	206	{
155	clear_map (pl);	207	clear_map (pl);
156	socket.current_map = ob->map;	208	socket.current_map = ob->map;
157		209	send_map_info (pl);
158	if (socket.mapinfocmd)
159	{
160	if (ob->map && ob->map->path[0])
161	{
162	int flags = 0;
163
164	if (ob->map->tile_path[0]) flags |= 1;
165	if (ob->map->tile_path[1]) flags |= 2;
166	if (ob->map->tile_path[2]) flags |= 4;
167	if (ob->map->tile_path[3]) flags |= 8;
168
169	snprintf (buf, MAX_BUF, "mapinfo - spatial %d %d %d %d %d %s",
170	flags, socket.mapx / 2 - ob->x, socket.mapy / 2 - ob->y, ob->map->width, ob->map->height, &ob->map->path);
171	}
172	else
173	snprintf (buf, MAX_BUF, "mapinfo current");
174
175	socket.send_packet (buf);
176	}
177	}	210	}
178	else if (socket.current_x != ob->x || socket.current_y != ob->y)	211	else if (socket.current_x != ob->x || socket.current_y != ob->y)
179	{	212	{
180	int dx = ob->x - socket.current_x;	213	int dx = ob->x - socket.current_x;
181	int dy = ob->y - socket.current_y;	214	int dy = ob->y - socket.current_y;
182		215
183	if (socket.buggy_mapscroll && (abs (dx) > 8 || abs (dy) > 8))
184	clear_map (pl); // current (<= 1.9.1) clients have unchecked buffer overflows
185	else
186	{
187	socket_map_scroll (&socket, ob->x - socket.current_x, ob->y - socket.current_y);	216	socket_map_scroll (&socket, ob->x - socket.current_x, ob->y - socket.current_y);
188	socket.floorbox_reset ();	217	socket.floorbox_reset ();
189	}
190	}	218	}
191		219
192	socket.current_x = ob->x;	220	socket.current_x = ob->x;
193	socket.current_y = ob->y;	221	socket.current_y = ob->y;
194
195	region *reg = ob->region ();
196	if (socket.current_region != reg)
197	{
198	socket.current_region = reg;
199	socket.send_packet_printf ("drawinfo 0 You are now %s.\n(use whereami for more details)", &reg->longname);
200	}
201	}	222	}
202		223
203	/**	224	/**
204	* RequestInfo is sort of a meta command. There is some specific	225	* RequestInfo is sort of a meta command. There is some specific
205	* request of information, but we call other functions to provide	226	* request of information, but we call other functions to provide
206	* that information.	227	* that information.
207	*/	228	*/
208	void	229	void
209	RequestInfo (char *buf, int len, client * ns)	230	RequestInfo (char *buf, int len, client *ns)
210	{	231	{
211	char *params = NULL, *cp;	232	char *params;
212
213	/* No match */
214	char bigbuf[MAX_BUF];
215	int slen;
216
217	/* Set up replyinfo before we modify any of the buffers - this is used
218	* if we don't find a match.
219	*/
220	strcpy (bigbuf, "replyinfo ");
221	slen = strlen (bigbuf);
222	safe_strcat (bigbuf, buf, &slen, MAX_BUF);
223		233
224	/* find the first space, make it null, and update the	234	/* find the first space, make it null, and update the
225	* params pointer.	235	* params pointer.
226	*/	236	*/
227	for (cp = buf; *cp != '\0'; cp++)	237	for (params = buf; *params; params++)
228	if (*cp == ' ')	238	if (*params == ' ')
229	{	239	{
230	*cp = '\0';
231	params = cp + 1;	240	*params++ = 0;
232	break;	241	break;
233	}	242	}
234		243
235	if (!strcmp (buf, "image_info"))
236	send_image_info (ns, params);
237	else if (!strcmp (buf, "image_sums"))
238	send_image_sums (ns, params);
239	else if (!strcmp (buf, "skill_info"))	244	if (!strcmp (buf, "skill_info"))
240	send_skill_info (ns, params);	245	send_skill_info (ns, params);
241	else if (!strcmp (buf, "spell_paths"))	246	else if (!strcmp (buf, "spell_paths"))
242	send_spell_paths (ns, params);	247	send_spell_paths (ns, params);
243	else	248	else
244	ns->send_packet (bigbuf, len);	249	{
		250	// undo tokenisation above and send replyinfo with the request unchanged
		251	if (*params)
		252	*--params = ' ';
		253
		254	ns->send_packet_printf ("replyinfo %s", buf);
		255	}
245	}	256	}
246		257
247	void	258	void
248	ExtCmd (char *buf, int len, player *pl)	259	ExtCmd (char *buf, int len, player *pl)
249	{	260	{
…		…
252		263
253	void	264	void
254	ExtiCmd (char *buf, int len, client *ns)	265	ExtiCmd (char *buf, int len, client *ns)
255	{	266	{
256	INVOKE_CLIENT (EXTICMD, ns, ARG_DATA (buf, len));	267	INVOKE_CLIENT (EXTICMD, ns, ARG_DATA (buf, len));
		268	}
		269
		270	//-GPL
		271
		272	void
		273	client::mapinfo_queue_clear ()
		274	{
		275	for (auto (i, mapinfo_queue.begin ()); i != mapinfo_queue.end (); ++i)
		276	free (*i);
		277
		278	mapinfo_queue.clear ();
		279	}
		280
		281	bool
		282	client::mapinfo_try (char *buf)
		283	{
		284	char *token = buf;
		285	buf += strlen (buf) + 9;
		286
		287	// initial map and its origin
		288	maptile *map = pl->viewpoint->map;
		289	int mapx = pl->ns->mapx / 2 - pl->viewpoint->x;
		290	int mapy = pl->ns->mapy / 2 - pl->viewpoint->y;
		291	int max_distance = 8; // limit maximum path length to something generous
		292
		293	while (*buf && map && max_distance)
		294	{
		295	int dir = *buf++ - '1';
		296
		297	if (dir >= 0 && dir <= 3)
		298	{
		299	if (!map->tile_path [dir])
		300	map = 0;
		301	else if (map->tile_available (dir, false))
		302	{
		303	maptile *neigh = map->tile_map [dir];
		304
		305	switch (dir)
		306	{
		307	case 0: mapy -= neigh->height; break;
		308	case 2: mapy += map ->height; break;
		309	case 3: mapx -= neigh->width ; break;
		310	case 1: mapx += map ->width ; break;
		311	}
		312
		313	map = neigh;
		314	--max_distance;
		315	}
		316	else
		317	return 0;
		318	}
		319	else
		320	max_distance = 0;
		321	}
		322
		323	if (!max_distance)
		324	send_packet_printf ("mapinfo %s error", token);
		325	else if (!map || !map->path)
		326	send_packet_printf ("mapinfo %s nomap", token);
		327	else
		328	{
		329	int flags = 0;
		330
		331	if (map->tile_path[0]) flags |= 1;
		332	if (map->tile_path[1]) flags |= 2;
		333	if (map->tile_path[2]) flags |= 4;
		334	if (map->tile_path[3]) flags |= 8;
		335
		336	send_packet_printf ("mapinfo %s spatial %d %d %d %d %d %s", token, flags, mapx, mapy, map->width, map->height, &map->path);
		337	}
		338
		339	return 1;
		340	}
		341
		342	void
		343	client::mapinfo_queue_run ()
		344	{
		345	if (mapinfo_queue.empty () || !pl)
		346	return;
		347
		348	for (int i = 0; i < mapinfo_queue.size (); ++i)
		349	if (mapinfo_try (mapinfo_queue [i]))
		350	{
		351	free (mapinfo_queue [i]);
		352	mapinfo_queue.erase (i);
		353	}
		354	else
		355	++i;
257	}	356	}
258		357
259	void	358	void
260	MapInfoCmd (char *buf, int len, player *pl)	359	MapInfoCmd (char *buf, int len, player *pl)
261	{	360	{
262	// <mapinfo tag spatial tile-path	361	// <mapinfo tag spatial tile-path
263	// >mapinfo tag spatial flags x y w h hash	362	// >mapinfo tag spatial flags x y w h hash
264		363
265	char bigbuf[MAX_BUF], *token;
266
267	token = buf;	364	char *token = buf;
268	// copy token	365
269	if (!(buf = strchr (buf, ' ')))	366	if (!(buf = strchr (buf, ' ')))
270	return;	367	return;
271		368
272	*buf++ = 0;
273
274	if (!strncmp (buf, "spatial ", 8))	369	if (!strncmp (buf, " spatial ", 9))
275	{	370	{
276	buf += 8;	371	char *copy = strdup (token);
		372	copy [buf - token] = 0;
277		373
278	// initial map and its origin	374	#if 0
279	maptile *map = pl->ob->map;	375	// this makes only sense when we flush the buffer immediately
280	sint16 dx, dy;	376	if (pl->ns->mapinfo_try (copy))
281	int mapx = pl->ns->mapx / 2 - pl->ob->x;	377	free (copy);
282	int mapy = pl->ns->mapy / 2 - pl->ob->y;
283	int max_distance = 8; // limit maximum path length to something generous
284
285	while (*buf && map && max_distance)
286	{
287	int dir = *buf++;
288
289	switch (dir)
290	{
291	case '1':
292	dx = 0;
293	dy = -1;
294	map = map->xy_find (dx, dy);
295	map && (mapy -= map->height);
296	break;
297	case '2':
298	mapx += map->width;
299	dx = map->width;
300	dy = 0;
301	map = map->xy_find (dx, dy);
302	break;
303	case '3':
304	mapy += map->height;
305	dx = 0;
306	dy = map->height;
307	map = map->xy_find (dx, dy);
308	break;
309	case '4':
310	dx = -1;
311	dy = 0;
312	map = map->xy_find (dx, dy);
313	map && (mapx -= map->width);
314	break;
315	}
316
317	--max_distance;
318	}
319
320	if (!max_distance)
321	snprintf (bigbuf, MAX_BUF, "mapinfo %s error", token);
322	else if (map && map->path[0])
323	{
324	int flags = 0;
325
326	if (map->tile_path[0]) flags |= 1;
327	if (map->tile_path[1]) flags |= 2;
328	if (map->tile_path[2]) flags |= 4;
329	if (map->tile_path[3]) flags |= 8;
330
331	snprintf (bigbuf, MAX_BUF, "mapinfo %s spatial %d %d %d %d %d %s", token, flags, mapx, mapy, map->width, map->height, &map->path);
332	}
333	else	378	else
334	snprintf (bigbuf, MAX_BUF, "mapinfo %s nomap", token);	379	#endif
		380	pl->ns->mapinfo_queue.push_back (copy);
335	}	381	}
336	else	382	else
337	snprintf (bigbuf, MAX_BUF, "mapinfo %s unsupported", token);	383	pl->ns->send_packet_printf ("mapinfo %s unsupported", token);
338
339	pl->ns->send_packet (bigbuf);
340	}	384	}
341		385
342	/** This is the Setup cmd */	386	/** This is the Setup cmd */
343	void	387	void
344	SetUp (char *buf, int len, client * ns)	388	SetUp (char *buf, int len, client * ns)
…		…
356	AddMeCmd (char *buf, int len, client *ns)	400	AddMeCmd (char *buf, int len, client *ns)
357	{	401	{
358	INVOKE_CLIENT (ADDME, ns, ARG_DATA (buf, len));	402	INVOKE_CLIENT (ADDME, ns, ARG_DATA (buf, len));
359	}	403	}
360		404
361	/** Reply to ExtendedInfos command */	405	//+GPL
362	void
363	ToggleExtendedInfos (char *buf, int len, client * ns)
364	{
365	char cmdback[MAX_BUF];
366	char command[50];
367	int info, nextinfo;
368
369	cmdback[0] = '\0';
370	nextinfo = 0;
371
372	while (1)
373	{
374	/* 1. Extract an info */
375	info = nextinfo;
376
377	while ((info < len) && (buf[info] == ' '))
378	info++;
379
380	if (info >= len)
381	break;
382
383	nextinfo = info + 1;
384
385	while ((nextinfo < len) && (buf[nextinfo] != ' '))
386	nextinfo++;
387
388	if (nextinfo - info >= 49) /*Erroneous info asked */
389	continue;
390
391	strncpy (command, &(buf[info]), nextinfo - info);
392
393	/* 2. Interpret info */
394	if (!strcmp ("smooth", command))
395	/* Toggle smoothing */
396	ns->EMI_smooth = !ns->EMI_smooth;
397	else
398	/*bad value */;
399
400	/*3. Next info */
401	}
402
403	strcpy (cmdback, "ExtendedInfoSet");
404
405	if (ns->EMI_smooth)
406	{
407	strcat (cmdback, " ");
408	strcat (cmdback, "smoothing");
409	}
410
411	ns->send_packet (cmdback);
412	}
413		406
414	/*	407	/*
415	#define MSG_TYPE_BOOK 1	408	#define MSG_TYPE_BOOK 1
416	#define MSG_TYPE_CARD 2	409	#define MSG_TYPE_CARD 2
417	#define MSG_TYPE_PAPER 3	410	#define MSG_TYPE_PAPER 3
…		…
434	while (1)	427	while (1)
435	{	428	{
436	/* 1. Extract an info */	429	/* 1. Extract an info */
437	info = nextinfo;	430	info = nextinfo;
438		431
439	while ((info < len) && (buf[info] == ' '))	432	while ((info < len) && (buf [info] == ' '))
440	info++;	433	info++;
441		434
442	if (info >= len)	435	if (info >= len)
443	break;	436	break;
444		437
445	nextinfo = info + 1;	438	nextinfo = info + 1;
446		439
447	while ((nextinfo < len) && (buf[nextinfo] != ' '))	440	while ((nextinfo < len) && (buf [nextinfo] != ' '))
448	nextinfo++;	441	nextinfo++;
449		442
450	if (nextinfo - info >= 49) /*Erroneous info asked */	443	if (nextinfo - info >= 49) /*Erroneous info asked */
451	continue;	444	continue;
452		445
453	strncpy (command, &(buf[info]), nextinfo - info);	446	memcpy (command, buf + info, nextinfo - info);
454	command[nextinfo - info] = '\0';	447	command [nextinfo - info] = 0;
		448
455	/* 2. Interpret info */	449	/* 2. Interpret info */
456	i = sscanf (command, "%d", &flag);	450	i = sscanf (command, "%d", &flag);
457		451
458	if ((i == 1) && (flag > 0) && (flag <= MSG_TYPE_LAST))	452	if ((i == 1) && (flag > 0) && (flag <= MSG_TYPE_LAST))
459	ns->supported_readables |= (1 << flag);	453	ns->supported_readables |= (1 << flag);
…		…
473		467
474	ns->send_packet (cmdback);	468	ns->send_packet (cmdback);
475	}	469	}
476		470
477	/**	471	/**
478	* client requested an image. send it rate-limited
479	* before flushing.
480	*/
481	void
482	AskFaceCmd (char *buf, int len, client *ns)
483	{
484	ns->askface.push_back (atoi (buf));
485	}
486
487	/**
488	* Tells client the picture it has to use
489	* to smooth a picture number given as argument.
490	*/
491	void
492	AskSmooth (char *buf, int len, client *ns)
493	{
494	ns->send_face (atoi (buf));
495	ns->flush_fx ();
496	}
497
498	/**
499	* This handles the general commands from the client (ie, north, fire, cast,	472	* This handles the general commands from the client (ie, north, fire, cast,
500	* etc.)	473	* etc.)
501	*/	474	*/
502	void	475	void
503	PlayerCmd (char *buf, int len, player *pl)	476	PlayerCmd (char *buf, int len, player *pl)
…		…
514	return;	487	return;
515		488
516	buf++;	489	buf++;
517	}	490	}
518		491
519	execute_newserver_command (pl->ob, (char *) buf);	492	execute_newserver_command (pl->ob, (char *)buf);
520		493
521	/* Perhaps something better should be done with a left over count.	494	/* Perhaps something better should be done with a left over count.
522	* Cleaning up the input should probably be done first - all actions	495	* Cleaning up the input should probably be done first - all actions
523	* for the command that issued the count should be done before any other	496	* for the command that issued the count should be done before any other
524	* commands.	497	* commands.
525	*/	498	*/
526	pl->count = 0;	499	pl->count = 0;
527	}	500	}
528		501
529
530	/**	502	/**
531	* This handles the general commands from the client (ie, north, fire, cast,	503	* This handles the general commands from the client (ie, north, fire, cast,
532	* etc.). It is a lot like PlayerCmd above, but is called with the	504	* etc.). It is a lot like PlayerCmd above, but is called with the
533	* 'ncom' method which gives more information back to the client so it	505	* 'ncom' method which gives more information back to the client so it
534	* can throttle.	506	* can throttle.
…		…
536	void	508	void
537	NewPlayerCmd (char *buf, int len, player *pl)	509	NewPlayerCmd (char *buf, int len, player *pl)
538	{	510	{
539	if (len <= 6)	511	if (len <= 6)
540	{	512	{
541	LOG (llevDebug, "Corrupt ncom command <%s> not long enough - discarding\n", buf);	513	LOG (llevDebug, "%s: corrupt ncom command <%s>: not long enough (%d) - discarding\n", pl->ns->host, buf, len);
542	return;	514	return;
543	}	515	}
544		516
545	uint16 cmdid = net_uint16 ((uint8 *)buf);	517	uint16 cmdid = net_uint16 ((uint8 *)buf);
546	sint32 repeat = net_sint32 ((uint8 *)buf + 2);	518	sint32 repeat = net_sint32 ((uint8 *)buf + 2);
…		…
684	* syntax is: move (to) (tag) (nrof)	656	* syntax is: move (to) (tag) (nrof)
685	*/	657	*/
686	void	658	void
687	MoveCmd (char *buf, int len, player *pl)	659	MoveCmd (char *buf, int len, player *pl)
688	{	660	{
689	int vals[3], i;	661	int to, tag, nrof;
690		662
691	/* A little funky here. We only cycle for 2 records, because	663	if (3 != sscanf (buf, "%d %d %d", &to, &tag, &nrof))
692	* we obviously are not going to find a space after the third
693	* record. Perhaps we should just replace this with a
694	* sscanf?
695	*/
696	for (i = 0; i < 2; i++)
697	{	664	{
698	vals[i] = atoi (buf);
699
700	if (!(buf = strchr (buf, ' ')))
701	{
702	LOG (llevError, "Incomplete move command: %s\n", buf);	665	LOG (llevError, "Incomplete move command: %s\n", buf);
703	return;	666	return;
704	}
705
706	buf++;
707	}	667	}
708		668
709	vals[2] = atoi (buf);	669	esrv_move_object (pl->ob, to, tag, nrof);
710
711	/* LOG(llevDebug,"Move item %d (nrof=%d) to %d.\n", vals[1], vals[2], vals[0]);*/
712	esrv_move_object (pl->ob, vals[0], vals[1], vals[2]);
713	}	670	}
714		671
715	/******************************************************************************	672	/******************************************************************************
716	*	673	*
717	* Start of commands the server sends to the client.	674	* Start of commands the server sends to the client.
…		…
730		687
731	/**	688	/**
732	* Get player's current range attack in obuf.	689	* Get player's current range attack in obuf.
733	*/	690	*/
734	static void	691	static void
735	rangetostring (object *ob, char *obuf)	692	rangetostring (player *pl, char *obuf)
736	{	693	{
737	dynbuf_text buf;	694	dynbuf_text &buf = msg_dynbuf; buf.clear ();
738		695
739	player *pl = ob->contr;
740
741	if (pl->ranged_skill)
742	{
743	buf.printf (" Range: %s", &pl->ranged_skill->name);
744
745	if (pl->ranged_ob)	696	if (pl->ranged_ob)
746	buf.printf (" (%s)", query_base_name (pl->ranged_ob, 0));	697	buf << " Range" << (pl->ob->current_weapon == pl->ranged_ob ? "*" : "") << ": " << pl->ranged_ob->name;
747	}
748		698
749	if (pl->combat_skill)
750	{
751	buf.printf (" Combat: %s", &pl->combat_skill->name);
752
753	if (pl->combat_ob)	699	if (pl->combat_ob)
754	buf.printf (" (%s)", query_base_name (pl->combat_ob, 0));	700	buf << " Combat" << (pl->ob->current_weapon == pl->combat_ob ? "*" : "") << ": " << pl->combat_ob->name;
755	}
756		701
		702	#if 0
		703	//TODO: remove this when slot system is working, this is only for debugging
		704	if (pl->ob->chosen_skill)
		705	buf << " Skill*: " << pl->ob->chosen_skill->name;
		706	#endif
		707
		708	//TODO: maybe golem should become the current_weapon, quite simply?
757	if (pl->golem)	709	if (pl->golem)
758	buf.printf (" Golem: %s", &pl->golem->name);	710	buf << " Golem*: " << pl->golem->name;
759		711
760	strcpy (obuf, buf.linearise () + 1);	712	buf << '\0';
		713	buf.linearise (obuf);
761	}	714	}
762		715
763	#define AddIfInt64(Old,New,Type) if (Old != New) {\	716	#define AddIfInt64(Old,New,Type) if (Old != New) {\
764	Old = New; \	717	Old = New; \
765	sl << uint8 (Type) << uint64 (New); \	718	sl << uint8 (Type) << uint64 (New); \
…		…
773	#define AddIfShort(Old,New,Type) if (Old != New) {\	726	#define AddIfShort(Old,New,Type) if (Old != New) {\
774	Old = New; \	727	Old = New; \
775	sl << uint8 (Type) << uint16 (New); \	728	sl << uint8 (Type) << uint16 (New); \
776	}	729	}
777		730
778	#define AddIfFloat(Old,New,Type) if (Old != New) {\	731	#define AddIfFloat(Old,New,Type,mult) if (Old != New) {\
779	Old = New; \	732	Old = New; \
780	sl << uint8 (Type) << uint32 (New*FLOAT_MULTI); \	733	sl << uint8 (Type) << uint32 (New*FLOAT_MULTI*mult); \
781	}	734	}
782		735
783	#define AddIfString(Old,New,Type) if (Old == NULL || strcmp(Old,New)) {\	736	#define AddIfString(Old,New,Type) if (Old == NULL || strcmp(Old,New)) {\
784	free(Old); Old = strdup (New);\	737	free(Old); Old = strdup (New);\
785	sl << uint8 (Type) << data8 (New); \	738	sl << uint8 (Type) << data8 (New); \
…		…
799		752
800	client *ns = pl->ns;	753	client *ns = pl->ns;
801	if (!ns)	754	if (!ns)
802	return;	755	return;
803		756
804	object *ob = pl->ob;	757	object *ob = pl->observe;
805	if (!ob)	758	if (!ob)
806	return;	759	return;
		760
		761	player *opl = ob->contr ? static_cast<player *>(ob->contr) : pl;
807		762
808	packet sl ("stats");	763	packet sl ("stats");
809		764
810	AddIfShort (ns->last_stats.hp, ob->stats.hp, CS_STAT_HP);	765	AddIfShort (ns->last_stats.hp, ob->stats.hp, CS_STAT_HP);
811	AddIfShort (ns->last_stats.maxhp, ob->stats.maxhp, CS_STAT_MAXHP);	766	AddIfShort (ns->last_stats.maxhp, ob->stats.maxhp, CS_STAT_MAXHP);
…		…
820	AddIfShort (ns->last_stats.Wis, ob->stats.Wis, CS_STAT_WIS);	775	AddIfShort (ns->last_stats.Wis, ob->stats.Wis, CS_STAT_WIS);
821	AddIfShort (ns->last_stats.Pow, ob->stats.Pow, CS_STAT_POW);	776	AddIfShort (ns->last_stats.Pow, ob->stats.Pow, CS_STAT_POW);
822	AddIfShort (ns->last_stats.Cha, ob->stats.Cha, CS_STAT_CHA);	777	AddIfShort (ns->last_stats.Cha, ob->stats.Cha, CS_STAT_CHA);
823		778
824	for (int s = 0; s < NUM_SKILLS; s++)	779	for (int s = 0; s < NUM_SKILLS; s++)
825	if (object *skill = pl->last_skill_ob[s])	780	if (object *skill = opl->last_skill_ob [s])
826	if (skill->stats.exp != ns->last_skill_exp [s])	781	if (skill->stats.exp != ns->last_skill_exp [s])
827	{	782	{
828	ns->last_skill_exp [s] = skill->stats.exp;	783	ns->last_skill_exp [s] = skill->stats.exp;
829		784
830	/* Always send along the level if exp changes. This is only	785	/* Always send along the level if exp changes. This is only
…		…
838	AddIfInt64 (ns->last_stats.exp, ob->stats.exp, CS_STAT_EXP64);	793	AddIfInt64 (ns->last_stats.exp, ob->stats.exp, CS_STAT_EXP64);
839	AddIfShort (ns->last_level, ob->level, CS_STAT_LEVEL);	794	AddIfShort (ns->last_level, ob->level, CS_STAT_LEVEL);
840	AddIfShort (ns->last_stats.wc, ob->stats.wc, CS_STAT_WC);	795	AddIfShort (ns->last_stats.wc, ob->stats.wc, CS_STAT_WC);
841	AddIfShort (ns->last_stats.ac, ob->stats.ac, CS_STAT_AC);	796	AddIfShort (ns->last_stats.ac, ob->stats.ac, CS_STAT_AC);
842	AddIfShort (ns->last_stats.dam, ob->stats.dam, CS_STAT_DAM);	797	AddIfShort (ns->last_stats.dam, ob->stats.dam, CS_STAT_DAM);
843	AddIfFloat (ns->last_speed, ob->speed, CS_STAT_SPEED);	798	AddIfFloat (ns->last_speed, ob->speed, CS_STAT_SPEED, 1.f/TICK);
844	AddIfShort (ns->last_stats.food, ob->stats.food, CS_STAT_FOOD);	799	AddIfShort (ns->last_stats.food, ob->stats.food, CS_STAT_FOOD);
845	AddIfFloat (ns->last_weapon_sp, pl->weapon_sp, CS_STAT_WEAP_SP);	800	AddIfFloat (ns->last_weapon_sp, pl->weapon_sp, CS_STAT_WEAP_SP, 1.f/TICK);
846	AddIfInt (ns->last_weight_limit, weight_limit[ob->stats.Str], CS_STAT_WEIGHT_LIM);	801	AddIfInt (ns->last_weight_limit, weight_limit[ob->stats.Str], CS_STAT_WEIGHT_LIM);
847		802
848	flags = 0;	803	flags = 0;
849		804
850	if (pl->fire_on)	805	if (opl->fire_on)
851	flags |= SF_FIREON;	806	flags |= SF_FIREON;
852		807
853	if (pl->run_on)	808	if (opl->run_on)
854	flags |= SF_RUNON;	809	flags |= SF_RUNON;
855		810
856	AddIfShort (ns->last_flags, flags, CS_STAT_FLAGS);	811	AddIfShort (ns->last_flags, flags, CS_STAT_FLAGS);
857		812
858	if (ns->sc_version < 1025)	813	if (ns->sc_version < 1025)
…		…
872	AddIfInt (ns->last_path_attuned, ob->path_attuned, CS_STAT_SPELL_ATTUNE);	827	AddIfInt (ns->last_path_attuned, ob->path_attuned, CS_STAT_SPELL_ATTUNE);
873	AddIfInt (ns->last_path_repelled, ob->path_repelled, CS_STAT_SPELL_REPEL);	828	AddIfInt (ns->last_path_repelled, ob->path_repelled, CS_STAT_SPELL_REPEL);
874	AddIfInt (ns->last_path_denied, ob->path_denied, CS_STAT_SPELL_DENY);	829	AddIfInt (ns->last_path_denied, ob->path_denied, CS_STAT_SPELL_DENY);
875	}	830	}
876		831
877	rangetostring (ob, buf); /* we want use the new fire & run system in new client */	832	rangetostring (opl, buf); /* we want use the new fire & run system in new client */
878	AddIfString (ns->stats.range, buf, CS_STAT_RANGE);	833	AddIfString (ns->stats.range, buf, CS_STAT_RANGE);
879	set_title (ob, buf);	834	set_title (ob, buf);
880	AddIfString (ns->stats.title, buf, CS_STAT_TITLE);	835	AddIfString (ns->stats.title, buf, CS_STAT_TITLE);
881		836
882	/* Only send it away if we have some actual data */	837	/* Only send it away if we have some actual data */
…		…
886		841
887	/**	842	/**
888	* Tells the client that here is a player it should start using.	843	* Tells the client that here is a player it should start using.
889	*/	844	*/
890	void	845	void
891	esrv_new_player (player *pl, uint32 weight)	846	esrv_new_player (player *pl)
892	{	847	{
		848	sint32 weight = pl->ob->client_weight ();
		849
893	packet sl ("player");	850	packet sl ("player");
894		851
895	sl << uint32 (pl->ob->count)	852	sl << uint32 (pl->ob->count)
896	<< uint32 (weight)	853	<< uint32 (weight)
897	<< uint32 (pl->ob->face)	854	<< uint32 (pl->ob->face)
898	<< data8 (pl->ob->name);	855	<< data8 (pl->ob->name);
899		856
900	pl->ns->last_weight = weight;	857	pl->ns->last_weight = weight;
901	pl->ns->send_packet (sl);	858	pl->ns->send_packet (sl);
902	SET_FLAG (pl->ob, FLAG_CLIENT_SENT);
903	}	859	}
904		860
905	/******************************************************************************	861	/******************************************************************************
906	*	862	*
907	* Start of map related commands.	863	* Start of map related commands.
…		…
964		920
965	if (!ns.faces_sent[face_num])	921	if (!ns.faces_sent[face_num])
966	if (ob)	922	if (ob)
967	ns.send_faces (ob);	923	ns.send_faces (ob);
968	else	924	else
969	ns.send_face (face_num);	925	ns.send_face (face_num, 10);
970		926
971	sl << uint16 (face_num);	927	sl << uint16 (face_num);
972	return 1;	928	return 1;
973	}	929	}
974		930
975	/* Nothing changed */	931	/* Nothing changed */
976	return 0;	932	return 0;
977	}	933	}
978		934
979	/**	935	//-GPL
980	* Returns the size of a data for a map square as returned by
981	* mapextended. There are CLIENTMAPX*CLIENTMAPY*LAYERS entries
982	* available.
983	*/
984	int
985	getExtendedMapInfoSize (client * ns)
986	{
987	int result = 0;
988
989	if (ns->ext_mapinfos)
990	{
991	if (ns->EMI_smooth)
992	result += 1; /*One byte for smoothlevel */
993	}
994
995	return result;
996	}
997		936
998	// prefetch (and touch) all maps within a specific distancd	937	// prefetch (and touch) all maps within a specific distancd
999	static void	938	static void
1000	prefetch_surrounding_maps (maptile *map, int distance)	939	prefetch_surrounding_maps (maptile *map, int distance)
1001	{	940	{
1002	map->last_access = runtime;	941	map->touch ();
1003		942
1004	if (--distance)	943	if (--distance)
1005	for (int dir = 4; --dir; )	944	for (int dir = 4; --dir; )
1006	if (const shstr &path = map->tile_path [dir])	945	if (const shstr &path = map->tile_path [dir])
1007	if (maptile *&neigh = map->tile_map [dir])	946	if (maptile *&neigh = map->tile_map [dir])
…		…
1015	prefetch_surrounding_maps (object *op)	954	prefetch_surrounding_maps (object *op)
1016	{	955	{
1017	prefetch_surrounding_maps (op->map, 3);	956	prefetch_surrounding_maps (op->map, 3);
1018	}	957	}
1019		958
		959	//+GPL
		960
1020	/**	961	/**
1021	* This function uses the new map1 protocol command to send the map	962	* Draws client map.
1022	* to the client. It is necessary because the old map command supports
1023	* a maximum map size of 15x15.
1024	* This function is much simpler than the old one. This is because
1025	* the old function optimized to send as few face identifiers as possible,
1026	* at the expense of sending more coordinate location (coordinates were
1027	* only 1 byte, faces 2 bytes, so this was a worthwhile savings). Since
1028	* we need 2 bytes for coordinates and 2 bytes for faces, such a trade off
1029	* maps no sense. Instead, we actually really only use 12 bits for coordinates,
1030	* and use the other 4 bits for other informatiion. For full documentation
1031	* of what we send, see the doc/Protocol file.
1032	* I will describe internally what we do:
1033	* the ns->lastmap shows how the map last looked when sent to the client.
1034	* in the lastmap structure, there is a cells array, which is set to the
1035	* maximum viewable size (As set in config.h).
1036	* in the cells, there are faces and a count value.
1037	* we use the count value to hold the darkness value. If -1, then this space
1038	* is not viewable.
1039	* we use faces[0] faces[1] faces[2] to hold what the three layers
1040	* look like.
1041	*/	963	*/
1042	void	964	void
1043	draw_client_map1 (object *pl)	965	draw_client_map (player *pl)
1044	{	966	{
1045	int x, y, ax, ay, startlen, max_x, max_y, oldlen;	967	object *ob = pl->viewpoint;
1046	sint16 nx, ny;
1047	int estartlen, eoldlen;
1048	uint8 eentrysize;
1049	uint16 ewhatstart, ewhatflag;
1050	uint8 extendedinfos;
1051	maptile *m;
1052
1053	client &socket = *pl->contr->ns;
1054
1055	if (!pl->active)	968	if (!pl->observe->active)
1056	return;	969	return;
1057
1058	check_map_change (pl->contr);
1059	prefetch_surrounding_maps (pl);
1060
1061	packet sl (socket.mapmode == Map1Cmd ? "map1" : "map1a");
1062	packet esl;
1063
1064	startlen = sl.length ();
1065
1066	/*Extendedmapinfo structure initialisation */
1067	if (socket.ext_mapinfos)
1068	{
1069	extendedinfos = EMI_NOREDRAW;
1070
1071	if (socket.EMI_smooth)
1072	extendedinfos |= EMI_SMOOTH;
1073
1074	ewhatstart = esl.length ();
1075	ewhatflag = extendedinfos; /*The EMI_NOREDRAW bit
1076	could need to be taken away */
1077	eentrysize = getExtendedMapInfoSize (&socket);
1078	esl << "mapextended "
1079	<< uint8 (extendedinfos)
1080	<< uint8 (eentrysize);
1081
1082	estartlen = esl.length ();
1083	}
1084
1085	/* x,y are the real map locations. ax, ay are viewport relative
1086	* locations.
1087	*/
1088	ay = 0;
1089
1090	/* We could do this logic as conditionals in the if statement,
1091	* but that started to get a bit messy to look at.
1092	*/
1093	max_x = pl->x + (socket.mapx + 1) / 2;
1094	max_y = pl->y + (socket.mapy + 1) / 2;
1095
1096	maptile *plmap = pl->map;
1097
1098	for (y = pl->y - socket.mapy / 2; y < max_y; y++, ay++)
1099	{
1100	ax = 0;
1101	for (x = pl->x - socket.mapx / 2; x < max_x; x++, ax++)
1102	{
1103	int emask, mask;
1104	emask = mask = (ax & 0x3f) << 10 | (ay & 0x3f) << 4;
1105
1106	MapCell &lastcell = socket.lastmap.cells[ax][ay];
1107
1108	/* If the coordinates are not valid, or it is too dark to see,
1109	* we tell the client as such
1110	*/
1111	nx = x;
1112	ny = y;
1113	m = get_map_from_coord (plmap, &nx, &ny);
1114
1115	if (!m)
1116	{
1117	/* space is out of map. Update space and clear values
1118	* if this hasn't already been done. If the space is out
1119	* of the map, it shouldn't have a head
1120	*/
1121	if (lastcell.count != -1)
1122	{
1123	sl << uint16 (mask);
1124	map_clearcell (&lastcell, -1);
1125	}
1126
1127	continue;
1128	}
1129
1130	m->touch ();
1131
1132	int d = pl->contr->blocked_los[ax][ay];
1133
1134	if (d > 3)
1135	{
1136
1137	int need_send = 0, count;
1138
1139	/* This block deals with spaces that are not visible for whatever
1140	* reason. Still may need to send the head for this space.
1141	*/
1142
1143	oldlen = sl.length ();
1144
1145	sl << uint16 (mask);
1146
1147	if (lastcell.count != -1)
1148	need_send = 1;
1149
1150	count = -1;
1151
1152	/* properly clear a previously sent big face */
1153	if (lastcell.faces[0] || lastcell.faces[1] || lastcell.faces[2]
1154	|| lastcell.stat_hp || lastcell.flags || lastcell.player)
1155	need_send = 1;
1156
1157	map_clearcell (&lastcell, count);
1158
1159	if ((mask & 0xf) || need_send)
1160	sl[oldlen + 1] = mask & 0xff;
1161	else
1162	sl.reset (oldlen);
1163	}
1164	else
1165	{
1166	/* In this block, the space is visible.
1167	*/
1168
1169	/* Rather than try to figure out what everything that we might
1170	* need to send is, then form the packet after that,
1171	* we presume that we will in fact form a packet, and update
1172	* the bits by what we do actually send. If we send nothing,
1173	* we just back out sl.length () to the old value, and no harm
1174	* is done.
1175	* I think this is simpler than doing a bunch of checks to see
1176	* what if anything we need to send, setting the bits, then
1177	* doing those checks again to add the real data.
1178	*/
1179	oldlen = sl.length ();
1180	eoldlen = esl.length ();
1181
1182	sl << uint16 (mask);
1183
1184	unsigned char dummy;
1185	unsigned char *last_ext = &dummy;
1186
1187	/* Darkness changed */
1188	if (lastcell.count != d && socket.darkness)
1189	{
1190	mask |= 0x8;
1191
1192	if (socket.extmap)
1193	{
1194	*last_ext |= 0x80;
1195	last_ext = &sl[sl.length ()];
1196	sl << uint8 (d);
1197	}
1198	else
1199	sl << uint8 (255 - 64 * d);
1200	}
1201
1202	lastcell.count = d;
1203
1204	mapspace &ms = m->at (nx, ny);
1205
1206	if (socket.extmap)
1207	{
1208	uint8 stat_hp = 0;
1209	uint8 stat_width = 0;
1210	uint8 flags = 0;
1211	tag_t player = 0;
1212
1213	// send hp information, if applicable
1214	if (object *op = ms.faces_obj [0])
1215	{
1216	if (op->head || op->invisible)
1217	; // do not show
1218	else if (op->type == PLAYER
1219	|| QUERY_FLAG (op, FLAG_MONSTER) || QUERY_FLAG (op, FLAG_ALIVE) || QUERY_FLAG (op, FLAG_GENERATOR))
1220	{
1221	if (op->stats.maxhp > 0 && (unsigned) op->stats.maxhp > (unsigned) op->stats.hp)
1222	{
1223	stat_hp = 255 - (op->stats.hp * 255 + 254) / op->stats.maxhp;
1224	stat_width = op->arch->tail_x;
1225	}
1226	}
1227
1228	if (op->msg && op->msg[0] == '@')
1229	flags |= 1;
1230
1231	if (op->type == PLAYER && op != pl)
1232	player = op->count;
1233	}
1234
1235	if (lastcell.stat_hp != stat_hp)
1236	{
1237	lastcell.stat_hp = stat_hp;
1238
1239	mask |= 0x8;
1240	*last_ext |= 0x80;
1241	last_ext = &sl[sl.length ()];
1242
1243	sl << uint8 (5) << uint8 (stat_hp);
1244
1245	if (stat_width > 1)
1246	{
1247	*last_ext |= 0x80;
1248	last_ext = &sl[sl.length ()];
1249
1250	sl << uint8 (6) << uint8 (stat_width);
1251	}
1252	}
1253
1254	if (lastcell.player != player)
1255	{
1256	lastcell.player = player;
1257
1258	mask |= 0x8;
1259	*last_ext |= 0x80;
1260	last_ext = &sl[sl.length ()];
1261
1262	sl << uint8 (0x47) << uint8 (4) << (uint32)player;
1263	}
1264
1265	if (lastcell.flags != flags)
1266	{
1267	lastcell.flags = flags;
1268
1269	mask |= 0x8;
1270	*last_ext |= 0x80;
1271	last_ext = &sl[sl.length ()];
1272
1273	sl << uint8 (8) << uint8 (flags);
1274	}
1275	}
1276
1277	/* Floor face */
1278	if (update_space (sl, socket, ms, lastcell, 2))
1279	mask |= 0x4;
1280
1281	/* Middle face */
1282	if (update_space (sl, socket, ms, lastcell, 1))
1283	mask |= 0x2;
1284
1285	if (ms.player () == pl
1286	&& (pl->invisible & (pl->invisible < 50 ? 1 : 7)))
1287	{
1288	// force player to be visible to himself if invisible
1289	if (lastcell.faces[0] != pl->face)
1290	{
1291	lastcell.faces[0] = pl->face;
1292
1293	mask |= 0x1;
1294	sl << uint16 (pl->face);
1295
1296	socket.send_faces (pl);
1297	}
1298	}
1299	/* Top face */
1300	else if (update_space (sl, socket, ms, lastcell, 0))
1301	mask |= 0x1;
1302
1303
1304	/* Check to see if we are in fact sending anything for this
1305	* space by checking the mask. If so, update the mask.
1306	* if not, reset the len to that from before adding the mask
1307	* value, so we don't send those bits.
1308	*/
1309	if (mask & 0xf)
1310	sl[oldlen + 1] = mask & 0xff;
1311	else
1312	sl.reset (oldlen);
1313
1314	if (socket.ext_mapinfos)
1315	esl << uint16 (emask);
1316
1317	if (socket.EMI_smooth)
1318	{
1319	for (int layer = 2+1; layer--; )
1320	{
1321	object *ob = ms.faces_obj [layer];
1322
1323	// If there is no object for this space, or if the face for the object
1324	// is the blank face, set the smoothlevel to zero.
1325	int smoothlevel = ob && ob->face != blank_face ? ob->smoothlevel : 0;
1326
1327	// We've gotten what face we want to use for the object. Now see if
1328	// if it has changed since we last sent it to the client.
1329	if (lastcell.smooth[layer] != smoothlevel)
1330	{
1331	lastcell.smooth[layer] = smoothlevel;
1332	esl << uint8 (smoothlevel);
1333	emask |= 1 << layer;
1334	}
1335	}
1336
1337	if (emask & 0xf)
1338	esl[eoldlen + 1] = emask & 0xff;
1339	else
1340	esl.reset (eoldlen);
1341	}
1342	} /* else this is a viewable space */
1343	} /* for x loop */
1344	} /* for y loop */
1345
1346	socket.flush_fx ();
1347
1348	/* Verify that we in fact do need to send this */
1349	if (socket.ext_mapinfos)
1350	{
1351	if (!(sl.length () > startlen || socket.sent_scroll))
1352	{
1353	/* No map data will follow, so don't say the client
1354	* it doesn't need draw!
1355	*/
1356	ewhatflag &= ~EMI_NOREDRAW;
1357	esl[ewhatstart + 1] = ewhatflag & 0xff;
1358	}
1359
1360	if (esl.length () > estartlen)
1361	socket.send_packet (esl);
1362	}
1363
1364	if (sl.length () > startlen || socket.sent_scroll)
1365	{
1366	socket.send_packet (sl);
1367	socket.sent_scroll = 0;
1368	}
1369	}
1370
1371	/**
1372	* Draws client map.
1373	*/
1374	void
1375	draw_client_map (object *pl)
1376	{
1377	int i, j;
1378	sint16 ax, ay; /* ax and ay goes from 0 to max-size of arrays */
1379	int mflags;
1380	struct Map newmap;
1381	maptile *m, *pm;
1382
1383	if (pl->type != PLAYER)
1384	{
1385	LOG (llevError, "draw_client_map called with non player/non eric-server\n");
1386	return;
1387	}
1388
1389	pm = pl->map;
1390		970
1391	/* If player is just joining the game, he isn't here yet, so the map	971	/* If player is just joining the game, he isn't here yet, so the map
1392	* can get swapped out. If so, don't try to send them a map. All will	972	* can get swapped out. If so, don't try to send them a map. All will
1393	* be OK once they really log in.	973	* be OK once they really log in.
1394	*/	974	*/
1395	if (pm == NULL || pm->in_memory != MAP_IN_MEMORY)	975	if (!ob->map || ob->map->in_memory != MAP_ACTIVE)
1396	return;	976	return;
1397		977
1398	memset (&newmap, 0, sizeof (struct Map));	978	int startlen, oldlen;
1399		979
1400	for (j = (pl->y - pl->contr->ns->mapy / 2); j < (pl->y + (pl->contr->ns->mapy + 1) / 2); j++)	980	check_map_change (pl);
1401	for (i = (pl->x - pl->contr->ns->mapx / 2); i < (pl->x + (pl->contr->ns->mapx + 1) / 2); i++)	981	prefetch_surrounding_maps (pl->ob);
		982
		983	/* do LOS after calls to update_position */
		984	/* unfortunately, we need to udpate los when observing, currently */
		985	if (pl->do_los || pl->viewpoint != pl->ob)
		986	{
		987	pl->do_los = 0;
		988	pl->update_los ();
		989	}
		990
		991	/**
		992	* This function uses the new map1 protocol command to send the map
		993	* to the client. It is necessary because the old map command supports
		994	* a maximum map size of 15x15.
		995	* This function is much simpler than the old one. This is because
		996	* the old function optimized to send as few face identifiers as possible,
		997	* at the expense of sending more coordinate location (coordinates were
		998	* only 1 byte, faces 2 bytes, so this was a worthwhile savings). Since
		999	* we need 2 bytes for coordinates and 2 bytes for faces, such a trade off
		1000	* maps no sense. Instead, we actually really only use 12 bits for coordinates,
		1001	* and use the other 4 bits for other informatiion. For full documentation
		1002	* of what we send, see the doc/Protocol file.
		1003	* I will describe internally what we do:
		1004	* the ns->lastmap shows how the map last looked when sent to the client.
		1005	* in the lastmap structure, there is a cells array, which is set to the
		1006	* maximum viewable size (As set in config.h).
		1007	* in the cells, there are faces and a count value.
		1008	* we use the count value to hold the darkness value. If -1, then this space
		1009	* is not viewable.
		1010	* we use faces[0] faces[1] faces[2] to hold what the three layers
		1011	* look like.
		1012	*/
		1013
		1014	client &socket = *pl->ns;
		1015
		1016	packet sl (socket.mapmode == Map1Cmd ? "map1" : "map1a");
		1017
		1018	startlen = sl.length ();
		1019
		1020	int hx = socket.mapx / 2;
		1021	int hy = socket.mapy / 2;
		1022
		1023	ordered_mapwalk_begin (ob, -hx, -hy, hx, hy)
		1024	int ax = dx + hx;
		1025	int ay = dy + hy;
		1026
		1027	int mask = (ax << 10) | (ay << 4);
		1028	MapCell &lastcell = socket.lastmap.cells[ax][ay];
		1029
		1030	/* If the coordinates are not valid, or it is too dark to see,
		1031	* we tell the client as such
		1032	*/
		1033	if (!m)
1402	{	1034	{
1403	ax = i;	1035	/* space is out of map. Update space and clear values
1404	ay = j;	1036	* if this hasn't already been done. If the space is out
1405	m = pm;	1037	* of the map, it shouldn't have a head.
1406	mflags = get_map_flags (m, &m, ax, ay, &ax, &ay);
1407
1408	if (mflags & P_OUT_OF_MAP)
1409	continue;
1410
1411	/* If a map is visible to the player, we don't want to swap it out
1412	* just to reload it. This should really call something like
1413	* swap_map, but this is much more efficient and 'good enough'
1414	*/	1038	*/
1415	if (mflags & P_NEW_MAP)	1039	if (lastcell.count != -1)
1416	m->timeout = 50;	1040	{
		1041	sl << uint16 (mask);
		1042	map_clearcell (&lastcell, -1);
		1043	}
		1044
		1045	continue;
1417	}	1046	}
		1047
		1048	int d = pl->blocked_los_uc (dx, dy);
1418		1049
1419	/* do LOS after calls to update_position */	1050	if (d > 3)
1420	if (pl->contr->do_los)
1421	{	1051	{
1422	update_los (pl);	1052	/* This block deals with spaces that are not visible for whatever
1423	pl->contr->do_los = 0;	1053	* reason. Still may need to send the head for this space.
		1054	*/
		1055	if (lastcell.count != -1
		1056	|| lastcell.faces[0]
		1057	|| lastcell.faces[1]
		1058	|| lastcell.faces[2]
		1059	|| lastcell.stat_hp
		1060	|| lastcell.flags
		1061	|| lastcell.player)
		1062	sl << uint16 (mask);
		1063
		1064	/* properly clear a previously sent big face */
		1065	map_clearcell (&lastcell, -1);
1424	}	1066	}
		1067	else
		1068	{
		1069	/* In this block, the space is visible.
		1070	*/
1425		1071
1426	/* Big maps need a different drawing mechanism to work */	1072	/* Rather than try to figure out what everything that we might
1427	draw_client_map1 (pl);	1073	* need to send is, then form the packet after that,
1428	}	1074	* we presume that we will in fact form a packet, and update
		1075	* the bits by what we do actually send. If we send nothing,
		1076	* we just back out sl.length () to the old value, and no harm
		1077	* is done.
		1078	* I think this is simpler than doing a bunch of checks to see
		1079	* what if anything we need to send, setting the bits, then
		1080	* doing those checks again to add the real data.
		1081	*/
		1082	oldlen = sl.length ();
1429		1083
		1084	sl << uint16 (mask);
		1085
		1086	unsigned char dummy;
		1087	unsigned char *last_ext = &dummy;
		1088
		1089	/* Darkness changed */
		1090	if (lastcell.count != d)
		1091	{
		1092	mask |= 0x8;
		1093
		1094	*last_ext |= 0x80;
		1095	last_ext = &sl[sl.length ()];
		1096	sl << uint8 (d);
		1097	}
		1098
		1099	lastcell.count = d;
		1100
		1101	mapspace &ms = m->at (nx, ny);
		1102	ms.update ();
		1103
		1104	// extmap handling
		1105	uint8 stat_hp = 0;
		1106	uint8 stat_width = 0;
		1107	uint8 flags = 0;
		1108	tag_t player = 0;
		1109
		1110	// send hp information, if applicable
		1111	if (object *op = ms.faces_obj [0])
		1112	if (op->is_head () && !op->invisible)
		1113	{
		1114	if (op->stats.maxhp > op->stats.hp
		1115	&& op->stats.maxhp > 0
		1116	&& (op->type == PLAYER
		1117	|| op->type == DOOR // does not work, have maxhp 0
		1118	|| QUERY_FLAG (op, FLAG_MONSTER)
		1119	|| QUERY_FLAG (op, FLAG_ALIVE)
		1120	|| QUERY_FLAG (op, FLAG_GENERATOR)))
		1121	{
		1122	stat_hp = 255 - (op->stats.hp * 255 + 254) / op->stats.maxhp;
		1123	stat_width = op->arch->max_x - op->arch->x; //TODO: should be upper-left edge
		1124	}
		1125
		1126	if (expect_false (op->has_dialogue ()))
		1127	flags |= 1;
		1128
		1129	if (expect_false (op->type == PLAYER))
		1130	player = op == ob ? pl->ob->count
		1131	: op == pl->ob ? ob->count
		1132	: op->count;
		1133	}
		1134
		1135	if (expect_false (lastcell.stat_hp != stat_hp))
		1136	{
		1137	lastcell.stat_hp = stat_hp;
		1138
		1139	mask |= 0x8;
		1140	*last_ext |= 0x80;
		1141	last_ext = &sl[sl.length ()];
		1142
		1143	sl << uint8 (5) << uint8 (stat_hp);
		1144
		1145	if (stat_width > 1)
		1146	{
		1147	*last_ext |= 0x80;
		1148	last_ext = &sl[sl.length ()];
		1149
		1150	sl << uint8 (6) << uint8 (stat_width);
		1151	}
		1152	}
		1153
		1154	if (expect_false (lastcell.player != player))
		1155	{
		1156	lastcell.player = player;
		1157
		1158	mask |= 0x8;
		1159	*last_ext |= 0x80;
		1160	last_ext = &sl[sl.length ()];
		1161
		1162	sl << uint8 (0x47) << uint8 (4) << (uint32)player;
		1163	}
		1164
		1165	if (expect_false (lastcell.flags != flags))
		1166	{
		1167	lastcell.flags = flags;
		1168
		1169	mask |= 0x8;
		1170	*last_ext |= 0x80;
		1171	last_ext = &sl[sl.length ()];
		1172
		1173	sl << uint8 (8) << uint8 (flags);
		1174	}
		1175
		1176	// faces
		1177
		1178	/* Floor face */
		1179	if (update_space (sl, socket, ms, lastcell, 2))
		1180	mask |= 0x4;
		1181
		1182	/* Middle face */
		1183	if (update_space (sl, socket, ms, lastcell, 1))
		1184	mask |= 0x2;
		1185
		1186	if (expect_false (ob->invisible)
		1187	&& ob->invisible & (ob->invisible < 50 ? 1 : 7)
		1188	&& ms.player () == ob)
		1189	{
		1190	// force player to be visible to himself if invisible
		1191	if (lastcell.faces[0] != ob->face)
		1192	{
		1193	lastcell.faces[0] = ob->face;
		1194
		1195	mask |= 0x1;
		1196	sl << uint16 (ob->face);
		1197
		1198	socket.send_faces (ob);
		1199	}
		1200	}
		1201	/* Top face */
		1202	else if (update_space (sl, socket, ms, lastcell, 0))
		1203	mask |= 0x1;
		1204
		1205	/* Check to see if we are in fact sending anything for this
		1206	* space by checking the mask. If so, update the mask.
		1207	* if not, reset the len to that from before adding the mask
		1208	* value, so we don't send those bits.
		1209	*/
		1210	if (mask & 0xf)
		1211	sl[oldlen + 1] = mask & 0xff;
		1212	else
		1213	sl.reset (oldlen);
		1214	} /* else this is a viewable space */
		1215	ordered_mapwalk_end
		1216
		1217	socket.flush_fx ();
		1218
		1219	if (sl.length () > startlen || socket.sent_scroll)
		1220	{
		1221	socket.send_packet (sl);
		1222	socket.sent_scroll = 0;
		1223	}
		1224	}
1430		1225
1431	/*****************************************************************************/	1226	/*****************************************************************************/
1432
1433	/* GROS: The following one is used to allow a plugin to send a generic cmd to*/	1227	/* GROS: The following one is used to allow a plugin to send a generic cmd to*/
1434
1435	/* a player. Of course, the client need to know the command to be able to */	1228	/* a player. Of course, the client need to know the command to be able to */
1436
1437	/* manage it ! */	1229	/* manage it ! */
1438
1439	/*****************************************************************************/	1230	/*****************************************************************************/
1440	void	1231	void
1441	send_plugin_custom_message (object *pl, char *buf)	1232	send_plugin_custom_message (object *pl, char *buf)
1442	{	1233	{
1443	pl->contr->ns->send_packet (buf);	1234	pl->contr->ns->send_packet (buf);
…		…
1452	{	1243	{
1453	packet sl;	1244	packet sl;
1454	sl << "replyinfo skill_info\n";	1245	sl << "replyinfo skill_info\n";
1455		1246
1456	for (int i = 1; i < NUM_SKILLS; i++)	1247	for (int i = 1; i < NUM_SKILLS; i++)
1457	sl.printf ("%d:%s\n", i + CS_STAT_SKILLINFO, &skill_names[i]);	1248	sl.printf ("%d:%s\n", i + CS_STAT_SKILLINFO, &skill_names [i]);
1458		1249
1459	if (sl.length () >= MAXSOCKBUF)	1250	if (sl.length () > MAXSOCKBUF)
1460	{	1251	{
1461	LOG (llevError, "Buffer overflow in send_skill_info!\n");	1252	LOG (llevError, "Buffer overflow in send_skill_info!\n");
1462	fatal (0);	1253	fatal (0);
1463	}	1254	}
1464		1255
…		…
1477	sl << "replyinfo spell_paths\n";	1268	sl << "replyinfo spell_paths\n";
1478		1269
1479	for (int i = 0; i < NRSPELLPATHS; i++)	1270	for (int i = 0; i < NRSPELLPATHS; i++)
1480	sl.printf ("%d:%s\n", 1 << i, spellpathnames[i]);	1271	sl.printf ("%d:%s\n", 1 << i, spellpathnames[i]);
1481		1272
1482	if (sl.length () >= MAXSOCKBUF)	1273	if (sl.length () > MAXSOCKBUF)
1483	{	1274	{
1484	LOG (llevError, "Buffer overflow in send_spell_paths!\n");	1275	LOG (llevError, "Buffer overflow in send_spell_paths!\n");
1485	fatal (0);	1276	fatal (0);
1486	}	1277	}
1487		1278
…		…
1506	if (spell->type == SPELL)	1297	if (spell->type == SPELL)
1507	{	1298	{
1508	int flags = 0;	1299	int flags = 0;
1509		1300
1510	/* check if we need to update it */	1301	/* check if we need to update it */
1511	if (spell->last_sp != SP_level_spellpoint_cost (pl->ob, spell, SPELL_MANA))	1302	if (spell->cached_sp != SP_level_spellpoint_cost (pl->ob, spell, SPELL_MANA))
1512	{	1303	{
1513	spell->last_sp = SP_level_spellpoint_cost (pl->ob, spell, SPELL_MANA);	1304	spell->cached_sp = SP_level_spellpoint_cost (pl->ob, spell, SPELL_MANA);
1514	flags |= UPD_SP_MANA;	1305	flags |= UPD_SP_MANA;
1515	}	1306	}
1516		1307
1517	if (spell->last_grace != SP_level_spellpoint_cost (pl->ob, spell, SPELL_GRACE))	1308	if (spell->cached_grace != SP_level_spellpoint_cost (pl->ob, spell, SPELL_GRACE))
1518	{	1309	{
1519	spell->last_grace = SP_level_spellpoint_cost (pl->ob, spell, SPELL_GRACE);	1310	spell->cached_grace = SP_level_spellpoint_cost (pl->ob, spell, SPELL_GRACE);
1520	flags |= UPD_SP_GRACE;	1311	flags |= UPD_SP_GRACE;
1521	}	1312	}
1522		1313
1523	if (spell->last_eat != spell->stats.dam + SP_level_dam_adjust (pl->ob, spell))	1314	if (spell->cached_eat != spell->stats.dam + SP_level_dam_adjust (pl->ob, spell))
1524	{	1315	{
1525	spell->last_eat = spell->stats.dam + SP_level_dam_adjust (pl->ob, spell);	1316	spell->cached_eat = spell->stats.dam + SP_level_dam_adjust (pl->ob, spell);
1526	flags |= UPD_SP_DAMAGE;	1317	flags |= UPD_SP_DAMAGE;
1527	}	1318	}
1528		1319
1529	if (flags)	1320	if (flags)
1530	{	1321	{
…		…
1532		1323
1533	sl << "updspell "	1324	sl << "updspell "
1534	<< uint8 (flags)	1325	<< uint8 (flags)
1535	<< uint32 (spell->count);	1326	<< uint32 (spell->count);
1536		1327
1537	if (flags & UPD_SP_MANA ) sl << uint16 (spell->last_sp);	1328	if (flags & UPD_SP_MANA ) sl << uint16 (spell->cached_sp);
1538	if (flags & UPD_SP_GRACE ) sl << uint16 (spell->last_grace);	1329	if (flags & UPD_SP_GRACE ) sl << uint16 (spell->cached_grace);
1539	if (flags & UPD_SP_DAMAGE) sl << uint16 (spell->last_eat);	1330	if (flags & UPD_SP_DAMAGE) sl << uint16 (spell->cached_eat);
1540		1331
1541	pl->ns->send_packet (sl);	1332	pl->ns->send_packet (sl);
1542	}	1333	}
1543	}	1334	}
1544	}	1335	}
…		…
1574	LOG (llevError, "item number %d is a spell with no name.\n", spell->count);	1365	LOG (llevError, "item number %d is a spell with no name.\n", spell->count);
1575	return;	1366	return;
1576	}	1367	}
1577		1368
1578	/* store costs and damage in the object struct, to compare to later */	1369	/* store costs and damage in the object struct, to compare to later */
1579	spell->last_sp = SP_level_spellpoint_cost (pl->ob, spell, SPELL_MANA);	1370	spell->cached_sp = SP_level_spellpoint_cost (pl->ob, spell, SPELL_MANA);
1580	spell->last_grace = SP_level_spellpoint_cost (pl->ob, spell, SPELL_GRACE);	1371	spell->cached_grace = SP_level_spellpoint_cost (pl->ob, spell, SPELL_GRACE);
1581	spell->last_eat = spell->stats.dam + SP_level_dam_adjust (pl->ob, spell);	1372	spell->cached_eat = spell->stats.dam + SP_level_dam_adjust (pl->ob, spell);
1582		1373
1583	/* figure out which skill it uses, if it uses one */	1374	/* figure out which skill it uses, if it uses one */
1584	if (spell->skill)	1375	if (spell->skill)
1585	{	1376	if (object *tmp = pl->find_skill (spell->skill))
1586	for (i = 1; i < NUM_SKILLS; i++)
1587	if (!strcmp (spell->skill, skill_names[i]))
1588	{
1589	skill = i + CS_STAT_SKILLINFO;	1377	skill = tmp->subtype + CS_STAT_SKILLINFO;
1590	break;
1591	}
1592	}
1593		1378
1594	// spells better have a face	1379	// spells better have a face
1595	if (!spell->face)	1380	if (!spell->face)
1596	{	1381	{
1597	LOG (llevError, "%s: spell has no face, but face is mandatory.\n", &spell->name);	1382	LOG (llevError, "%s: spell has no face, but face is mandatory.\n", &spell->name);
1598	spell->face = face_find ("burnout.x11", blank_face);	1383	spell->face = face_find ("burnout.x11", blank_face);
1599	}	1384	}
		1385
		1386	pl->ns->send_face (spell->face);
1600		1387
1601	/* send the current values */	1388	/* send the current values */
1602	sl << uint32 (spell->count)	1389	sl << uint32 (spell->count)
1603	<< uint16 (spell->level)	1390	<< uint16 (spell->level)
1604	<< uint16 (spell->casting_time)	1391	<< uint16 (spell->casting_time)
1605	<< uint16 (spell->last_sp)	1392	<< uint16 (spell->cached_sp)
1606	<< uint16 (spell->last_grace)	1393	<< uint16 (spell->cached_grace)
1607	<< uint16 (spell->last_eat)	1394	<< uint16 (spell->cached_eat)
1608	<< uint8 (skill)	1395	<< uint8 (skill)
1609	<< uint32 (spell->path_attuned)	1396	<< uint32 (spell->path_attuned)
1610	<< uint32 (spell->face)	1397	<< uint32 (spell->face)
1611	<< data8 (spell->name)	1398	<< data8 (spell->name)
1612	<< data16 (spell->msg);	1399	<< data16 (spell->msg);
…		…
1640	* bytes and 3 strings (because that is the spec) so we need to	1427	* bytes and 3 strings (because that is the spec) so we need to
1641	* check that the length of those 3 strings, plus the 23 bytes,	1428	* check that the length of those 3 strings, plus the 23 bytes,
1642	* won't take us over the length limit for the socket, if it does,	1429	* won't take us over the length limit for the socket, if it does,
1643	* we need to send what we already have, and restart packet formation	1430	* we need to send what we already have, and restart packet formation
1644	*/	1431	*/
		1432	if (spell->type != SPELL)
		1433	continue;
		1434
1645	/* Seeing crashes by overflowed buffers. Quick arithemetic seems	1435	/* Seeing crashes by overflowed buffers. Quick arithemetic seems
1646	* to show add_spell is 26 bytes + 2 strings. However, the overun	1436	* to show add_spell is 26 bytes + 2 strings. However, the overun
1647	* is hundreds of bytes off, so correcting 22 vs 26 doesn't seem	1437	* is hundreds of bytes off, so correcting 22 vs 26 doesn't seem
1648	* like it will fix this	1438	* like it will fix this
1649	*/	1439	*/
1650	if (spell->type != SPELL)
1651	continue;
1652
1653	if (sl.length () >= (MAXSOCKBUF - (26 + strlen (spell->name) + (spell->msg ? strlen (spell->msg) : 0))))	1440	if (sl.length () > (MAXSOCKBUF - (26 + strlen (spell->name) + (spell->msg ? strlen (spell->msg) : 0))))
1654	{	1441	{
		1442	pl->ns->flush_fx ();
1655	pl->ns->send_packet (sl);	1443	pl->ns->send_packet (sl);
1656		1444
1657	sl.reset ();	1445	sl.reset ();
1658	sl << "addspell ";	1446	sl << "addspell ";
1659	}	1447	}
…		…
1667	return;	1455	return;
1668	}	1456	}
1669	else	1457	else
1670	append_spell (pl, sl, spell);	1458	append_spell (pl, sl, spell);
1671		1459
1672	if (sl.length () >= MAXSOCKBUF)	1460	if (sl.length () > MAXSOCKBUF)
1673	{	1461	{
1674	LOG (llevError, "Buffer overflow in esrv_add_spells!\n");	1462	LOG (llevError, "Buffer overflow in esrv_add_spells!\n");
1675	fatal (0);	1463	fatal (0);
1676	}	1464	}
1677		1465
1678	/* finally, we can send the packet */	1466	/* finally, we can send the packet */
		1467	pl->ns->flush_fx ();
1679	pl->ns->send_packet (sl);	1468	pl->ns->send_packet (sl);
1680	}	1469	}
1681		1470
		1471	//-GPL
		1472

Diff Legend

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