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.88 by root, Tue Apr 24 00:42:03 2007 UTC vs.
Revision 1.153 by root, Wed Nov 4 13:46:37 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])
165	flags |= 1;
166	if (ob->map->tile_path[1])
167	flags |= 2;
168	if (ob->map->tile_path[2])
169	flags |= 4;
170	if (ob->map->tile_path[3])
171	flags |= 8;
172
173	snprintf (buf, MAX_BUF, "mapinfo - spatial %d %d %d %d %d %s",
174	flags, socket.mapx / 2 - ob->x, socket.mapy / 2 - ob->y, ob->map->width, ob->map->height, &ob->map->path);
175	}
176	else
177	snprintf (buf, MAX_BUF, "mapinfo current");
178
179	socket.send_packet (buf);
180	}
181	}	208	}
182	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)
183	{	210	{
184	int dx = ob->x - socket.current_x;	211	int dx = ob->x - socket.current_x;
185	int dy = ob->y - socket.current_y;	212	int dy = ob->y - socket.current_y;
186		213
187	if (socket.buggy_mapscroll && (abs (dx) > 8 || abs (dy) > 8))
188	clear_map (pl); // current (<= 1.9.1) clients have unchecked buffer overflows
189	else
190	{
191	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);
192	socket.floorbox_reset ();	215	socket.floorbox_reset ();
193	}
194	}	216	}
195		217
196	socket.current_x = ob->x;	218	socket.current_x = ob->x;
197	socket.current_y = ob->y;	219	socket.current_y = ob->y;
198
199	region *reg = ob->region ();
200	if (socket.current_region != reg)
201	{
202	socket.current_region = reg;
203	socket.send_packet_printf ("drawinfo 0 You are now %s.\n(use whereami for more details)", &reg->longname);
204	}
205	}	220	}
206		221
207	/**	222	/**
208	* RequestInfo is sort of a meta command. There is some specific	223	* RequestInfo is sort of a meta command. There is some specific
209	* request of information, but we call other functions to provide	224	* request of information, but we call other functions to provide
210	* that information.	225	* that information.
211	*/	226	*/
212	void	227	void
213	RequestInfo (char *buf, int len, client * ns)	228	RequestInfo (char *buf, int len, client *ns)
214	{	229	{
215	char *params = NULL, *cp;	230	char *params;
216
217	/* No match */
218	char bigbuf[MAX_BUF];
219	int slen;
220
221	/* Set up replyinfo before we modify any of the buffers - this is used
222	* if we don't find a match.
223	*/
224	strcpy (bigbuf, "replyinfo ");
225	slen = strlen (bigbuf);
226	safe_strcat (bigbuf, buf, &slen, MAX_BUF);
227		231
228	/* find the first space, make it null, and update the	232	/* find the first space, make it null, and update the
229	* params pointer.	233	* params pointer.
230	*/	234	*/
231	for (cp = buf; *cp != '\0'; cp++)	235	for (params = buf; *params; params++)
232	if (*cp == ' ')	236	if (*params == ' ')
233	{	237	{
234	*cp = '\0';
235	params = cp + 1;	238	*params++ = 0;
236	break;	239	break;
237	}	240	}
238		241
239	if (!strcmp (buf, "image_info"))
240	send_image_info (ns, params);
241	else if (!strcmp (buf, "image_sums"))
242	send_image_sums (ns, params);
243	else if (!strcmp (buf, "skill_info"))	242	if (!strcmp (buf, "skill_info"))
244	send_skill_info (ns, params);	243	send_skill_info (ns, params);
245	else if (!strcmp (buf, "spell_paths"))	244	else if (!strcmp (buf, "spell_paths"))
246	send_spell_paths (ns, params);	245	send_spell_paths (ns, params);
247	else	246	else
248	ns->send_packet (bigbuf, len);	247	{
		248	// undo tokenisation above and send replyinfo with the request unchanged
		249	if (*params)
		250	*--params = ' ';
		251
		252	ns->send_packet_printf ("replyinfo %s", buf);
		253	}
249	}	254	}
250		255
251	void	256	void
252	ExtCmd (char *buf, int len, player *pl)	257	ExtCmd (char *buf, int len, player *pl)
253	{	258	{
…		…
256		261
257	void	262	void
258	ExtiCmd (char *buf, int len, client *ns)	263	ExtiCmd (char *buf, int len, client *ns)
259	{	264	{
260	INVOKE_CLIENT (EXTICMD, ns, ARG_DATA (buf, len));	265	INVOKE_CLIENT (EXTICMD, ns, ARG_DATA (buf, len));
		266	}
		267
		268	void
		269	client::mapinfo_queue_clear ()
		270	{
		271	for (auto (i, mapinfo_queue.begin ()); i != mapinfo_queue.end (); ++i)
		272	free (*i);
		273
		274	mapinfo_queue.clear ();
		275	}
		276
		277	bool
		278	client::mapinfo_try (char *buf)
		279	{
		280	char *token = buf;
		281	buf += strlen (buf) + 9;
		282
		283	// initial map and its origin
		284	maptile *map = pl->observe->map;
		285	int mapx = pl->ns->mapx / 2 - pl->observe->x;
		286	int mapy = pl->ns->mapy / 2 - pl->observe->y;
		287	int max_distance = 8; // limit maximum path length to something generous
		288
		289	while (*buf && map && max_distance)
		290	{
		291	int dir = *buf++ - '1';
		292
		293	if (dir >= 0 && dir <= 3)
		294	{
		295	if (!map->tile_path [dir])
		296	map = 0;
		297	else if (map->tile_available (dir, false))
		298	{
		299	maptile *neigh = map->tile_map [dir];
		300
		301	switch (dir)
		302	{
		303	case 0: mapy -= neigh->height; break;
		304	case 2: mapy += map ->height; break;
		305	case 3: mapx -= neigh->width ; break;
		306	case 1: mapx += map ->width ; break;
		307	}
		308
		309	map = neigh;
		310	--max_distance;
		311	}
		312	else
		313	return 0;
		314	}
		315	else
		316	max_distance = 0;
		317	}
		318
		319	if (!max_distance)
		320	send_packet_printf ("mapinfo %s error", token);
		321	else if (!map || !map->path)
		322	send_packet_printf ("mapinfo %s nomap", token);
		323	else
		324	{
		325	int flags = 0;
		326
		327	if (map->tile_path[0]) flags |= 1;
		328	if (map->tile_path[1]) flags |= 2;
		329	if (map->tile_path[2]) flags |= 4;
		330	if (map->tile_path[3]) flags |= 8;
		331
		332	send_packet_printf ("mapinfo %s spatial %d %d %d %d %d %s", token, flags, mapx, mapy, map->width, map->height, &map->path);
		333	}
		334
		335	return 1;
		336	}
		337
		338	void
		339	client::mapinfo_queue_run ()
		340	{
		341	if (mapinfo_queue.empty () || !pl)
		342	return;
		343
		344	for (int i = 0; i < mapinfo_queue.size (); ++i)
		345	if (mapinfo_try (mapinfo_queue [i]))
		346	{
		347	free (mapinfo_queue [i]);
		348	mapinfo_queue.erase (i);
		349	}
		350	else
		351	++i;
261	}	352	}
262		353
263	void	354	void
264	MapInfoCmd (char *buf, int len, player *pl)	355	MapInfoCmd (char *buf, int len, player *pl)
265	{	356	{
266	// <mapinfo tag spatial tile-path	357	// <mapinfo tag spatial tile-path
267	// >mapinfo tag spatial flags x y w h hash	358	// >mapinfo tag spatial flags x y w h hash
268		359
269	char bigbuf[MAX_BUF], *token;
270
271	token = buf;	360	char *token = buf;
272	// copy token	361
273	if (!(buf = strchr (buf, ' ')))	362	if (!(buf = strchr (buf, ' ')))
274	return;	363	return;
275		364
276	*buf++ = 0;
277
278	if (!strncmp (buf, "spatial ", 8))	365	if (!strncmp (buf, " spatial ", 9))
279	{	366	{
280	buf += 8;	367	char *copy = strdup (token);
		368	copy [buf - token] = 0;
281		369
282	// initial map and its origin	370	#if 0
283	maptile *map = pl->ob->map;	371	// this makes only sense when we flush the buffer immediately
284	sint16 dx, dy;	372	if (pl->ns->mapinfo_try (copy))
285	int mapx = pl->ns->mapx / 2 - pl->ob->x;	373	free (copy);
286	int mapy = pl->ns->mapy / 2 - pl->ob->y;
287	int max_distance = 8; // limit maximum path length to something generous
288
289	while (*buf && map && max_distance)
290	{
291	int dir = *buf++;
292
293	switch (dir)
294	{
295	case '1':
296	dx = 0;
297	dy = -1;
298	map = map->xy_find (dx, dy);
299	map && (mapy -= map->height);
300	break;
301	case '2':
302	mapx += map->width;
303	dx = map->width;
304	dy = 0;
305	map = map->xy_find (dx, dy);
306	break;
307	case '3':
308	mapy += map->height;
309	dx = 0;
310	dy = map->height;
311	map = map->xy_find (dx, dy);
312	break;
313	case '4':
314	dx = -1;
315	dy = 0;
316	map = map->xy_find (dx, dy);
317	map && (mapx -= map->width);
318	break;
319	}
320
321	--max_distance;
322	}
323
324	if (!max_distance)
325	snprintf (bigbuf, MAX_BUF, "mapinfo %s error", token);
326	else if (map && map->path[0])
327	{
328	int flags = 0;
329
330	if (map->tile_path[0])
331	flags |= 1;
332	if (map->tile_path[1])
333	flags |= 2;
334	if (map->tile_path[2])
335	flags |= 4;
336	if (map->tile_path[3])
337	flags |= 8;
338
339	snprintf (bigbuf, MAX_BUF, "mapinfo %s spatial %d %d %d %d %d %s", token, flags, mapx, mapy, map->width, map->height, &map->path);
340	}
341	else	374	else
342	snprintf (bigbuf, MAX_BUF, "mapinfo %s nomap", token);	375	#endif
		376	pl->ns->mapinfo_queue.push_back (copy);
343	}	377	}
344	else	378	else
345	snprintf (bigbuf, MAX_BUF, "mapinfo %s unsupported", token);	379	pl->ns->send_packet_printf ("mapinfo %s unsupported", token);
346
347	pl->ns->send_packet (bigbuf);
348	}	380	}
349		381
350	/** This is the Setup cmd */	382	/** This is the Setup cmd */
351	void	383	void
352	SetUp (char *buf, int len, client * ns)	384	SetUp (char *buf, int len, client * ns)
…		…
362	*/	394	*/
363	void	395	void
364	AddMeCmd (char *buf, int len, client *ns)	396	AddMeCmd (char *buf, int len, client *ns)
365	{	397	{
366	INVOKE_CLIENT (ADDME, ns, ARG_DATA (buf, len));	398	INVOKE_CLIENT (ADDME, ns, ARG_DATA (buf, len));
367	}
368
369	/** Reply to ExtendedInfos command */
370	void
371	ToggleExtendedInfos (char *buf, int len, client * ns)
372	{
373	char cmdback[MAX_BUF];
374	char command[50];
375	int info, nextinfo;
376
377	cmdback[0] = '\0';
378	nextinfo = 0;
379
380	while (1)
381	{
382	/* 1. Extract an info */
383	info = nextinfo;
384
385	while ((info < len) && (buf[info] == ' '))
386	info++;
387
388	if (info >= len)
389	break;
390
391	nextinfo = info + 1;
392
393	while ((nextinfo < len) && (buf[nextinfo] != ' '))
394	nextinfo++;
395
396	if (nextinfo - info >= 49) /*Erroneous info asked */
397	continue;
398
399	strncpy (command, &(buf[info]), nextinfo - info);
400
401	/* 2. Interpret info */
402	if (!strcmp ("smooth", command))
403	/* Toggle smoothing */
404	ns->EMI_smooth = !ns->EMI_smooth;
405	else
406	/*bad value */;
407
408	/*3. Next info */
409	}
410
411	strcpy (cmdback, "ExtendedInfoSet");
412
413	if (ns->EMI_smooth)
414	{
415	strcat (cmdback, " ");
416	strcat (cmdback, "smoothing");
417	}
418
419	ns->send_packet (cmdback);
420	}	399	}
421		400
422	/*	401	/*
423	#define MSG_TYPE_BOOK 1	402	#define MSG_TYPE_BOOK 1
424	#define MSG_TYPE_CARD 2	403	#define MSG_TYPE_CARD 2
…		…
442	while (1)	421	while (1)
443	{	422	{
444	/* 1. Extract an info */	423	/* 1. Extract an info */
445	info = nextinfo;	424	info = nextinfo;
446		425
447	while ((info < len) && (buf[info] == ' '))	426	while ((info < len) && (buf [info] == ' '))
448	info++;	427	info++;
449		428
450	if (info >= len)	429	if (info >= len)
451	break;	430	break;
452		431
453	nextinfo = info + 1;	432	nextinfo = info + 1;
454		433
455	while ((nextinfo < len) && (buf[nextinfo] != ' '))	434	while ((nextinfo < len) && (buf [nextinfo] != ' '))
456	nextinfo++;	435	nextinfo++;
457		436
458	if (nextinfo - info >= 49) /*Erroneous info asked */	437	if (nextinfo - info >= 49) /*Erroneous info asked */
459	continue;	438	continue;
460		439
461	strncpy (command, &(buf[info]), nextinfo - info);	440	memcpy (command, buf + info, nextinfo - info);
462	command[nextinfo - info] = '\0';	441	command [nextinfo - info] = 0;
		442
463	/* 2. Interpret info */	443	/* 2. Interpret info */
464	i = sscanf (command, "%d", &flag);	444	i = sscanf (command, "%d", &flag);
465		445
466	if ((i == 1) && (flag > 0) && (flag <= MSG_TYPE_LAST))	446	if ((i == 1) && (flag > 0) && (flag <= MSG_TYPE_LAST))
467	ns->supported_readables |= (1 << flag);	447	ns->supported_readables |= (1 << flag);
…		…
481		461
482	ns->send_packet (cmdback);	462	ns->send_packet (cmdback);
483	}	463	}
484		464
485	/**	465	/**
486	* client requested an image. send it rate-limited
487	* before flushing.
488	*/
489	void
490	AskFaceCmd (char *buf, int len, client *ns)
491	{
492	ns->askface.push_back (atoi (buf));
493	}
494
495	/**
496	* Tells client the picture it has to use
497	* to smooth a picture number given as argument.
498	*/
499	void
500	AskSmooth (char *buf, int len, client *ns)
501	{
502	ns->send_face (atoi (buf));
503	ns->flush_fx ();
504	}
505
506	/**
507	* This handles the general commands from the client (ie, north, fire, cast,	466	* This handles the general commands from the client (ie, north, fire, cast,
508	* etc.)	467	* etc.)
509	*/	468	*/
510	void	469	void
511	PlayerCmd (char *buf, int len, player *pl)	470	PlayerCmd (char *buf, int len, player *pl)
…		…
522	return;	481	return;
523		482
524	buf++;	483	buf++;
525	}	484	}
526		485
527	execute_newserver_command (pl->ob, (char *) buf);	486	execute_newserver_command (pl->ob, (char *)buf);
528		487
529	/* Perhaps something better should be done with a left over count.	488	/* Perhaps something better should be done with a left over count.
530	* Cleaning up the input should probably be done first - all actions	489	* Cleaning up the input should probably be done first - all actions
531	* for the command that issued the count should be done before any other	490	* for the command that issued the count should be done before any other
532	* commands.	491	* commands.
533	*/	492	*/
534	pl->count = 0;	493	pl->count = 0;
535	}	494	}
536		495
537
538	/**	496	/**
539	* This handles the general commands from the client (ie, north, fire, cast,	497	* This handles the general commands from the client (ie, north, fire, cast,
540	* etc.). It is a lot like PlayerCmd above, but is called with the	498	* etc.). It is a lot like PlayerCmd above, but is called with the
541	* 'ncom' method which gives more information back to the client so it	499	* 'ncom' method which gives more information back to the client so it
542	* can throttle.	500	* can throttle.
…		…
544	void	502	void
545	NewPlayerCmd (char *buf, int len, player *pl)	503	NewPlayerCmd (char *buf, int len, player *pl)
546	{	504	{
547	if (len <= 6)	505	if (len <= 6)
548	{	506	{
549	LOG (llevDebug, "Corrupt ncom command <%s> not long enough - discarding\n", buf);	507	LOG (llevDebug, "%s: corrupt ncom command <%s>: not long enough (%d) - discarding\n", pl->ns->host, buf, len);
550	return;	508	return;
551	}	509	}
552		510
553	uint16 cmdid = net_uint16 ((uint8 *)buf);	511	uint16 cmdid = net_uint16 ((uint8 *)buf);
554	sint32 repeat = net_sint32 ((uint8 *)buf + 2);	512	sint32 repeat = net_sint32 ((uint8 *)buf + 2);
…		…
659		617
660	cp = strchr (cp + 1, ' ');	618	cp = strchr (cp + 1, ' ');
661		619
662	if (cp)	620	if (cp)
663	{	621	{
664	assign (ns->version, cp + 1);	622	ns->version = cp + 1;
665		623
666	if (ns->sc_version < 1026)	624	if (ns->sc_version < 1026)
667	ns->send_packet_printf ("drawinfo %d %s", NDI_RED,	625	ns->send_packet_printf ("drawinfo %d %s", NDI_RED,
668	"**** VERSION WARNING ****\n**** CLIENT IS TOO OLD!! UPDATE THE CLIENT!! ****");	626	"**** VERSION WARNING ****\n**** CLIENT IS TOO OLD!! UPDATE THE CLIENT!! ****");
669	}	627	}
…		…
692	* syntax is: move (to) (tag) (nrof)	650	* syntax is: move (to) (tag) (nrof)
693	*/	651	*/
694	void	652	void
695	MoveCmd (char *buf, int len, player *pl)	653	MoveCmd (char *buf, int len, player *pl)
696	{	654	{
697	int vals[3], i;	655	int to, tag, nrof;
698		656
699	/* A little funky here. We only cycle for 2 records, because	657	if (3 != sscanf (buf, "%d %d %d", &to, &tag, &nrof))
700	* we obviously are not going to find a space after the third
701	* record. Perhaps we should just replace this with a
702	* sscanf?
703	*/
704	for (i = 0; i < 2; i++)
705	{	658	{
706	vals[i] = atoi (buf);
707
708	if (!(buf = strchr (buf, ' ')))
709	{
710	LOG (llevError, "Incomplete move command: %s\n", buf);	659	LOG (llevError, "Incomplete move command: %s\n", buf);
711	return;	660	return;
712	}
713
714	buf++;
715	}	661	}
716		662
717	vals[2] = atoi (buf);	663	esrv_move_object (pl->ob, to, tag, nrof);
718
719	/* LOG(llevDebug,"Move item %d (nrof=%d) to %d.\n", vals[1], vals[2], vals[0]);*/
720	esrv_move_object (pl->ob, vals[0], vals[1], vals[2]);
721	}	664	}
722		665
723	/******************************************************************************	666	/******************************************************************************
724	*	667	*
725	* Start of commands the server sends to the client.	668	* Start of commands the server sends to the client.
…		…
734	send_query (client *ns, uint8 flags, const char *text)	677	send_query (client *ns, uint8 flags, const char *text)
735	{	678	{
736	ns->send_packet_printf ("query %d %s", flags, text ? text : "");	679	ns->send_packet_printf ("query %d %s", flags, text ? text : "");
737	}	680	}
738		681
		682	/**
		683	* Get player's current range attack in obuf.
		684	*/
		685	static void
		686	rangetostring (player *pl, char *obuf)
		687	{
		688	dynbuf_text &buf = msg_dynbuf; buf.clear ();
		689
		690	if (pl->ranged_ob)
		691	buf << " Range" << (pl->ob->current_weapon == pl->ranged_ob ? "*" : "") << ": " << pl->ranged_ob->name;
		692
		693	if (pl->combat_ob)
		694	buf << " Combat" << (pl->ob->current_weapon == pl->combat_ob ? "*" : "") << ": " << pl->combat_ob->name;
		695
		696	#if 0
		697	//TODO: remove this when slot system is working, this is only for debugging
		698	if (pl->ob->chosen_skill)
		699	buf << " Skill*: " << pl->ob->chosen_skill->name;
		700	#endif
		701
		702	//TODO: maybe golem should become the current_weapon, quite simply?
		703	if (pl->golem)
		704	buf << " Golem*: " << pl->golem->name;
		705
		706	buf << '\0';
		707	buf.linearise (obuf);
		708	}
		709
739	#define AddIfInt64(Old,New,Type) if (Old != New) {\	710	#define AddIfInt64(Old,New,Type) if (Old != New) {\
740	Old = New; \	711	Old = New; \
741	sl << uint8 (Type) << uint64 (New); \	712	sl << uint8 (Type) << uint64 (New); \
742	}	713	}
743		714
…		…
749	#define AddIfShort(Old,New,Type) if (Old != New) {\	720	#define AddIfShort(Old,New,Type) if (Old != New) {\
750	Old = New; \	721	Old = New; \
751	sl << uint8 (Type) << uint16 (New); \	722	sl << uint8 (Type) << uint16 (New); \
752	}	723	}
753		724
754	#define AddIfFloat(Old,New,Type) if (Old != New) {\	725	#define AddIfFloat(Old,New,Type,mult) if (Old != New) {\
755	Old = New; \	726	Old = New; \
756	sl << uint8 (Type) << uint32 (New*FLOAT_MULTI); \	727	sl << uint8 (Type) << uint32 (New*FLOAT_MULTI*mult); \
757	}	728	}
758		729
759	#define AddIfString(Old,New,Type) if (Old == NULL || strcmp(Old,New)) {\	730	#define AddIfString(Old,New,Type) if (Old == NULL || strcmp(Old,New)) {\
760	free(Old); Old = strdup (New);\	731	free(Old); Old = strdup (New);\
761	sl << uint8 (Type) << data8 (New); \	732	sl << uint8 (Type) << data8 (New); \
…		…
775		746
776	client *ns = pl->ns;	747	client *ns = pl->ns;
777	if (!ns)	748	if (!ns)
778	return;	749	return;
779		750
780	object *ob = pl->ob;	751	object *ob = pl->observe;
781	if (!ob)	752	if (!ob)
782	return;	753	return;
		754
		755	player *opl = ob->contr ? static_cast<player *>(ob->contr) : pl;
783		756
784	packet sl ("stats");	757	packet sl ("stats");
785		758
786	AddIfShort (ns->last_stats.hp, ob->stats.hp, CS_STAT_HP);	759	AddIfShort (ns->last_stats.hp, ob->stats.hp, CS_STAT_HP);
787	AddIfShort (ns->last_stats.maxhp, ob->stats.maxhp, CS_STAT_MAXHP);	760	AddIfShort (ns->last_stats.maxhp, ob->stats.maxhp, CS_STAT_MAXHP);
…		…
796	AddIfShort (ns->last_stats.Wis, ob->stats.Wis, CS_STAT_WIS);	769	AddIfShort (ns->last_stats.Wis, ob->stats.Wis, CS_STAT_WIS);
797	AddIfShort (ns->last_stats.Pow, ob->stats.Pow, CS_STAT_POW);	770	AddIfShort (ns->last_stats.Pow, ob->stats.Pow, CS_STAT_POW);
798	AddIfShort (ns->last_stats.Cha, ob->stats.Cha, CS_STAT_CHA);	771	AddIfShort (ns->last_stats.Cha, ob->stats.Cha, CS_STAT_CHA);
799		772
800	for (int s = 0; s < NUM_SKILLS; s++)	773	for (int s = 0; s < NUM_SKILLS; s++)
801	if (object *skill = pl->last_skill_ob[s])	774	if (object *skill = opl->last_skill_ob [s])
802	if (skill->stats.exp != ns->last_skill_exp [s])	775	if (skill->stats.exp != ns->last_skill_exp [s])
803	{	776	{
804	ns->last_skill_exp [s] = skill->stats.exp;	777	ns->last_skill_exp [s] = skill->stats.exp;
805		778
806	/* Always send along the level if exp changes. This is only	779	/* Always send along the level if exp changes. This is only
…		…
814	AddIfInt64 (ns->last_stats.exp, ob->stats.exp, CS_STAT_EXP64);	787	AddIfInt64 (ns->last_stats.exp, ob->stats.exp, CS_STAT_EXP64);
815	AddIfShort (ns->last_level, ob->level, CS_STAT_LEVEL);	788	AddIfShort (ns->last_level, ob->level, CS_STAT_LEVEL);
816	AddIfShort (ns->last_stats.wc, ob->stats.wc, CS_STAT_WC);	789	AddIfShort (ns->last_stats.wc, ob->stats.wc, CS_STAT_WC);
817	AddIfShort (ns->last_stats.ac, ob->stats.ac, CS_STAT_AC);	790	AddIfShort (ns->last_stats.ac, ob->stats.ac, CS_STAT_AC);
818	AddIfShort (ns->last_stats.dam, ob->stats.dam, CS_STAT_DAM);	791	AddIfShort (ns->last_stats.dam, ob->stats.dam, CS_STAT_DAM);
819	AddIfFloat (ns->last_speed, ob->speed, CS_STAT_SPEED);	792	AddIfFloat (ns->last_speed, ob->speed, CS_STAT_SPEED, 1.f/TICK);
820	AddIfShort (ns->last_stats.food, ob->stats.food, CS_STAT_FOOD);	793	AddIfShort (ns->last_stats.food, ob->stats.food, CS_STAT_FOOD);
821	AddIfFloat (ns->last_weapon_sp, pl->weapon_sp, CS_STAT_WEAP_SP);	794	AddIfFloat (ns->last_weapon_sp, pl->weapon_sp, CS_STAT_WEAP_SP, 1.f/TICK);
822	AddIfInt (ns->last_weight_limit, weight_limit[ob->stats.Str], CS_STAT_WEIGHT_LIM);	795	AddIfInt (ns->last_weight_limit, weight_limit[ob->stats.Str], CS_STAT_WEIGHT_LIM);
823		796
824	flags = 0;	797	flags = 0;
825		798
826	if (pl->fire_on)	799	if (opl->fire_on)
827	flags |= SF_FIREON;	800	flags |= SF_FIREON;
828		801
829	if (pl->run_on)	802	if (opl->run_on)
830	flags |= SF_RUNON;	803	flags |= SF_RUNON;
831		804
832	AddIfShort (ns->last_flags, flags, CS_STAT_FLAGS);	805	AddIfShort (ns->last_flags, flags, CS_STAT_FLAGS);
833		806
834	if (ns->sc_version < 1025)	807	if (ns->sc_version < 1025)
…		…
848	AddIfInt (ns->last_path_attuned, ob->path_attuned, CS_STAT_SPELL_ATTUNE);	821	AddIfInt (ns->last_path_attuned, ob->path_attuned, CS_STAT_SPELL_ATTUNE);
849	AddIfInt (ns->last_path_repelled, ob->path_repelled, CS_STAT_SPELL_REPEL);	822	AddIfInt (ns->last_path_repelled, ob->path_repelled, CS_STAT_SPELL_REPEL);
850	AddIfInt (ns->last_path_denied, ob->path_denied, CS_STAT_SPELL_DENY);	823	AddIfInt (ns->last_path_denied, ob->path_denied, CS_STAT_SPELL_DENY);
851	}	824	}
852		825
853	rangetostring (ob, buf); /* we want use the new fire & run system in new client */	826	rangetostring (opl, buf); /* we want use the new fire & run system in new client */
854	AddIfString (ns->stats.range, buf, CS_STAT_RANGE);	827	AddIfString (ns->stats.range, buf, CS_STAT_RANGE);
855	set_title (ob, buf);	828	set_title (ob, buf);
856	AddIfString (ns->stats.title, buf, CS_STAT_TITLE);	829	AddIfString (ns->stats.title, buf, CS_STAT_TITLE);
857		830
858	/* Only send it away if we have some actual data */	831	/* Only send it away if we have some actual data */
…		…
862		835
863	/**	836	/**
864	* Tells the client that here is a player it should start using.	837	* Tells the client that here is a player it should start using.
865	*/	838	*/
866	void	839	void
867	esrv_new_player (player *pl, uint32 weight)	840	esrv_new_player (player *pl)
868	{	841	{
		842	sint32 weight = pl->ob->client_weight ();
		843
869	packet sl ("player");	844	packet sl ("player");
870		845
871	sl << uint32 (pl->ob->count)	846	sl << uint32 (pl->ob->count)
872	<< uint32 (weight)	847	<< uint32 (weight)
873	<< uint32 (pl->ob->face)	848	<< uint32 (pl->ob->face)
874	<< data8 (pl->ob->name);	849	<< data8 (pl->ob->name);
875		850
876	pl->ns->last_weight = weight;	851	pl->ns->last_weight = weight;
877	pl->ns->send_packet (sl);	852	pl->ns->send_packet (sl);
878	SET_FLAG (pl->ob, FLAG_CLIENT_SENT);
879	}	853	}
880		854
881	/******************************************************************************	855	/******************************************************************************
882	*	856	*
883	* Start of map related commands.	857	* Start of map related commands.
…		…
940		914
941	if (!ns.faces_sent[face_num])	915	if (!ns.faces_sent[face_num])
942	if (ob)	916	if (ob)
943	ns.send_faces (ob);	917	ns.send_faces (ob);
944	else	918	else
945	ns.send_face (face_num);	919	ns.send_face (face_num, 10);
946		920
947	sl << uint16 (face_num);	921	sl << uint16 (face_num);
948	return 1;	922	return 1;
949	}	923	}
950		924
951	/* Nothing changed */	925	/* Nothing changed */
952	return 0;	926	return 0;
953	}
954
955	/**
956	* Returns the size of a data for a map square as returned by
957	* mapextended. There are CLIENTMAPX*CLIENTMAPY*LAYERS entries
958	* available.
959	*/
960	int
961	getExtendedMapInfoSize (client * ns)
962	{
963	int result = 0;
964
965	if (ns->ext_mapinfos)
966	{
967	if (ns->EMI_smooth)
968	result += 1; /*One byte for smoothlevel */
969	}
970
971	return result;
972	}	927	}
973		928
974	// prefetch (and touch) all maps within a specific distancd	929	// prefetch (and touch) all maps within a specific distancd
975	static void	930	static void
976	prefetch_surrounding_maps (maptile *map, int distance)	931	prefetch_surrounding_maps (maptile *map, int distance)
977	{	932	{
978	map->last_access = runtime;	933	map->touch ();
979		934
980	if (--distance)	935	if (--distance)
981	for (int dir = 4; --dir; )	936	for (int dir = 4; --dir; )
982	if (const shstr &path = map->tile_path [dir])	937	if (const shstr &path = map->tile_path [dir])
983	if (maptile *&neigh = map->tile_map [dir])	938	if (maptile *&neigh = map->tile_map [dir])
…		…
992	{	947	{
993	prefetch_surrounding_maps (op->map, 3);	948	prefetch_surrounding_maps (op->map, 3);
994	}	949	}
995		950
996	/**	951	/**
997	* This function uses the new map1 protocol command to send the map	952	* Draws client map.
998	* to the client. It is necessary because the old map command supports
999	* a maximum map size of 15x15.
1000	* This function is much simpler than the old one. This is because
1001	* the old function optimized to send as few face identifiers as possible,
1002	* at the expense of sending more coordinate location (coordinates were
1003	* only 1 byte, faces 2 bytes, so this was a worthwhile savings). Since
1004	* we need 2 bytes for coordinates and 2 bytes for faces, such a trade off
1005	* maps no sense. Instead, we actually really only use 12 bits for coordinates,
1006	* and use the other 4 bits for other informatiion. For full documentation
1007	* of what we send, see the doc/Protocol file.
1008	* I will describe internally what we do:
1009	* the ns->lastmap shows how the map last looked when sent to the client.
1010	* in the lastmap structure, there is a cells array, which is set to the
1011	* maximum viewable size (As set in config.h).
1012	* in the cells, there are faces and a count value.
1013	* we use the count value to hold the darkness value. If -1, then this space
1014	* is not viewable.
1015	* we use faces[0] faces[1] faces[2] to hold what the three layers
1016	* look like.
1017	*/	953	*/
1018	void	954	void
1019	draw_client_map1 (object *pl)	955	draw_client_map (player *pl)
1020	{	956	{
1021	int x, y, ax, ay, startlen, max_x, max_y, oldlen;	957	object *ob = pl->observe;
1022	sint16 nx, ny;
1023	int estartlen, eoldlen;
1024	uint8 eentrysize;
1025	uint16 ewhatstart, ewhatflag;
1026	uint8 extendedinfos;
1027	maptile *m;
1028
1029	client &socket = *pl->contr->ns;
1030
1031	if (!pl->active)	958	if (!ob->active)
1032	return;	959	return;
1033
1034	check_map_change (pl->contr);
1035	prefetch_surrounding_maps (pl);
1036
1037	packet sl (socket.mapmode == Map1Cmd ? "map1" : "map1a");
1038	packet esl;
1039
1040	startlen = sl.length ();
1041
1042	/*Extendedmapinfo structure initialisation */
1043	if (socket.ext_mapinfos)
1044	{
1045	extendedinfos = EMI_NOREDRAW;
1046
1047	if (socket.EMI_smooth)
1048	extendedinfos |= EMI_SMOOTH;
1049
1050	ewhatstart = esl.length ();
1051	ewhatflag = extendedinfos; /*The EMI_NOREDRAW bit
1052	could need to be taken away */
1053	eentrysize = getExtendedMapInfoSize (&socket);
1054	esl << "mapextended "
1055	<< uint8 (extendedinfos)
1056	<< uint8 (eentrysize);
1057
1058	estartlen = esl.length ();
1059	}
1060
1061	/* x,y are the real map locations. ax, ay are viewport relative
1062	* locations.
1063	*/
1064	ay = 0;
1065
1066	/* We could do this logic as conditionals in the if statement,
1067	* but that started to get a bit messy to look at.
1068	*/
1069	max_x = pl->x + (socket.mapx + 1) / 2;
1070	max_y = pl->y + (socket.mapy + 1) / 2;
1071
1072	maptile *plmap = pl->map;
1073
1074	for (y = pl->y - socket.mapy / 2; y < max_y; y++, ay++)
1075	{
1076	ax = 0;
1077	for (x = pl->x - socket.mapx / 2; x < max_x; x++, ax++)
1078	{
1079	int emask, mask;
1080	emask = mask = (ax & 0x3f) << 10 | (ay & 0x3f) << 4;
1081
1082	MapCell &lastcell = socket.lastmap.cells[ax][ay];
1083
1084	/* If the coordinates are not valid, or it is too dark to see,
1085	* we tell the client as such
1086	*/
1087	nx = x;
1088	ny = y;
1089	m = get_map_from_coord (plmap, &nx, &ny);
1090
1091	if (!m)
1092	{
1093	/* space is out of map. Update space and clear values
1094	* if this hasn't already been done. If the space is out
1095	* of the map, it shouldn't have a head
1096	*/
1097	if (lastcell.count != -1)
1098	{
1099	sl << uint16 (mask);
1100	map_clearcell (&lastcell, -1);
1101	}
1102
1103	continue;
1104	}
1105
1106	m->touch ();
1107
1108	int d = pl->contr->blocked_los[ax][ay];
1109
1110	if (d > 3)
1111	{
1112
1113	int need_send = 0, count;
1114
1115	/* This block deals with spaces that are not visible for whatever
1116	* reason. Still may need to send the head for this space.
1117	*/
1118
1119	oldlen = sl.length ();
1120
1121	sl << uint16 (mask);
1122
1123	if (lastcell.count != -1)
1124	need_send = 1;
1125
1126	count = -1;
1127
1128	/* properly clear a previously sent big face */
1129	if (lastcell.faces[0] || lastcell.faces[1] || lastcell.faces[2]
1130	|| lastcell.stat_hp || lastcell.flags || lastcell.player)
1131	need_send = 1;
1132
1133	map_clearcell (&lastcell, count);
1134
1135	if ((mask & 0xf) || need_send)
1136	sl[oldlen + 1] = mask & 0xff;
1137	else
1138	sl.reset (oldlen);
1139	}
1140	else
1141	{
1142	/* In this block, the space is visible.
1143	*/
1144
1145	/* Rather than try to figure out what everything that we might
1146	* need to send is, then form the packet after that,
1147	* we presume that we will in fact form a packet, and update
1148	* the bits by what we do actually send. If we send nothing,
1149	* we just back out sl.length () to the old value, and no harm
1150	* is done.
1151	* I think this is simpler than doing a bunch of checks to see
1152	* what if anything we need to send, setting the bits, then
1153	* doing those checks again to add the real data.
1154	*/
1155	oldlen = sl.length ();
1156	eoldlen = esl.length ();
1157
1158	sl << uint16 (mask);
1159
1160	unsigned char dummy;
1161	unsigned char *last_ext = &dummy;
1162
1163	/* Darkness changed */
1164	if (lastcell.count != d && socket.darkness)
1165	{
1166	mask |= 0x8;
1167
1168	if (socket.extmap)
1169	{
1170	*last_ext |= 0x80;
1171	last_ext = &sl[sl.length ()];
1172	sl << uint8 (d);
1173	}
1174	else
1175	sl << uint8 (255 - 64 * d);
1176	}
1177
1178	lastcell.count = d;
1179
1180	mapspace &ms = m->at (nx, ny);
1181
1182	if (socket.extmap)
1183	{
1184	uint8 stat_hp = 0;
1185	uint8 stat_width = 0;
1186	uint8 flags = 0;
1187	tag_t player = 0;
1188
1189	// send hp information, if applicable
1190	if (object *op = ms.faces_obj [0])
1191	{
1192	if (op->head || op->invisible)
1193	; // do not show
1194	else if (op->type == PLAYER
1195	|| QUERY_FLAG (op, FLAG_MONSTER) || QUERY_FLAG (op, FLAG_ALIVE) || QUERY_FLAG (op, FLAG_GENERATOR))
1196	{
1197	if (op->stats.maxhp > 0 && (unsigned) op->stats.maxhp > (unsigned) op->stats.hp)
1198	{
1199	stat_hp = 255 - (op->stats.hp * 255 + 254) / op->stats.maxhp;
1200	stat_width = op->arch->tail_x;
1201	}
1202	}
1203
1204	if (op->msg && op->msg[0] == '@')
1205	flags |= 1;
1206
1207	if (op->type == PLAYER && op != pl)
1208	player = op->count;
1209	}
1210
1211	if (lastcell.stat_hp != stat_hp)
1212	{
1213	lastcell.stat_hp = stat_hp;
1214
1215	mask |= 0x8;
1216	*last_ext |= 0x80;
1217	last_ext = &sl[sl.length ()];
1218
1219	sl << uint8 (5) << uint8 (stat_hp);
1220
1221	if (stat_width > 1)
1222	{
1223	*last_ext |= 0x80;
1224	last_ext = &sl[sl.length ()];
1225
1226	sl << uint8 (6) << uint8 (stat_width);
1227	}
1228	}
1229
1230	if (lastcell.player != player)
1231	{
1232	lastcell.player = player;
1233
1234	mask |= 0x8;
1235	*last_ext |= 0x80;
1236	last_ext = &sl[sl.length ()];
1237
1238	sl << uint8 (0x47) << uint8 (4) << (uint32)player;
1239	}
1240
1241	if (lastcell.flags != flags)
1242	{
1243	lastcell.flags = flags;
1244
1245	mask |= 0x8;
1246	*last_ext |= 0x80;
1247	last_ext = &sl[sl.length ()];
1248
1249	sl << uint8 (8) << uint8 (flags);
1250	}
1251	}
1252
1253	/* Floor face */
1254	if (update_space (sl, socket, ms, lastcell, 2))
1255	mask |= 0x4;
1256
1257	/* Middle face */
1258	if (update_space (sl, socket, ms, lastcell, 1))
1259	mask |= 0x2;
1260
1261	if (ms.player () == pl
1262	&& (pl->invisible & (pl->invisible < 50 ? 1 : 7)))
1263	{
1264	// force player to be visible to himself if invisible
1265	if (lastcell.faces[0] != pl->face)
1266	{
1267	lastcell.faces[0] = pl->face;
1268
1269	mask |= 0x1;
1270	sl << uint16 (pl->face);
1271
1272	socket.send_faces (pl);
1273	}
1274	}
1275	/* Top face */
1276	else if (update_space (sl, socket, ms, lastcell, 0))
1277	mask |= 0x1;
1278
1279
1280	/* Check to see if we are in fact sending anything for this
1281	* space by checking the mask. If so, update the mask.
1282	* if not, reset the len to that from before adding the mask
1283	* value, so we don't send those bits.
1284	*/
1285	if (mask & 0xf)
1286	sl[oldlen + 1] = mask & 0xff;
1287	else
1288	sl.reset (oldlen);
1289
1290	if (socket.ext_mapinfos)
1291	esl << uint16 (emask);
1292
1293	if (socket.EMI_smooth)
1294	{
1295	for (int layer = 2+1; layer--; )
1296	{
1297	object *ob = ms.faces_obj [layer];
1298
1299	// If there is no object for this space, or if the face for the object
1300	// is the blank face, set the smoothlevel to zero.
1301	int smoothlevel = ob && ob->face != blank_face ? ob->smoothlevel : 0;
1302
1303	// We've gotten what face we want to use for the object. Now see if
1304	// if it has changed since we last sent it to the client.
1305	if (lastcell.smooth[layer] != smoothlevel)
1306	{
1307	lastcell.smooth[layer] = smoothlevel;
1308	esl << uint8 (smoothlevel);
1309	emask |= 1 << layer;
1310	}
1311	}
1312
1313	if (emask & 0xf)
1314	esl[eoldlen + 1] = emask & 0xff;
1315	else
1316	esl.reset (eoldlen);
1317	}
1318	} /* else this is a viewable space */
1319	} /* for x loop */
1320	} /* for y loop */
1321
1322	socket.flush_fx ();
1323
1324	/* Verify that we in fact do need to send this */
1325	if (socket.ext_mapinfos)
1326	{
1327	if (!(sl.length () > startlen || socket.sent_scroll))
1328	{
1329	/* No map data will follow, so don't say the client
1330	* it doesn't need draw!
1331	*/
1332	ewhatflag &= ~EMI_NOREDRAW;
1333	esl[ewhatstart + 1] = ewhatflag & 0xff;
1334	}
1335
1336	if (esl.length () > estartlen)
1337	socket.send_packet (esl);
1338	}
1339
1340	if (sl.length () > startlen || socket.sent_scroll)
1341	{
1342	socket.send_packet (sl);
1343	socket.sent_scroll = 0;
1344	}
1345	}
1346
1347	/**
1348	* Draws client map.
1349	*/
1350	void
1351	draw_client_map (object *pl)
1352	{
1353	int i, j;
1354	sint16 ax, ay; /* ax and ay goes from 0 to max-size of arrays */
1355	int mflags;
1356	struct Map newmap;
1357	maptile *m, *pm;
1358
1359	if (pl->type != PLAYER)
1360	{
1361	LOG (llevError, "draw_client_map called with non player/non eric-server\n");
1362	return;
1363	}
1364
1365	pm = pl->map;
1366		960
1367	/* If player is just joining the game, he isn't here yet, so the map	961	/* If player is just joining the game, he isn't here yet, so the map
1368	* can get swapped out. If so, don't try to send them a map. All will	962	* can get swapped out. If so, don't try to send them a map. All will
1369	* be OK once they really log in.	963	* be OK once they really log in.
1370	*/	964	*/
1371	if (pm == NULL || pm->in_memory != MAP_IN_MEMORY)	965	if (!ob->map || ob->map->in_memory != MAP_ACTIVE)
1372	return;	966	return;
1373		967
1374	memset (&newmap, 0, sizeof (struct Map));	968	int startlen, oldlen;
1375		969
1376	for (j = (pl->y - pl->contr->ns->mapy / 2); j < (pl->y + (pl->contr->ns->mapy + 1) / 2); j++)	970	check_map_change (pl);
1377	for (i = (pl->x - pl->contr->ns->mapx / 2); i < (pl->x + (pl->contr->ns->mapx + 1) / 2); i++)	971	prefetch_surrounding_maps (pl->ob);
		972
		973	/* do LOS after calls to update_position */
		974	/* unfortunately, we need to udpate los when observing, currently */
		975	if (pl->do_los || pl->observe != pl->ob)
		976	{
		977	pl->do_los = 0;
		978	pl->update_los ();
		979	}
		980
		981	/**
		982	* This function uses the new map1 protocol command to send the map
		983	* to the client. It is necessary because the old map command supports
		984	* a maximum map size of 15x15.
		985	* This function is much simpler than the old one. This is because
		986	* the old function optimized to send as few face identifiers as possible,
		987	* at the expense of sending more coordinate location (coordinates were
		988	* only 1 byte, faces 2 bytes, so this was a worthwhile savings). Since
		989	* we need 2 bytes for coordinates and 2 bytes for faces, such a trade off
		990	* maps no sense. Instead, we actually really only use 12 bits for coordinates,
		991	* and use the other 4 bits for other informatiion. For full documentation
		992	* of what we send, see the doc/Protocol file.
		993	* I will describe internally what we do:
		994	* the ns->lastmap shows how the map last looked when sent to the client.
		995	* in the lastmap structure, there is a cells array, which is set to the
		996	* maximum viewable size (As set in config.h).
		997	* in the cells, there are faces and a count value.
		998	* we use the count value to hold the darkness value. If -1, then this space
		999	* is not viewable.
		1000	* we use faces[0] faces[1] faces[2] to hold what the three layers
		1001	* look like.
		1002	*/
		1003
		1004	client &socket = *pl->ns;
		1005
		1006	packet sl (socket.mapmode == Map1Cmd ? "map1" : "map1a");
		1007
		1008	startlen = sl.length ();
		1009
		1010	int hx = socket.mapx / 2;
		1011	int hy = socket.mapy / 2;
		1012
		1013	ordered_mapwalk_begin (ob, -hx, -hy, hx, hy)
		1014	int ax = dx + hx;
		1015	int ay = dy + hy;
		1016
		1017	int mask = (ax << 10) | (ay << 4);
		1018	MapCell &lastcell = socket.lastmap.cells[ax][ay];
		1019
		1020	/* If the coordinates are not valid, or it is too dark to see,
		1021	* we tell the client as such
		1022	*/
		1023	if (!m)
1378	{	1024	{
1379	ax = i;	1025	/* space is out of map. Update space and clear values
1380	ay = j;	1026	* if this hasn't already been done. If the space is out
1381	m = pm;	1027	* of the map, it shouldn't have a head.
1382	mflags = get_map_flags (m, &m, ax, ay, &ax, &ay);
1383
1384	if (mflags & P_OUT_OF_MAP)
1385	continue;
1386
1387	/* If a map is visible to the player, we don't want to swap it out
1388	* just to reload it. This should really call something like
1389	* swap_map, but this is much more efficient and 'good enough'
1390	*/	1028	*/
1391	if (mflags & P_NEW_MAP)	1029	if (lastcell.count != -1)
1392	m->timeout = 50;	1030	{
		1031	sl << uint16 (mask);
		1032	map_clearcell (&lastcell, -1);
		1033	}
		1034
		1035	continue;
1393	}	1036	}
		1037
		1038	int d = pl->blocked_los_uc (dx, dy);
1394		1039
1395	/* do LOS after calls to update_position */	1040	if (d > 3)
1396	if (pl->contr->do_los)
1397	{	1041	{
1398	update_los (pl);	1042	/* This block deals with spaces that are not visible for whatever
1399	pl->contr->do_los = 0;	1043	* reason. Still may need to send the head for this space.
		1044	*/
		1045	if (lastcell.count != -1
		1046	|| lastcell.faces[0]
		1047	|| lastcell.faces[1]
		1048	|| lastcell.faces[2]
		1049	|| lastcell.stat_hp
		1050	|| lastcell.flags
		1051	|| lastcell.player)
		1052	sl << uint16 (mask);
		1053
		1054	/* properly clear a previously sent big face */
		1055	map_clearcell (&lastcell, -1);
1400	}	1056	}
		1057	else
		1058	{
		1059	/* In this block, the space is visible.
		1060	*/
1401		1061
1402	/* Big maps need a different drawing mechanism to work */	1062	/* Rather than try to figure out what everything that we might
1403	draw_client_map1 (pl);	1063	* need to send is, then form the packet after that,
1404	}	1064	* we presume that we will in fact form a packet, and update
		1065	* the bits by what we do actually send. If we send nothing,
		1066	* we just back out sl.length () to the old value, and no harm
		1067	* is done.
		1068	* I think this is simpler than doing a bunch of checks to see
		1069	* what if anything we need to send, setting the bits, then
		1070	* doing those checks again to add the real data.
		1071	*/
		1072	oldlen = sl.length ();
1405		1073
		1074	sl << uint16 (mask);
		1075
		1076	unsigned char dummy;
		1077	unsigned char *last_ext = &dummy;
		1078
		1079	/* Darkness changed */
		1080	if (lastcell.count != d)
		1081	{
		1082	mask |= 0x8;
		1083
		1084	*last_ext |= 0x80;
		1085	last_ext = &sl[sl.length ()];
		1086	sl << uint8 (d);
		1087	}
		1088
		1089	lastcell.count = d;
		1090
		1091	mapspace &ms = m->at (nx, ny);
		1092	ms.update ();
		1093
		1094	// extmap handling
		1095	uint8 stat_hp = 0;
		1096	uint8 stat_width = 0;
		1097	uint8 flags = 0;
		1098	tag_t player = 0;
		1099
		1100	// send hp information, if applicable
		1101	if (object *op = ms.faces_obj [0])
		1102	if (op->is_head () && !op->invisible)
		1103	{
		1104	if (op->stats.maxhp > op->stats.hp
		1105	&& op->stats.maxhp > 0
		1106	&& (op->type == PLAYER
		1107	|| op->type == DOOR // does not work, have maxhp 0
		1108	|| QUERY_FLAG (op, FLAG_MONSTER)
		1109	|| QUERY_FLAG (op, FLAG_ALIVE)
		1110	|| QUERY_FLAG (op, FLAG_GENERATOR)))
		1111	{
		1112	stat_hp = 255 - (op->stats.hp * 255 + 254) / op->stats.maxhp;
		1113	stat_width = op->arch->max_x - op->arch->x; //TODO: should be upper-left edge
		1114	}
		1115
		1116	if (expect_false (op->has_dialogue ()))
		1117	flags |= 1;
		1118
		1119	if (expect_false (op->type == PLAYER))
		1120	player = op == ob ? pl->ob->count
		1121	: op == pl->ob ? ob->count
		1122	: op->count;
		1123	}
		1124
		1125	if (expect_false (lastcell.stat_hp != stat_hp))
		1126	{
		1127	lastcell.stat_hp = stat_hp;
		1128
		1129	mask |= 0x8;
		1130	*last_ext |= 0x80;
		1131	last_ext = &sl[sl.length ()];
		1132
		1133	sl << uint8 (5) << uint8 (stat_hp);
		1134
		1135	if (stat_width > 1)
		1136	{
		1137	*last_ext |= 0x80;
		1138	last_ext = &sl[sl.length ()];
		1139
		1140	sl << uint8 (6) << uint8 (stat_width);
		1141	}
		1142	}
		1143
		1144	if (expect_false (lastcell.player != player))
		1145	{
		1146	lastcell.player = player;
		1147
		1148	mask |= 0x8;
		1149	*last_ext |= 0x80;
		1150	last_ext = &sl[sl.length ()];
		1151
		1152	sl << uint8 (0x47) << uint8 (4) << (uint32)player;
		1153	}
		1154
		1155	if (expect_false (lastcell.flags != flags))
		1156	{
		1157	lastcell.flags = flags;
		1158
		1159	mask |= 0x8;
		1160	*last_ext |= 0x80;
		1161	last_ext = &sl[sl.length ()];
		1162
		1163	sl << uint8 (8) << uint8 (flags);
		1164	}
		1165
		1166	// faces
		1167
		1168	/* Floor face */
		1169	if (update_space (sl, socket, ms, lastcell, 2))
		1170	mask |= 0x4;
		1171
		1172	/* Middle face */
		1173	if (update_space (sl, socket, ms, lastcell, 1))
		1174	mask |= 0x2;
		1175
		1176	if (expect_false (ob->invisible)
		1177	&& ob->invisible & (ob->invisible < 50 ? 1 : 7)
		1178	&& ms.player () == ob)
		1179	{
		1180	// force player to be visible to himself if invisible
		1181	if (lastcell.faces[0] != ob->face)
		1182	{
		1183	lastcell.faces[0] = ob->face;
		1184
		1185	mask |= 0x1;
		1186	sl << uint16 (ob->face);
		1187
		1188	socket.send_faces (ob);
		1189	}
		1190	}
		1191	/* Top face */
		1192	else if (update_space (sl, socket, ms, lastcell, 0))
		1193	mask |= 0x1;
		1194
		1195	/* Check to see if we are in fact sending anything for this
		1196	* space by checking the mask. If so, update the mask.
		1197	* if not, reset the len to that from before adding the mask
		1198	* value, so we don't send those bits.
		1199	*/
		1200	if (mask & 0xf)
		1201	sl[oldlen + 1] = mask & 0xff;
		1202	else
		1203	sl.reset (oldlen);
		1204	} /* else this is a viewable space */
		1205	ordered_mapwalk_end
		1206
		1207	socket.flush_fx ();
		1208
		1209	if (sl.length () > startlen || socket.sent_scroll)
		1210	{
		1211	socket.send_packet (sl);
		1212	socket.sent_scroll = 0;
		1213	}
		1214	}
1406		1215
1407	/*****************************************************************************/	1216	/*****************************************************************************/
1408
1409	/* GROS: The following one is used to allow a plugin to send a generic cmd to*/	1217	/* GROS: The following one is used to allow a plugin to send a generic cmd to*/
1410
1411	/* a player. Of course, the client need to know the command to be able to */	1218	/* a player. Of course, the client need to know the command to be able to */
1412
1413	/* manage it ! */	1219	/* manage it ! */
1414
1415	/*****************************************************************************/	1220	/*****************************************************************************/
1416	void	1221	void
1417	send_plugin_custom_message (object *pl, char *buf)	1222	send_plugin_custom_message (object *pl, char *buf)
1418	{	1223	{
1419	pl->contr->ns->send_packet (buf);	1224	pl->contr->ns->send_packet (buf);
…		…
1428	{	1233	{
1429	packet sl;	1234	packet sl;
1430	sl << "replyinfo skill_info\n";	1235	sl << "replyinfo skill_info\n";
1431		1236
1432	for (int i = 1; i < NUM_SKILLS; i++)	1237	for (int i = 1; i < NUM_SKILLS; i++)
1433	sl.printf ("%d:%s\n", i + CS_STAT_SKILLINFO, &skill_names[i]);	1238	sl.printf ("%d:%s\n", i + CS_STAT_SKILLINFO, &skill_names [i]);
1434		1239
1435	if (sl.length () >= MAXSOCKBUF)	1240	if (sl.length () > MAXSOCKBUF)
1436	{	1241	{
1437	LOG (llevError, "Buffer overflow in send_skill_info!\n");	1242	LOG (llevError, "Buffer overflow in send_skill_info!\n");
1438	fatal (0);	1243	fatal (0);
1439	}	1244	}
1440		1245
…		…
1453	sl << "replyinfo spell_paths\n";	1258	sl << "replyinfo spell_paths\n";
1454		1259
1455	for (int i = 0; i < NRSPELLPATHS; i++)	1260	for (int i = 0; i < NRSPELLPATHS; i++)
1456	sl.printf ("%d:%s\n", 1 << i, spellpathnames[i]);	1261	sl.printf ("%d:%s\n", 1 << i, spellpathnames[i]);
1457		1262
1458	if (sl.length () >= MAXSOCKBUF)	1263	if (sl.length () > MAXSOCKBUF)
1459	{	1264	{
1460	LOG (llevError, "Buffer overflow in send_spell_paths!\n");	1265	LOG (llevError, "Buffer overflow in send_spell_paths!\n");
1461	fatal (0);	1266	fatal (0);
1462	}	1267	}
1463		1268
…		…
1482	if (spell->type == SPELL)	1287	if (spell->type == SPELL)
1483	{	1288	{
1484	int flags = 0;	1289	int flags = 0;
1485		1290
1486	/* check if we need to update it */	1291	/* check if we need to update it */
1487	if (spell->last_sp != SP_level_spellpoint_cost (pl->ob, spell, SPELL_MANA))	1292	if (spell->cached_sp != SP_level_spellpoint_cost (pl->ob, spell, SPELL_MANA))
1488	{	1293	{
1489	spell->last_sp = SP_level_spellpoint_cost (pl->ob, spell, SPELL_MANA);	1294	spell->cached_sp = SP_level_spellpoint_cost (pl->ob, spell, SPELL_MANA);
1490	flags |= UPD_SP_MANA;	1295	flags |= UPD_SP_MANA;
1491	}	1296	}
1492		1297
1493	if (spell->last_grace != SP_level_spellpoint_cost (pl->ob, spell, SPELL_GRACE))	1298	if (spell->cached_grace != SP_level_spellpoint_cost (pl->ob, spell, SPELL_GRACE))
1494	{	1299	{
1495	spell->last_grace = SP_level_spellpoint_cost (pl->ob, spell, SPELL_GRACE);	1300	spell->cached_grace = SP_level_spellpoint_cost (pl->ob, spell, SPELL_GRACE);
1496	flags |= UPD_SP_GRACE;	1301	flags |= UPD_SP_GRACE;
1497	}	1302	}
1498		1303
1499	if (spell->last_eat != spell->stats.dam + SP_level_dam_adjust (pl->ob, spell))	1304	if (spell->cached_eat != spell->stats.dam + SP_level_dam_adjust (pl->ob, spell))
1500	{	1305	{
1501	spell->last_eat = spell->stats.dam + SP_level_dam_adjust (pl->ob, spell);	1306	spell->cached_eat = spell->stats.dam + SP_level_dam_adjust (pl->ob, spell);
1502	flags |= UPD_SP_DAMAGE;	1307	flags |= UPD_SP_DAMAGE;
1503	}	1308	}
1504		1309
1505	if (flags)	1310	if (flags)
1506	{	1311	{
…		…
1508		1313
1509	sl << "updspell "	1314	sl << "updspell "
1510	<< uint8 (flags)	1315	<< uint8 (flags)
1511	<< uint32 (spell->count);	1316	<< uint32 (spell->count);
1512		1317
1513	if (flags & UPD_SP_MANA ) sl << uint16 (spell->last_sp);	1318	if (flags & UPD_SP_MANA ) sl << uint16 (spell->cached_sp);
1514	if (flags & UPD_SP_GRACE ) sl << uint16 (spell->last_grace);	1319	if (flags & UPD_SP_GRACE ) sl << uint16 (spell->cached_grace);
1515	if (flags & UPD_SP_DAMAGE) sl << uint16 (spell->last_eat);	1320	if (flags & UPD_SP_DAMAGE) sl << uint16 (spell->cached_eat);
1516		1321
1517	pl->ns->send_packet (sl);	1322	pl->ns->send_packet (sl);
1518	}	1323	}
1519	}	1324	}
1520	}	1325	}
…		…
1550	LOG (llevError, "item number %d is a spell with no name.\n", spell->count);	1355	LOG (llevError, "item number %d is a spell with no name.\n", spell->count);
1551	return;	1356	return;
1552	}	1357	}
1553		1358
1554	/* store costs and damage in the object struct, to compare to later */	1359	/* store costs and damage in the object struct, to compare to later */
1555	spell->last_sp = SP_level_spellpoint_cost (pl->ob, spell, SPELL_MANA);	1360	spell->cached_sp = SP_level_spellpoint_cost (pl->ob, spell, SPELL_MANA);
1556	spell->last_grace = SP_level_spellpoint_cost (pl->ob, spell, SPELL_GRACE);	1361	spell->cached_grace = SP_level_spellpoint_cost (pl->ob, spell, SPELL_GRACE);
1557	spell->last_eat = spell->stats.dam + SP_level_dam_adjust (pl->ob, spell);	1362	spell->cached_eat = spell->stats.dam + SP_level_dam_adjust (pl->ob, spell);
1558		1363
1559	/* figure out which skill it uses, if it uses one */	1364	/* figure out which skill it uses, if it uses one */
1560	if (spell->skill)	1365	if (spell->skill)
1561	{	1366	if (object *tmp = pl->find_skill (spell->skill))
1562	for (i = 1; i < NUM_SKILLS; i++)
1563	if (!strcmp (spell->skill, skill_names[i]))
1564	{
1565	skill = i + CS_STAT_SKILLINFO;	1367	skill = tmp->subtype + CS_STAT_SKILLINFO;
1566	break;
1567	}
1568	}
1569		1368
1570	// spells better have a face	1369	// spells better have a face
1571	if (!spell->face)	1370	if (!spell->face)
1572	{	1371	{
1573	LOG (llevError, "%s: spell has no face, but face is mandatory.\n", &spell->name);	1372	LOG (llevError, "%s: spell has no face, but face is mandatory.\n", &spell->name);
1574	spell->face = face_find ("burnout.x11", blank_face);	1373	spell->face = face_find ("burnout.x11", blank_face);
1575	}	1374	}
		1375
		1376	pl->ns->send_face (spell->face);
1576		1377
1577	/* send the current values */	1378	/* send the current values */
1578	sl << uint32 (spell->count)	1379	sl << uint32 (spell->count)
1579	<< uint16 (spell->level)	1380	<< uint16 (spell->level)
1580	<< uint16 (spell->casting_time)	1381	<< uint16 (spell->casting_time)
1581	<< uint16 (spell->last_sp)	1382	<< uint16 (spell->cached_sp)
1582	<< uint16 (spell->last_grace)	1383	<< uint16 (spell->cached_grace)
1583	<< uint16 (spell->last_eat)	1384	<< uint16 (spell->cached_eat)
1584	<< uint8 (skill)	1385	<< uint8 (skill)
1585	<< uint32 (spell->path_attuned)	1386	<< uint32 (spell->path_attuned)
1586	<< uint32 (spell->face)	1387	<< uint32 (spell->face)
1587	<< data8 (spell->name)	1388	<< data8 (spell->name)
1588	<< data16 (spell->msg);	1389	<< data16 (spell->msg);
…		…
1616	* bytes and 3 strings (because that is the spec) so we need to	1417	* bytes and 3 strings (because that is the spec) so we need to
1617	* check that the length of those 3 strings, plus the 23 bytes,	1418	* check that the length of those 3 strings, plus the 23 bytes,
1618	* won't take us over the length limit for the socket, if it does,	1419	* won't take us over the length limit for the socket, if it does,
1619	* we need to send what we already have, and restart packet formation	1420	* we need to send what we already have, and restart packet formation
1620	*/	1421	*/
		1422	if (spell->type != SPELL)
		1423	continue;
		1424
1621	/* Seeing crashes by overflowed buffers. Quick arithemetic seems	1425	/* Seeing crashes by overflowed buffers. Quick arithemetic seems
1622	* to show add_spell is 26 bytes + 2 strings. However, the overun	1426	* to show add_spell is 26 bytes + 2 strings. However, the overun
1623	* is hundreds of bytes off, so correcting 22 vs 26 doesn't seem	1427	* is hundreds of bytes off, so correcting 22 vs 26 doesn't seem
1624	* like it will fix this	1428	* like it will fix this
1625	*/	1429	*/
1626	if (spell->type != SPELL)
1627	continue;
1628
1629	if (sl.length () >= (MAXSOCKBUF - (26 + strlen (spell->name) + (spell->msg ? strlen (spell->msg) : 0))))	1430	if (sl.length () > (MAXSOCKBUF - (26 + strlen (spell->name) + (spell->msg ? strlen (spell->msg) : 0))))
1630	{	1431	{
		1432	pl->ns->flush_fx ();
1631	pl->ns->send_packet (sl);	1433	pl->ns->send_packet (sl);
1632		1434
1633	sl.reset ();	1435	sl.reset ();
1634	sl << "addspell ";	1436	sl << "addspell ";
1635	}	1437	}
…		…
1643	return;	1445	return;
1644	}	1446	}
1645	else	1447	else
1646	append_spell (pl, sl, spell);	1448	append_spell (pl, sl, spell);
1647		1449
1648	if (sl.length () >= MAXSOCKBUF)	1450	if (sl.length () > MAXSOCKBUF)
1649	{	1451	{
1650	LOG (llevError, "Buffer overflow in esrv_add_spells!\n");	1452	LOG (llevError, "Buffer overflow in esrv_add_spells!\n");
1651	fatal (0);	1453	fatal (0);
1652	}	1454	}
1653		1455
1654	/* finally, we can send the packet */	1456	/* finally, we can send the packet */
		1457	pl->ns->flush_fx ();
1655	pl->ns->send_packet (sl);	1458	pl->ns->send_packet (sl);
1656	}	1459	}
1657		1460

Diff Legend

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