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.108 by root, Sat Jun 9 20:51:45 2007 UTC vs.
Revision 1.157 by root, Fri Nov 6 13:05:57 2009 UTC

1	/*	1	/*
2	* This file is part of Crossfire TRT, the Multiplayer Online Role Playing Game.	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 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
5	* Copyright (©) 2001,2007 Mark Wedel	5	* Copyright (©) 2001,2007 Mark Wedel
6	* Copyright (©) 1992,2007 Frank Tore Johansen	6	* Copyright (©) 1992,2007 Frank Tore Johansen
7	*	7	*
8	* Crossfire TRT is free software; you can redistribute it and/or modify it	8	* Deliantra is free software: you can redistribute it and/or modify it under
9	* under the terms of the GNU General Public License as published by the Free	9	* the terms of the Affero GNU General Public License as published by the
10	* Software Foundation; either version 2 of the License, or (at your option)	10	* Free Software Foundation, either version 3 of the License, or (at your
11	* any later version.	11	* option) any later version.
12	*	12	*
13	* This program is distributed in the hope that it will be useful, but	13	* This program is distributed in the hope that it will be useful,
14	* WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY	14	* but WITHOUT ANY WARRANTY; without even the implied warranty of
15	* or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License	15	* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16	* 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 along	18	* You should have received a copy of the Affero GNU General Public License
19	* with Crossfire TRT; if not, write to the Free Software Foundation, Inc. 51	19	* and the GNU General Public License along with this program. If not, see
20	* Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA	20	* <http://www.gnu.org/licenses/>.
21	*	21	*
22	* 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>
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->observe;	176	object *ob = pl->viewpoint;
		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	}
151		204
152	if (socket.current_map != ob->map || socket.force_newmap)	205	if (socket.current_map != ob->map || socket.force_newmap)
153	{	206	{
154	clear_map (pl);	207	clear_map (pl);
155	socket.current_map = ob->map;	208	socket.current_map = ob->map;
156		209	send_map_info (pl);
157	if (socket.mapinfocmd)
158	{
159	if (ob->map && ob->map->path[0])
160	{
161	int flags = 0;
162
163	if (ob->map->tile_path[0]) flags |= 1;
164	if (ob->map->tile_path[1]) flags |= 2;
165	if (ob->map->tile_path[2]) flags |= 4;
166	if (ob->map->tile_path[3]) flags |= 8;
167
168	socket.send_packet_printf ("mapinfo - spatial %d %d %d %d %d %s",
169	flags, socket.mapx / 2 - ob->x, socket.mapy / 2 - ob->y,
170	ob->map->width, ob->map->height, &ob->map->path);
171	}
172	else
173	socket.send_packet ("mapinfo current");
174	}
175	}	210	}
176	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)
177	{	212	{
178	int dx = ob->x - socket.current_x;	213	int dx = ob->x - socket.current_x;
179	int dy = ob->y - socket.current_y;	214	int dy = ob->y - socket.current_y;
180		215
181	if (socket.buggy_mapscroll && (abs (dx) > 8 || abs (dy) > 8))
182	clear_map (pl); // current (<= 1.9.1) clients have unchecked buffer overflows
183	else
184	{
185	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);
186	socket.floorbox_reset ();	217	socket.floorbox_reset ();
187	}
188	}	218	}
189		219
190	socket.current_x = ob->x;	220	socket.current_x = ob->x;
191	socket.current_y = ob->y;	221	socket.current_y = ob->y;
		222	}
192		223
193	region *reg = ob->region ();	224	/**
194	if (socket.current_region != reg)	225	* This sends the skill number to name mapping. We ignore
195	{	226	* the params - we always send the same info no matter what.
196	socket.current_region = reg;	227	*/
197	socket.send_packet_printf ("drawinfo 0 You are now %s.\n(use whereami for more details)", &reg->longname);	228	void
		229	send_skill_info (client *ns, char *params)
		230	{
		231	packet sl;
		232	sl << "replyinfo skill_info\n";
		233
		234	for (int i = 1; i < NUM_SKILLS; i++)
		235	sl.printf ("%d:%s\n", i + CS_STAT_SKILLINFO, &skill_names [i]);
		236
		237	if (sl.length () > MAXSOCKBUF)
198	}	238	{
		239	LOG (llevError, "Buffer overflow in send_skill_info!\n");
		240	fatal (0);
		241	}
		242
		243	ns->send_packet (sl);
		244	}
		245
		246	/**
		247	* This sends the spell path to name mapping. We ignore
		248	* the params - we always send the same info no matter what.
		249	*/
		250	void
		251	send_spell_paths (client * ns, char *params)
		252	{
		253	packet sl;
		254
		255	sl << "replyinfo spell_paths\n";
		256
		257	for (int i = 0; i < NRSPELLPATHS; i++)
		258	sl.printf ("%d:%s\n", 1 << i, spellpathnames[i]);
		259
		260	if (sl.length () > MAXSOCKBUF)
		261	{
		262	LOG (llevError, "Buffer overflow in send_spell_paths!\n");
		263	fatal (0);
		264	}
		265
		266	ns->send_packet (sl);
199	}	267	}
200		268
201	/**	269	/**
202	* RequestInfo is sort of a meta command. There is some specific	270	* RequestInfo is sort of a meta command. There is some specific
203	* request of information, but we call other functions to provide	271	* request of information, but we call other functions to provide
204	* that information.	272	* that information.
205	*/	273	*/
206	void	274	void
207	RequestInfo (char *buf, int len, client * ns)	275	RequestInfo (char *buf, int len, client *ns)
208	{	276	{
209	char *params = NULL, *cp;	277	char *params;
210
211	/* No match */
212	char bigbuf[MAX_BUF];
213	int slen;
214
215	/* Set up replyinfo before we modify any of the buffers - this is used
216	* if we don't find a match.
217	*/
218	strcpy (bigbuf, "replyinfo ");
219	slen = strlen (bigbuf);
220	safe_strcat (bigbuf, buf, &slen, MAX_BUF);
221		278
222	/* find the first space, make it null, and update the	279	/* find the first space, make it null, and update the
223	* params pointer.	280	* params pointer.
224	*/	281	*/
225	for (cp = buf; *cp != '\0'; cp++)	282	for (params = buf; *params; params++)
226	if (*cp == ' ')	283	if (*params == ' ')
227	{	284	{
228	*cp = '\0';
229	params = cp + 1;	285	*params++ = 0;
230	break;	286	break;
231	}	287	}
232		288
233	if (!strcmp (buf, "image_info"))
234	send_image_info (ns, params);
235	else if (!strcmp (buf, "image_sums"))
236	send_image_sums (ns, params);
237	else if (!strcmp (buf, "skill_info"))	289	if (!strcmp (buf, "skill_info"))
238	send_skill_info (ns, params);	290	send_skill_info (ns, params);
239	else if (!strcmp (buf, "spell_paths"))	291	else if (!strcmp (buf, "spell_paths"))
240	send_spell_paths (ns, params);	292	send_spell_paths (ns, params);
241	else	293	else
242	ns->send_packet (bigbuf, len);	294	{
		295	// undo tokenisation above and send replyinfo with the request unchanged
		296	if (*params)
		297	*--params = ' ';
		298
		299	ns->send_packet_printf ("replyinfo %s", buf);
		300	}
243	}	301	}
244		302
245	void	303	void
246	ExtCmd (char *buf, int len, player *pl)	304	ExtCmd (char *buf, int len, player *pl)
247	{	305	{
…		…
250		308
251	void	309	void
252	ExtiCmd (char *buf, int len, client *ns)	310	ExtiCmd (char *buf, int len, client *ns)
253	{	311	{
254	INVOKE_CLIENT (EXTICMD, ns, ARG_DATA (buf, len));	312	INVOKE_CLIENT (EXTICMD, ns, ARG_DATA (buf, len));
		313	}
		314
		315	//-GPL
		316
		317	void
		318	client::mapinfo_queue_clear ()
		319	{
		320	for (auto (i, mapinfo_queue.begin ()); i != mapinfo_queue.end (); ++i)
		321	free (*i);
		322
		323	mapinfo_queue.clear ();
		324	}
		325
		326	bool
		327	client::mapinfo_try (char *buf)
		328	{
		329	char *token = buf;
		330	buf += strlen (buf) + 9;
		331
		332	// initial map and its origin
		333	maptile *map = pl->viewpoint->map;
		334	int mapx = pl->ns->mapx / 2 - pl->viewpoint->x;
		335	int mapy = pl->ns->mapy / 2 - pl->viewpoint->y;
		336	int max_distance = 8; // limit maximum path length to something generous
		337
		338	while (*buf && map && max_distance)
		339	{
		340	int dir = *buf++ - '1';
		341
		342	if (dir >= 0 && dir <= 3)
		343	{
		344	if (!map->tile_path [dir])
		345	map = 0;
		346	else if (map->tile_available (dir, false))
		347	{
		348	maptile *neigh = map->tile_map [dir];
		349
		350	switch (dir)
		351	{
		352	case 0: mapy -= neigh->height; break;
		353	case 2: mapy += map ->height; break;
		354	case 3: mapx -= neigh->width ; break;
		355	case 1: mapx += map ->width ; break;
		356	}
		357
		358	map = neigh;
		359	--max_distance;
		360	}
		361	else
		362	return 0;
		363	}
		364	else
		365	max_distance = 0;
		366	}
		367
		368	if (!max_distance)
		369	send_packet_printf ("mapinfo %s error", token);
		370	else if (!map || !map->path)
		371	send_packet_printf ("mapinfo %s nomap", token);
		372	else
		373	{
		374	int flags = 0;
		375
		376	if (map->tile_path[0]) flags |= 1;
		377	if (map->tile_path[1]) flags |= 2;
		378	if (map->tile_path[2]) flags |= 4;
		379	if (map->tile_path[3]) flags |= 8;
		380
		381	send_packet_printf ("mapinfo %s spatial %d %d %d %d %d %s", token, flags, mapx, mapy, map->width, map->height, &map->path);
		382	}
		383
		384	return 1;
		385	}
		386
		387	void
		388	client::mapinfo_queue_run ()
		389	{
		390	if (mapinfo_queue.empty () || !pl)
		391	return;
		392
		393	for (int i = 0; i < mapinfo_queue.size (); ++i)
		394	if (mapinfo_try (mapinfo_queue [i]))
		395	{
		396	free (mapinfo_queue [i]);
		397	mapinfo_queue.erase (i);
		398	}
		399	else
		400	++i;
255	}	401	}
256		402
257	void	403	void
258	MapInfoCmd (char *buf, int len, player *pl)	404	MapInfoCmd (char *buf, int len, player *pl)
259	{	405	{
260	// <mapinfo tag spatial tile-path	406	// <mapinfo tag spatial tile-path
261	// >mapinfo tag spatial flags x y w h hash	407	// >mapinfo tag spatial flags x y w h hash
262		408
263	char bigbuf[MAX_BUF], *token;
264
265	token = buf;	409	char *token = buf;
266	// copy token	410
267	if (!(buf = strchr (buf, ' ')))	411	if (!(buf = strchr (buf, ' ')))
268	return;	412	return;
269		413
270	*buf++ = 0;
271
272	if (!strncmp (buf, "spatial ", 8))	414	if (!strncmp (buf, " spatial ", 9))
273	{	415	{
274	buf += 8;	416	char *copy = strdup (token);
		417	copy [buf - token] = 0;
275		418
276	// initial map and its origin	419	#if 0
277	maptile *map = pl->ob->map;	420	// this makes only sense when we flush the buffer immediately
278	sint16 dx, dy;	421	if (pl->ns->mapinfo_try (copy))
279	int mapx = pl->ns->mapx / 2 - pl->ob->x;	422	free (copy);
280	int mapy = pl->ns->mapy / 2 - pl->ob->y;
281	int max_distance = 8; // limit maximum path length to something generous
282
283	while (*buf && map && max_distance)
284	{
285	int dir = *buf++;
286
287	switch (dir)
288	{
289	case '1':
290	dx = 0;
291	dy = -1;
292	map = map->xy_find (dx, dy);
293	map && (mapy -= map->height);
294	break;
295	case '2':
296	mapx += map->width;
297	dx = map->width;
298	dy = 0;
299	map = map->xy_find (dx, dy);
300	break;
301	case '3':
302	mapy += map->height;
303	dx = 0;
304	dy = map->height;
305	map = map->xy_find (dx, dy);
306	break;
307	case '4':
308	dx = -1;
309	dy = 0;
310	map = map->xy_find (dx, dy);
311	map && (mapx -= map->width);
312	break;
313	}
314
315	--max_distance;
316	}
317
318	if (!max_distance)
319	snprintf (bigbuf, MAX_BUF, "mapinfo %s error", token);
320	else if (map && map->path[0])
321	{
322	int flags = 0;
323
324	if (map->tile_path[0]) flags |= 1;
325	if (map->tile_path[1]) flags |= 2;
326	if (map->tile_path[2]) flags |= 4;
327	if (map->tile_path[3]) flags |= 8;
328
329	snprintf (bigbuf, MAX_BUF, "mapinfo %s spatial %d %d %d %d %d %s", token, flags, mapx, mapy, map->width, map->height, &map->path);
330	}
331	else	423	else
332	snprintf (bigbuf, MAX_BUF, "mapinfo %s nomap", token);	424	#endif
		425	pl->ns->mapinfo_queue.push_back (copy);
333	}	426	}
334	else	427	else
335	snprintf (bigbuf, MAX_BUF, "mapinfo %s unsupported", token);	428	pl->ns->send_packet_printf ("mapinfo %s unsupported", token);
336
337	pl->ns->send_packet (bigbuf);
338	}	429	}
339		430
340	/** This is the Setup cmd */	431	/** This is the Setup cmd */
341	void	432	void
342	SetUp (char *buf, int len, client * ns)	433	SetUp (char *buf, int len, client * ns)
…		…
354	AddMeCmd (char *buf, int len, client *ns)	445	AddMeCmd (char *buf, int len, client *ns)
355	{	446	{
356	INVOKE_CLIENT (ADDME, ns, ARG_DATA (buf, len));	447	INVOKE_CLIENT (ADDME, ns, ARG_DATA (buf, len));
357	}	448	}
358		449
359	/** Reply to ExtendedInfos command */	450	//+GPL
360	void
361	ToggleExtendedInfos (char *buf, int len, client * ns)
362	{
363	char cmdback[MAX_BUF];
364	char command[50];
365	int info, nextinfo;
366
367	cmdback[0] = '\0';
368	nextinfo = 0;
369
370	while (1)
371	{
372	/* 1. Extract an info */
373	info = nextinfo;
374
375	while ((info < len) && (buf[info] == ' '))
376	info++;
377
378	if (info >= len)
379	break;
380
381	nextinfo = info + 1;
382
383	while ((nextinfo < len) && (buf[nextinfo] != ' '))
384	nextinfo++;
385
386	if (nextinfo - info >= 49) /*Erroneous info asked */
387	continue;
388
389	strncpy (command, &(buf[info]), nextinfo - info);
390
391	/* 2. Interpret info */
392	if (!strcmp ("smooth", command))
393	/* Toggle smoothing */
394	ns->EMI_smooth = !ns->EMI_smooth;
395	else
396	/*bad value */;
397
398	/*3. Next info */
399	}
400
401	strcpy (cmdback, "ExtendedInfoSet");
402
403	if (ns->EMI_smooth)
404	{
405	strcat (cmdback, " ");
406	strcat (cmdback, "smoothing");
407	}
408
409	ns->send_packet (cmdback);
410	}
411		451
412	/*	452	/*
413	#define MSG_TYPE_BOOK 1	453	#define MSG_TYPE_BOOK 1
414	#define MSG_TYPE_CARD 2	454	#define MSG_TYPE_CARD 2
415	#define MSG_TYPE_PAPER 3	455	#define MSG_TYPE_PAPER 3
…		…
432	while (1)	472	while (1)
433	{	473	{
434	/* 1. Extract an info */	474	/* 1. Extract an info */
435	info = nextinfo;	475	info = nextinfo;
436		476
437	while ((info < len) && (buf[info] == ' '))	477	while ((info < len) && (buf [info] == ' '))
438	info++;	478	info++;
439		479
440	if (info >= len)	480	if (info >= len)
441	break;	481	break;
442		482
443	nextinfo = info + 1;	483	nextinfo = info + 1;
444		484
445	while ((nextinfo < len) && (buf[nextinfo] != ' '))	485	while ((nextinfo < len) && (buf [nextinfo] != ' '))
446	nextinfo++;	486	nextinfo++;
447		487
448	if (nextinfo - info >= 49) /*Erroneous info asked */	488	if (nextinfo - info >= 49) /*Erroneous info asked */
449	continue;	489	continue;
450		490
451	strncpy (command, &(buf[info]), nextinfo - info);	491	memcpy (command, buf + info, nextinfo - info);
452	command[nextinfo - info] = '\0';	492	command [nextinfo - info] = 0;
		493
453	/* 2. Interpret info */	494	/* 2. Interpret info */
454	i = sscanf (command, "%d", &flag);	495	i = sscanf (command, "%d", &flag);
455		496
456	if ((i == 1) && (flag > 0) && (flag <= MSG_TYPE_LAST))	497	if ((i == 1) && (flag > 0) && (flag <= MSG_TYPE_LAST))
457	ns->supported_readables |= (1 << flag);	498	ns->supported_readables |= (1 << flag);
…		…
471		512
472	ns->send_packet (cmdback);	513	ns->send_packet (cmdback);
473	}	514	}
474		515
475	/**	516	/**
476	* client requested an image. send it rate-limited
477	* before flushing.
478	*/
479	void
480	AskFaceCmd (char *buf, int len, client *ns)
481	{
482	ns->askface.push_back (atoi (buf));
483	}
484
485	/**
486	* Tells client the picture it has to use
487	* to smooth a picture number given as argument.
488	*/
489	void
490	AskSmooth (char *buf, int len, client *ns)
491	{
492	ns->send_face (atoi (buf));
493	ns->flush_fx ();
494	}
495
496	/**
497	* This handles the general commands from the client (ie, north, fire, cast,	517	* This handles the general commands from the client (ie, north, fire, cast,
498	* etc.)	518	* etc.)
499	*/	519	*/
500	void	520	void
501	PlayerCmd (char *buf, int len, player *pl)	521	PlayerCmd (char *buf, int len, player *pl)
…		…
512	return;	532	return;
513		533
514	buf++;	534	buf++;
515	}	535	}
516		536
517	execute_newserver_command (pl->ob, (char *) buf);	537	execute_newserver_command (pl->ob, (char *)buf);
518		538
519	/* Perhaps something better should be done with a left over count.	539	/* Perhaps something better should be done with a left over count.
520	* Cleaning up the input should probably be done first - all actions	540	* Cleaning up the input should probably be done first - all actions
521	* for the command that issued the count should be done before any other	541	* for the command that issued the count should be done before any other
522	* commands.	542	* commands.
…		…
533	void	553	void
534	NewPlayerCmd (char *buf, int len, player *pl)	554	NewPlayerCmd (char *buf, int len, player *pl)
535	{	555	{
536	if (len <= 6)	556	if (len <= 6)
537	{	557	{
538	LOG (llevDebug, "Corrupt ncom command <%s> not long enough - discarding\n", buf);	558	LOG (llevDebug, "%s: corrupt ncom command <%s>: not long enough (%d) - discarding\n", pl->ns->host, buf, len);
539	return;	559	return;
540	}	560	}
541		561
542	uint16 cmdid = net_uint16 ((uint8 *)buf);	562	uint16 cmdid = net_uint16 ((uint8 *)buf);
543	sint32 repeat = net_sint32 ((uint8 *)buf + 2);	563	sint32 repeat = net_sint32 ((uint8 *)buf + 2);
…		…
681	* syntax is: move (to) (tag) (nrof)	701	* syntax is: move (to) (tag) (nrof)
682	*/	702	*/
683	void	703	void
684	MoveCmd (char *buf, int len, player *pl)	704	MoveCmd (char *buf, int len, player *pl)
685	{	705	{
686	int vals[3], i;	706	int to, tag, nrof;
687		707
688	/* A little funky here. We only cycle for 2 records, because	708	if (3 != sscanf (buf, "%d %d %d", &to, &tag, &nrof))
689	* we obviously are not going to find a space after the third
690	* record. Perhaps we should just replace this with a
691	* sscanf?
692	*/
693	for (i = 0; i < 2; i++)
694	{	709	{
695	vals[i] = atoi (buf);
696
697	if (!(buf = strchr (buf, ' ')))
698	{
699	LOG (llevError, "Incomplete move command: %s\n", buf);	710	LOG (llevError, "Incomplete move command: %s\n", buf);
700	return;	711	return;
701	}
702
703	buf++;
704	}	712	}
705		713
706	vals[2] = atoi (buf);	714	esrv_move_object (pl->ob, to, tag, nrof);
707
708	/* LOG(llevDebug,"Move item %d (nrof=%d) to %d.\n", vals[1], vals[2], vals[0]);*/
709	esrv_move_object (pl->ob, vals[0], vals[1], vals[2]);
710	}	715	}
711		716
712	/******************************************************************************	717	/******************************************************************************
713	*	718	*
714	* Start of commands the server sends to the client.	719	* Start of commands the server sends to the client.
…		…
729	* Get player's current range attack in obuf.	734	* Get player's current range attack in obuf.
730	*/	735	*/
731	static void	736	static void
732	rangetostring (player *pl, char *obuf)	737	rangetostring (player *pl, char *obuf)
733	{	738	{
734	dynbuf_text buf;	739	dynbuf_text &buf = msg_dynbuf; buf.clear ();
735		740
736	if (pl->ranged_ob)	741	if (pl->ranged_ob)
737	buf << " Range" << (pl->ob->current_weapon == pl->ranged_ob ? "*" : "") << ": " << pl->ranged_ob->name;	742	buf << " Range" << (pl->ob->current_weapon == pl->ranged_ob ? "*" : "") << ": " << pl->ranged_ob->name;
738		743
739	if (pl->combat_ob)	744	if (pl->combat_ob)
…		…
747		752
748	//TODO: maybe golem should become the current_weapon, quite simply?	753	//TODO: maybe golem should become the current_weapon, quite simply?
749	if (pl->golem)	754	if (pl->golem)
750	buf << " Golem*: " << pl->golem->name;	755	buf << " Golem*: " << pl->golem->name;
751		756
		757	buf << '\0';
752	buf.linearise (obuf);	758	buf.linearise (obuf);
753	obuf [buf.size ()] = 0;
754	}	759	}
755		760
756	#define AddIfInt64(Old,New,Type) if (Old != New) {\	761	#define AddIfInt64(Old,New,Type) if (Old != New) {\
757	Old = New; \	762	Old = New; \
758	sl << uint8 (Type) << uint64 (New); \	763	sl << uint8 (Type) << uint64 (New); \
…		…
815	AddIfShort (ns->last_stats.Wis, ob->stats.Wis, CS_STAT_WIS);	820	AddIfShort (ns->last_stats.Wis, ob->stats.Wis, CS_STAT_WIS);
816	AddIfShort (ns->last_stats.Pow, ob->stats.Pow, CS_STAT_POW);	821	AddIfShort (ns->last_stats.Pow, ob->stats.Pow, CS_STAT_POW);
817	AddIfShort (ns->last_stats.Cha, ob->stats.Cha, CS_STAT_CHA);	822	AddIfShort (ns->last_stats.Cha, ob->stats.Cha, CS_STAT_CHA);
818		823
819	for (int s = 0; s < NUM_SKILLS; s++)	824	for (int s = 0; s < NUM_SKILLS; s++)
820	if (object *skill = opl->last_skill_ob[s])	825	if (object *skill = opl->last_skill_ob [s])
821	if (skill->stats.exp != ns->last_skill_exp [s])	826	if (skill->stats.exp != ns->last_skill_exp [s])
822	{	827	{
823	ns->last_skill_exp [s] = skill->stats.exp;	828	ns->last_skill_exp [s] = skill->stats.exp;
824		829
825	/* Always send along the level if exp changes. This is only	830	/* Always send along the level if exp changes. This is only
…		…
881		886
882	/**	887	/**
883	* Tells the client that here is a player it should start using.	888	* Tells the client that here is a player it should start using.
884	*/	889	*/
885	void	890	void
886	esrv_new_player (player *pl, uint32 weight)	891	esrv_new_player (player *pl)
887	{	892	{
		893	sint32 weight = pl->ob->client_weight ();
		894
888	packet sl ("player");	895	packet sl ("player");
889		896
890	sl << uint32 (pl->ob->count)	897	sl << uint32 (pl->ob->count)
891	<< uint32 (weight)	898	<< uint32 (weight)
892	<< uint32 (pl->ob->face)	899	<< uint32 (pl->ob->face)
893	<< data8 (pl->ob->name);	900	<< data8 (pl->ob->name);
894		901
895	pl->ns->last_weight = weight;	902	pl->ns->last_weight = weight;
896	pl->ns->send_packet (sl);	903	pl->ns->send_packet (sl);
897	SET_FLAG (pl->ob, FLAG_CLIENT_SENT);
898	}	904	}
899		905
900	/******************************************************************************	906	/******************************************************************************
901	*	907	*
902	* Start of map related commands.	908	* Start of map related commands.
…		…
959		965
960	if (!ns.faces_sent[face_num])	966	if (!ns.faces_sent[face_num])
961	if (ob)	967	if (ob)
962	ns.send_faces (ob);	968	ns.send_faces (ob);
963	else	969	else
964	ns.send_face (face_num);	970	ns.send_face (face_num, 10);
965		971
966	sl << uint16 (face_num);	972	sl << uint16 (face_num);
967	return 1;	973	return 1;
968	}	974	}
969		975
970	/* Nothing changed */	976	/* Nothing changed */
971	return 0;	977	return 0;
972	}	978	}
973		979
974	/**	980	//-GPL
975	* Returns the size of a data for a map square as returned by
976	* mapextended. There are CLIENTMAPX*CLIENTMAPY*LAYERS entries
977	* available.
978	*/
979	int
980	getExtendedMapInfoSize (client * ns)
981	{
982	int result = 0;
983
984	if (ns->ext_mapinfos)
985	{
986	if (ns->EMI_smooth)
987	result += 1; /*One byte for smoothlevel */
988	}
989
990	return result;
991	}
992		981
993	// prefetch (and touch) all maps within a specific distancd	982	// prefetch (and touch) all maps within a specific distancd
994	static void	983	static void
995	prefetch_surrounding_maps (maptile *map, int distance)	984	prefetch_surrounding_maps (maptile *map, int distance)
996	{	985	{
997	map->last_access = runtime;	986	map->touch ();
998		987
999	if (--distance)	988	if (--distance)
1000	for (int dir = 4; --dir; )	989	for (int dir = 4; --dir; )
1001	if (const shstr &path = map->tile_path [dir])	990	if (const shstr &path = map->tile_path [dir])
1002	if (maptile *&neigh = map->tile_map [dir])	991	if (maptile *&neigh = map->tile_map [dir])
…		…
1010	prefetch_surrounding_maps (object *op)	999	prefetch_surrounding_maps (object *op)
1011	{	1000	{
1012	prefetch_surrounding_maps (op->map, 3);	1001	prefetch_surrounding_maps (op->map, 3);
1013	}	1002	}
1014		1003
		1004	//+GPL
		1005
1015	/**	1006	/**
1016	* Draws client map.	1007	* Draws client map.
1017	*/	1008	*/
1018	void	1009	void
1019	draw_client_map (player *pl)	1010	draw_client_map (player *pl)
1020	{	1011	{
1021	object *ob = pl->observe;	1012	object *ob = pl->viewpoint;
1022	if (!ob->active)	1013	if (!pl->observe->active)
1023	return;	1014	return;
1024
1025	maptile *plmap = ob->map;
1026		1015
1027	/* If player is just joining the game, he isn't here yet, so the map	1016	/* If player is just joining the game, he isn't here yet, so the map
1028	* can get swapped out. If so, don't try to send them a map. All will	1017	* can get swapped out. If so, don't try to send them a map. All will
1029	* be OK once they really log in.	1018	* be OK once they really log in.
1030	*/	1019	*/
1031	if (!plmap || plmap->in_memory != MAP_IN_MEMORY)	1020	if (!ob->map || ob->map->in_memory != MAP_ACTIVE)
1032	return;	1021	return;
1033		1022
1034	int x, y, ax, ay, startlen, max_x, max_y, oldlen;
1035	int estartlen, eoldlen;	1023	int startlen, oldlen;
1036	uint8 eentrysize;
1037	uint16 ewhatstart, ewhatflag;
1038	uint8 extendedinfos;
1039		1024
1040	check_map_change (pl);	1025	check_map_change (pl);
1041	prefetch_surrounding_maps (pl->ob);	1026	prefetch_surrounding_maps (pl->ob);
1042		1027
1043	/* do LOS after calls to update_position */	1028	/* do LOS after calls to update_position */
1044	if (ob != pl->ob)	1029	/* unfortunately, we need to udpate los when observing, currently */
1045	clear_los (pl);	1030	if (pl->do_los || pl->viewpoint != pl->ob)
1046	else if (pl->do_los)
1047	{	1031	{
1048	update_los (ob);
1049	pl->do_los = 0;	1032	pl->do_los = 0;
		1033	pl->update_los ();
1050	}	1034	}
1051		1035
1052	/**	1036	/**
1053	* This function uses the new map1 protocol command to send the map	1037	* This function uses the new map1 protocol command to send the map
1054	* to the client. It is necessary because the old map command supports	1038	* to the client. It is necessary because the old map command supports
…		…
1073	*/	1057	*/
1074		1058
1075	client &socket = *pl->ns;	1059	client &socket = *pl->ns;
1076		1060
1077	packet sl (socket.mapmode == Map1Cmd ? "map1" : "map1a");	1061	packet sl (socket.mapmode == Map1Cmd ? "map1" : "map1a");
1078	packet esl;
1079		1062
1080	startlen = sl.length ();	1063	startlen = sl.length ();
1081		1064
1082	/*Extendedmapinfo structure initialisation */	1065	int hx = socket.mapx / 2;
1083	if (socket.ext_mapinfos)	1066	int hy = socket.mapy / 2;
1084	{
1085	extendedinfos = EMI_NOREDRAW;
1086		1067
1087	if (socket.EMI_smooth)	1068	ordered_mapwalk_begin (ob, -hx, -hy, hx, hy)
1088	extendedinfos |= EMI_SMOOTH;	1069	int ax = dx + hx;
		1070	int ay = dy + hy;
1089		1071
1090	ewhatstart = esl.length ();	1072	int mask = (ax << 10) | (ay << 4);
1091	ewhatflag = extendedinfos; /*The EMI_NOREDRAW bit	1073	MapCell &lastcell = socket.lastmap.cells[ax][ay];
1092	could need to be taken away */
1093	eentrysize = getExtendedMapInfoSize (&socket);
1094	esl << "mapextended "
1095	<< uint8 (extendedinfos)
1096	<< uint8 (eentrysize);
1097		1074
1098	estartlen = esl.length ();	1075	/* If the coordinates are not valid, or it is too dark to see,
1099	}	1076	* we tell the client as such
1100
1101	/* x,y are the real map locations. ax, ay are viewport relative
1102	* locations.
1103	*/	1077	*/
1104	ay = 0;	1078	if (!m)
1105
1106	/* We could do this logic as conditionals in the if statement,
1107	* but that started to get a bit messy to look at.
1108	*/
1109	max_x = ob->x + (socket.mapx + 1) / 2;
1110	max_y = ob->y + (socket.mapy + 1) / 2;
1111
1112	for (y = ob->y - socket.mapy / 2; y < max_y; y++, ay++)
1113	{	1079	{
1114	sint16 nx, ny;	1080	/* space is out of map. Update space and clear values
1115	maptile *m = 0;	1081	* if this hasn't already been done. If the space is out
1116		1082	* of the map, it shouldn't have a head.
1117	ax = 0;	1083	*/
1118	for (x = ob->x - socket.mapx / 2; x < max_x; x++, ax++)	1084	if (lastcell.count != -1)
1119	{	1085	{
1120	// check to see if we can simply go one right quickly	1086	sl << uint16 (mask);
		1087	map_clearcell (&lastcell, -1);
1121	++nx;	1088	}
1122	if (m && nx >= m->width)	1089
		1090	continue;
		1091	}
		1092
		1093	int d = pl->blocked_los_uc (dx, dy);
		1094
		1095	if (d > 3)
		1096	{
		1097	/* This block deals with spaces that are not visible for whatever
		1098	* reason. Still may need to send the head for this space.
		1099	*/
		1100	if (lastcell.count != -1
		1101	|| lastcell.faces[0]
		1102	|| lastcell.faces[1]
		1103	|| lastcell.faces[2]
		1104	|| lastcell.stat_hp
		1105	|| lastcell.flags
		1106	|| lastcell.player)
		1107	sl << uint16 (mask);
		1108
		1109	/* properly clear a previously sent big face */
		1110	map_clearcell (&lastcell, -1);
		1111	}
		1112	else
		1113	{
		1114	/* In this block, the space is visible.
		1115	*/
		1116
		1117	/* Rather than try to figure out what everything that we might
		1118	* need to send is, then form the packet after that,
		1119	* we presume that we will in fact form a packet, and update
		1120	* the bits by what we do actually send. If we send nothing,
		1121	* we just back out sl.length () to the old value, and no harm
		1122	* is done.
		1123	* I think this is simpler than doing a bunch of checks to see
		1124	* what if anything we need to send, setting the bits, then
		1125	* doing those checks again to add the real data.
		1126	*/
		1127	oldlen = sl.length ();
		1128
		1129	sl << uint16 (mask);
		1130
		1131	unsigned char dummy;
		1132	unsigned char *last_ext = &dummy;
		1133
		1134	/* Darkness changed */
		1135	if (lastcell.count != d)
		1136	{
1123	m = 0;	1137	mask |= 0x8;
1124		1138
1125	if (!m)	1139	*last_ext |= 0x80;
		1140	last_ext = &sl[sl.length ()];
		1141	sl << uint8 (d);
		1142	}
		1143
		1144	lastcell.count = d;
		1145
		1146	mapspace &ms = m->at (nx, ny);
		1147	ms.update ();
		1148
		1149	// extmap handling
		1150	uint8 stat_hp = 0;
		1151	uint8 stat_width = 0;
		1152	uint8 flags = 0;
		1153	tag_t player = 0;
		1154
		1155	// send hp information, if applicable
		1156	if (object *op = ms.faces_obj [0])
		1157	if (op->is_head () && !op->invisible)
1126	{	1158	{
1127	nx = x; ny = y; m = plmap;	1159	if (op->stats.maxhp > op->stats.hp
1128		1160	&& op->stats.maxhp > 0
1129	if (!xy_normalise (m, nx, ny))	1161	&& (op->type == PLAYER
		1162	|| op->type == DOOR // does not work, have maxhp 0
		1163	|| QUERY_FLAG (op, FLAG_MONSTER)
		1164	|| QUERY_FLAG (op, FLAG_ALIVE)
		1165	|| QUERY_FLAG (op, FLAG_GENERATOR)))
1130	m = 0;	1166	{
		1167	stat_hp = 255 - (op->stats.hp * 255 + 254) / op->stats.maxhp;
		1168	stat_width = op->arch->max_x - op->arch->x; //TODO: should be upper-left edge
		1169	}
		1170
		1171	if (expect_false (op->has_dialogue ()))
		1172	flags |= 1;
		1173
		1174	if (expect_false (op->type == PLAYER))
		1175	player = op == ob ? pl->ob->count
		1176	: op == pl->ob ? ob->count
		1177	: op->count;
1131	}	1178	}
1132		1179
1133	int emask, mask;	1180	if (expect_false (lastcell.stat_hp != stat_hp))
1134	emask = mask = (ax & 0x3f) << 10 | (ay & 0x3f) << 4;
1135
1136	MapCell &lastcell = socket.lastmap.cells[ax][ay];
1137
1138	/* If the coordinates are not valid, or it is too dark to see,
1139	* we tell the client as such
1140	*/
1141	if (!m)
1142	{	1181	{
1143	/* space is out of map. Update space and clear values	1182	lastcell.stat_hp = stat_hp;
1144	* if this hasn't already been done. If the space is out	1183
1145	* of the map, it shouldn't have a head	1184	mask |= 0x8;
1146	*/	1185	*last_ext |= 0x80;
1147	if (lastcell.count != -1)	1186	last_ext = &sl[sl.length ()];
		1187
		1188	sl << uint8 (5) << uint8 (stat_hp);
		1189
		1190	if (stat_width > 1)
1148	{	1191	{
1149	sl << uint16 (mask);
1150	map_clearcell (&lastcell, -1);
1151	}
1152
1153	continue;
1154	}
1155
1156	m->touch ();
1157
1158	int d = pl->blocked_los[ax][ay];
1159
1160	if (d > 3)
1161	{
1162
1163	int need_send = 0, count;
1164
1165	/* This block deals with spaces that are not visible for whatever
1166	* reason. Still may need to send the head for this space.
1167	*/
1168
1169	oldlen = sl.length ();
1170
1171	sl << uint16 (mask);
1172
1173	if (lastcell.count != -1)
1174	need_send = 1;
1175
1176	count = -1;
1177
1178	/* properly clear a previously sent big face */
1179	if (lastcell.faces[0] || lastcell.faces[1] || lastcell.faces[2]
1180	|| lastcell.stat_hp || lastcell.flags || lastcell.player)
1181	need_send = 1;
1182
1183	map_clearcell (&lastcell, count);
1184
1185	if ((mask & 0xf) || need_send)
1186	sl[oldlen + 1] = mask & 0xff;
1187	else
1188	sl.reset (oldlen);
1189	}
1190	else
1191	{
1192	/* In this block, the space is visible.
1193	*/
1194
1195	/* Rather than try to figure out what everything that we might
1196	* need to send is, then form the packet after that,
1197	* we presume that we will in fact form a packet, and update
1198	* the bits by what we do actually send. If we send nothing,
1199	* we just back out sl.length () to the old value, and no harm
1200	* is done.
1201	* I think this is simpler than doing a bunch of checks to see
1202	* what if anything we need to send, setting the bits, then
1203	* doing those checks again to add the real data.
1204	*/
1205	oldlen = sl.length ();
1206	eoldlen = esl.length ();
1207
1208	sl << uint16 (mask);
1209
1210	unsigned char dummy;
1211	unsigned char *last_ext = &dummy;
1212
1213	/* Darkness changed */
1214	if (lastcell.count != d && socket.darkness)
1215	{
1216	mask |= 0x8;
1217
1218	if (socket.extmap)
1219	{
1220	*last_ext |= 0x80;	1192	*last_ext |= 0x80;
1221	last_ext = &sl[sl.length ()];	1193	last_ext = &sl[sl.length ()];
1222	sl << uint8 (d);	1194
1223	}	1195	sl << uint8 (6) << uint8 (stat_width);
1224	else
1225	sl << uint8 (255 - 64 * d);
1226	}	1196	}
		1197	}
1227		1198
1228	lastcell.count = d;	1199	if (expect_false (lastcell.player != player))
1229
1230	mapspace &ms = m->at (nx, ny);
1231	ms.update ();
1232
1233	if (socket.extmap)
1234	{	1200	{
1235	uint8 stat_hp = 0;	1201	lastcell.player = player;
1236	uint8 stat_width = 0;
1237	uint8 flags = 0;
1238	tag_t player = 0;
1239		1202
1240	// send hp information, if applicable
1241	if (object *op = ms.faces_obj [0])
1242	{
1243	if (op->head || op->invisible)
1244	; // do not show
1245	else if (op->type == PLAYER
1246	|| QUERY_FLAG (op, FLAG_MONSTER) || QUERY_FLAG (op, FLAG_ALIVE) || QUERY_FLAG (op, FLAG_GENERATOR))
1247	{
1248	if (op->stats.maxhp > 0 && (unsigned) op->stats.maxhp > (unsigned) op->stats.hp)
1249	{
1250	stat_hp = 255 - (op->stats.hp * 255 + 254) / op->stats.maxhp;
1251	stat_width = op->arch->max_x - op->arch->x; //TODO: should be upper-left edge
1252	}
1253	}
1254
1255	if (op->msg && op->msg[0] == '@')
1256	flags |= 1;
1257
1258	if (op->type == PLAYER && op != ob)
1259	player = op->count;
1260	}
1261
1262	if (lastcell.stat_hp != stat_hp)
1263	{
1264	lastcell.stat_hp = stat_hp;
1265
1266	mask |= 0x8;	1203	mask |= 0x8;
1267	*last_ext |= 0x80;	1204	*last_ext |= 0x80;
1268	last_ext = &sl[sl.length ()];	1205	last_ext = &sl[sl.length ()];
1269		1206
1270	sl << uint8 (5) << uint8 (stat_hp);
1271
1272	if (stat_width > 1)
1273	{
1274	*last_ext |= 0x80;
1275	last_ext = &sl[sl.length ()];
1276
1277	sl << uint8 (6) << uint8 (stat_width);
1278	}
1279	}
1280
1281	if (lastcell.player != player)
1282	{
1283	lastcell.player = player;
1284
1285	mask |= 0x8;
1286	*last_ext |= 0x80;
1287	last_ext = &sl[sl.length ()];
1288
1289	sl << uint8 (0x47) << uint8 (4) << (uint32)player;	1207	sl << uint8 (0x47) << uint8 (4) << (uint32)player;
1290	}	1208	}
1291		1209
1292	if (lastcell.flags != flags)	1210	if (expect_false (lastcell.flags != flags))
1293	{	1211	{
1294	lastcell.flags = flags;	1212	lastcell.flags = flags;
1295		1213
1296	mask |= 0x8;	1214	mask |= 0x8;
1297	*last_ext |= 0x80;	1215	*last_ext |= 0x80;
1298	last_ext = &sl[sl.length ()];	1216	last_ext = &sl[sl.length ()];
1299		1217
1300	sl << uint8 (8) << uint8 (flags);	1218	sl << uint8 (8) << uint8 (flags);
1301	}
1302	}	1219	}
1303		1220
		1221	// faces
		1222
1304	/* Floor face */	1223	/* Floor face */
1305	if (update_space (sl, socket, ms, lastcell, 2))	1224	if (update_space (sl, socket, ms, lastcell, 2))
1306	mask |= 0x4;	1225	mask |= 0x4;
1307		1226
1308	/* Middle face */	1227	/* Middle face */
1309	if (update_space (sl, socket, ms, lastcell, 1))	1228	if (update_space (sl, socket, ms, lastcell, 1))
1310	mask |= 0x2;	1229	mask |= 0x2;
1311		1230
		1231	if (expect_false (ob->invisible)
		1232	&& ob->invisible & (ob->invisible < 50 ? 1 : 7)
1312	if (ms.player () == ob	1233	&& ms.player () == ob)
1313	&& (ob->invisible & (ob->invisible < 50 ? 1 : 7)))
1314	{	1234	{
1315	// force player to be visible to himself if invisible	1235	// force player to be visible to himself if invisible
1316	if (lastcell.faces[0] != ob->face)	1236	if (lastcell.faces[0] != ob->face)
1317	{	1237	{
1318	lastcell.faces[0] = ob->face;	1238	lastcell.faces[0] = ob->face;
1319		1239
1320	mask |= 0x1;
1321	sl << uint16 (ob->face);
1322
1323	socket.send_faces (ob);
1324	}
1325	}
1326	/* Top face */
1327	else if (update_space (sl, socket, ms, lastcell, 0))
1328	mask |= 0x1;	1240	mask |= 0x1;
		1241	sl << uint16 (ob->face);
1329		1242
		1243	socket.send_faces (ob);
		1244	}
		1245	}
		1246	/* Top face */
		1247	else if (update_space (sl, socket, ms, lastcell, 0))
		1248	mask |= 0x1;
		1249
1330	/* Check to see if we are in fact sending anything for this	1250	/* Check to see if we are in fact sending anything for this
1331	* space by checking the mask. If so, update the mask.	1251	* space by checking the mask. If so, update the mask.
1332	* if not, reset the len to that from before adding the mask	1252	* if not, reset the len to that from before adding the mask
1333	* value, so we don't send those bits.	1253	* value, so we don't send those bits.
1334	*/	1254	*/
1335	if (mask & 0xf)	1255	if (mask & 0xf)
1336	sl[oldlen + 1] = mask & 0xff;	1256	sl[oldlen + 1] = mask & 0xff;
1337	else	1257	else
1338	sl.reset (oldlen);	1258	sl.reset (oldlen);
1339
1340	if (socket.ext_mapinfos)
1341	esl << uint16 (emask);
1342
1343	if (socket.EMI_smooth)
1344	{
1345	for (int layer = 2+1; layer--; )
1346	{
1347	object *ob = ms.faces_obj [layer];
1348
1349	// If there is no object for this space, or if the face for the object
1350	// is the blank face, set the smoothlevel to zero.
1351	int smoothlevel = ob && ob->face != blank_face ? ob->smoothlevel : 0;
1352
1353	// We've gotten what face we want to use for the object. Now see if
1354	// if it has changed since we last sent it to the client.
1355	if (lastcell.smooth[layer] != smoothlevel)
1356	{
1357	lastcell.smooth[layer] = smoothlevel;
1358	esl << uint8 (smoothlevel);
1359	emask |= 1 << layer;
1360	}
1361	}
1362
1363	if (emask & 0xf)
1364	esl[eoldlen + 1] = emask & 0xff;
1365	else
1366	esl.reset (eoldlen);
1367	}
1368	} /* else this is a viewable space */	1259	} /* else this is a viewable space */
1369	} /* for x loop */	1260	ordered_mapwalk_end
1370	} /* for y loop */
1371		1261
1372	socket.flush_fx ();	1262	socket.flush_fx ();
1373
1374	/* Verify that we in fact do need to send this */
1375	if (socket.ext_mapinfos)
1376	{
1377	if (!(sl.length () > startlen || socket.sent_scroll))
1378	{
1379	/* No map data will follow, so don't say the client
1380	* it doesn't need draw!
1381	*/
1382	ewhatflag &= ~EMI_NOREDRAW;
1383	esl[ewhatstart + 1] = ewhatflag & 0xff;
1384	}
1385
1386	if (esl.length () > estartlen)
1387	socket.send_packet (esl);
1388	}
1389		1263
1390	if (sl.length () > startlen || socket.sent_scroll)	1264	if (sl.length () > startlen || socket.sent_scroll)
1391	{	1265	{
1392	socket.send_packet (sl);	1266	socket.send_packet (sl);
1393	socket.sent_scroll = 0;	1267	socket.sent_scroll = 0;
…		…
1404	{	1278	{
1405	pl->contr->ns->send_packet (buf);	1279	pl->contr->ns->send_packet (buf);
1406	}	1280	}
1407		1281
1408	/**	1282	/**
1409	* This sends the skill number to name mapping. We ignore
1410	* the params - we always send the same info no matter what.
1411	*/
1412	void
1413	send_skill_info (client *ns, char *params)
1414	{
1415	packet sl;
1416	sl << "replyinfo skill_info\n";
1417
1418	for (int i = 1; i < NUM_SKILLS; i++)
1419	sl.printf ("%d:%s\n", i + CS_STAT_SKILLINFO, &skill_names[i]);
1420
1421	if (sl.length () >= MAXSOCKBUF)
1422	{
1423	LOG (llevError, "Buffer overflow in send_skill_info!\n");
1424	fatal (0);
1425	}
1426
1427	ns->send_packet (sl);
1428	}
1429
1430	/**
1431	* This sends the spell path to name mapping. We ignore
1432	* the params - we always send the same info no matter what.
1433	*/
1434	void
1435	send_spell_paths (client * ns, char *params)
1436	{
1437	packet sl;
1438
1439	sl << "replyinfo spell_paths\n";
1440
1441	for (int i = 0; i < NRSPELLPATHS; i++)
1442	sl.printf ("%d:%s\n", 1 << i, spellpathnames[i]);
1443
1444	if (sl.length () >= MAXSOCKBUF)
1445	{
1446	LOG (llevError, "Buffer overflow in send_spell_paths!\n");
1447	fatal (0);
1448	}
1449
1450	ns->send_packet (sl);
1451	}
1452
1453	/**
1454	* This looks for any spells the player may have that have changed their stats.	1283	* This looks for any spells the player may have that have changed their stats.
1455	* it then sends an updspell packet for each spell that has changed in this way	1284	* it then sends an updspell packet for each spell that has changed in this way
1456	*/	1285	*/
1457	void	1286	void
1458	esrv_update_spells (player *pl)	1287	esrv_update_spells (player *pl)
…		…
1468	if (spell->type == SPELL)	1297	if (spell->type == SPELL)
1469	{	1298	{
1470	int flags = 0;	1299	int flags = 0;
1471		1300
1472	/* check if we need to update it */	1301	/* check if we need to update it */
1473	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))
1474	{	1303	{
1475	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);
1476	flags |= UPD_SP_MANA;	1305	flags |= UPD_SP_MANA;
1477	}	1306	}
1478		1307
1479	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))
1480	{	1309	{
1481	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);
1482	flags |= UPD_SP_GRACE;	1311	flags |= UPD_SP_GRACE;
1483	}	1312	}
1484		1313
1485	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))
1486	{	1315	{
1487	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);
1488	flags |= UPD_SP_DAMAGE;	1317	flags |= UPD_SP_DAMAGE;
1489	}	1318	}
1490		1319
1491	if (flags)	1320	if (flags)
1492	{	1321	{
…		…
1494		1323
1495	sl << "updspell "	1324	sl << "updspell "
1496	<< uint8 (flags)	1325	<< uint8 (flags)
1497	<< uint32 (spell->count);	1326	<< uint32 (spell->count);
1498		1327
1499	if (flags & UPD_SP_MANA ) sl << uint16 (spell->last_sp);	1328	if (flags & UPD_SP_MANA ) sl << uint16 (spell->cached_sp);
1500	if (flags & UPD_SP_GRACE ) sl << uint16 (spell->last_grace);	1329	if (flags & UPD_SP_GRACE ) sl << uint16 (spell->cached_grace);
1501	if (flags & UPD_SP_DAMAGE) sl << uint16 (spell->last_eat);	1330	if (flags & UPD_SP_DAMAGE) sl << uint16 (spell->cached_eat);
1502		1331
1503	pl->ns->send_packet (sl);	1332	pl->ns->send_packet (sl);
1504	}	1333	}
1505	}	1334	}
1506	}	1335	}
…		…
1536	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);
1537	return;	1366	return;
1538	}	1367	}
1539		1368
1540	/* 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 */
1541	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);
1542	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);
1543	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);
1544		1373
1545	/* figure out which skill it uses, if it uses one */	1374	/* figure out which skill it uses, if it uses one */
1546	if (spell->skill)	1375	if (spell->skill)
1547	{	1376	if (object *tmp = pl->find_skill (spell->skill))
1548	for (i = 1; i < NUM_SKILLS; i++)
1549	if (!strcmp (spell->skill, skill_names[i]))
1550	{
1551	skill = i + CS_STAT_SKILLINFO;	1377	skill = tmp->subtype + CS_STAT_SKILLINFO;
1552	break;
1553	}
1554	}
1555		1378
1556	// spells better have a face	1379	// spells better have a face
1557	if (!spell->face)	1380	if (!spell->face)
1558	{	1381	{
1559	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);
1560	spell->face = face_find ("burnout.x11", blank_face);	1383	spell->face = face_find ("burnout.x11", blank_face);
1561	}	1384	}
		1385
		1386	pl->ns->send_face (spell->face);
1562		1387
1563	/* send the current values */	1388	/* send the current values */
1564	sl << uint32 (spell->count)	1389	sl << uint32 (spell->count)
1565	<< uint16 (spell->level)	1390	<< uint16 (spell->level)
1566	<< uint16 (spell->casting_time)	1391	<< uint16 (spell->casting_time)
1567	<< uint16 (spell->last_sp)	1392	<< uint16 (spell->cached_sp)
1568	<< uint16 (spell->last_grace)	1393	<< uint16 (spell->cached_grace)
1569	<< uint16 (spell->last_eat)	1394	<< uint16 (spell->cached_eat)
1570	<< uint8 (skill)	1395	<< uint8 (skill)
1571	<< uint32 (spell->path_attuned)	1396	<< uint32 (spell->path_attuned)
1572	<< uint32 (spell->face)	1397	<< uint32 (spell->face)
1573	<< data8 (spell->name)	1398	<< data8 (spell->name)
1574	<< data16 (spell->msg);	1399	<< data16 (spell->msg);
…		…
1602	* 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
1603	* 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,
1604	* 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,
1605	* 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
1606	*/	1431	*/
		1432	if (spell->type != SPELL)
		1433	continue;
		1434
1607	/* Seeing crashes by overflowed buffers. Quick arithemetic seems	1435	/* Seeing crashes by overflowed buffers. Quick arithemetic seems
1608	* 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
1609	* 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
1610	* like it will fix this	1438	* like it will fix this
1611	*/	1439	*/
1612	if (spell->type != SPELL)
1613	continue;
1614
1615	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))))
1616	{	1441	{
		1442	pl->ns->flush_fx ();
1617	pl->ns->send_packet (sl);	1443	pl->ns->send_packet (sl);
1618		1444
1619	sl.reset ();	1445	sl.reset ();
1620	sl << "addspell ";	1446	sl << "addspell ";
1621	}	1447	}
…		…
1629	return;	1455	return;
1630	}	1456	}
1631	else	1457	else
1632	append_spell (pl, sl, spell);	1458	append_spell (pl, sl, spell);
1633		1459
1634	if (sl.length () >= MAXSOCKBUF)	1460	if (sl.length () > MAXSOCKBUF)
1635	{	1461	{
1636	LOG (llevError, "Buffer overflow in esrv_add_spells!\n");	1462	LOG (llevError, "Buffer overflow in esrv_add_spells!\n");
1637	fatal (0);	1463	fatal (0);
1638	}	1464	}
1639		1465
1640	/* finally, we can send the packet */	1466	/* finally, we can send the packet */
		1467	pl->ns->flush_fx ();
1641	pl->ns->send_packet (sl);	1468	pl->ns->send_packet (sl);
1642	}	1469	}
1643		1470
		1471	//-GPL
		1472

Diff Legend

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