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

Diff Legend

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