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.118 by root, Sun Jul 29 19:11:47 2007 UTC vs.
Revision 1.190 by root, Sun Nov 4 01:01:13 2012 UTC

1	/*	1	/*
2	* This file is part of Crossfire TRT, the Roguelike Realtime MORPG.	2	* This file is part of Deliantra, the Roguelike Realtime MMORPG.
3	*	3	*
4	* Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Crossfire TRT team	4	* Copyright (©) 2005,2006,2007,2008,2009,2010,2011,2012 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
5	* Copyright (©) 2001,2007 Mark Wedel	5	* Copyright (©) 2001 Mark Wedel
6	* Copyright (©) 1992,2007 Frank Tore Johansen	6	* Copyright (©) 1992 Frank Tore Johansen
7	*	7	*
8	* Crossfire TRT 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 3 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, see <http://www.gnu.org/licenses/>.	19	* and the GNU General Public License along with this program. If not, see
		20	* <http://www.gnu.org/licenses/>.
20	*	21	*
21	* The authors can be reached via e-mail to <crossfire@schmorp.de>	22	* The authors can be reached via e-mail to <support@deliantra.net>
22	*/	23	*/
		24
		25	//+GPL
23		26
24	/**	27	/**
25	* \file	28	* \file
26	* Client handling.	29	* Client handling.
27	*	30	*
…		…
41		44
42	#include <global.h>	45	#include <global.h>
43	#include <sproto.h>	46	#include <sproto.h>
44		47
45	#include <living.h>	48	#include <living.h>
46	#include <commands.h>
47		49
48	/* This block is basically taken from socket.c - I assume if it works there,	50	/* This block is basically taken from socket.c - I assume if it works there,
49	* it should work here.	51	* it should work here.
50	*/	52	*/
51	#include <sys/types.h>	53	#include <sys/types.h>
…		…
63	* This table translates the attack numbers as used within the	65	* This table translates the attack numbers as used within the
64	* program to the value we use when sending STATS command to the	66	* program to the value we use when sending STATS command to the
65	* client. If a value is -1, then we don't send that to the	67	* client. If a value is -1, then we don't send that to the
66	* client.	68	* client.
67	*/	69	*/
68	short atnr_cs_stat[NROFATTACKS] = { CS_STAT_RES_PHYS,	70	static short atnr_cs_stat[NROFATTACKS] =
69	CS_STAT_RES_MAG, CS_STAT_RES_FIRE, CS_STAT_RES_ELEC,	71	{
70	CS_STAT_RES_COLD, CS_STAT_RES_CONF, CS_STAT_RES_ACID,	72	CS_STAT_RES_PHYS,
71	CS_STAT_RES_DRAIN, -1 /* weaponmagic */ ,	73	CS_STAT_RES_MAG,
72	CS_STAT_RES_GHOSTHIT, CS_STAT_RES_POISON,	74	CS_STAT_RES_FIRE,
73	CS_STAT_RES_SLOW, CS_STAT_RES_PARA, CS_STAT_TURN_UNDEAD,	75	CS_STAT_RES_ELEC,
74	CS_STAT_RES_FEAR, -1 /* Cancellation */ ,	76	CS_STAT_RES_COLD,
75	CS_STAT_RES_DEPLETE, CS_STAT_RES_DEATH,	77	CS_STAT_RES_CONF,
76	-1 /* Chaos */ , -1 /* Counterspell */ ,	78	CS_STAT_RES_ACID,
77	-1 /* Godpower */ , CS_STAT_RES_HOLYWORD,	79	CS_STAT_RES_DRAIN,
		80	-1 /* weaponmagic */,
		81	CS_STAT_RES_GHOSTHIT,
		82	CS_STAT_RES_POISON,
		83	CS_STAT_RES_SLOW,
		84	CS_STAT_RES_PARA,
		85	CS_STAT_TURN_UNDEAD,
		86	CS_STAT_RES_FEAR,
		87	-1 /* Cancellation */,
		88	CS_STAT_RES_DEPLETE,
		89	CS_STAT_RES_DEATH,
		90	-1 /* Chaos */,
		91	-1 /* Counterspell */,
		92	-1 /* Godpower */,
		93	CS_STAT_RES_HOLYWORD,
78	CS_STAT_RES_BLIND,	94	CS_STAT_RES_BLIND,
79	-1, /* Internal */	95	-1, /* Internal */
80	-1, /* life stealing */	96	-1, /* life stealing */
81	-1 /* Disease - not fully done yet */	97	-1 /* Disease - not fully done yet */
82	};	98	};
…		…
98	*/	114	*/
99	mx = ns->mapx;	115	mx = ns->mapx;
100	my = ns->mapy;	116	my = ns->mapy;
101		117
102	/* the x and y here are coordinates for the new map, i.e. if we moved	118	/* the x and y here are coordinates for the new map, i.e. if we moved
103	* (dx,dy), newmap[x][y] = oldmap[x-dx][y-dy]. For this reason,	119	* (dx,dy), newmap[x][y] = oldmap[x-dx][y-dy]. For this reason,
104	* if the destination x or y coordinate is outside the viewable	120	* if the destination x or y coordinate is outside the viewable
105	* area, we clear the values - otherwise, the old values	121	* area, we clear the values - otherwise, the old values
106	* are preserved, and the check_head thinks it needs to clear them.	122	* are preserved, and the check_head thinks it needs to clear them.
107	*/	123	*/
108	for (x = 0; x < mx; x++)	124	for (x = 0; x < mx; x++)
109	{
110	for (y = 0; y < my; y++)	125	for (y = 0; y < my; y++)
111	{
112	if (x >= ns->mapx || y >= ns->mapy)	126	if (x >= ns->mapx || y >= ns->mapy)
113	/* clear cells outside the viewable area */	127	/* clear cells outside the viewable area */
114	memset (&newmap.cells[x][y], 0, sizeof (struct MapCell));	128	memset (&newmap.cells[x][y], 0, sizeof (struct MapCell));
115	else if ((x + dx) < 0 || (x + dx) >= ns->mapx || (y + dy) < 0 || (y + dy) >= ns->mapy)	129	else if ((x + dx) < 0 || (x + dx) >= ns->mapx || (y + dy) < 0 || (y + dy) >= ns->mapy)
116	/* clear newly visible tiles within the viewable area */	130	/* clear newly visible tiles within the viewable area */
117	memset (&(newmap.cells[x][y]), 0, sizeof (struct MapCell));	131	memset (&(newmap.cells[x][y]), 0, sizeof (struct MapCell));
118	else	132	else
119	memcpy (&(newmap.cells[x][y]), &(ns->lastmap.cells[x + dx][y + dy]), sizeof (struct MapCell));	133	memcpy (&(newmap.cells[x][y]), &(ns->lastmap.cells[x + dx][y + dy]), sizeof (struct MapCell));
120	}
121	}
122		134
123	memcpy (&(ns->lastmap), &newmap, sizeof (struct Map));	135	memcpy (&(ns->lastmap), &newmap, sizeof (struct Map));
124		136
125	/* Make sure that the next "map1" command will be sent (even if it is	137	/* Make sure that the next "map1" command will be sent (even if it is
126	* empty).	138	* empty).
…		…
129	}	141	}
130		142
131	static void	143	static void
132	clear_map (player *pl)	144	clear_map (player *pl)
133	{	145	{
		146	pl->ns->mapinfo_queue_clear ();
		147
134	memset (&pl->ns->lastmap, 0, sizeof (pl->ns->lastmap));	148	memset (&pl->ns->lastmap, 0, sizeof (pl->ns->lastmap));
135		149
136	pl->ns->force_newmap = false;	150	pl->ns->force_newmap = false;
137
138	if (pl->ns->newmapcmd == 1)
139	pl->ns->send_packet ("newmap");	151	pl->ns->send_packet ("newmap");
140
141	pl->ns->floorbox_reset ();	152	pl->ns->floorbox_reset ();
		153	}
		154
		155	static void
		156	send_map_info (player *pl)
		157	{
		158	client &socket = *pl->ns;
		159	object *ob = pl->viewpoint;
		160
		161	if (socket.mapinfocmd)
		162	{
		163	if (ob->map && ob->map->path)
		164	{
		165	int flags = 0;
		166
		167	// due to historical glitches, the bit ordering and map index ordering differs
		168	if (ob->map->tile_path [TILE_NORTH]) flags |= 0x01;
		169	if (ob->map->tile_path [TILE_EAST ]) flags |= 0x02;
		170	if (ob->map->tile_path [TILE_SOUTH]) flags |= 0x04;
		171	if (ob->map->tile_path [TILE_WEST ]) flags |= 0x08;
		172	// these two are debatable
		173	if (ob->map->tile_path [TILE_UP ]) flags |= 0x10;
		174	if (ob->map->tile_path [TILE_DOWN ]) flags |= 0x20;
		175
		176	socket.send_packet_printf ("mapinfo - spatial %d %d %d %d %d %s",
		177	flags, socket.mapx / 2 - ob->x, socket.mapy / 2 - ob->y,
		178	ob->map->width, ob->map->height, &ob->map->path);
		179	}
		180	else
		181	socket.send_packet ("mapinfo current");
		182	}
142	}	183	}
143		184
144	/** check for map/region change and send new map data */	185	/** check for map/region change and send new map data */
145	static void	186	static void
146	check_map_change (player *pl)	187	check_map_change (player *pl)
147	{	188	{
148	client &socket = *pl->ns;	189	client &socket = *pl->ns;
149	object *ob = pl->observe;	190	object *ob = pl->viewpoint;
		191
		192	region *reg = ob->region ();
		193	if (socket.current_region != reg)
		194	{
		195	INVOKE_PLAYER (REGION_CHANGE, pl, ARG_REGION (reg), ARG_REGION (socket.current_region));
		196	socket.current_region = reg;
		197	}
		198
		199	// first try to avoid a full newmap on tiled map scrolls
		200	if (socket.current_map != ob->map && !socket.force_newmap)
		201	{
		202	rv_vector rv;
		203
		204	get_rangevector_from_mapcoord (socket.current_map, socket.current_x, socket.current_y, ob, &rv, 0);
		205
		206	// manhattan distance is very handy here
		207	if (rv.distance < 8) // 8 works nicely for speed << 70 and buggy gcfclient
		208	{
		209	socket.current_map = ob->map;
		210	socket.current_x = ob->x;
		211	socket.current_y = ob->y;
		212
		213	socket_map_scroll (&socket, rv.distance_x, rv.distance_y);
		214	socket.floorbox_reset ();
		215	send_map_info (pl);
		216	}
		217	}
150		218
151	if (socket.current_map != ob->map || socket.force_newmap)	219	if (socket.current_map != ob->map || socket.force_newmap)
152	{	220	{
153	clear_map (pl);	221	clear_map (pl);
154	socket.current_map = ob->map;	222	socket.current_map = ob->map;
155		223	send_map_info (pl);
156	if (socket.mapinfocmd)
157	{
158	if (ob->map && ob->map->path[0])
159	{
160	int flags = 0;
161
162	if (ob->map->tile_path[0]) flags |= 1;
163	if (ob->map->tile_path[1]) flags |= 2;
164	if (ob->map->tile_path[2]) flags |= 4;
165	if (ob->map->tile_path[3]) flags |= 8;
166
167	socket.send_packet_printf ("mapinfo - spatial %d %d %d %d %d %s",
168	flags, socket.mapx / 2 - ob->x, socket.mapy / 2 - ob->y,
169	ob->map->width, ob->map->height, &ob->map->path);
170	}
171	else
172	socket.send_packet ("mapinfo current");
173	}
174	}	224	}
175	else if (socket.current_x != ob->x || socket.current_y != ob->y)	225	else if (socket.current_x != ob->x || socket.current_y != ob->y)
176	{	226	{
177	int dx = ob->x - socket.current_x;	227	int dx = ob->x - socket.current_x;
178	int dy = ob->y - socket.current_y;	228	int dy = ob->y - socket.current_y;
179		229
180	if (socket.buggy_mapscroll && (abs (dx) > 8 || abs (dy) > 8))
181	clear_map (pl); // current (<= 1.9.1) clients have unchecked buffer overflows
182	else
183	{
184	socket_map_scroll (&socket, ob->x - socket.current_x, ob->y - socket.current_y);	230	socket_map_scroll (&socket, ob->x - socket.current_x, ob->y - socket.current_y);
185	socket.floorbox_reset ();	231	socket.floorbox_reset ();
186	}
187	}	232	}
188		233
189	socket.current_x = ob->x;	234	socket.current_x = ob->x;
190	socket.current_y = ob->y;	235	socket.current_y = ob->y;
		236	}
191		237
192	region *reg = ob->region ();	238	/**
193	if (socket.current_region != reg)	239	* This sends the skill number to name mapping. We ignore
194	{	240	* the params - we always send the same info no matter what.
195	INVOKE_PLAYER (REGION_CHANGE, pl, ARG_REGION (reg), ARG_REGION (socket.current_region));	241	*/
196	socket.current_region = reg;	242	static void
197	}	243	send_skill_info (client *ns, char *params)
		244	{
		245	packet sl;
		246	sl << "replyinfo skill_info\n";
		247
		248	for (int i = 0; i < skillvec.size (); ++i)
		249	sl.printf ("%d:%s\n", CS_STAT_SKILLINFO + i, &skillvec [i]->name);
		250
		251	if (sl.length () > MAXSOCKBUF)
		252	cleanup ("buffer overflow in send_skill_info!");
		253
		254	ns->send_packet (sl);
		255	}
		256
		257	/**
		258	* This sends the spell path to name mapping. We ignore
		259	* the params - we always send the same info no matter what.
		260	*/
		261	static void
		262	send_spell_paths (client * ns, char *params)
		263	{
		264	packet sl;
		265
		266	sl << "replyinfo spell_paths\n";
		267
		268	for (int i = 0; i < NRSPELLPATHS; i++)
		269	sl.printf ("%d:%s\n", 1 << i, spellpathnames[i]);
		270
		271	if (sl.length () > MAXSOCKBUF)
		272	cleanup ("buffer overflow in send_spell_paths!");
		273
		274	ns->send_packet (sl);
198	}	275	}
199		276
200	/**	277	/**
201	* RequestInfo is sort of a meta command. There is some specific	278	* RequestInfo is sort of a meta command. There is some specific
202	* request of information, but we call other functions to provide	279	* request of information, but we call other functions to provide
203	* that information.	280	* that information.
		281	* requestinfo is completely deprecated, use resource exti request
		282	* and the fxix or http protocols.
204	*/	283	*/
205	void	284	void
206	RequestInfo (char *buf, int len, client *ns)	285	RequestInfo (char *buf, int len, client *ns)
207	{	286	{
208	char *params;	287	char *params;
…		…
215	{	294	{
216	*params++ = 0;	295	*params++ = 0;
217	break;	296	break;
218	}	297	}
219		298
220	if (!strcmp (buf, "image_info"))
221	send_image_info (ns, params);
222	else if (!strcmp (buf, "image_sums"))
223	send_image_sums (ns, params);
224	else if (!strcmp (buf, "skill_info"))	299	if (!strcmp (buf, "skill_info"))
225	send_skill_info (ns, params);	300	send_skill_info (ns, params);
226	else if (!strcmp (buf, "spell_paths"))	301	else if (!strcmp (buf, "spell_paths"))
227	send_spell_paths (ns, params);	302	send_spell_paths (ns, params);
228	else	303	else
229	{	304	{
…		…
245	ExtiCmd (char *buf, int len, client *ns)	320	ExtiCmd (char *buf, int len, client *ns)
246	{	321	{
247	INVOKE_CLIENT (EXTICMD, ns, ARG_DATA (buf, len));	322	INVOKE_CLIENT (EXTICMD, ns, ARG_DATA (buf, len));
248	}	323	}
249		324
		325	//-GPL
		326
		327	void
		328	client::mapinfo_queue_clear ()
		329	{
		330	for (auto (i, mapinfo_queue.begin ()); i != mapinfo_queue.end (); ++i)
		331	free (*i);
		332
		333	mapinfo_queue.clear ();
		334	}
		335
		336	bool
		337	client::mapinfo_try (char *buf)
		338	{
		339	char *token = buf;
		340	buf += strlen (buf) + 9;
		341
		342	// initial map and its origin
		343	maptile *map = pl->viewpoint->map;
		344	int mapx = pl->ns->mapx / 2 - pl->viewpoint->x;
		345	int mapy = pl->ns->mapy / 2 - pl->viewpoint->y;
		346	int max_distance = 8; // limit maximum path length to something generous
		347
		348	while (*buf && map && max_distance)
		349	{
		350	int dir = *buf++ - '1';
		351
		352	// due to historical glitches, the mapinfo index and tile index differs
		353	static unsigned char dirmap [] = { TILE_NORTH, TILE_EAST, TILE_SOUTH, TILE_WEST, TILE_UP, TILE_DOWN };
		354
		355	// maybe we should only allow the four flat directions
		356	if (IN_RANGE_EXC (dir, 0, array_length (dirmap)))
		357	{
		358	dir = dirmap [dir];
		359
		360	if (!map->tile_path [dir])
		361	map = 0;
		362	else if (map->tile_available (dir, false))
		363	{
		364	maptile *neigh = map->tile_map [dir];
		365
		366	switch (dir)
		367	{
		368	case 0: mapy -= neigh->height; break;
		369	case 2: mapy += map ->height; break;
		370	case 3: mapx -= neigh->width ; break;
		371	case 1: mapx += map ->width ; break;
		372	}
		373
		374	map = neigh;
		375	--max_distance;
		376	}
		377	else
		378	return 0;
		379	}
		380	else
		381	max_distance = 0;
		382	}
		383
		384	if (!max_distance)
		385	send_packet_printf ("mapinfo %s error", token);
		386	else if (!map || !map->path)
		387	send_packet_printf ("mapinfo %s nomap", token);
		388	else
		389	{
		390	int flags = 0;
		391
		392	// due to historical glitches, the bit ordering and map index ordering differs
		393	if (map->tile_path [TILE_NORTH]) flags |= 0x01;
		394	if (map->tile_path [TILE_EAST ]) flags |= 0x02;
		395	if (map->tile_path [TILE_SOUTH]) flags |= 0x04;
		396	if (map->tile_path [TILE_WEST ]) flags |= 0x08;
		397	// these two are debatable
		398	if (map->tile_path [TILE_UP ]) flags |= 0x10;
		399	if (map->tile_path [TILE_DOWN ]) flags |= 0x20;
		400
		401	send_packet_printf ("mapinfo %s spatial %d %d %d %d %d %s", token, flags, mapx, mapy, map->width, map->height, &map->path);
		402	}
		403
		404	return 1;
		405	}
		406
		407	void
		408	client::mapinfo_queue_run ()
		409	{
		410	if (mapinfo_queue.empty () || !pl)
		411	return;
		412
		413	for (int i = 0; i < mapinfo_queue.size (); ++i)
		414	if (mapinfo_try (mapinfo_queue [i]))
		415	{
		416	free (mapinfo_queue [i]);
		417	mapinfo_queue.erase (i);
		418	}
		419	else
		420	++i;
		421	}
		422
250	void	423	void
251	MapInfoCmd (char *buf, int len, player *pl)	424	MapInfoCmd (char *buf, int len, player *pl)
252	{	425	{
253	// <mapinfo tag spatial tile-path	426	// <mapinfo tag spatial tile-path
254	// >mapinfo tag spatial flags x y w h hash	427	// >mapinfo tag spatial flags x y w h hash
255		428
256	char bigbuf[MAX_BUF], *token;
257
258	token = buf;	429	char *token = buf;
259	// copy token	430
260	if (!(buf = strchr (buf, ' ')))	431	if (!(buf = strchr (buf, ' ')))
261	return;	432	return;
262		433
263	*buf++ = 0;
264
265	if (!strncmp (buf, "spatial ", 8))	434	if (!strncmp (buf, " spatial ", 9))
266	{	435	{
267	buf += 8;	436	char *copy = strdup (token);
		437	copy [buf - token] = 0;
268		438
269	// initial map and its origin	439	#if 0
270	maptile *map = pl->ob->map;	440	// this makes only sense when we flush the buffer immediately
271	sint16 dx, dy;	441	if (pl->ns->mapinfo_try (copy))
272	int mapx = pl->ns->mapx / 2 - pl->ob->x;	442	free (copy);
273	int mapy = pl->ns->mapy / 2 - pl->ob->y;
274	int max_distance = 8; // limit maximum path length to something generous
275
276	while (*buf && map && max_distance)
277	{
278	int dir = *buf++;
279
280	switch (dir)
281	{
282	case '1':
283	dx = 0;
284	dy = -1;
285	map = map->xy_find (dx, dy);
286	map && (mapy -= map->height);
287	break;
288	case '2':
289	mapx += map->width;
290	dx = map->width;
291	dy = 0;
292	map = map->xy_find (dx, dy);
293	break;
294	case '3':
295	mapy += map->height;
296	dx = 0;
297	dy = map->height;
298	map = map->xy_find (dx, dy);
299	break;
300	case '4':
301	dx = -1;
302	dy = 0;
303	map = map->xy_find (dx, dy);
304	map && (mapx -= map->width);
305	break;
306	}
307
308	--max_distance;
309	}
310
311	if (!max_distance)
312	snprintf (bigbuf, MAX_BUF, "mapinfo %s error", token);
313	else if (map && map->path[0])
314	{
315	int flags = 0;
316
317	if (map->tile_path[0]) flags |= 1;
318	if (map->tile_path[1]) flags |= 2;
319	if (map->tile_path[2]) flags |= 4;
320	if (map->tile_path[3]) flags |= 8;
321
322	snprintf (bigbuf, MAX_BUF, "mapinfo %s spatial %d %d %d %d %d %s", token, flags, mapx, mapy, map->width, map->height, &map->path);
323	}
324	else	443	else
325	snprintf (bigbuf, MAX_BUF, "mapinfo %s nomap", token);	444	#endif
		445	pl->ns->mapinfo_queue.push_back (copy);
326	}	446	}
327	else	447	else
328	snprintf (bigbuf, MAX_BUF, "mapinfo %s unsupported", token);	448	pl->ns->send_packet_printf ("mapinfo %s unsupported", token);
329
330	pl->ns->send_packet (bigbuf);
331	}	449	}
332		450
333	/** This is the Setup cmd */	451	/** This is the Setup cmd */
334	void	452	void
335	SetUp (char *buf, int len, client * ns)	453	SetUp (char *buf, int len, client * ns)
…		…
347	AddMeCmd (char *buf, int len, client *ns)	465	AddMeCmd (char *buf, int len, client *ns)
348	{	466	{
349	INVOKE_CLIENT (ADDME, ns, ARG_DATA (buf, len));	467	INVOKE_CLIENT (ADDME, ns, ARG_DATA (buf, len));
350	}	468	}
351		469
352	/** Reply to ExtendedInfos command */	470	//+GPL
353	void
354	ToggleExtendedInfos (char *buf, int len, client * ns)
355	{
356	char cmdback[MAX_BUF];
357	char command[50];
358	int info, nextinfo;
359
360	cmdback[0] = '\0';
361	nextinfo = 0;
362
363	while (1)
364	{
365	/* 1. Extract an info */
366	info = nextinfo;
367
368	while ((info < len) && (buf[info] == ' '))
369	info++;
370
371	if (info >= len)
372	break;
373
374	nextinfo = info + 1;
375
376	while ((nextinfo < len) && (buf[nextinfo] != ' '))
377	nextinfo++;
378
379	if (nextinfo - info >= 49) /*Erroneous info asked */
380	continue;
381
382	strncpy (command, &(buf[info]), nextinfo - info);
383
384	/* 2. Interpret info */
385	if (!strcmp ("smooth", command))
386	/* Toggle smoothing */
387	ns->EMI_smooth = !ns->EMI_smooth;
388	else
389	/*bad value */;
390
391	/*3. Next info */
392	}
393
394	strcpy (cmdback, "ExtendedInfoSet");
395
396	if (ns->EMI_smooth)
397	{
398	strcat (cmdback, " ");
399	strcat (cmdback, "smoothing");
400	}
401
402	ns->send_packet (cmdback);
403	}
404
405	/*
406	#define MSG_TYPE_BOOK 1
407	#define MSG_TYPE_CARD 2
408	#define MSG_TYPE_PAPER 3
409	#define MSG_TYPE_SIGN 4
410	#define MSG_TYPE_MONUMENT 5
411	#define MSG_TYPE_SCRIPTED_DIALOG 6*/
412
413	/** Reply to ExtendedInfos command */
414	void
415	ToggleExtendedText (char *buf, int len, client * ns)
416	{
417	char cmdback[MAX_BUF];
418	char temp[10];
419	char command[50];
420	int info, nextinfo, i, flag;
421
422	cmdback[0] = '\0';
423
424	nextinfo = 0;
425	while (1)
426	{
427	/* 1. Extract an info */
428	info = nextinfo;
429
430	while ((info < len) && (buf[info] == ' '))
431	info++;
432
433	if (info >= len)
434	break;
435
436	nextinfo = info + 1;
437
438	while ((nextinfo < len) && (buf[nextinfo] != ' '))
439	nextinfo++;
440
441	if (nextinfo - info >= 49) /*Erroneous info asked */
442	continue;
443
444	strncpy (command, &(buf[info]), nextinfo - info);
445	command[nextinfo - info] = '\0';
446	/* 2. Interpret info */
447	i = sscanf (command, "%d", &flag);
448
449	if ((i == 1) && (flag > 0) && (flag <= MSG_TYPE_LAST))
450	ns->supported_readables |= (1 << flag);
451	/*3. Next info */
452	}
453
454	/* Send resulting state */
455	strcpy (cmdback, "ExtendedTextSet");
456
457	for (i = 0; i <= MSG_TYPE_LAST; i++)
458	if (ns->supported_readables & (1 << i))
459	{
460	strcat (cmdback, " ");
461	snprintf (temp, sizeof (temp), "%d", i);
462	strcat (cmdback, temp);
463	}
464
465	ns->send_packet (cmdback);
466	}
467		471
468	/**	472	/**
469	* This handles the general commands from the client (ie, north, fire, cast,	473	* This handles the general commands from the client (ie, north, fire, cast,
470	* etc.)	474	* etc.)
471	*/	475	*/
…		…
484	return;	488	return;
485		489
486	buf++;	490	buf++;
487	}	491	}
488		492
489	execute_newserver_command (pl->ob, (char *) buf);	493	execute_newserver_command (pl->ob, (char *)buf);
490		494
491	/* Perhaps something better should be done with a left over count.	495	/* Perhaps something better should be done with a left over count.
492	* Cleaning up the input should probably be done first - all actions	496	* Cleaning up the input should probably be done first - all actions
493	* for the command that issued the count should be done before any other	497	* for the command that issued the count should be done before any other
494	* commands.	498	* commands.
…		…
528	* commands.	532	* commands.
529	*/	533	*/
530	pl->count = 0;	534	pl->count = 0;
531		535
532	//TODO: schmorp thinks whatever this calculates, it makes no sense at all	536	//TODO: schmorp thinks whatever this calculates, it makes no sense at all
533	int time = fabs (pl->ob->speed) < 0.001	537	int time = pl->ob->has_active_speed ()
534	? time = MAX_TIME * 100
535	: time = (int) (MAX_TIME / fabs (pl->ob->speed));	538	? (int) (MAX_TIME / pl->ob->speed)
		539	: MAX_TIME * 100;
536		540
537	/* Send confirmation of command execution now */	541	/* Send confirmation of command execution now */
538	packet sl ("comc");	542	packet sl ("comc");
539	sl << uint16 (cmdid) << uint32 (time);	543	sl << uint16 (cmdid) << uint32 (time);
540	pl->ns->send_packet (sl);	544	pl->ns->send_packet (sl);
…		…
582	LOG (llevError, "Unknown input state: %d\n", ns->state);	586	LOG (llevError, "Unknown input state: %d\n", ns->state);
583	}	587	}
584	}	588	}
585		589
586	/**	590	/**
587	* Client tells its version. If there is a mismatch, we close the	591	* Client tells its version info.
588	* socket. In real life, all we should care about is the client having
589	* something older than the server. If we assume the client will be
590	* backwards compatible, having it be a later version should not be a
591	* problem.
592	*/	592	*/
593	void	593	void
594	VersionCmd (char *buf, int len, client * ns)	594	VersionCmd (char *buf, int len, client *ns)
595	{	595	{
596	if (!buf)	596	INVOKE_CLIENT (VERSION, ns, ARG_DATA (buf, len));
597	{
598	LOG (llevError, "CS: received corrupted version command\n");
599	return;
600	}
601
602	ns->cs_version = atoi (buf);
603	ns->sc_version = ns->cs_version;
604
605	LOG (llevDebug, "connection from client <%s>\n", buf);
606
607	//TODO: should log here just for statistics
608
609	//if (VERSION_CS != ns->cs_version)
610	// unchecked;
611
612	char *cp = strchr (buf + 1, ' ');
613	if (!cp)
614	return;
615
616	ns->sc_version = atoi (cp);
617
618	//if (VERSION_SC != ns->sc_version)
619	// unchecked;
620
621	cp = strchr (cp + 1, ' ');
622
623	if (cp)
624	{
625	ns->version = cp + 1;
626
627	if (ns->sc_version < 1026)
628	ns->send_packet_printf ("drawinfo %d %s", NDI_RED,
629	"**** VERSION WARNING ****\n**** CLIENT IS TOO OLD!! UPDATE THE CLIENT!! ****");
630	}
631	}	597	}
632		598
633	/** sound related functions. */	599	/** sound related functions. */
634	void	600	void
635	SetSound (char *buf, int len, client * ns)	601	SetSound (char *buf, int len, client * ns)
…		…
653	* syntax is: move (to) (tag) (nrof)	619	* syntax is: move (to) (tag) (nrof)
654	*/	620	*/
655	void	621	void
656	MoveCmd (char *buf, int len, player *pl)	622	MoveCmd (char *buf, int len, player *pl)
657	{	623	{
658	int vals[3], i;	624	int to, tag, nrof;
659		625
660	/* A little funky here. We only cycle for 2 records, because	626	if (3 != sscanf (buf, "%d %d %d", &to, &tag, &nrof))
661	* we obviously are not going to find a space after the third
662	* record. Perhaps we should just replace this with a
663	* sscanf?
664	*/
665	for (i = 0; i < 2; i++)
666	{	627	{
667	vals[i] = atoi (buf);
668
669	if (!(buf = strchr (buf, ' ')))
670	{
671	LOG (llevError, "Incomplete move command: %s\n", buf);	628	LOG (llevError, "Incomplete move command: %s\n", buf);
672	return;	629	return;
673	}
674
675	buf++;
676	}	630	}
677		631
678	vals[2] = atoi (buf);	632	esrv_move_object (pl->ob, to, tag, nrof);
679
680	/* LOG(llevDebug,"Move item %d (nrof=%d) to %d.\n", vals[1], vals[2], vals[0]);*/
681	esrv_move_object (pl->ob, vals[0], vals[1], vals[2]);
682	}	633	}
683		634
684	/******************************************************************************	635	/******************************************************************************
685	*	636	*
686	* Start of commands the server sends to the client.	637	* Start of commands the server sends to the client.
…		…
701	* Get player's current range attack in obuf.	652	* Get player's current range attack in obuf.
702	*/	653	*/
703	static void	654	static void
704	rangetostring (player *pl, char *obuf)	655	rangetostring (player *pl, char *obuf)
705	{	656	{
706	dynbuf_text buf;	657	dynbuf_text &buf = msg_dynbuf; buf.clear ();
		658
		659	#if 0
		660	// print ranged/chosen_skill etc. objects every call
		661	printf ("%s %s => %s (%s)\n",
		662	pl->ranged_ob ? &pl->ranged_ob->name : "-",
		663	pl->combat_ob ? &pl->combat_ob->name : "-",
		664	pl->ob->current_weapon ? &pl->ob->current_weapon->name : "-",
		665	pl->ob->chosen_skill ? &pl->ob->chosen_skill->name : "-"
		666	);
		667	#endif
707		668
708	if (pl->ranged_ob)	669	if (pl->ranged_ob)
709	buf << " Range" << (pl->ob->current_weapon == pl->ranged_ob ? "*" : "") << ": " << pl->ranged_ob->name;	670	buf << " Range" << (pl->ob->current_weapon == pl->ranged_ob ? "*" : "") << ": " << pl->ranged_ob->name;
710		671
711	if (pl->combat_ob)	672	if (pl->combat_ob)
…		…
757	* commands for now.	718	* commands for now.
758	*/	719	*/
759	void	720	void
760	esrv_update_stats (player *pl)	721	esrv_update_stats (player *pl)
761	{	722	{
762	char buf[MAX_BUF];
763	uint16 flags;
764
765	client *ns = pl->ns;	723	client *ns = pl->ns;
766	if (!ns)	724	if (!ns)
767	return;	725	return;
768		726
769	object *ob = pl->observe;	727	object *ob = pl->observe;
…		…
786	AddIfShort (ns->last_stats.Int, ob->stats.Int, CS_STAT_INT);	744	AddIfShort (ns->last_stats.Int, ob->stats.Int, CS_STAT_INT);
787	AddIfShort (ns->last_stats.Wis, ob->stats.Wis, CS_STAT_WIS);	745	AddIfShort (ns->last_stats.Wis, ob->stats.Wis, CS_STAT_WIS);
788	AddIfShort (ns->last_stats.Pow, ob->stats.Pow, CS_STAT_POW);	746	AddIfShort (ns->last_stats.Pow, ob->stats.Pow, CS_STAT_POW);
789	AddIfShort (ns->last_stats.Cha, ob->stats.Cha, CS_STAT_CHA);	747	AddIfShort (ns->last_stats.Cha, ob->stats.Cha, CS_STAT_CHA);
790		748
791	for (int s = 0; s < NUM_SKILLS; s++)	749	for (int s = 0; s < CS_NUM_SKILLS; s++)
792	if (object *skill = opl->last_skill_ob[s])	750	if (object *skill = opl->last_skill_ob [s])
793	if (skill->stats.exp != ns->last_skill_exp [s])	751	if (skill->stats.exp != ns->last_skill_exp [s])
794	{	752	{
795	ns->last_skill_exp [s] = skill->stats.exp;	753	ns->last_skill_exp [s] = skill->stats.exp;
796		754
797	/* Always send along the level if exp changes. This is only	755	/* Always send along the level if exp changes. This is only
798	* 1 extra byte, but keeps processing simpler.	756	* 1 extra byte, but keeps processing simpler.
799	*/	757	*/
800	sl << uint8 (s + CS_STAT_SKILLINFO)	758	sl << uint8 (CS_STAT_SKILLINFO + s)
801	<< uint8 (skill->level)	759	<< uint8 (skill->level)
802	<< uint64 (skill->stats.exp);	760	<< uint64 (skill->stats.exp);
803	}	761	}
804		762
805	AddIfInt64 (ns->last_stats.exp, ob->stats.exp, CS_STAT_EXP64);	763	AddIfInt64 (ns->last_stats.exp, ob->stats.exp, CS_STAT_EXP64);
806	AddIfShort (ns->last_level, ob->level, CS_STAT_LEVEL);	764	AddIfShort (ns->last_level, ob->level, CS_STAT_LEVEL);
807	AddIfShort (ns->last_stats.wc, ob->stats.wc, CS_STAT_WC);	765	AddIfShort (ns->last_stats.wc, ob->stats.wc, CS_STAT_WC);
808	AddIfShort (ns->last_stats.ac, ob->stats.ac, CS_STAT_AC);	766	AddIfShort (ns->last_stats.ac, ob->stats.ac, CS_STAT_AC);
809	AddIfShort (ns->last_stats.dam, ob->stats.dam, CS_STAT_DAM);	767	AddIfShort (ns->last_stats.dam, ob->stats.dam, CS_STAT_DAM);
810	AddIfFloat (ns->last_speed, ob->speed, CS_STAT_SPEED, 1.f/TICK);	768	AddIfFloat (ns->last_speed, ob->speed, CS_STAT_SPEED, 1.f / TICK);
811	AddIfShort (ns->last_stats.food, ob->stats.food, CS_STAT_FOOD);	769	AddIfShort (ns->last_stats.food, ob->stats.food, CS_STAT_FOOD);
812	AddIfFloat (ns->last_weapon_sp, pl->weapon_sp, CS_STAT_WEAP_SP, 1.f/TICK);	770	AddIfFloat (ns->last_weapon_sp, pl->weapon_sp, CS_STAT_WEAP_SP, 1.f / TICK);
813	AddIfInt (ns->last_weight_limit, weight_limit[ob->stats.Str], CS_STAT_WEIGHT_LIM);	771	AddIfInt (ns->last_weight_limit, weight_limit[ob->stats.Str], CS_STAT_WEIGHT_LIM);
814		772
815	flags = 0;	773	int flags = (opl->fire_on ? SF_FIREON : 0)
816		774	| (opl->run_on ? SF_RUNON : 0);
817	if (opl->fire_on)
818	flags |= SF_FIREON;
819
820	if (opl->run_on)
821	flags |= SF_RUNON;
822		775
823	AddIfShort (ns->last_flags, flags, CS_STAT_FLAGS);	776	AddIfShort (ns->last_flags, flags, CS_STAT_FLAGS);
824		777
825	if (ns->sc_version < 1025)
826	{ AddIfShort (ns->last_resist[ATNR_PHYSICAL], ob->resist[ATNR_PHYSICAL], CS_STAT_ARMOUR) }
827	else
828	for (int i = 0; i < NROFATTACKS; i++)	778	for (int i = 0; i < NROFATTACKS; i++)
829	{
830	/* Skip ones we won't send */	779	/* Skip ones we won't send */
831	if (atnr_cs_stat[i] == -1)	780	if (atnr_cs_stat[i] >= 0)
832	continue;
833
834	AddIfShort (ns->last_resist[i], ob->resist[i], atnr_cs_stat[i]);	781	AddIfShort (ns->last_resist[i], ob->resist[i], atnr_cs_stat[i]);
835	}
836		782
837	if (pl->ns->monitor_spells)	783	if (pl->ns->monitor_spells)
838	{	784	{
839	AddIfInt (ns->last_path_attuned, ob->path_attuned, CS_STAT_SPELL_ATTUNE);	785	AddIfInt (ns->last_path_attuned, ob->path_attuned, CS_STAT_SPELL_ATTUNE);
840	AddIfInt (ns->last_path_repelled, ob->path_repelled, CS_STAT_SPELL_REPEL);	786	AddIfInt (ns->last_path_repelled, ob->path_repelled, CS_STAT_SPELL_REPEL);
841	AddIfInt (ns->last_path_denied, ob->path_denied, CS_STAT_SPELL_DENY);	787	AddIfInt (ns->last_path_denied, ob->path_denied, CS_STAT_SPELL_DENY);
842	}	788	}
843		789
		790	char buf[MAX_BUF];
844	rangetostring (opl, buf); /* we want use the new fire & run system in new client */	791	rangetostring (opl, buf); /* we want use the new fire & run system in new client */
845	AddIfString (ns->stats.range, buf, CS_STAT_RANGE);	792	AddIfString (ns->stats.range, buf, CS_STAT_RANGE);
846	set_title (ob, buf);	793	set_title (ob, buf);
847	AddIfString (ns->stats.title, buf, CS_STAT_TITLE);	794	AddIfString (ns->stats.title, buf, CS_STAT_TITLE);
848		795
…		…
853		800
854	/**	801	/**
855	* Tells the client that here is a player it should start using.	802	* Tells the client that here is a player it should start using.
856	*/	803	*/
857	void	804	void
858	esrv_new_player (player *pl, uint32 weight)	805	esrv_new_player (player *pl)
859	{	806	{
		807	sint32 weight = pl->ob->client_weight ();
		808
860	packet sl ("player");	809	packet sl ("player");
861		810
862	sl << uint32 (pl->ob->count)	811	sl << uint32 (pl->ob->count)
863	<< uint32 (weight)	812	<< uint32 (weight)
864	<< uint32 (pl->ob->face)	813	<< uint32 (pl->ob->face)
865	<< data8 (pl->ob->name);	814	<< data8 (pl->ob->name);
866		815
867	pl->ns->last_weight = weight;	816	pl->ns->last_weight = weight;
868	pl->ns->send_packet (sl);	817	pl->ns->send_packet (sl);
869	SET_FLAG (pl->ob, FLAG_CLIENT_SENT);
870	}	818	}
871		819
872	/******************************************************************************	820	/******************************************************************************
873	*	821	*
874	* Start of map related commands.	822	* Start of map related commands.
…		…
942	/* Nothing changed */	890	/* Nothing changed */
943	return 0;	891	return 0;
944	}	892	}
945		893
946	/**	894	/**
947	* Returns the size of a data for a map square as returned by
948	* mapextended. There are CLIENTMAPX*CLIENTMAPY*LAYERS entries
949	* available.
950	*/
951	int
952	getExtendedMapInfoSize (client * ns)
953	{
954	int result = 0;
955
956	if (ns->ext_mapinfos)
957	{
958	if (ns->EMI_smooth)
959	result += 1; /*One byte for smoothlevel */
960	}
961
962	return result;
963	}
964
965	// prefetch (and touch) all maps within a specific distancd
966	static void
967	prefetch_surrounding_maps (maptile *map, int distance)
968	{
969	map->last_access = runtime;
970
971	if (--distance)
972	for (int dir = 4; --dir; )
973	if (const shstr &path = map->tile_path [dir])
974	if (maptile *&neigh = map->tile_map [dir])
975	prefetch_surrounding_maps (neigh, distance);
976	else
977	neigh = maptile::find_async (path, map);
978	}
979
980	// prefetch a generous area around the player
981	static void
982	prefetch_surrounding_maps (object *op)
983	{
984	prefetch_surrounding_maps (op->map, 3);
985	}
986
987	/**
988	* Draws client map.	895	* Draws client map.
989	*/	896	*/
990	void	897	void
991	draw_client_map (player *pl)	898	draw_client_map (player *pl)
992	{	899	{
993	object *ob = pl->observe;	900	object *ob = pl->viewpoint;
994	if (!ob->active)	901	if (!pl->observe->active)
995	return;	902	return;
996
997	maptile *plmap = ob->map;
998		903
999	/* If player is just joining the game, he isn't here yet, so the map	904	/* If player is just joining the game, he isn't here yet, so the map
1000	* can get swapped out. If so, don't try to send them a map. All will	905	* can get swapped out. If so, don't try to send them a map. All will
1001	* be OK once they really log in.	906	* be OK once they really log in.
1002	*/	907	*/
1003	if (!plmap || plmap->in_memory != MAP_IN_MEMORY)	908	if (!ob->map || ob->map->state != MAP_ACTIVE)
1004	return;	909	return;
1005		910
1006	int x, y, ax, ay, startlen, max_x, max_y, oldlen;
1007	int estartlen, eoldlen;	911	int startlen, oldlen;
1008	uint8 eentrysize;
1009	uint16 ewhatstart, ewhatflag;
1010	uint8 extendedinfos;
1011		912
1012	check_map_change (pl);	913	check_map_change (pl);
1013	prefetch_surrounding_maps (pl->ob);	914	pl->ob->prefetch_surrounding_maps ();
1014		915
1015	/* do LOS after calls to update_position */	916	/* do LOS after calls to update_position */
1016	if (ob != pl->ob)	917	/* unfortunately, we need to udpate los when observing, currently */
1017	clear_los (pl);	918	if (pl->do_los || pl->viewpoint != pl->ob)
1018	else if (pl->do_los)
1019	{	919	{
1020	update_los (ob);
1021	pl->do_los = 0;	920	pl->do_los = 0;
		921	pl->update_los ();
1022	}	922	}
1023		923
1024	/**	924	/**
1025	* This function uses the new map1 protocol command to send the map	925	* This function uses the new map1 protocol command to send the map
1026	* to the client. It is necessary because the old map command supports	926	* to the client. It is necessary because the old map command supports
…		…
1044	* look like.	944	* look like.
1045	*/	945	*/
1046		946
1047	client &socket = *pl->ns;	947	client &socket = *pl->ns;
1048		948
1049	packet sl (socket.mapmode == Map1Cmd ? "map1" : "map1a");	949	packet sl ("map1a");
1050	packet esl;
1051		950
1052	startlen = sl.length ();	951	startlen = sl.length ();
1053		952
1054	/*Extendedmapinfo structure initialisation */	953	int hx = socket.mapx / 2;
1055	if (socket.ext_mapinfos)	954	int hy = socket.mapy / 2;
1056	{
1057	extendedinfos = EMI_NOREDRAW;
1058		955
1059	if (socket.EMI_smooth)	956	ordered_mapwalk_begin (ob, -hx, -hy, hx, hy)
1060	extendedinfos |= EMI_SMOOTH;	957	int ax = dx + hx;
		958	int ay = dy + hy;
1061		959
1062	ewhatstart = esl.length ();	960	int mask = (ax << 10) | (ay << 4);
1063	ewhatflag = extendedinfos; /*The EMI_NOREDRAW bit	961	MapCell &lastcell = socket.lastmap.cells[ax][ay];
1064	could need to be taken away */
1065	eentrysize = getExtendedMapInfoSize (&socket);
1066	esl << "mapextended "
1067	<< uint8 (extendedinfos)
1068	<< uint8 (eentrysize);
1069		962
1070	estartlen = esl.length ();	963	/* If the coordinates are not valid, or it is too dark to see,
1071	}	964	* we tell the client as such
1072
1073	/* x,y are the real map locations. ax, ay are viewport relative
1074	* locations.
1075	*/	965	*/
1076	ay = 0;	966	if (!m)
1077
1078	/* We could do this logic as conditionals in the if statement,
1079	* but that started to get a bit messy to look at.
1080	*/
1081	max_x = ob->x + (socket.mapx + 1) / 2;
1082	max_y = ob->y + (socket.mapy + 1) / 2;
1083
1084	for (y = ob->y - socket.mapy / 2; y < max_y; y++, ay++)
1085	{	967	{
1086	sint16 nx, ny;	968	/* space is out of map. Update space and clear values
1087	maptile *m = 0;	969	* if this hasn't already been done. If the space is out
1088		970	* of the map, it shouldn't have a head.
1089	ax = 0;	971	*/
1090	for (x = ob->x - socket.mapx / 2; x < max_x; x++, ax++)	972	if (lastcell.count != -1)
1091	{	973	{
1092	// check to see if we can simply go one right quickly	974	sl << uint16 (mask);
		975	map_clearcell (&lastcell, -1);
1093	++nx;	976	}
1094	if (m && nx >= m->width)	977
		978	continue;
		979	}
		980
		981	int d = pl->blocked_los_uc (dx, dy);
		982
		983	if (d > 3)
		984	{
		985	/* This block deals with spaces that are not visible for whatever
		986	* reason. Still may need to send the head for this space.
		987	*/
		988	if (lastcell.count != -1
		989	|| lastcell.faces[0]
		990	|| lastcell.faces[1]
		991	|| lastcell.faces[2]
		992	|| lastcell.stat_hp
		993	|| lastcell.flags
		994	|| lastcell.player)
		995	sl << uint16 (mask);
		996
		997	/* properly clear a previously sent big face */
		998	map_clearcell (&lastcell, -1);
		999	}
		1000	else
		1001	{
		1002	/* In this block, the space is visible.
		1003	*/
		1004
		1005	/* Rather than try to figure out what everything that we might
		1006	* need to send is, then form the packet after that,
		1007	* we presume that we will in fact form a packet, and update
		1008	* the bits by what we do actually send. If we send nothing,
		1009	* we just back out sl.length () to the old value, and no harm
		1010	* is done.
		1011	* I think this is simpler than doing a bunch of checks to see
		1012	* what if anything we need to send, setting the bits, then
		1013	* doing those checks again to add the real data.
		1014	*/
		1015	oldlen = sl.length ();
		1016
		1017	sl << uint16 (mask);
		1018
		1019	unsigned char dummy;
		1020	unsigned char *last_ext = &dummy;
		1021
		1022	/* Darkness changed */
		1023	if (lastcell.count != d)
		1024	{
1095	m = 0;	1025	mask |= 0x8;
1096		1026
1097	if (!m)	1027	*last_ext |= 0x80;
		1028	last_ext = &sl[sl.length ()];
		1029	sl << uint8 (d);
		1030	}
		1031
		1032	lastcell.count = d;
		1033
		1034	mapspace &ms = m->at (nx, ny);
		1035	ms.update ();
		1036
		1037	// extmap handling
		1038	uint8 stat_hp = 0;
		1039	uint8 stat_width = 0;
		1040	uint8 flags = 0;
		1041	tag_t player = 0;
		1042
		1043	// send hp information, if applicable
		1044	if (object *op = ms.faces_obj [0])
		1045	if (op->is_head () && !op->invisible)
1098	{	1046	{
1099	nx = x; ny = y; m = plmap;	1047	if (op->stats.maxhp > op->stats.hp
1100		1048	&& op->stats.maxhp > 0
1101	if (!xy_normalise (m, nx, ny))	1049	&& (op->type == PLAYER
		1050	|| op->type == DOOR // does not work, have maxhp 0
		1051	|| op->flag [FLAG_MONSTER]
		1052	|| op->flag [FLAG_ALIVE]
		1053	|| op->flag [FLAG_GENERATOR]))
1102	m = 0;	1054	{
		1055	stat_hp = 255 - (op->stats.hp * 255 + 254) / op->stats.maxhp;
		1056	stat_width = op->arch->max_x - op->arch->x; //TODO: should be upper-left edge
		1057	}
		1058
		1059	if (expect_false (op->has_dialogue ()))
		1060	flags |= 1;
		1061
		1062	if (expect_false (op->type == PLAYER))
		1063	player = op == ob ? pl->ob->count
		1064	: op == pl->ob ? ob->count
		1065	: op->count;
1103	}	1066	}
1104		1067
1105	int emask, mask;	1068	if (expect_false (lastcell.stat_hp != stat_hp))
1106	emask = mask = (ax & 0x3f) << 10 | (ay & 0x3f) << 4;
1107
1108	MapCell &lastcell = socket.lastmap.cells[ax][ay];
1109
1110	/* If the coordinates are not valid, or it is too dark to see,
1111	* we tell the client as such
1112	*/
1113	if (!m)
1114	{	1069	{
1115	/* space is out of map. Update space and clear values	1070	lastcell.stat_hp = stat_hp;
1116	* if this hasn't already been done. If the space is out	1071
1117	* of the map, it shouldn't have a head	1072	mask |= 0x8;
1118	*/	1073	*last_ext |= 0x80;
1119	if (lastcell.count != -1)	1074	last_ext = &sl[sl.length ()];
		1075
		1076	sl << uint8 (5) << uint8 (stat_hp);
		1077
		1078	if (stat_width > 1)
1120	{	1079	{
1121	sl << uint16 (mask);
1122	map_clearcell (&lastcell, -1);
1123	}
1124
1125	continue;
1126	}
1127
1128	m->touch ();
1129
1130	int d = pl->blocked_los[ax][ay];
1131
1132	if (d > 3)
1133	{
1134
1135	int need_send = 0, count;
1136
1137	/* This block deals with spaces that are not visible for whatever
1138	* reason. Still may need to send the head for this space.
1139	*/
1140
1141	oldlen = sl.length ();
1142
1143	sl << uint16 (mask);
1144
1145	if (lastcell.count != -1)
1146	need_send = 1;
1147
1148	count = -1;
1149
1150	/* properly clear a previously sent big face */
1151	if (lastcell.faces[0] || lastcell.faces[1] || lastcell.faces[2]
1152	|| lastcell.stat_hp || lastcell.flags || lastcell.player)
1153	need_send = 1;
1154
1155	map_clearcell (&lastcell, count);
1156
1157	if ((mask & 0xf) || need_send)
1158	sl[oldlen + 1] = mask & 0xff;
1159	else
1160	sl.reset (oldlen);
1161	}
1162	else
1163	{
1164	/* In this block, the space is visible.
1165	*/
1166
1167	/* Rather than try to figure out what everything that we might
1168	* need to send is, then form the packet after that,
1169	* we presume that we will in fact form a packet, and update
1170	* the bits by what we do actually send. If we send nothing,
1171	* we just back out sl.length () to the old value, and no harm
1172	* is done.
1173	* I think this is simpler than doing a bunch of checks to see
1174	* what if anything we need to send, setting the bits, then
1175	* doing those checks again to add the real data.
1176	*/
1177	oldlen = sl.length ();
1178	eoldlen = esl.length ();
1179
1180	sl << uint16 (mask);
1181
1182	unsigned char dummy;
1183	unsigned char *last_ext = &dummy;
1184
1185	/* Darkness changed */
1186	if (lastcell.count != d && socket.darkness)
1187	{
1188	mask |= 0x8;
1189
1190	if (socket.extmap)
1191	{
1192	*last_ext |= 0x80;	1080	*last_ext |= 0x80;
1193	last_ext = &sl[sl.length ()];	1081	last_ext = &sl[sl.length ()];
1194	sl << uint8 (d);	1082
1195	}	1083	sl << uint8 (6) << uint8 (stat_width);
1196	else
1197	sl << uint8 (255 - 64 * d);
1198	}	1084	}
		1085	}
1199		1086
1200	lastcell.count = d;	1087	if (expect_false (lastcell.player != player))
1201
1202	mapspace &ms = m->at (nx, ny);
1203	ms.update ();
1204
1205	if (socket.extmap)
1206	{	1088	{
1207	uint8 stat_hp = 0;	1089	lastcell.player = player;
1208	uint8 stat_width = 0;
1209	uint8 flags = 0;
1210	tag_t player = 0;
1211		1090
1212	// send hp information, if applicable
1213	if (object *op = ms.faces_obj [0])
1214	{
1215	if (op->head || op->invisible)
1216	; // do not show
1217	else if (op->type == PLAYER
1218	|| QUERY_FLAG (op, FLAG_MONSTER) || QUERY_FLAG (op, FLAG_ALIVE) || QUERY_FLAG (op, FLAG_GENERATOR))
1219	{
1220	if (op->stats.maxhp > 0 && (unsigned) op->stats.maxhp > (unsigned) op->stats.hp)
1221	{
1222	stat_hp = 255 - (op->stats.hp * 255 + 254) / op->stats.maxhp;
1223	stat_width = op->arch->max_x - op->arch->x; //TODO: should be upper-left edge
1224	}
1225	}
1226
1227	if (op->msg && op->msg[0] == '@')
1228	flags |= 1;
1229
1230	if (op->type == PLAYER && op != ob)
1231	player = op->count;
1232	}
1233
1234	if (lastcell.stat_hp != stat_hp)
1235	{
1236	lastcell.stat_hp = stat_hp;
1237
1238	mask |= 0x8;	1091	mask |= 0x8;
1239	*last_ext |= 0x80;	1092	*last_ext |= 0x80;
1240	last_ext = &sl[sl.length ()];	1093	last_ext = &sl[sl.length ()];
1241		1094
1242	sl << uint8 (5) << uint8 (stat_hp);
1243
1244	if (stat_width > 1)
1245	{
1246	*last_ext |= 0x80;
1247	last_ext = &sl[sl.length ()];
1248
1249	sl << uint8 (6) << uint8 (stat_width);
1250	}
1251	}
1252
1253	if (lastcell.player != player)
1254	{
1255	lastcell.player = player;
1256
1257	mask |= 0x8;
1258	*last_ext |= 0x80;
1259	last_ext = &sl[sl.length ()];
1260
1261	sl << uint8 (0x47) << uint8 (4) << (uint32)player;	1095	sl << uint8 (0x47) << uint8 (4) << (uint32)player;
1262	}	1096	}
1263		1097
1264	if (lastcell.flags != flags)	1098	if (expect_false (lastcell.flags != flags))
1265	{	1099	{
1266	lastcell.flags = flags;	1100	lastcell.flags = flags;
1267		1101
1268	mask |= 0x8;	1102	mask |= 0x8;
1269	*last_ext |= 0x80;	1103	*last_ext |= 0x80;
1270	last_ext = &sl[sl.length ()];	1104	last_ext = &sl[sl.length ()];
1271		1105
1272	sl << uint8 (8) << uint8 (flags);	1106	sl << uint8 (8) << uint8 (flags);
1273	}
1274	}	1107	}
1275		1108
		1109	// faces
		1110
1276	/* Floor face */	1111	/* Floor face */
1277	if (update_space (sl, socket, ms, lastcell, 2))	1112	if (update_space (sl, socket, ms, lastcell, 2))
1278	mask |= 0x4;	1113	mask |= 0x4;
1279		1114
1280	/* Middle face */	1115	/* Middle face */
1281	if (update_space (sl, socket, ms, lastcell, 1))	1116	if (update_space (sl, socket, ms, lastcell, 1))
1282	mask |= 0x2;	1117	mask |= 0x2;
1283		1118
		1119	if (expect_false (ob->invisible)
		1120	&& ob->invisible & (ob->invisible < 50 ? 1 : 7)
1284	if (ms.player () == ob	1121	&& ms.player () == ob)
1285	&& (ob->invisible & (ob->invisible < 50 ? 1 : 7)))
1286	{	1122	{
1287	// force player to be visible to himself if invisible	1123	// force player to be visible to himself if invisible
1288	if (lastcell.faces[0] != ob->face)	1124	if (lastcell.faces[0] != ob->face)
1289	{	1125	{
1290	lastcell.faces[0] = ob->face;	1126	lastcell.faces[0] = ob->face;
1291		1127
1292	mask |= 0x1;
1293	sl << uint16 (ob->face);
1294
1295	socket.send_faces (ob);
1296	}
1297	}
1298	/* Top face */
1299	else if (update_space (sl, socket, ms, lastcell, 0))
1300	mask |= 0x1;	1128	mask |= 0x1;
		1129	sl << uint16 (ob->face);
1301		1130
		1131	socket.send_faces (ob);
		1132	}
		1133	}
		1134	/* Top face */
		1135	else if (update_space (sl, socket, ms, lastcell, 0))
		1136	mask |= 0x1;
		1137
1302	/* Check to see if we are in fact sending anything for this	1138	/* Check to see if we are in fact sending anything for this
1303	* space by checking the mask. If so, update the mask.	1139	* space by checking the mask. If so, update the mask.
1304	* if not, reset the len to that from before adding the mask	1140	* if not, reset the len to that from before adding the mask
1305	* value, so we don't send those bits.	1141	* value, so we don't send those bits.
1306	*/	1142	*/
1307	if (mask & 0xf)	1143	if (mask & 0xf)
1308	sl[oldlen + 1] = mask & 0xff;	1144	sl[oldlen + 1] = mask & 0xff;
1309	else	1145	else
1310	sl.reset (oldlen);	1146	sl.reset (oldlen);
1311
1312	if (socket.ext_mapinfos)
1313	esl << uint16 (emask);
1314
1315	if (socket.EMI_smooth)
1316	{
1317	for (int layer = 2+1; layer--; )
1318	{
1319	object *ob = ms.faces_obj [layer];
1320
1321	// If there is no object for this space, or if the face for the object
1322	// is the blank face, set the smoothlevel to zero.
1323	int smoothlevel = ob && ob->face != blank_face ? ob->smoothlevel : 0;
1324
1325	// We've gotten what face we want to use for the object. Now see if
1326	// if it has changed since we last sent it to the client.
1327	if (lastcell.smooth[layer] != smoothlevel)
1328	{
1329	lastcell.smooth[layer] = smoothlevel;
1330	esl << uint8 (smoothlevel);
1331	emask |= 1 << layer;
1332	}
1333	}
1334
1335	if (emask & 0xf)
1336	esl[eoldlen + 1] = emask & 0xff;
1337	else
1338	esl.reset (eoldlen);
1339	}
1340	} /* else this is a viewable space */	1147	} /* else this is a viewable space */
1341	} /* for x loop */	1148	ordered_mapwalk_end
1342	} /* for y loop */
1343		1149
1344	socket.flush_fx ();	1150	socket.flush_fx ();
1345
1346	/* Verify that we in fact do need to send this */
1347	if (socket.ext_mapinfos)
1348	{
1349	if (!(sl.length () > startlen || socket.sent_scroll))
1350	{
1351	/* No map data will follow, so don't say the client
1352	* it doesn't need draw!
1353	*/
1354	ewhatflag &= ~EMI_NOREDRAW;
1355	esl[ewhatstart + 1] = ewhatflag & 0xff;
1356	}
1357
1358	if (esl.length () > estartlen)
1359	socket.send_packet (esl);
1360	}
1361		1151
1362	if (sl.length () > startlen || socket.sent_scroll)	1152	if (sl.length () > startlen || socket.sent_scroll)
1363	{	1153	{
1364	socket.send_packet (sl);	1154	socket.send_packet (sl);
1365	socket.sent_scroll = 0;	1155	socket.sent_scroll = 0;
1366	}	1156	}
1367	}	1157	}
1368		1158
1369	/*****************************************************************************/
1370	/* GROS: The following one is used to allow a plugin to send a generic cmd to*/
1371	/* a player. Of course, the client need to know the command to be able to */
1372	/* manage it ! */
1373	/*****************************************************************************/
1374	void
1375	send_plugin_custom_message (object *pl, char *buf)
1376	{
1377	pl->contr->ns->send_packet (buf);
1378	}
1379
1380	/**
1381	* This sends the skill number to name mapping. We ignore
1382	* the params - we always send the same info no matter what.
1383	*/
1384	void
1385	send_skill_info (client *ns, char *params)
1386	{
1387	packet sl;
1388	sl << "replyinfo skill_info\n";
1389
1390	for (int i = 1; i < NUM_SKILLS; i++)
1391	sl.printf ("%d:%s\n", i + CS_STAT_SKILLINFO, &skill_names[i]);
1392
1393	if (sl.length () > MAXSOCKBUF)
1394	{
1395	LOG (llevError, "Buffer overflow in send_skill_info!\n");
1396	fatal (0);
1397	}
1398
1399	ns->send_packet (sl);
1400	}
1401
1402	/**
1403	* This sends the spell path to name mapping. We ignore
1404	* the params - we always send the same info no matter what.
1405	*/
1406	void
1407	send_spell_paths (client * ns, char *params)
1408	{
1409	packet sl;
1410
1411	sl << "replyinfo spell_paths\n";
1412
1413	for (int i = 0; i < NRSPELLPATHS; i++)
1414	sl.printf ("%d:%s\n", 1 << i, spellpathnames[i]);
1415
1416	if (sl.length () > MAXSOCKBUF)
1417	{
1418	LOG (llevError, "Buffer overflow in send_spell_paths!\n");
1419	fatal (0);
1420	}
1421
1422	ns->send_packet (sl);
1423	}
1424
1425	/**	1159	/**
1426	* This looks for any spells the player may have that have changed their stats.	1160	* This looks for any spells the player may have that have changed their stats.
1427	* it then sends an updspell packet for each spell that has changed in this way	1161	* it then sends an updspell packet for each spell that has changed in this way
1428	*/	1162	*/
1429	void	1163	void
1430	esrv_update_spells (player *pl)	1164	esrv_update_spells (player *pl)
1431	{	1165	{
1432	if (!pl->ns)	1166	if (!pl->ns)
1433	return;	1167	return;
1434		1168
		1169	pl->ns->update_spells = false;
		1170
1435	if (!pl->ns->monitor_spells)	1171	if (!pl->ns->monitor_spells)
1436	return;	1172	return;
1437		1173
1438	for (object *spell = pl->ob->inv; spell; spell = spell->below)	1174	for (object *spell = pl->ob->inv; spell; spell = spell->below)
1439	{
1440	if (spell->type == SPELL)	1175	if (spell->type == SPELL)
1441	{	1176	{
1442	int flags = 0;	1177	int flags = 0;
		1178	int val;
1443		1179
1444	/* check if we need to update it */	1180	/* check if we need to update it */
1445	if (spell->last_sp != SP_level_spellpoint_cost (pl->ob, spell, SPELL_MANA))	1181	val = SP_level_spellpoint_cost (pl->ob, spell, SPELL_MANA);
		1182	if (spell->cached_sp != val)
1446	{	1183	{
1447	spell->last_sp = SP_level_spellpoint_cost (pl->ob, spell, SPELL_MANA);	1184	spell->cached_sp = val;
1448	flags |= UPD_SP_MANA;	1185	flags |= UPD_SP_MANA;
1449	}	1186	}
1450		1187
1451	if (spell->last_grace != SP_level_spellpoint_cost (pl->ob, spell, SPELL_GRACE))	1188	val = SP_level_spellpoint_cost (pl->ob, spell, SPELL_GRACE);
		1189	if (spell->cached_grace != val)
1452	{	1190	{
1453	spell->last_grace = SP_level_spellpoint_cost (pl->ob, spell, SPELL_GRACE);	1191	spell->cached_grace = val;
1454	flags |= UPD_SP_GRACE;	1192	flags |= UPD_SP_GRACE;
1455	}	1193	}
1456		1194
1457	if (spell->last_eat != spell->stats.dam + SP_level_dam_adjust (pl->ob, spell))	1195	val = casting_level (pl->ob, spell);
		1196	if (spell->cached_eat != val)
1458	{	1197	{
1459	spell->last_eat = spell->stats.dam + SP_level_dam_adjust (pl->ob, spell);	1198	spell->cached_eat = val;
1460	flags |= UPD_SP_DAMAGE;	1199	flags |= UPD_SP_LEVEL;
1461	}	1200	}
1462		1201
1463	if (flags)	1202	if (flags)
1464	{	1203	{
1465	packet sl;	1204	packet sl;
1466		1205
1467	sl << "updspell "	1206	sl << "updspell "
1468	<< uint8 (flags)	1207	<< uint8 (flags)
1469	<< uint32 (spell->count);	1208	<< uint32 (spell->count);
1470		1209
1471	if (flags & UPD_SP_MANA ) sl << uint16 (spell->last_sp);	1210	if (flags & UPD_SP_MANA ) sl << uint16 (spell->cached_sp);
1472	if (flags & UPD_SP_GRACE ) sl << uint16 (spell->last_grace);	1211	if (flags & UPD_SP_GRACE) sl << uint16 (spell->cached_grace);
1473	if (flags & UPD_SP_DAMAGE) sl << uint16 (spell->last_eat);	1212	if (flags & UPD_SP_LEVEL) sl << uint16 (spell->cached_eat);
1474		1213
1475	pl->ns->send_packet (sl);	1214	pl->ns->send_packet (sl);
1476	}	1215	}
1477	}	1216	}
1478	}
1479	}	1217	}
1480		1218
1481	void	1219	void
1482	esrv_remove_spell (player *pl, object *spell)	1220	esrv_remove_spell (player *pl, object *spell)
1483	{	1221	{
…		…
1499		1237
1500	/* appends the spell *spell to the Socklist we will send the data to. */	1238	/* appends the spell *spell to the Socklist we will send the data to. */
1501	static void	1239	static void
1502	append_spell (player *pl, packet &sl, object *spell)	1240	append_spell (player *pl, packet &sl, object *spell)
1503	{	1241	{
1504	int i, skill = 0;	1242	int skill = 0;
1505		1243
1506	if (!(spell->name))	1244	if (!(spell->name))
1507	{	1245	{
1508	LOG (llevError, "item number %d is a spell with no name.\n", spell->count);	1246	LOG (llevError, "item number %d is a spell with no name.\n", spell->count);
1509	return;	1247	return;
1510	}	1248	}
1511		1249
1512	/* store costs and damage in the object struct, to compare to later */	1250	/* store costs and damage in the object struct, to compare to later */
1513	spell->last_sp = SP_level_spellpoint_cost (pl->ob, spell, SPELL_MANA);	1251	spell->cached_sp = SP_level_spellpoint_cost (pl->ob, spell, SPELL_MANA);
1514	spell->last_grace = SP_level_spellpoint_cost (pl->ob, spell, SPELL_GRACE);	1252	spell->cached_grace = SP_level_spellpoint_cost (pl->ob, spell, SPELL_GRACE);
1515	spell->last_eat = spell->stats.dam + SP_level_dam_adjust (pl->ob, spell);	1253	spell->cached_eat = casting_level (pl->ob, spell);
1516		1254
1517	/* figure out which skill it uses, if it uses one */	1255	/* figure out which skill it uses, if it uses one */
1518	if (spell->skill)	1256	if (spell->skill)
1519	{	1257	if (object *tmp = pl->find_skill (spell->skill))
1520	for (i = 1; i < NUM_SKILLS; i++)	1258	skill = CS_STAT_SKILLINFO + SKILL_INDEX (tmp);
1521	if (!strcmp (spell->skill, skill_names[i]))
1522	{
1523	skill = i + CS_STAT_SKILLINFO;
1524	break;
1525	}
1526	}
1527		1259
1528	// spells better have a face	1260	// spells better have a face
1529	if (!spell->face)	1261	if (!spell->face)
1530	{	1262	{
1531	LOG (llevError, "%s: spell has no face, but face is mandatory.\n", &spell->name);	1263	LOG (llevError, "%s: spell has no face, but face is mandatory.\n", &spell->name);
…		…
1536		1268
1537	/* send the current values */	1269	/* send the current values */
1538	sl << uint32 (spell->count)	1270	sl << uint32 (spell->count)
1539	<< uint16 (spell->level)	1271	<< uint16 (spell->level)
1540	<< uint16 (spell->casting_time)	1272	<< uint16 (spell->casting_time)
1541	<< uint16 (spell->last_sp)	1273	<< uint16 (spell->cached_sp)
1542	<< uint16 (spell->last_grace)	1274	<< uint16 (spell->cached_grace)
1543	<< uint16 (spell->last_eat)	1275	<< uint16 (spell->cached_eat)
1544	<< uint8 (skill)	1276	<< uint8 (skill)
1545	<< uint32 (spell->path_attuned)	1277	<< uint32 (spell->path_attuned)
1546	<< uint32 (spell->face)	1278	<< uint32 (spell->face)
1547	<< data8 (spell->name)	1279	<< data8 (spell->name)
1548	<< data16 (spell->msg);	1280	<< data16 (spell->msg);
…		…
1605	}	1337	}
1606	else	1338	else
1607	append_spell (pl, sl, spell);	1339	append_spell (pl, sl, spell);
1608		1340
1609	if (sl.length () > MAXSOCKBUF)	1341	if (sl.length () > MAXSOCKBUF)
1610	{
1611	LOG (llevError, "Buffer overflow in esrv_add_spells!\n");	1342	cleanup ("buffer overflow in esrv_add_spells!");
1612	fatal (0);
1613	}
1614		1343
1615	/* finally, we can send the packet */	1344	/* finally, we can send the packet */
1616	pl->ns->flush_fx ();	1345	pl->ns->flush_fx ();
1617	pl->ns->send_packet (sl);	1346	pl->ns->send_packet (sl);
1618	}	1347	}
1619		1348
		1349	//-GPL
		1350

Diff Legend

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