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.92 by root, Mon Apr 30 17:39:59 2007 UTC vs.
Revision 1.150 by root, Mon Oct 12 14:00:59 2009 UTC

1	/*	1	/*
2	* CrossFire, A Multiplayer game for X-windows	2	* This file is part of Deliantra, the Roguelike Realtime MMORPG.
3	*	3	*
4	* Copyright (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team	4	* Copyright (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
5	* Copyright (C) 2001 Mark Wedel	5	* Copyright (©) 2001,2007 Mark Wedel
6	* Copyright (C) 1992 Frank Tore Johansen	6	* Copyright (©) 1992,2007 Frank Tore Johansen
7	*	7	*
8	* This program is free software; you can redistribute it and/or modify	8	* Deliantra is free software: you can redistribute it and/or modify it under
9	* it under the terms of the GNU General Public License as published by	9	* the terms of the Affero GNU General Public License as published by the
10	* the Free Software Foundation; either version 2 of the License, or	10	* Free Software Foundation, either version 3 of the License, or (at your
11	* (at your option) any later version.	11	* option) any later version.
12	*	12	*
13	* This program is distributed in the hope that it will be useful,	13	* This program is distributed in the hope that it will be useful,
14	* but WITHOUT ANY WARRANTY; without even the implied warranty of	14	* but WITHOUT ANY WARRANTY; without even the implied warranty of
15	* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the	15	* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16	* GNU General Public License for more details.	16	* GNU General Public License for more details.
17	*	17	*
18	* You should have received a copy of the GNU General Public License	18	* You should have received a copy of the Affero GNU General Public License
19	* along with this program; if not, write to the Free Software	19	* and the GNU General Public License along with this program. If not, see
20	* Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.	20	* <http://www.gnu.org/licenses/>.
21	*	21	*
22	* The author can be reached via e-mail to <crossfire@schmorp.de>	22	* The authors can be reached via e-mail to <support@deliantra.net>
23	*/	23	*/
24		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
…		…
473		464
474	ns->send_packet (cmdback);	465	ns->send_packet (cmdback);
475	}	466	}
476		467
477	/**	468	/**
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,	469	* This handles the general commands from the client (ie, north, fire, cast,
500	* etc.)	470	* etc.)
501	*/	471	*/
502	void	472	void
503	PlayerCmd (char *buf, int len, player *pl)	473	PlayerCmd (char *buf, int len, player *pl)
…		…
524	* commands.	494	* commands.
525	*/	495	*/
526	pl->count = 0;	496	pl->count = 0;
527	}	497	}
528		498
529
530	/**	499	/**
531	* This handles the general commands from the client (ie, north, fire, cast,	500	* 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	501	* 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	502	* 'ncom' method which gives more information back to the client so it
534	* can throttle.	503	* can throttle.
…		…
536	void	505	void
537	NewPlayerCmd (char *buf, int len, player *pl)	506	NewPlayerCmd (char *buf, int len, player *pl)
538	{	507	{
539	if (len <= 6)	508	if (len <= 6)
540	{	509	{
541	LOG (llevDebug, "Corrupt ncom command <%s> not long enough - discarding\n", buf);	510	LOG (llevDebug, "%s: corrupt ncom command <%s>: not long enough (%d) - discarding\n", pl->ns->host, buf, len);
542	return;	511	return;
543	}	512	}
544		513
545	uint16 cmdid = net_uint16 ((uint8 *)buf);	514	uint16 cmdid = net_uint16 ((uint8 *)buf);
546	sint32 repeat = net_sint32 ((uint8 *)buf + 2);	515	sint32 repeat = net_sint32 ((uint8 *)buf + 2);
…		…
684	* syntax is: move (to) (tag) (nrof)	653	* syntax is: move (to) (tag) (nrof)
685	*/	654	*/
686	void	655	void
687	MoveCmd (char *buf, int len, player *pl)	656	MoveCmd (char *buf, int len, player *pl)
688	{	657	{
689	int vals[3], i;	658	int to, tag, nrof;
690		659
691	/* A little funky here. We only cycle for 2 records, because	660	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	{	661	{
698	vals[i] = atoi (buf);
699
700	if (!(buf = strchr (buf, ' ')))
701	{
702	LOG (llevError, "Incomplete move command: %s\n", buf);	662	LOG (llevError, "Incomplete move command: %s\n", buf);
703	return;	663	return;
704	}
705
706	buf++;
707	}	664	}
708		665
709	vals[2] = atoi (buf);	666	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	}	667	}
714		668
715	/******************************************************************************	669	/******************************************************************************
716	*	670	*
717	* Start of commands the server sends to the client.	671	* Start of commands the server sends to the client.
…		…
730		684
731	/**	685	/**
732	* Get player's current range attack in obuf.	686	* Get player's current range attack in obuf.
733	*/	687	*/
734	static void	688	static void
735	rangetostring (object *ob, char *obuf)	689	rangetostring (player *pl, char *obuf)
736	{	690	{
737	dynbuf_text buf;	691	dynbuf_text &buf = msg_dynbuf; buf.clear ();
738		692
739	player *pl = ob->contr;
740
741	if (pl->ranged_skill)	693	if (pl->ranged_ob)
742	buf << " Range: "	694	buf << " Range" << (pl->ob->current_weapon == pl->ranged_ob ? "*" : "") << ": " << pl->ranged_ob->name;
743	<< (pl->ranged_ob
744	? pl->ranged_ob->name
745	: pl->ranged_skill->name);
746		695
747	if (pl->combat_skill)	696	if (pl->combat_ob)
748	buf << " Combat: "	697	buf << " Combat" << (pl->ob->current_weapon == pl->combat_ob ? "*" : "") << ": " << pl->combat_ob->name;
749	<< (pl->combat_ob
750	? pl->combat_ob->name
751	: pl->combat_skill->name);
752		698
		699	#if 0
		700	//TODO: remove this when slot system is working, this is only for debugging
		701	if (pl->ob->chosen_skill)
		702	buf << " Skill*: " << pl->ob->chosen_skill->name;
		703	#endif
		704
		705	//TODO: maybe golem should become the current_weapon, quite simply?
753	if (pl->golem)	706	if (pl->golem)
754	buf << " Golem: " << pl->golem->name;	707	buf << " Golem*: " << pl->golem->name;
755		708
756	if (buf.empty ())	709	buf << '\0';
757	*obuf = 0;	710	buf.linearise (obuf);
758	else
759	memcpy (obuf, buf.linearise () + 1, buf.size () - 1);
760	}	711	}
761		712
762	#define AddIfInt64(Old,New,Type) if (Old != New) {\	713	#define AddIfInt64(Old,New,Type) if (Old != New) {\
763	Old = New; \	714	Old = New; \
764	sl << uint8 (Type) << uint64 (New); \	715	sl << uint8 (Type) << uint64 (New); \
…		…
772	#define AddIfShort(Old,New,Type) if (Old != New) {\	723	#define AddIfShort(Old,New,Type) if (Old != New) {\
773	Old = New; \	724	Old = New; \
774	sl << uint8 (Type) << uint16 (New); \	725	sl << uint8 (Type) << uint16 (New); \
775	}	726	}
776		727
777	#define AddIfFloat(Old,New,Type) if (Old != New) {\	728	#define AddIfFloat(Old,New,Type,mult) if (Old != New) {\
778	Old = New; \	729	Old = New; \
779	sl << uint8 (Type) << uint32 (New*FLOAT_MULTI); \	730	sl << uint8 (Type) << uint32 (New*FLOAT_MULTI*mult); \
780	}	731	}
781		732
782	#define AddIfString(Old,New,Type) if (Old == NULL || strcmp(Old,New)) {\	733	#define AddIfString(Old,New,Type) if (Old == NULL || strcmp(Old,New)) {\
783	free(Old); Old = strdup (New);\	734	free(Old); Old = strdup (New);\
784	sl << uint8 (Type) << data8 (New); \	735	sl << uint8 (Type) << data8 (New); \
…		…
798		749
799	client *ns = pl->ns;	750	client *ns = pl->ns;
800	if (!ns)	751	if (!ns)
801	return;	752	return;
802		753
803	object *ob = pl->ob;	754	object *ob = pl->observe;
804	if (!ob)	755	if (!ob)
805	return;	756	return;
		757
		758	player *opl = ob->contr ? static_cast<player *>(ob->contr) : pl;
806		759
807	packet sl ("stats");	760	packet sl ("stats");
808		761
809	AddIfShort (ns->last_stats.hp, ob->stats.hp, CS_STAT_HP);	762	AddIfShort (ns->last_stats.hp, ob->stats.hp, CS_STAT_HP);
810	AddIfShort (ns->last_stats.maxhp, ob->stats.maxhp, CS_STAT_MAXHP);	763	AddIfShort (ns->last_stats.maxhp, ob->stats.maxhp, CS_STAT_MAXHP);
…		…
819	AddIfShort (ns->last_stats.Wis, ob->stats.Wis, CS_STAT_WIS);	772	AddIfShort (ns->last_stats.Wis, ob->stats.Wis, CS_STAT_WIS);
820	AddIfShort (ns->last_stats.Pow, ob->stats.Pow, CS_STAT_POW);	773	AddIfShort (ns->last_stats.Pow, ob->stats.Pow, CS_STAT_POW);
821	AddIfShort (ns->last_stats.Cha, ob->stats.Cha, CS_STAT_CHA);	774	AddIfShort (ns->last_stats.Cha, ob->stats.Cha, CS_STAT_CHA);
822		775
823	for (int s = 0; s < NUM_SKILLS; s++)	776	for (int s = 0; s < NUM_SKILLS; s++)
824	if (object *skill = pl->last_skill_ob[s])	777	if (object *skill = opl->last_skill_ob [s])
825	if (skill->stats.exp != ns->last_skill_exp [s])	778	if (skill->stats.exp != ns->last_skill_exp [s])
826	{	779	{
827	ns->last_skill_exp [s] = skill->stats.exp;	780	ns->last_skill_exp [s] = skill->stats.exp;
828		781
829	/* Always send along the level if exp changes. This is only	782	/* Always send along the level if exp changes. This is only
…		…
837	AddIfInt64 (ns->last_stats.exp, ob->stats.exp, CS_STAT_EXP64);	790	AddIfInt64 (ns->last_stats.exp, ob->stats.exp, CS_STAT_EXP64);
838	AddIfShort (ns->last_level, ob->level, CS_STAT_LEVEL);	791	AddIfShort (ns->last_level, ob->level, CS_STAT_LEVEL);
839	AddIfShort (ns->last_stats.wc, ob->stats.wc, CS_STAT_WC);	792	AddIfShort (ns->last_stats.wc, ob->stats.wc, CS_STAT_WC);
840	AddIfShort (ns->last_stats.ac, ob->stats.ac, CS_STAT_AC);	793	AddIfShort (ns->last_stats.ac, ob->stats.ac, CS_STAT_AC);
841	AddIfShort (ns->last_stats.dam, ob->stats.dam, CS_STAT_DAM);	794	AddIfShort (ns->last_stats.dam, ob->stats.dam, CS_STAT_DAM);
842	AddIfFloat (ns->last_speed, ob->speed, CS_STAT_SPEED);	795	AddIfFloat (ns->last_speed, ob->speed, CS_STAT_SPEED, 1.f/TICK);
843	AddIfShort (ns->last_stats.food, ob->stats.food, CS_STAT_FOOD);	796	AddIfShort (ns->last_stats.food, ob->stats.food, CS_STAT_FOOD);
844	AddIfFloat (ns->last_weapon_sp, pl->weapon_sp, CS_STAT_WEAP_SP);	797	AddIfFloat (ns->last_weapon_sp, pl->weapon_sp, CS_STAT_WEAP_SP, 1.f/TICK);
845	AddIfInt (ns->last_weight_limit, weight_limit[ob->stats.Str], CS_STAT_WEIGHT_LIM);	798	AddIfInt (ns->last_weight_limit, weight_limit[ob->stats.Str], CS_STAT_WEIGHT_LIM);
846		799
847	flags = 0;	800	flags = 0;
848		801
849	if (pl->fire_on)	802	if (opl->fire_on)
850	flags |= SF_FIREON;	803	flags |= SF_FIREON;
851		804
852	if (pl->run_on)	805	if (opl->run_on)
853	flags |= SF_RUNON;	806	flags |= SF_RUNON;
854		807
855	AddIfShort (ns->last_flags, flags, CS_STAT_FLAGS);	808	AddIfShort (ns->last_flags, flags, CS_STAT_FLAGS);
856		809
857	if (ns->sc_version < 1025)	810	if (ns->sc_version < 1025)
…		…
871	AddIfInt (ns->last_path_attuned, ob->path_attuned, CS_STAT_SPELL_ATTUNE);	824	AddIfInt (ns->last_path_attuned, ob->path_attuned, CS_STAT_SPELL_ATTUNE);
872	AddIfInt (ns->last_path_repelled, ob->path_repelled, CS_STAT_SPELL_REPEL);	825	AddIfInt (ns->last_path_repelled, ob->path_repelled, CS_STAT_SPELL_REPEL);
873	AddIfInt (ns->last_path_denied, ob->path_denied, CS_STAT_SPELL_DENY);	826	AddIfInt (ns->last_path_denied, ob->path_denied, CS_STAT_SPELL_DENY);
874	}	827	}
875		828
876	rangetostring (ob, buf); /* we want use the new fire & run system in new client */	829	rangetostring (opl, buf); /* we want use the new fire & run system in new client */
877	AddIfString (ns->stats.range, buf, CS_STAT_RANGE);	830	AddIfString (ns->stats.range, buf, CS_STAT_RANGE);
878	set_title (ob, buf);	831	set_title (ob, buf);
879	AddIfString (ns->stats.title, buf, CS_STAT_TITLE);	832	AddIfString (ns->stats.title, buf, CS_STAT_TITLE);
880		833
881	/* Only send it away if we have some actual data */	834	/* Only send it away if we have some actual data */
…		…
885		838
886	/**	839	/**
887	* Tells the client that here is a player it should start using.	840	* Tells the client that here is a player it should start using.
888	*/	841	*/
889	void	842	void
890	esrv_new_player (player *pl, uint32 weight)	843	esrv_new_player (player *pl)
891	{	844	{
		845	sint32 weight = pl->ob->client_weight ();
		846
892	packet sl ("player");	847	packet sl ("player");
893		848
894	sl << uint32 (pl->ob->count)	849	sl << uint32 (pl->ob->count)
895	<< uint32 (weight)	850	<< uint32 (weight)
896	<< uint32 (pl->ob->face)	851	<< uint32 (pl->ob->face)
897	<< data8 (pl->ob->name);	852	<< data8 (pl->ob->name);
898		853
899	pl->ns->last_weight = weight;	854	pl->ns->last_weight = weight;
900	pl->ns->send_packet (sl);	855	pl->ns->send_packet (sl);
901	SET_FLAG (pl->ob, FLAG_CLIENT_SENT);
902	}	856	}
903		857
904	/******************************************************************************	858	/******************************************************************************
905	*	859	*
906	* Start of map related commands.	860	* Start of map related commands.
…		…
963		917
964	if (!ns.faces_sent[face_num])	918	if (!ns.faces_sent[face_num])
965	if (ob)	919	if (ob)
966	ns.send_faces (ob);	920	ns.send_faces (ob);
967	else	921	else
968	ns.send_face (face_num);	922	ns.send_face (face_num, 10);
969		923
970	sl << uint16 (face_num);	924	sl << uint16 (face_num);
971	return 1;	925	return 1;
972	}	926	}
973		927
974	/* Nothing changed */	928	/* Nothing changed */
975	return 0;	929	return 0;
976	}
977
978	/**
979	* Returns the size of a data for a map square as returned by
980	* mapextended. There are CLIENTMAPX*CLIENTMAPY*LAYERS entries
981	* available.
982	*/
983	int
984	getExtendedMapInfoSize (client * ns)
985	{
986	int result = 0;
987
988	if (ns->ext_mapinfos)
989	{
990	if (ns->EMI_smooth)
991	result += 1; /*One byte for smoothlevel */
992	}
993
994	return result;
995	}	930	}
996		931
997	// prefetch (and touch) all maps within a specific distancd	932	// prefetch (and touch) all maps within a specific distancd
998	static void	933	static void
999	prefetch_surrounding_maps (maptile *map, int distance)	934	prefetch_surrounding_maps (maptile *map, int distance)
1000	{	935	{
1001	map->last_access = runtime;	936	map->touch ();
1002		937
1003	if (--distance)	938	if (--distance)
1004	for (int dir = 4; --dir; )	939	for (int dir = 4; --dir; )
1005	if (const shstr &path = map->tile_path [dir])	940	if (const shstr &path = map->tile_path [dir])
1006	if (maptile *&neigh = map->tile_map [dir])	941	if (maptile *&neigh = map->tile_map [dir])
…		…
1015	{	950	{
1016	prefetch_surrounding_maps (op->map, 3);	951	prefetch_surrounding_maps (op->map, 3);
1017	}	952	}
1018		953
1019	/**	954	/**
1020	* This function uses the new map1 protocol command to send the map	955	* Draws client map.
1021	* to the client. It is necessary because the old map command supports
1022	* a maximum map size of 15x15.
1023	* This function is much simpler than the old one. This is because
1024	* the old function optimized to send as few face identifiers as possible,
1025	* at the expense of sending more coordinate location (coordinates were
1026	* only 1 byte, faces 2 bytes, so this was a worthwhile savings). Since
1027	* we need 2 bytes for coordinates and 2 bytes for faces, such a trade off
1028	* maps no sense. Instead, we actually really only use 12 bits for coordinates,
1029	* and use the other 4 bits for other informatiion. For full documentation
1030	* of what we send, see the doc/Protocol file.
1031	* I will describe internally what we do:
1032	* the ns->lastmap shows how the map last looked when sent to the client.
1033	* in the lastmap structure, there is a cells array, which is set to the
1034	* maximum viewable size (As set in config.h).
1035	* in the cells, there are faces and a count value.
1036	* we use the count value to hold the darkness value. If -1, then this space
1037	* is not viewable.
1038	* we use faces[0] faces[1] faces[2] to hold what the three layers
1039	* look like.
1040	*/	956	*/
1041	void	957	void
1042	draw_client_map1 (object *pl)	958	draw_client_map (player *pl)
1043	{	959	{
1044	int x, y, ax, ay, startlen, max_x, max_y, oldlen;	960	object *ob = pl->observe;
1045	sint16 nx, ny;
1046	int estartlen, eoldlen;
1047	uint8 eentrysize;
1048	uint16 ewhatstart, ewhatflag;
1049	uint8 extendedinfos;
1050	maptile *m;
1051
1052	client &socket = *pl->contr->ns;
1053
1054	if (!pl->active)	961	if (!ob->active)
1055	return;	962	return;
1056
1057	check_map_change (pl->contr);
1058	prefetch_surrounding_maps (pl);
1059
1060	packet sl (socket.mapmode == Map1Cmd ? "map1" : "map1a");
1061	packet esl;
1062
1063	startlen = sl.length ();
1064
1065	/*Extendedmapinfo structure initialisation */
1066	if (socket.ext_mapinfos)
1067	{
1068	extendedinfos = EMI_NOREDRAW;
1069
1070	if (socket.EMI_smooth)
1071	extendedinfos |= EMI_SMOOTH;
1072
1073	ewhatstart = esl.length ();
1074	ewhatflag = extendedinfos; /*The EMI_NOREDRAW bit
1075	could need to be taken away */
1076	eentrysize = getExtendedMapInfoSize (&socket);
1077	esl << "mapextended "
1078	<< uint8 (extendedinfos)
1079	<< uint8 (eentrysize);
1080
1081	estartlen = esl.length ();
1082	}
1083
1084	/* x,y are the real map locations. ax, ay are viewport relative
1085	* locations.
1086	*/
1087	ay = 0;
1088
1089	/* We could do this logic as conditionals in the if statement,
1090	* but that started to get a bit messy to look at.
1091	*/
1092	max_x = pl->x + (socket.mapx + 1) / 2;
1093	max_y = pl->y + (socket.mapy + 1) / 2;
1094
1095	maptile *plmap = pl->map;
1096
1097	for (y = pl->y - socket.mapy / 2; y < max_y; y++, ay++)
1098	{
1099	ax = 0;
1100	for (x = pl->x - socket.mapx / 2; x < max_x; x++, ax++)
1101	{
1102	int emask, mask;
1103	emask = mask = (ax & 0x3f) << 10 | (ay & 0x3f) << 4;
1104
1105	MapCell &lastcell = socket.lastmap.cells[ax][ay];
1106
1107	/* If the coordinates are not valid, or it is too dark to see,
1108	* we tell the client as such
1109	*/
1110	nx = x;
1111	ny = y;
1112	m = get_map_from_coord (plmap, &nx, &ny);
1113
1114	if (!m)
1115	{
1116	/* space is out of map. Update space and clear values
1117	* if this hasn't already been done. If the space is out
1118	* of the map, it shouldn't have a head
1119	*/
1120	if (lastcell.count != -1)
1121	{
1122	sl << uint16 (mask);
1123	map_clearcell (&lastcell, -1);
1124	}
1125
1126	continue;
1127	}
1128
1129	m->touch ();
1130
1131	int d = pl->contr->blocked_los[ax][ay];
1132
1133	if (d > 3)
1134	{
1135
1136	int need_send = 0, count;
1137
1138	/* This block deals with spaces that are not visible for whatever
1139	* reason. Still may need to send the head for this space.
1140	*/
1141
1142	oldlen = sl.length ();
1143
1144	sl << uint16 (mask);
1145
1146	if (lastcell.count != -1)
1147	need_send = 1;
1148
1149	count = -1;
1150
1151	/* properly clear a previously sent big face */
1152	if (lastcell.faces[0] || lastcell.faces[1] || lastcell.faces[2]
1153	|| lastcell.stat_hp || lastcell.flags || lastcell.player)
1154	need_send = 1;
1155
1156	map_clearcell (&lastcell, count);
1157
1158	if ((mask & 0xf) || need_send)
1159	sl[oldlen + 1] = mask & 0xff;
1160	else
1161	sl.reset (oldlen);
1162	}
1163	else
1164	{
1165	/* In this block, the space is visible.
1166	*/
1167
1168	/* Rather than try to figure out what everything that we might
1169	* need to send is, then form the packet after that,
1170	* we presume that we will in fact form a packet, and update
1171	* the bits by what we do actually send. If we send nothing,
1172	* we just back out sl.length () to the old value, and no harm
1173	* is done.
1174	* I think this is simpler than doing a bunch of checks to see
1175	* what if anything we need to send, setting the bits, then
1176	* doing those checks again to add the real data.
1177	*/
1178	oldlen = sl.length ();
1179	eoldlen = esl.length ();
1180
1181	sl << uint16 (mask);
1182
1183	unsigned char dummy;
1184	unsigned char *last_ext = &dummy;
1185
1186	/* Darkness changed */
1187	if (lastcell.count != d && socket.darkness)
1188	{
1189	mask |= 0x8;
1190
1191	if (socket.extmap)
1192	{
1193	*last_ext |= 0x80;
1194	last_ext = &sl[sl.length ()];
1195	sl << uint8 (d);
1196	}
1197	else
1198	sl << uint8 (255 - 64 * d);
1199	}
1200
1201	lastcell.count = d;
1202
1203	mapspace &ms = m->at (nx, ny);
1204
1205	if (socket.extmap)
1206	{
1207	uint8 stat_hp = 0;
1208	uint8 stat_width = 0;
1209	uint8 flags = 0;
1210	tag_t player = 0;
1211
1212	// send hp information, if applicable
1213	if (object *op = ms.faces_obj [0])
1214	{
1215	if (op->head || op->invisible)
1216	; // do not show
1217	else if (op->type == PLAYER
1218	|| QUERY_FLAG (op, FLAG_MONSTER) || QUERY_FLAG (op, FLAG_ALIVE) || QUERY_FLAG (op, FLAG_GENERATOR))
1219	{
1220	if (op->stats.maxhp > 0 && (unsigned) op->stats.maxhp > (unsigned) op->stats.hp)
1221	{
1222	stat_hp = 255 - (op->stats.hp * 255 + 254) / op->stats.maxhp;
1223	stat_width = op->arch->tail_x;
1224	}
1225	}
1226
1227	if (op->msg && op->msg[0] == '@')
1228	flags |= 1;
1229
1230	if (op->type == PLAYER && op != pl)
1231	player = op->count;
1232	}
1233
1234	if (lastcell.stat_hp != stat_hp)
1235	{
1236	lastcell.stat_hp = stat_hp;
1237
1238	mask |= 0x8;
1239	*last_ext |= 0x80;
1240	last_ext = &sl[sl.length ()];
1241
1242	sl << uint8 (5) << uint8 (stat_hp);
1243
1244	if (stat_width > 1)
1245	{
1246	*last_ext |= 0x80;
1247	last_ext = &sl[sl.length ()];
1248
1249	sl << uint8 (6) << uint8 (stat_width);
1250	}
1251	}
1252
1253	if (lastcell.player != player)
1254	{
1255	lastcell.player = player;
1256
1257	mask |= 0x8;
1258	*last_ext |= 0x80;
1259	last_ext = &sl[sl.length ()];
1260
1261	sl << uint8 (0x47) << uint8 (4) << (uint32)player;
1262	}
1263
1264	if (lastcell.flags != flags)
1265	{
1266	lastcell.flags = flags;
1267
1268	mask |= 0x8;
1269	*last_ext |= 0x80;
1270	last_ext = &sl[sl.length ()];
1271
1272	sl << uint8 (8) << uint8 (flags);
1273	}
1274	}
1275
1276	/* Floor face */
1277	if (update_space (sl, socket, ms, lastcell, 2))
1278	mask |= 0x4;
1279
1280	/* Middle face */
1281	if (update_space (sl, socket, ms, lastcell, 1))
1282	mask |= 0x2;
1283
1284	if (ms.player () == pl
1285	&& (pl->invisible & (pl->invisible < 50 ? 1 : 7)))
1286	{
1287	// force player to be visible to himself if invisible
1288	if (lastcell.faces[0] != pl->face)
1289	{
1290	lastcell.faces[0] = pl->face;
1291
1292	mask |= 0x1;
1293	sl << uint16 (pl->face);
1294
1295	socket.send_faces (pl);
1296	}
1297	}
1298	/* Top face */
1299	else if (update_space (sl, socket, ms, lastcell, 0))
1300	mask |= 0x1;
1301
1302
1303	/* Check to see if we are in fact sending anything for this
1304	* space by checking the mask. If so, update the mask.
1305	* if not, reset the len to that from before adding the mask
1306	* value, so we don't send those bits.
1307	*/
1308	if (mask & 0xf)
1309	sl[oldlen + 1] = mask & 0xff;
1310	else
1311	sl.reset (oldlen);
1312
1313	if (socket.ext_mapinfos)
1314	esl << uint16 (emask);
1315
1316	if (socket.EMI_smooth)
1317	{
1318	for (int layer = 2+1; layer--; )
1319	{
1320	object *ob = ms.faces_obj [layer];
1321
1322	// If there is no object for this space, or if the face for the object
1323	// is the blank face, set the smoothlevel to zero.
1324	int smoothlevel = ob && ob->face != blank_face ? ob->smoothlevel : 0;
1325
1326	// We've gotten what face we want to use for the object. Now see if
1327	// if it has changed since we last sent it to the client.
1328	if (lastcell.smooth[layer] != smoothlevel)
1329	{
1330	lastcell.smooth[layer] = smoothlevel;
1331	esl << uint8 (smoothlevel);
1332	emask |= 1 << layer;
1333	}
1334	}
1335
1336	if (emask & 0xf)
1337	esl[eoldlen + 1] = emask & 0xff;
1338	else
1339	esl.reset (eoldlen);
1340	}
1341	} /* else this is a viewable space */
1342	} /* for x loop */
1343	} /* for y loop */
1344
1345	socket.flush_fx ();
1346
1347	/* Verify that we in fact do need to send this */
1348	if (socket.ext_mapinfos)
1349	{
1350	if (!(sl.length () > startlen || socket.sent_scroll))
1351	{
1352	/* No map data will follow, so don't say the client
1353	* it doesn't need draw!
1354	*/
1355	ewhatflag &= ~EMI_NOREDRAW;
1356	esl[ewhatstart + 1] = ewhatflag & 0xff;
1357	}
1358
1359	if (esl.length () > estartlen)
1360	socket.send_packet (esl);
1361	}
1362
1363	if (sl.length () > startlen || socket.sent_scroll)
1364	{
1365	socket.send_packet (sl);
1366	socket.sent_scroll = 0;
1367	}
1368	}
1369
1370	/**
1371	* Draws client map.
1372	*/
1373	void
1374	draw_client_map (object *pl)
1375	{
1376	int i, j;
1377	sint16 ax, ay; /* ax and ay goes from 0 to max-size of arrays */
1378	int mflags;
1379	struct Map newmap;
1380	maptile *m, *pm;
1381
1382	if (pl->type != PLAYER)
1383	{
1384	LOG (llevError, "draw_client_map called with non player/non eric-server\n");
1385	return;
1386	}
1387
1388	pm = pl->map;
1389		963
1390	/* If player is just joining the game, he isn't here yet, so the map	964	/* If player is just joining the game, he isn't here yet, so the map
1391	* can get swapped out. If so, don't try to send them a map. All will	965	* can get swapped out. If so, don't try to send them a map. All will
1392	* be OK once they really log in.	966	* be OK once they really log in.
1393	*/	967	*/
1394	if (pm == NULL || pm->in_memory != MAP_IN_MEMORY)	968	if (!ob->map || ob->map->in_memory != MAP_ACTIVE)
1395	return;	969	return;
1396		970
1397	memset (&newmap, 0, sizeof (struct Map));	971	int startlen, oldlen;
1398		972
1399	for (j = (pl->y - pl->contr->ns->mapy / 2); j < (pl->y + (pl->contr->ns->mapy + 1) / 2); j++)	973	check_map_change (pl);
1400	for (i = (pl->x - pl->contr->ns->mapx / 2); i < (pl->x + (pl->contr->ns->mapx + 1) / 2); i++)	974	prefetch_surrounding_maps (pl->ob);
		975
		976	/* do LOS after calls to update_position */
		977	/* unfortunately, we need to udpate los when observing, currently */
		978	if (pl->do_los || pl->observe != pl->ob)
		979	{
		980	pl->do_los = 0;
		981	pl->update_los ();
		982	}
		983
		984	/**
		985	* This function uses the new map1 protocol command to send the map
		986	* to the client. It is necessary because the old map command supports
		987	* a maximum map size of 15x15.
		988	* This function is much simpler than the old one. This is because
		989	* the old function optimized to send as few face identifiers as possible,
		990	* at the expense of sending more coordinate location (coordinates were
		991	* only 1 byte, faces 2 bytes, so this was a worthwhile savings). Since
		992	* we need 2 bytes for coordinates and 2 bytes for faces, such a trade off
		993	* maps no sense. Instead, we actually really only use 12 bits for coordinates,
		994	* and use the other 4 bits for other informatiion. For full documentation
		995	* of what we send, see the doc/Protocol file.
		996	* I will describe internally what we do:
		997	* the ns->lastmap shows how the map last looked when sent to the client.
		998	* in the lastmap structure, there is a cells array, which is set to the
		999	* maximum viewable size (As set in config.h).
		1000	* in the cells, there are faces and a count value.
		1001	* we use the count value to hold the darkness value. If -1, then this space
		1002	* is not viewable.
		1003	* we use faces[0] faces[1] faces[2] to hold what the three layers
		1004	* look like.
		1005	*/
		1006
		1007	client &socket = *pl->ns;
		1008
		1009	packet sl (socket.mapmode == Map1Cmd ? "map1" : "map1a");
		1010
		1011	startlen = sl.length ();
		1012
		1013	int hx = socket.mapx / 2;
		1014	int hy = socket.mapy / 2;
		1015
		1016	ordered_mapwalk_begin (ob, -hx, -hy, hx, hy)
		1017	int ax = dx + hx;
		1018	int ay = dy + hy;
		1019
		1020	int mask = (ax << 10) | (ay << 4);
		1021	MapCell &lastcell = socket.lastmap.cells[ax][ay];
		1022
		1023	/* If the coordinates are not valid, or it is too dark to see,
		1024	* we tell the client as such
		1025	*/
		1026	if (!m)
1401	{	1027	{
1402	ax = i;	1028	/* space is out of map. Update space and clear values
1403	ay = j;	1029	* if this hasn't already been done. If the space is out
1404	m = pm;	1030	* of the map, it shouldn't have a head.
1405	mflags = get_map_flags (m, &m, ax, ay, &ax, &ay);
1406
1407	if (mflags & P_OUT_OF_MAP)
1408	continue;
1409
1410	/* If a map is visible to the player, we don't want to swap it out
1411	* just to reload it. This should really call something like
1412	* swap_map, but this is much more efficient and 'good enough'
1413	*/	1031	*/
1414	if (mflags & P_NEW_MAP)	1032	if (lastcell.count != -1)
1415	m->timeout = 50;	1033	{
		1034	sl << uint16 (mask);
		1035	map_clearcell (&lastcell, -1);
		1036	}
		1037
		1038	continue;
1416	}	1039	}
		1040
		1041	int d = pl->blocked_los_uc (dx, dy);
1417		1042
1418	/* do LOS after calls to update_position */	1043	if (d > 3)
1419	if (pl->contr->do_los)
1420	{	1044	{
1421	update_los (pl);	1045	/* This block deals with spaces that are not visible for whatever
1422	pl->contr->do_los = 0;	1046	* reason. Still may need to send the head for this space.
		1047	*/
		1048	if (lastcell.count != -1
		1049	|| lastcell.faces[0]
		1050	|| lastcell.faces[1]
		1051	|| lastcell.faces[2]
		1052	|| lastcell.stat_hp
		1053	|| lastcell.flags
		1054	|| lastcell.player)
		1055	sl << uint16 (mask);
		1056
		1057	/* properly clear a previously sent big face */
		1058	map_clearcell (&lastcell, -1);
1423	}	1059	}
		1060	else
		1061	{
		1062	/* In this block, the space is visible.
		1063	*/
1424		1064
1425	/* Big maps need a different drawing mechanism to work */	1065	/* Rather than try to figure out what everything that we might
1426	draw_client_map1 (pl);	1066	* need to send is, then form the packet after that,
1427	}	1067	* we presume that we will in fact form a packet, and update
		1068	* the bits by what we do actually send. If we send nothing,
		1069	* we just back out sl.length () to the old value, and no harm
		1070	* is done.
		1071	* I think this is simpler than doing a bunch of checks to see
		1072	* what if anything we need to send, setting the bits, then
		1073	* doing those checks again to add the real data.
		1074	*/
		1075	oldlen = sl.length ();
1428		1076
		1077	sl << uint16 (mask);
		1078
		1079	unsigned char dummy;
		1080	unsigned char *last_ext = &dummy;
		1081
		1082	/* Darkness changed */
		1083	if (lastcell.count != d)
		1084	{
		1085	mask |= 0x8;
		1086
		1087	*last_ext |= 0x80;
		1088	last_ext = &sl[sl.length ()];
		1089	sl << uint8 (d);
		1090	}
		1091
		1092	lastcell.count = d;
		1093
		1094	mapspace &ms = m->at (nx, ny);
		1095	ms.update ();
		1096
		1097	// extmap handling
		1098	uint8 stat_hp = 0;
		1099	uint8 stat_width = 0;
		1100	uint8 flags = 0;
		1101	tag_t player = 0;
		1102
		1103	// send hp information, if applicable
		1104	if (object *op = ms.faces_obj [0])
		1105	if (op->is_head () && !op->invisible)
		1106	{
		1107	if (op->stats.maxhp > op->stats.hp
		1108	&& op->stats.maxhp > 0
		1109	&& (op->type == PLAYER
		1110	|| op->type == DOOR // does not work, have maxhp 0
		1111	|| QUERY_FLAG (op, FLAG_MONSTER)
		1112	|| QUERY_FLAG (op, FLAG_ALIVE)
		1113	|| QUERY_FLAG (op, FLAG_GENERATOR)))
		1114	{
		1115	stat_hp = 255 - (op->stats.hp * 255 + 254) / op->stats.maxhp;
		1116	stat_width = op->arch->max_x - op->arch->x; //TODO: should be upper-left edge
		1117	}
		1118
		1119	if (expect_false (op->has_dialogue ()))
		1120	flags |= 1;
		1121
		1122	if (expect_false (op->type == PLAYER))
		1123	player = op == ob ? pl->ob->count
		1124	: op == pl->ob ? ob->count
		1125	: op->count;
		1126	}
		1127
		1128	if (expect_false (lastcell.stat_hp != stat_hp))
		1129	{
		1130	lastcell.stat_hp = stat_hp;
		1131
		1132	mask |= 0x8;
		1133	*last_ext |= 0x80;
		1134	last_ext = &sl[sl.length ()];
		1135
		1136	sl << uint8 (5) << uint8 (stat_hp);
		1137
		1138	if (stat_width > 1)
		1139	{
		1140	*last_ext |= 0x80;
		1141	last_ext = &sl[sl.length ()];
		1142
		1143	sl << uint8 (6) << uint8 (stat_width);
		1144	}
		1145	}
		1146
		1147	if (expect_false (lastcell.player != player))
		1148	{
		1149	lastcell.player = player;
		1150
		1151	mask |= 0x8;
		1152	*last_ext |= 0x80;
		1153	last_ext = &sl[sl.length ()];
		1154
		1155	sl << uint8 (0x47) << uint8 (4) << (uint32)player;
		1156	}
		1157
		1158	if (expect_false (lastcell.flags != flags))
		1159	{
		1160	lastcell.flags = flags;
		1161
		1162	mask |= 0x8;
		1163	*last_ext |= 0x80;
		1164	last_ext = &sl[sl.length ()];
		1165
		1166	sl << uint8 (8) << uint8 (flags);
		1167	}
		1168
		1169	// faces
		1170
		1171	/* Floor face */
		1172	if (update_space (sl, socket, ms, lastcell, 2))
		1173	mask |= 0x4;
		1174
		1175	/* Middle face */
		1176	if (update_space (sl, socket, ms, lastcell, 1))
		1177	mask |= 0x2;
		1178
		1179	if (expect_false (ob->invisible)
		1180	&& ob->invisible & (ob->invisible < 50 ? 1 : 7)
		1181	&& ms.player () == ob)
		1182	{
		1183	// force player to be visible to himself if invisible
		1184	if (lastcell.faces[0] != ob->face)
		1185	{
		1186	lastcell.faces[0] = ob->face;
		1187
		1188	mask |= 0x1;
		1189	sl << uint16 (ob->face);
		1190
		1191	socket.send_faces (ob);
		1192	}
		1193	}
		1194	/* Top face */
		1195	else if (update_space (sl, socket, ms, lastcell, 0))
		1196	mask |= 0x1;
		1197
		1198	/* Check to see if we are in fact sending anything for this
		1199	* space by checking the mask. If so, update the mask.
		1200	* if not, reset the len to that from before adding the mask
		1201	* value, so we don't send those bits.
		1202	*/
		1203	if (mask & 0xf)
		1204	sl[oldlen + 1] = mask & 0xff;
		1205	else
		1206	sl.reset (oldlen);
		1207	} /* else this is a viewable space */
		1208	ordered_mapwalk_end
		1209
		1210	socket.flush_fx ();
		1211
		1212	if (sl.length () > startlen || socket.sent_scroll)
		1213	{
		1214	socket.send_packet (sl);
		1215	socket.sent_scroll = 0;
		1216	}
		1217	}
1429		1218
1430	/*****************************************************************************/	1219	/*****************************************************************************/
1431
1432	/* GROS: The following one is used to allow a plugin to send a generic cmd to*/	1220	/* GROS: The following one is used to allow a plugin to send a generic cmd to*/
1433
1434	/* a player. Of course, the client need to know the command to be able to */	1221	/* a player. Of course, the client need to know the command to be able to */
1435
1436	/* manage it ! */	1222	/* manage it ! */
1437
1438	/*****************************************************************************/	1223	/*****************************************************************************/
1439	void	1224	void
1440	send_plugin_custom_message (object *pl, char *buf)	1225	send_plugin_custom_message (object *pl, char *buf)
1441	{	1226	{
1442	pl->contr->ns->send_packet (buf);	1227	pl->contr->ns->send_packet (buf);
…		…
1451	{	1236	{
1452	packet sl;	1237	packet sl;
1453	sl << "replyinfo skill_info\n";	1238	sl << "replyinfo skill_info\n";
1454		1239
1455	for (int i = 1; i < NUM_SKILLS; i++)	1240	for (int i = 1; i < NUM_SKILLS; i++)
1456	sl.printf ("%d:%s\n", i + CS_STAT_SKILLINFO, &skill_names[i]);	1241	sl.printf ("%d:%s\n", i + CS_STAT_SKILLINFO, &skill_names [i]);
1457		1242
1458	if (sl.length () >= MAXSOCKBUF)	1243	if (sl.length () > MAXSOCKBUF)
1459	{	1244	{
1460	LOG (llevError, "Buffer overflow in send_skill_info!\n");	1245	LOG (llevError, "Buffer overflow in send_skill_info!\n");
1461	fatal (0);	1246	fatal (0);
1462	}	1247	}
1463		1248
…		…
1476	sl << "replyinfo spell_paths\n";	1261	sl << "replyinfo spell_paths\n";
1477		1262
1478	for (int i = 0; i < NRSPELLPATHS; i++)	1263	for (int i = 0; i < NRSPELLPATHS; i++)
1479	sl.printf ("%d:%s\n", 1 << i, spellpathnames[i]);	1264	sl.printf ("%d:%s\n", 1 << i, spellpathnames[i]);
1480		1265
1481	if (sl.length () >= MAXSOCKBUF)	1266	if (sl.length () > MAXSOCKBUF)
1482	{	1267	{
1483	LOG (llevError, "Buffer overflow in send_spell_paths!\n");	1268	LOG (llevError, "Buffer overflow in send_spell_paths!\n");
1484	fatal (0);	1269	fatal (0);
1485	}	1270	}
1486		1271
…		…
1505	if (spell->type == SPELL)	1290	if (spell->type == SPELL)
1506	{	1291	{
1507	int flags = 0;	1292	int flags = 0;
1508		1293
1509	/* check if we need to update it */	1294	/* check if we need to update it */
1510	if (spell->last_sp != SP_level_spellpoint_cost (pl->ob, spell, SPELL_MANA))	1295	if (spell->cached_sp != SP_level_spellpoint_cost (pl->ob, spell, SPELL_MANA))
1511	{	1296	{
1512	spell->last_sp = SP_level_spellpoint_cost (pl->ob, spell, SPELL_MANA);	1297	spell->cached_sp = SP_level_spellpoint_cost (pl->ob, spell, SPELL_MANA);
1513	flags |= UPD_SP_MANA;	1298	flags |= UPD_SP_MANA;
1514	}	1299	}
1515		1300
1516	if (spell->last_grace != SP_level_spellpoint_cost (pl->ob, spell, SPELL_GRACE))	1301	if (spell->cached_grace != SP_level_spellpoint_cost (pl->ob, spell, SPELL_GRACE))
1517	{	1302	{
1518	spell->last_grace = SP_level_spellpoint_cost (pl->ob, spell, SPELL_GRACE);	1303	spell->cached_grace = SP_level_spellpoint_cost (pl->ob, spell, SPELL_GRACE);
1519	flags |= UPD_SP_GRACE;	1304	flags |= UPD_SP_GRACE;
1520	}	1305	}
1521		1306
1522	if (spell->last_eat != spell->stats.dam + SP_level_dam_adjust (pl->ob, spell))	1307	if (spell->cached_eat != spell->stats.dam + SP_level_dam_adjust (pl->ob, spell))
1523	{	1308	{
1524	spell->last_eat = spell->stats.dam + SP_level_dam_adjust (pl->ob, spell);	1309	spell->cached_eat = spell->stats.dam + SP_level_dam_adjust (pl->ob, spell);
1525	flags |= UPD_SP_DAMAGE;	1310	flags |= UPD_SP_DAMAGE;
1526	}	1311	}
1527		1312
1528	if (flags)	1313	if (flags)
1529	{	1314	{
…		…
1531		1316
1532	sl << "updspell "	1317	sl << "updspell "
1533	<< uint8 (flags)	1318	<< uint8 (flags)
1534	<< uint32 (spell->count);	1319	<< uint32 (spell->count);
1535		1320
1536	if (flags & UPD_SP_MANA ) sl << uint16 (spell->last_sp);	1321	if (flags & UPD_SP_MANA ) sl << uint16 (spell->cached_sp);
1537	if (flags & UPD_SP_GRACE ) sl << uint16 (spell->last_grace);	1322	if (flags & UPD_SP_GRACE ) sl << uint16 (spell->cached_grace);
1538	if (flags & UPD_SP_DAMAGE) sl << uint16 (spell->last_eat);	1323	if (flags & UPD_SP_DAMAGE) sl << uint16 (spell->cached_eat);
1539		1324
1540	pl->ns->send_packet (sl);	1325	pl->ns->send_packet (sl);
1541	}	1326	}
1542	}	1327	}
1543	}	1328	}
…		…
1573	LOG (llevError, "item number %d is a spell with no name.\n", spell->count);	1358	LOG (llevError, "item number %d is a spell with no name.\n", spell->count);
1574	return;	1359	return;
1575	}	1360	}
1576		1361
1577	/* store costs and damage in the object struct, to compare to later */	1362	/* store costs and damage in the object struct, to compare to later */
1578	spell->last_sp = SP_level_spellpoint_cost (pl->ob, spell, SPELL_MANA);	1363	spell->cached_sp = SP_level_spellpoint_cost (pl->ob, spell, SPELL_MANA);
1579	spell->last_grace = SP_level_spellpoint_cost (pl->ob, spell, SPELL_GRACE);	1364	spell->cached_grace = SP_level_spellpoint_cost (pl->ob, spell, SPELL_GRACE);
1580	spell->last_eat = spell->stats.dam + SP_level_dam_adjust (pl->ob, spell);	1365	spell->cached_eat = spell->stats.dam + SP_level_dam_adjust (pl->ob, spell);
1581		1366
1582	/* figure out which skill it uses, if it uses one */	1367	/* figure out which skill it uses, if it uses one */
1583	if (spell->skill)	1368	if (spell->skill)
1584	{	1369	if (object *tmp = pl->find_skill (spell->skill))
1585	for (i = 1; i < NUM_SKILLS; i++)
1586	if (!strcmp (spell->skill, skill_names[i]))
1587	{
1588	skill = i + CS_STAT_SKILLINFO;	1370	skill = tmp->subtype + CS_STAT_SKILLINFO;
1589	break;
1590	}
1591	}
1592		1371
1593	// spells better have a face	1372	// spells better have a face
1594	if (!spell->face)	1373	if (!spell->face)
1595	{	1374	{
1596	LOG (llevError, "%s: spell has no face, but face is mandatory.\n", &spell->name);	1375	LOG (llevError, "%s: spell has no face, but face is mandatory.\n", &spell->name);
1597	spell->face = face_find ("burnout.x11", blank_face);	1376	spell->face = face_find ("burnout.x11", blank_face);
1598	}	1377	}
		1378
		1379	pl->ns->send_face (spell->face);
1599		1380
1600	/* send the current values */	1381	/* send the current values */
1601	sl << uint32 (spell->count)	1382	sl << uint32 (spell->count)
1602	<< uint16 (spell->level)	1383	<< uint16 (spell->level)
1603	<< uint16 (spell->casting_time)	1384	<< uint16 (spell->casting_time)
1604	<< uint16 (spell->last_sp)	1385	<< uint16 (spell->cached_sp)
1605	<< uint16 (spell->last_grace)	1386	<< uint16 (spell->cached_grace)
1606	<< uint16 (spell->last_eat)	1387	<< uint16 (spell->cached_eat)
1607	<< uint8 (skill)	1388	<< uint8 (skill)
1608	<< uint32 (spell->path_attuned)	1389	<< uint32 (spell->path_attuned)
1609	<< uint32 (spell->face)	1390	<< uint32 (spell->face)
1610	<< data8 (spell->name)	1391	<< data8 (spell->name)
1611	<< data16 (spell->msg);	1392	<< data16 (spell->msg);
…		…
1639	* bytes and 3 strings (because that is the spec) so we need to	1420	* bytes and 3 strings (because that is the spec) so we need to
1640	* check that the length of those 3 strings, plus the 23 bytes,	1421	* check that the length of those 3 strings, plus the 23 bytes,
1641	* won't take us over the length limit for the socket, if it does,	1422	* won't take us over the length limit for the socket, if it does,
1642	* we need to send what we already have, and restart packet formation	1423	* we need to send what we already have, and restart packet formation
1643	*/	1424	*/
		1425	if (spell->type != SPELL)
		1426	continue;
		1427
1644	/* Seeing crashes by overflowed buffers. Quick arithemetic seems	1428	/* Seeing crashes by overflowed buffers. Quick arithemetic seems
1645	* to show add_spell is 26 bytes + 2 strings. However, the overun	1429	* to show add_spell is 26 bytes + 2 strings. However, the overun
1646	* is hundreds of bytes off, so correcting 22 vs 26 doesn't seem	1430	* is hundreds of bytes off, so correcting 22 vs 26 doesn't seem
1647	* like it will fix this	1431	* like it will fix this
1648	*/	1432	*/
1649	if (spell->type != SPELL)
1650	continue;
1651
1652	if (sl.length () >= (MAXSOCKBUF - (26 + strlen (spell->name) + (spell->msg ? strlen (spell->msg) : 0))))	1433	if (sl.length () > (MAXSOCKBUF - (26 + strlen (spell->name) + (spell->msg ? strlen (spell->msg) : 0))))
1653	{	1434	{
		1435	pl->ns->flush_fx ();
1654	pl->ns->send_packet (sl);	1436	pl->ns->send_packet (sl);
1655		1437
1656	sl.reset ();	1438	sl.reset ();
1657	sl << "addspell ";	1439	sl << "addspell ";
1658	}	1440	}
…		…
1666	return;	1448	return;
1667	}	1449	}
1668	else	1450	else
1669	append_spell (pl, sl, spell);	1451	append_spell (pl, sl, spell);
1670		1452
1671	if (sl.length () >= MAXSOCKBUF)	1453	if (sl.length () > MAXSOCKBUF)
1672	{	1454	{
1673	LOG (llevError, "Buffer overflow in esrv_add_spells!\n");	1455	LOG (llevError, "Buffer overflow in esrv_add_spells!\n");
1674	fatal (0);	1456	fatal (0);
1675	}	1457	}
1676		1458
1677	/* finally, we can send the packet */	1459	/* finally, we can send the packet */
		1460	pl->ns->flush_fx ();
1678	pl->ns->send_packet (sl);	1461	pl->ns->send_packet (sl);
1679	}	1462	}
1680		1463

Diff Legend

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