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.97 by root, Thu May 17 14:14:56 2007 UTC vs.
Revision 1.152 by root, Tue Oct 20 07:18:11 2009 UTC

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

Diff Legend

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