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.192 by root, Wed Nov 21 13:22:34 2012 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,2009,2010,2011,2012 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
5	* Copyright (C) 2001 Mark Wedel	5	* Copyright (©) 2001 Mark Wedel
6	* Copyright (C) 1992 Frank Tore Johansen	6	* Copyright (©) 1992 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	*
18	* You should have received a copy of the GNU General Public License
19	* along with this program; if not, write to the Free Software
20	* Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
21	*	17	*
22	* The author can be reached via e-mail to <crossfire@schmorp.de>	18	* You should have received a copy of the Affero GNU General Public License
		19	* and the GNU General Public License along with this program. If not, see
		20	* <http://www.gnu.org/licenses/>.
23	*/	21	*
		22	* The authors can be reached via e-mail to <support@deliantra.net>
		23	*/
		24
		25	//+GPL
24		26
25	/**	27	/**
26	* \file	28	* \file
27	* Client handling.	29	* Client handling.
28	*	30	*
…		…
42		44
43	#include <global.h>	45	#include <global.h>
44	#include <sproto.h>	46	#include <sproto.h>
45		47
46	#include <living.h>	48	#include <living.h>
47	#include <commands.h>
48		49
49	/* 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,
50	* it should work here.	51	* it should work here.
51	*/	52	*/
52	#include <sys/types.h>	53	#include <sys/types.h>
…		…
64	* This table translates the attack numbers as used within the	65	* This table translates the attack numbers as used within the
65	* 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
66	* 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
67	* client.	68	* client.
68	*/	69	*/
69	short atnr_cs_stat[NROFATTACKS] = { CS_STAT_RES_PHYS,	70	static short atnr_cs_stat[NROFATTACKS] =
70	CS_STAT_RES_MAG, CS_STAT_RES_FIRE, CS_STAT_RES_ELEC,	71	{
71	CS_STAT_RES_COLD, CS_STAT_RES_CONF, CS_STAT_RES_ACID,	72	CS_STAT_RES_PHYS,
72	CS_STAT_RES_DRAIN, -1 /* weaponmagic */ ,	73	CS_STAT_RES_MAG,
73	CS_STAT_RES_GHOSTHIT, CS_STAT_RES_POISON,	74	CS_STAT_RES_FIRE,
74	CS_STAT_RES_SLOW, CS_STAT_RES_PARA, CS_STAT_TURN_UNDEAD,	75	CS_STAT_RES_ELEC,
75	CS_STAT_RES_FEAR, -1 /* Cancellation */ ,	76	CS_STAT_RES_COLD,
76	CS_STAT_RES_DEPLETE, CS_STAT_RES_DEATH,	77	CS_STAT_RES_CONF,
77	-1 /* Chaos */ , -1 /* Counterspell */ ,	78	CS_STAT_RES_ACID,
78	-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,
79	CS_STAT_RES_BLIND,	94	CS_STAT_RES_BLIND,
80	-1, /* Internal */	95	-1, /* Internal */
81	-1, /* life stealing */	96	-1, /* life stealing */
82	-1 /* Disease - not fully done yet */	97	-1 /* Disease - not fully done yet */
83	};	98	};
…		…
99	*/	114	*/
100	mx = ns->mapx;	115	mx = ns->mapx;
101	my = ns->mapy;	116	my = ns->mapy;
102		117
103	/* 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
104	* (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,
105	* if the destination x or y coordinate is outside the viewable	120	* if the destination x or y coordinate is outside the viewable
106	* area, we clear the values - otherwise, the old values	121	* area, we clear the values - otherwise, the old values
107	* 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.
108	*/	123	*/
109	for (x = 0; x < mx; x++)	124	for (x = 0; x < mx; x++)
110	{
111	for (y = 0; y < my; y++)	125	for (y = 0; y < my; y++)
112	{
113	if (x >= ns->mapx || y >= ns->mapy)	126	if (x >= ns->mapx || y >= ns->mapy)
114	/* clear cells outside the viewable area */	127	/* clear cells outside the viewable area */
115	memset (&newmap.cells[x][y], 0, sizeof (struct MapCell));	128	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)	129	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 */	130	/* clear newly visible tiles within the viewable area */
118	memset (&(newmap.cells[x][y]), 0, sizeof (struct MapCell));	131	memset (&(newmap.cells[x][y]), 0, sizeof (struct MapCell));
119	else	132	else
120	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));
121	}
122	}
123		134
124	memcpy (&(ns->lastmap), &newmap, sizeof (struct Map));	135	memcpy (&(ns->lastmap), &newmap, sizeof (struct Map));
125		136
126	/* 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
127	* empty).	138	* empty).
…		…
130	}	141	}
131		142
132	static void	143	static void
133	clear_map (player *pl)	144	clear_map (player *pl)
134	{	145	{
		146	pl->ns->mapinfo_queue_clear ();
		147
135	memset (&pl->ns->lastmap, 0, sizeof (pl->ns->lastmap));	148	memset (&pl->ns->lastmap, 0, sizeof (pl->ns->lastmap));
136		149
137	pl->ns->force_newmap = false;	150	pl->ns->force_newmap = false;
138
139	if (pl->ns->newmapcmd == 1)
140	pl->ns->send_packet ("newmap");	151	pl->ns->send_packet ("newmap");
141
142	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	}
143	}	183	}
144		184
145	/** check for map/region change and send new map data */	185	/** check for map/region change and send new map data */
146	static void	186	static void
147	check_map_change (player *pl)	187	check_map_change (player *pl)
148	{	188	{
149	client &socket = *pl->ns;	189	client &socket = *pl->ns;
150	object *ob = pl->ob;	190	object *ob = pl->viewpoint;
151	char buf[MAX_BUF]; /* eauugggh */	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	}
152		218
153	if (socket.current_map != ob->map || socket.force_newmap)	219	if (socket.current_map != ob->map || socket.force_newmap)
154	{	220	{
155	clear_map (pl);	221	clear_map (pl);
156	socket.current_map = ob->map;	222	socket.current_map = ob->map;
157		223	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	}	224	}
182	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)
183	{	226	{
184	int dx = ob->x - socket.current_x;	227	int dx = ob->x - socket.current_x;
185	int dy = ob->y - socket.current_y;	228	int dy = ob->y - socket.current_y;
186		229
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);	230	socket_map_scroll (&socket, ob->x - socket.current_x, ob->y - socket.current_y);
192	socket.floorbox_reset ();	231	socket.floorbox_reset ();
193	}
194	}	232	}
195		233
196	socket.current_x = ob->x;	234	socket.current_x = ob->x;
197	socket.current_y = ob->y;	235	socket.current_y = ob->y;
		236	}
198		237
199	region *reg = ob->region ();	238	/**
200	if (socket.current_region != reg)	239	* This sends the skill number to name mapping. We ignore
201	{	240	* the params - we always send the same info no matter what.
202	socket.current_region = reg;	241	*/
203	socket.send_packet_printf ("drawinfo 0 You are now %s.\n(use whereami for more details)", &reg->longname);	242	static void
204	}	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);
205	}	275	}
206		276
207	/**	277	/**
208	* RequestInfo is sort of a meta command. There is some specific	278	* RequestInfo is sort of a meta command. There is some specific
209	* request of information, but we call other functions to provide	279	* request of information, but we call other functions to provide
210	* that information.	280	* that information.
		281	* requestinfo is completely deprecated, use resource exti request
		282	* and the fxix or http protocols.
211	*/	283	*/
212	void	284	void
213	RequestInfo (char *buf, int len, client * ns)	285	RequestInfo (char *buf, int len, client *ns)
214	{	286	{
215	char *params = NULL, *cp;	287	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		288
228	/* find the first space, make it null, and update the	289	/* find the first space, make it null, and update the
229	* params pointer.	290	* params pointer.
230	*/	291	*/
231	for (cp = buf; *cp != '\0'; cp++)	292	for (params = buf; *params; params++)
232	if (*cp == ' ')	293	if (*params == ' ')
233	{	294	{
234	*cp = '\0';
235	params = cp + 1;	295	*params++ = 0;
236	break;	296	break;
237	}	297	}
238		298
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"))	299	if (!strcmp (buf, "skill_info"))
244	send_skill_info (ns, params);	300	send_skill_info (ns, params);
245	else if (!strcmp (buf, "spell_paths"))	301	else if (!strcmp (buf, "spell_paths"))
246	send_spell_paths (ns, params);	302	send_spell_paths (ns, params);
247	else	303	else
248	ns->send_packet (bigbuf, len);	304	{
		305	// undo tokenisation above and send replyinfo with the request unchanged
		306	if (*params)
		307	*--params = ' ';
		308
		309	ns->send_packet_printf ("replyinfo %s", buf);
		310	}
249	}	311	}
250		312
251	void	313	void
252	ExtCmd (char *buf, int len, player *pl)	314	ExtCmd (char *buf, int len, player *pl)
253	{	315	{
…		…
256		318
257	void	319	void
258	ExtiCmd (char *buf, int len, client *ns)	320	ExtiCmd (char *buf, int len, client *ns)
259	{	321	{
260	INVOKE_CLIENT (EXTICMD, ns, ARG_DATA (buf, len));	322	INVOKE_CLIENT (EXTICMD, ns, ARG_DATA (buf, len));
		323	}
		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;
261	}	421	}
262		422
263	void	423	void
264	MapInfoCmd (char *buf, int len, player *pl)	424	MapInfoCmd (char *buf, int len, player *pl)
265	{	425	{
266	// <mapinfo tag spatial tile-path	426	// <mapinfo tag spatial tile-path
267	// >mapinfo tag spatial flags x y w h hash	427	// >mapinfo tag spatial flags x y w h hash
268		428
269	char bigbuf[MAX_BUF], *token;
270
271	token = buf;	429	char *token = buf;
272	// copy token	430
273	if (!(buf = strchr (buf, ' ')))	431	if (!(buf = strchr (buf, ' ')))
274	return;	432	return;
275		433
276	*buf++ = 0;
277
278	if (!strncmp (buf, "spatial ", 8))	434	if (!strncmp (buf, " spatial ", 9))
279	{	435	{
280	buf += 8;	436	char *copy = strdup (token);
		437	copy [buf - token] = 0;
281		438
282	// initial map and its origin	439	#if 0
283	maptile *map = pl->ob->map;	440	// this makes only sense when we flush the buffer immediately
284	sint16 dx, dy;	441	if (pl->ns->mapinfo_try (copy))
285	int mapx = pl->ns->mapx / 2 - pl->ob->x;	442	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	443	else
342	snprintf (bigbuf, MAX_BUF, "mapinfo %s nomap", token);	444	#endif
		445	pl->ns->mapinfo_queue.push_back (copy);
343	}	446	}
344	else	447	else
345	snprintf (bigbuf, MAX_BUF, "mapinfo %s unsupported", token);	448	pl->ns->send_packet_printf ("mapinfo %s unsupported", token);
346
347	pl->ns->send_packet (bigbuf);
348	}	449	}
349		450
350	/** This is the Setup cmd */	451	/** This is the Setup cmd */
351	void	452	void
352	SetUp (char *buf, int len, client * ns)	453	SetUp (char *buf, int len, client * ns)
…		…
364	AddMeCmd (char *buf, int len, client *ns)	465	AddMeCmd (char *buf, int len, client *ns)
365	{	466	{
366	INVOKE_CLIENT (ADDME, ns, ARG_DATA (buf, len));	467	INVOKE_CLIENT (ADDME, ns, ARG_DATA (buf, len));
367	}	468	}
368		469
369	/** Reply to ExtendedInfos command */	470	//+GPL
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	}
421
422	/*
423	#define MSG_TYPE_BOOK 1
424	#define MSG_TYPE_CARD 2
425	#define MSG_TYPE_PAPER 3
426	#define MSG_TYPE_SIGN 4
427	#define MSG_TYPE_MONUMENT 5
428	#define MSG_TYPE_SCRIPTED_DIALOG 6*/
429
430	/** Reply to ExtendedInfos command */
431	void
432	ToggleExtendedText (char *buf, int len, client * ns)
433	{
434	char cmdback[MAX_BUF];
435	char temp[10];
436	char command[50];
437	int info, nextinfo, i, flag;
438
439	cmdback[0] = '\0';
440
441	nextinfo = 0;
442	while (1)
443	{
444	/* 1. Extract an info */
445	info = nextinfo;
446
447	while ((info < len) && (buf[info] == ' '))
448	info++;
449
450	if (info >= len)
451	break;
452
453	nextinfo = info + 1;
454
455	while ((nextinfo < len) && (buf[nextinfo] != ' '))
456	nextinfo++;
457
458	if (nextinfo - info >= 49) /*Erroneous info asked */
459	continue;
460
461	strncpy (command, &(buf[info]), nextinfo - info);
462	command[nextinfo - info] = '\0';
463	/* 2. Interpret info */
464	i = sscanf (command, "%d", &flag);
465
466	if ((i == 1) && (flag > 0) && (flag <= MSG_TYPE_LAST))
467	ns->supported_readables |= (1 << flag);
468	/*3. Next info */
469	}
470
471	/* Send resulting state */
472	strcpy (cmdback, "ExtendedTextSet");
473
474	for (i = 0; i <= MSG_TYPE_LAST; i++)
475	if (ns->supported_readables & (1 << i))
476	{
477	strcat (cmdback, " ");
478	snprintf (temp, sizeof (temp), "%d", i);
479	strcat (cmdback, temp);
480	}
481
482	ns->send_packet (cmdback);
483	}
484
485	/**
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		471
506	/**	472	/**
507	* 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,
508	* etc.)	474	* etc.)
509	*/	475	*/
…		…
522	return;	488	return;
523		489
524	buf++;	490	buf++;
525	}	491	}
526		492
527	execute_newserver_command (pl->ob, (char *) buf);	493	execute_newserver_command (pl->ob, (char *)buf);
528		494
529	/* Perhaps something better should be done with a left over count.	495	/* Perhaps something better should be done with a left over count.
530	* Cleaning up the input should probably be done first - all actions	496	* 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	497	* for the command that issued the count should be done before any other
532	* commands.	498	* commands.
533	*/	499	*/
534	pl->count = 0;	500	pl->count = 0;
535	}
536
537
538	/**
539	* 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
541	* 'ncom' method which gives more information back to the client so it
542	* can throttle.
543	*/
544	void
545	NewPlayerCmd (char *buf, int len, player *pl)
546	{
547	if (len <= 6)
548	{
549	LOG (llevDebug, "Corrupt ncom command <%s> not long enough - discarding\n", buf);
550	return;
551	}
552
553	uint16 cmdid = net_uint16 ((uint8 *)buf);
554	sint32 repeat = net_sint32 ((uint8 *)buf + 2);
555
556	/* -1 is special - no repeat, but don't update */
557	if (repeat != -1)
558	pl->count = repeat;
559
560	buf += 6; //len -= 6;
561
562	execute_newserver_command (pl->ob, buf);
563
564	/* Perhaps something better should be done with a left over count.
565	* Cleaning up the input should probably be done first - all actions
566	* for the command that issued the count should be done before any other
567	* commands.
568	*/
569	pl->count = 0;
570
571	//TODO: schmorp thinks whatever this calculates, it makes no sense at all
572	int time = fabs (pl->ob->speed) < 0.001
573	? time = MAX_TIME * 100
574	: time = (int) (MAX_TIME / fabs (pl->ob->speed));
575
576	/* Send confirmation of command execution now */
577	packet sl ("comc");
578	sl << uint16 (cmdid) << uint32 (time);
579	pl->ns->send_packet (sl);
580	}	501	}
581		502
582	/** This is a reply to a previous query. */	503	/** This is a reply to a previous query. */
583	void	504	void
584	ReplyCmd (char *buf, int len, client *ns)	505	ReplyCmd (char *buf, int len, client *ns)
…		…
621	LOG (llevError, "Unknown input state: %d\n", ns->state);	542	LOG (llevError, "Unknown input state: %d\n", ns->state);
622	}	543	}
623	}	544	}
624		545
625	/**	546	/**
626	* Client tells its version. If there is a mismatch, we close the	547	* Client tells its version info.
627	* socket. In real life, all we should care about is the client having
628	* something older than the server. If we assume the client will be
629	* backwards compatible, having it be a later version should not be a
630	* problem.
631	*/	548	*/
632	void	549	void
633	VersionCmd (char *buf, int len, client * ns)	550	VersionCmd (char *buf, int len, client *ns)
634	{	551	{
635	if (!buf)	552	INVOKE_CLIENT (VERSION, ns, ARG_DATA (buf, len));
636	{
637	LOG (llevError, "CS: received corrupted version command\n");
638	return;
639	}
640
641	ns->cs_version = atoi (buf);
642	ns->sc_version = ns->cs_version;
643
644	LOG (llevDebug, "connection from client <%s>\n", buf);
645
646	//TODO: should log here just for statistics
647
648	//if (VERSION_CS != ns->cs_version)
649	// unchecked;
650
651	char *cp = strchr (buf + 1, ' ');
652	if (!cp)
653	return;
654
655	ns->sc_version = atoi (cp);
656
657	//if (VERSION_SC != ns->sc_version)
658	// unchecked;
659
660	cp = strchr (cp + 1, ' ');
661
662	if (cp)
663	{
664	assign (ns->version, cp + 1);
665
666	if (ns->sc_version < 1026)
667	ns->send_packet_printf ("drawinfo %d %s", NDI_RED,
668	"**** VERSION WARNING ****\n**** CLIENT IS TOO OLD!! UPDATE THE CLIENT!! ****");
669	}
670	}	553	}
671		554
672	/** sound related functions. */	555	/** sound related functions. */
673	void	556	void
674	SetSound (char *buf, int len, client * ns)	557	SetSound (char *buf, int len, client * ns)
…		…
692	* syntax is: move (to) (tag) (nrof)	575	* syntax is: move (to) (tag) (nrof)
693	*/	576	*/
694	void	577	void
695	MoveCmd (char *buf, int len, player *pl)	578	MoveCmd (char *buf, int len, player *pl)
696	{	579	{
697	int vals[3], i;	580	int to, tag, nrof;
698		581
699	/* A little funky here. We only cycle for 2 records, because	582	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	{	583	{
706	vals[i] = atoi (buf);
707
708	if (!(buf = strchr (buf, ' ')))
709	{
710	LOG (llevError, "Incomplete move command: %s\n", buf);	584	LOG (llevError, "Incomplete move command: %s\n", buf);
711	return;	585	return;
712	}
713
714	buf++;
715	}	586	}
716		587
717	vals[2] = atoi (buf);	588	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	}	589	}
722		590
723	/******************************************************************************	591	/******************************************************************************
724	*	592	*
725	* Start of commands the server sends to the client.	593	* Start of commands the server sends to the client.
…		…
734	send_query (client *ns, uint8 flags, const char *text)	602	send_query (client *ns, uint8 flags, const char *text)
735	{	603	{
736	ns->send_packet_printf ("query %d %s", flags, text ? text : "");	604	ns->send_packet_printf ("query %d %s", flags, text ? text : "");
737	}	605	}
738		606
		607	/**
		608	* Get player's current range attack in obuf.
		609	*/
		610	static void
		611	rangetostring (player *pl, char *obuf)
		612	{
		613	dynbuf_text &buf = msg_dynbuf; buf.clear ();
		614
		615	#if 0
		616	// print ranged/chosen_skill etc. objects every call
		617	printf ("%s %s => %s (%s)\n",
		618	pl->ranged_ob ? &pl->ranged_ob->name : "-",
		619	pl->combat_ob ? &pl->combat_ob->name : "-",
		620	pl->ob->current_weapon ? &pl->ob->current_weapon->name : "-",
		621	pl->ob->chosen_skill ? &pl->ob->chosen_skill->name : "-"
		622	);
		623	#endif
		624
		625	if (pl->ranged_ob)
		626	buf << " Range" << (pl->ob->current_weapon == pl->ranged_ob ? "*" : "") << ": " << pl->ranged_ob->name;
		627
		628	if (pl->combat_ob)
		629	buf << " Combat" << (pl->ob->current_weapon == pl->combat_ob ? "*" : "") << ": " << pl->combat_ob->name;
		630
		631	#if 0
		632	//TODO: remove this when slot system is working, this is only for debugging
		633	if (pl->ob->chosen_skill)
		634	buf << " Skill*: " << pl->ob->chosen_skill->name;
		635	#endif
		636
		637	//TODO: maybe golem should become the current_weapon, quite simply?
		638	if (pl->golem)
		639	buf << " Golem*: " << pl->golem->name;
		640
		641	buf << '\0';
		642	buf.linearise (obuf);
		643	}
		644
739	#define AddIfInt64(Old,New,Type) if (Old != New) {\	645	#define AddIfInt64(Old,New,Type) if (Old != New) {\
740	Old = New; \	646	Old = New; \
741	sl << uint8 (Type) << uint64 (New); \	647	sl << uint8 (Type) << uint64 (New); \
742	}	648	}
743		649
…		…
749	#define AddIfShort(Old,New,Type) if (Old != New) {\	655	#define AddIfShort(Old,New,Type) if (Old != New) {\
750	Old = New; \	656	Old = New; \
751	sl << uint8 (Type) << uint16 (New); \	657	sl << uint8 (Type) << uint16 (New); \
752	}	658	}
753		659
754	#define AddIfFloat(Old,New,Type) if (Old != New) {\	660	#define AddIfFloat(Old,New,Type,mult) if (Old != New) {\
755	Old = New; \	661	Old = New; \
756	sl << uint8 (Type) << uint32 (New*FLOAT_MULTI); \	662	sl << uint8 (Type) << uint32 (New*FLOAT_MULTI*mult); \
757	}	663	}
758		664
759	#define AddIfString(Old,New,Type) if (Old == NULL || strcmp(Old,New)) {\	665	#define AddIfString(Old,New,Type) if (Old == NULL || strcmp(Old,New)) {\
760	free(Old); Old = strdup (New);\	666	free(Old); Old = strdup (New);\
761	sl << uint8 (Type) << data8 (New); \	667	sl << uint8 (Type) << data8 (New); \
…		…
768	* commands for now.	674	* commands for now.
769	*/	675	*/
770	void	676	void
771	esrv_update_stats (player *pl)	677	esrv_update_stats (player *pl)
772	{	678	{
773	char buf[MAX_BUF];
774	uint16 flags;
775
776	client *ns = pl->ns;	679	client *ns = pl->ns;
777	if (!ns)	680	if (!ns)
778	return;	681	return;
779		682
780	object *ob = pl->ob;	683	object *ob = pl->observe;
781	if (!ob)	684	if (!ob)
782	return;	685	return;
		686
		687	player *opl = ob->contr ? static_cast<player *>(ob->contr) : pl;
783		688
784	packet sl ("stats");	689	packet sl ("stats");
785		690
786	AddIfShort (ns->last_stats.hp, ob->stats.hp, CS_STAT_HP);	691	AddIfShort (ns->last_stats.hp, ob->stats.hp, CS_STAT_HP);
787	AddIfShort (ns->last_stats.maxhp, ob->stats.maxhp, CS_STAT_MAXHP);	692	AddIfShort (ns->last_stats.maxhp, ob->stats.maxhp, CS_STAT_MAXHP);
…		…
795	AddIfShort (ns->last_stats.Int, ob->stats.Int, CS_STAT_INT);	700	AddIfShort (ns->last_stats.Int, ob->stats.Int, CS_STAT_INT);
796	AddIfShort (ns->last_stats.Wis, ob->stats.Wis, CS_STAT_WIS);	701	AddIfShort (ns->last_stats.Wis, ob->stats.Wis, CS_STAT_WIS);
797	AddIfShort (ns->last_stats.Pow, ob->stats.Pow, CS_STAT_POW);	702	AddIfShort (ns->last_stats.Pow, ob->stats.Pow, CS_STAT_POW);
798	AddIfShort (ns->last_stats.Cha, ob->stats.Cha, CS_STAT_CHA);	703	AddIfShort (ns->last_stats.Cha, ob->stats.Cha, CS_STAT_CHA);
799		704
800	for (int s = 0; s < NUM_SKILLS; s++)	705	for (int s = 0; s < CS_NUM_SKILLS; s++)
801	if (object *skill = pl->last_skill_ob[s])	706	if (object *skill = opl->last_skill_ob [s])
802	if (skill->stats.exp != ns->last_skill_exp [s])	707	if (skill->stats.exp != ns->last_skill_exp [s])
803	{	708	{
804	ns->last_skill_exp [s] = skill->stats.exp;	709	ns->last_skill_exp [s] = skill->stats.exp;
805		710
806	/* Always send along the level if exp changes. This is only	711	/* Always send along the level if exp changes. This is only
807	* 1 extra byte, but keeps processing simpler.	712	* 1 extra byte, but keeps processing simpler.
808	*/	713	*/
809	sl << uint8 (s + CS_STAT_SKILLINFO)	714	sl << uint8 (CS_STAT_SKILLINFO + s)
810	<< uint8 (skill->level)	715	<< uint8 (skill->level)
811	<< uint64 (skill->stats.exp);	716	<< uint64 (skill->stats.exp);
812	}	717	}
813		718
814	AddIfInt64 (ns->last_stats.exp, ob->stats.exp, CS_STAT_EXP64);	719	AddIfInt64 (ns->last_stats.exp, ob->stats.exp, CS_STAT_EXP64);
815	AddIfShort (ns->last_level, ob->level, CS_STAT_LEVEL);	720	AddIfShort (ns->last_level, ob->level, CS_STAT_LEVEL);
816	AddIfShort (ns->last_stats.wc, ob->stats.wc, CS_STAT_WC);	721	AddIfShort (ns->last_stats.wc, ob->stats.wc, CS_STAT_WC);
817	AddIfShort (ns->last_stats.ac, ob->stats.ac, CS_STAT_AC);	722	AddIfShort (ns->last_stats.ac, ob->stats.ac, CS_STAT_AC);
818	AddIfShort (ns->last_stats.dam, ob->stats.dam, CS_STAT_DAM);	723	AddIfShort (ns->last_stats.dam, ob->stats.dam, CS_STAT_DAM);
819	AddIfFloat (ns->last_speed, ob->speed, CS_STAT_SPEED);	724	AddIfFloat (ns->last_speed, ob->speed, CS_STAT_SPEED, 1.f / TICK);
820	AddIfShort (ns->last_stats.food, ob->stats.food, CS_STAT_FOOD);	725	AddIfShort (ns->last_stats.food, ob->stats.food, CS_STAT_FOOD);
821	AddIfFloat (ns->last_weapon_sp, pl->weapon_sp, CS_STAT_WEAP_SP);	726	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);	727	AddIfInt (ns->last_weight_limit, weight_limit[ob->stats.Str], CS_STAT_WEIGHT_LIM);
823		728
824	flags = 0;	729	int flags = (opl->fire_on ? SF_FIREON : 0)
825		730	| (opl->run_on ? SF_RUNON : 0);
826	if (pl->fire_on)
827	flags |= SF_FIREON;
828
829	if (pl->run_on)
830	flags |= SF_RUNON;
831		731
832	AddIfShort (ns->last_flags, flags, CS_STAT_FLAGS);	732	AddIfShort (ns->last_flags, flags, CS_STAT_FLAGS);
833		733
834	if (ns->sc_version < 1025)
835	{ AddIfShort (ns->last_resist[ATNR_PHYSICAL], ob->resist[ATNR_PHYSICAL], CS_STAT_ARMOUR) }
836	else
837	for (int i = 0; i < NROFATTACKS; i++)	734	for (int i = 0; i < NROFATTACKS; i++)
838	{
839	/* Skip ones we won't send */	735	/* Skip ones we won't send */
840	if (atnr_cs_stat[i] == -1)	736	if (atnr_cs_stat[i] >= 0)
841	continue;
842
843	AddIfShort (ns->last_resist[i], ob->resist[i], atnr_cs_stat[i]);	737	AddIfShort (ns->last_resist[i], ob->resist[i], atnr_cs_stat[i]);
844	}
845		738
846	if (pl->ns->monitor_spells)	739	if (pl->ns->monitor_spells)
847	{	740	{
848	AddIfInt (ns->last_path_attuned, ob->path_attuned, CS_STAT_SPELL_ATTUNE);	741	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);	742	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);	743	AddIfInt (ns->last_path_denied, ob->path_denied, CS_STAT_SPELL_DENY);
851	}	744	}
852		745
		746	char buf[MAX_BUF];
853	rangetostring (ob, buf); /* we want use the new fire & run system in new client */	747	rangetostring (opl, buf); /* we want use the new fire & run system in new client */
854	AddIfString (ns->stats.range, buf, CS_STAT_RANGE);	748	AddIfString (ns->stats.range, buf, CS_STAT_RANGE);
855	set_title (ob, buf);	749	set_title (ob, buf);
856	AddIfString (ns->stats.title, buf, CS_STAT_TITLE);	750	AddIfString (ns->stats.title, buf, CS_STAT_TITLE);
857		751
858	/* Only send it away if we have some actual data */	752	/* Only send it away if we have some actual data */
…		…
862		756
863	/**	757	/**
864	* Tells the client that here is a player it should start using.	758	* Tells the client that here is a player it should start using.
865	*/	759	*/
866	void	760	void
867	esrv_new_player (player *pl, uint32 weight)	761	esrv_new_player (player *pl)
868	{	762	{
		763	sint32 weight = pl->ob->client_weight ();
		764
869	packet sl ("player");	765	packet sl ("player");
870		766
871	sl << uint32 (pl->ob->count)	767	sl << uint32 (pl->ob->count)
872	<< uint32 (weight)	768	<< uint32 (weight)
873	<< uint32 (pl->ob->face)	769	<< uint32 (pl->ob->face)
874	<< data8 (pl->ob->name);	770	<< data8 (pl->ob->name);
875		771
876	pl->ns->last_weight = weight;	772	pl->ns->last_weight = weight;
877	pl->ns->send_packet (sl);	773	pl->ns->send_packet (sl);
878	SET_FLAG (pl->ob, FLAG_CLIENT_SENT);
879	}	774	}
880		775
881	/******************************************************************************	776	/******************************************************************************
882	*	777	*
883	* Start of map related commands.	778	* Start of map related commands.
…		…
940		835
941	if (!ns.faces_sent[face_num])	836	if (!ns.faces_sent[face_num])
942	if (ob)	837	if (ob)
943	ns.send_faces (ob);	838	ns.send_faces (ob);
944	else	839	else
945	ns.send_face (face_num);	840	ns.send_face (face_num, 10);
946		841
947	sl << uint16 (face_num);	842	sl << uint16 (face_num);
948	return 1;	843	return 1;
949	}	844	}
950		845
951	/* Nothing changed */	846	/* Nothing changed */
952	return 0;	847	return 0;
953	}	848	}
954		849
955	/**	850	/**
956	* Returns the size of a data for a map square as returned by	851	* Draws client map.
957	* mapextended. There are CLIENTMAPX*CLIENTMAPY*LAYERS entries
958	* available.
959	*/	852	*/
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	}
973
974	// prefetch (and touch) all maps within a specific distancd
975	static void
976	prefetch_surrounding_maps (maptile *map, int distance)
977	{
978	map->last_access = runtime;
979
980	if (--distance)
981	for (int dir = 4; --dir; )
982	if (const shstr &path = map->tile_path [dir])
983	if (maptile *&neigh = map->tile_map [dir])
984	prefetch_surrounding_maps (neigh, distance);
985	else
986	neigh = maptile::find_async (path, map);
987	}
988
989	// prefetch a generous area around the player
990	static void
991	prefetch_surrounding_maps (object *op)
992	{
993	prefetch_surrounding_maps (op->map, 3);
994	}
995
996	/**
997	* This function uses the new map1 protocol command to send the 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	*/
1018	void	853	void
1019	draw_client_map1 (object *pl)	854	draw_client_map (player *pl)
1020	{	855	{
1021	int x, y, ax, ay, startlen, max_x, max_y, oldlen;	856	object *ob = pl->viewpoint;
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)	857	if (!pl->observe->active)
1032	return;	858	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		859
1367	/* If player is just joining the game, he isn't here yet, so the map	860	/* 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	861	* can get swapped out. If so, don't try to send them a map. All will
1369	* be OK once they really log in.	862	* be OK once they really log in.
1370	*/	863	*/
1371	if (pm == NULL || pm->in_memory != MAP_IN_MEMORY)	864	if (!ob->map || ob->map->state != MAP_ACTIVE)
1372	return;	865	return;
1373		866
1374	memset (&newmap, 0, sizeof (struct Map));	867	int startlen, oldlen;
1375		868
1376	for (j = (pl->y - pl->contr->ns->mapy / 2); j < (pl->y + (pl->contr->ns->mapy + 1) / 2); j++)	869	check_map_change (pl);
1377	for (i = (pl->x - pl->contr->ns->mapx / 2); i < (pl->x + (pl->contr->ns->mapx + 1) / 2); i++)	870	pl->ob->prefetch_surrounding_maps ();
		871
		872	/* do LOS after calls to update_position */
		873	/* unfortunately, we need to udpate los when observing, currently */
		874	if (pl->do_los || pl->viewpoint != pl->ob)
		875	{
		876	pl->do_los = 0;
		877	pl->update_los ();
		878	}
		879
		880	/**
		881	* This function uses the new map1 protocol command to send the map
		882	* to the client. It is necessary because the old map command supports
		883	* a maximum map size of 15x15.
		884	* This function is much simpler than the old one. This is because
		885	* the old function optimized to send as few face identifiers as possible,
		886	* at the expense of sending more coordinate location (coordinates were
		887	* only 1 byte, faces 2 bytes, so this was a worthwhile savings). Since
		888	* we need 2 bytes for coordinates and 2 bytes for faces, such a trade off
		889	* maps no sense. Instead, we actually really only use 12 bits for coordinates,
		890	* and use the other 4 bits for other informatiion. For full documentation
		891	* of what we send, see the doc/Protocol file.
		892	* I will describe internally what we do:
		893	* the ns->lastmap shows how the map last looked when sent to the client.
		894	* in the lastmap structure, there is a cells array, which is set to the
		895	* maximum viewable size (As set in config.h).
		896	* in the cells, there are faces and a count value.
		897	* we use the count value to hold the darkness value. If -1, then this space
		898	* is not viewable.
		899	* we use faces[0] faces[1] faces[2] to hold what the three layers
		900	* look like.
		901	*/
		902
		903	client &socket = *pl->ns;
		904
		905	packet sl ("map1a");
		906
		907	startlen = sl.length ();
		908
		909	int hx = socket.mapx / 2;
		910	int hy = socket.mapy / 2;
		911
		912	ordered_mapwalk_begin (ob, -hx, -hy, hx, hy)
		913	int ax = dx + hx;
		914	int ay = dy + hy;
		915
		916	int mask = (ax << 10) | (ay << 4);
		917	MapCell &lastcell = socket.lastmap.cells[ax][ay];
		918
		919	/* If the coordinates are not valid, or it is too dark to see,
		920	* we tell the client as such
		921	*/
		922	if (!m)
1378	{	923	{
1379	ax = i;	924	/* space is out of map. Update space and clear values
1380	ay = j;	925	* if this hasn't already been done. If the space is out
1381	m = pm;	926	* 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	*/	927	*/
1391	if (mflags & P_NEW_MAP)	928	if (lastcell.count != -1)
1392	m->timeout = 50;	929	{
		930	sl << uint16 (mask);
		931	map_clearcell (&lastcell, -1);
		932	}
		933
		934	continue;
1393	}	935	}
1394		936
1395	/* do LOS after calls to update_position */	937	int d = pl->blocked_los_uc (dx, dy);
1396	if (pl->contr->do_los)	938
		939	if (d > 3)
1397	{	940	{
1398	update_los (pl);	941	/* This block deals with spaces that are not visible for whatever
1399	pl->contr->do_los = 0;	942	* reason. Still may need to send the head for this space.
		943	*/
		944	if (lastcell.count != -1
		945	|| lastcell.faces[0]
		946	|| lastcell.faces[1]
		947	|| lastcell.faces[2]
		948	|| lastcell.stat_hp
		949	|| lastcell.flags
		950	|| lastcell.player)
		951	sl << uint16 (mask);
		952
		953	/* properly clear a previously sent big face */
		954	map_clearcell (&lastcell, -1);
1400	}	955	}
1401		956	else
1402	/* Big maps need a different drawing mechanism to work */
1403	draw_client_map1 (pl);
1404	}
1405
1406
1407	/*****************************************************************************/
1408
1409	/* 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 */
1412
1413	/* manage it ! */
1414
1415	/*****************************************************************************/
1416	void
1417	send_plugin_custom_message (object *pl, char *buf)
1418	{
1419	pl->contr->ns->send_packet (buf);
1420	}
1421
1422	/**
1423	* This sends the skill number to name mapping. We ignore
1424	* the params - we always send the same info no matter what.
1425	*/
1426	void
1427	send_skill_info (client *ns, char *params)
1428	{
1429	packet sl;
1430	sl << "replyinfo skill_info\n";
1431
1432	for (int i = 1; i < NUM_SKILLS; i++)
1433	sl.printf ("%d:%s\n", i + CS_STAT_SKILLINFO, &skill_names[i]);
1434
1435	if (sl.length () >= MAXSOCKBUF)
1436	{	957	{
1437	LOG (llevError, "Buffer overflow in send_skill_info!\n");	958	/* In this block, the space is visible.
1438	fatal (0);	959	*/
		960
		961	/* Rather than try to figure out what everything that we might
		962	* need to send is, then form the packet after that,
		963	* we presume that we will in fact form a packet, and update
		964	* the bits by what we do actually send. If we send nothing,
		965	* we just back out sl.length () to the old value, and no harm
		966	* is done.
		967	* I think this is simpler than doing a bunch of checks to see
		968	* what if anything we need to send, setting the bits, then
		969	* doing those checks again to add the real data.
		970	*/
		971	oldlen = sl.length ();
		972
		973	sl << uint16 (mask);
		974
		975	unsigned char dummy;
		976	unsigned char *last_ext = &dummy;
		977
		978	/* Darkness changed */
		979	if (lastcell.count != d)
		980	{
		981	mask |= 0x8;
		982
		983	*last_ext |= 0x80;
		984	last_ext = &sl[sl.length ()];
		985	sl << uint8 (d);
		986	}
		987
		988	lastcell.count = d;
		989
		990	mapspace &ms = m->at (nx, ny);
		991	ms.update ();
		992
		993	// extmap handling
		994	uint8 stat_hp = 0;
		995	uint8 stat_width = 0;
		996	uint8 flags = 0;
		997	tag_t player = 0;
		998
		999	// send hp information, if applicable
		1000	if (object *op = ms.faces_obj [0])
		1001	if (op->is_head () && !op->invisible)
		1002	{
		1003	if (op->stats.maxhp > op->stats.hp
		1004	&& op->stats.maxhp > 0
		1005	&& (op->type == PLAYER
		1006	|| op->type == DOOR // does not work, have maxhp 0
		1007	|| op->flag [FLAG_MONSTER]
		1008	|| op->flag [FLAG_ALIVE]
		1009	|| op->flag [FLAG_GENERATOR]))
		1010	{
		1011	stat_hp = 255 - (op->stats.hp * 255 + 254) / op->stats.maxhp;
		1012	stat_width = op->arch->max_x - op->arch->x; //TODO: should be upper-left edge
		1013	}
		1014
		1015	if (expect_false (op->has_dialogue ()))
		1016	flags |= 1;
		1017
		1018	if (expect_false (op->type == PLAYER))
		1019	player = op == ob ? pl->ob->count
		1020	: op == pl->ob ? ob->count
		1021	: op->count;
		1022	}
		1023
		1024	if (expect_false (lastcell.stat_hp != stat_hp))
		1025	{
		1026	lastcell.stat_hp = stat_hp;
		1027
		1028	mask |= 0x8;
		1029	*last_ext |= 0x80;
		1030	last_ext = &sl[sl.length ()];
		1031
		1032	sl << uint8 (5) << uint8 (stat_hp);
		1033
		1034	if (stat_width > 1)
		1035	{
		1036	*last_ext |= 0x80;
		1037	last_ext = &sl[sl.length ()];
		1038
		1039	sl << uint8 (6) << uint8 (stat_width);
		1040	}
		1041	}
		1042
		1043	if (expect_false (lastcell.player != player))
		1044	{
		1045	lastcell.player = player;
		1046
		1047	mask |= 0x8;
		1048	*last_ext |= 0x80;
		1049	last_ext = &sl[sl.length ()];
		1050
		1051	sl << uint8 (0x47) << uint8 (4) << (uint32)player;
		1052	}
		1053
		1054	if (expect_false (lastcell.flags != flags))
		1055	{
		1056	lastcell.flags = flags;
		1057
		1058	mask |= 0x8;
		1059	*last_ext |= 0x80;
		1060	last_ext = &sl[sl.length ()];
		1061
		1062	sl << uint8 (8) << uint8 (flags);
		1063	}
		1064
		1065	// faces
		1066
		1067	/* Floor face */
		1068	if (update_space (sl, socket, ms, lastcell, 2))
		1069	mask |= 0x4;
		1070
		1071	/* Middle face */
		1072	if (update_space (sl, socket, ms, lastcell, 1))
		1073	mask |= 0x2;
		1074
		1075	if (expect_false (ob->invisible)
		1076	&& ob->invisible & (ob->invisible < 50 ? 1 : 7)
		1077	&& ms.player () == ob)
		1078	{
		1079	// force player to be visible to himself if invisible
		1080	if (lastcell.faces[0] != ob->face)
		1081	{
		1082	lastcell.faces[0] = ob->face;
		1083
		1084	mask |= 0x1;
		1085	sl << uint16 (ob->face);
		1086
		1087	socket.send_faces (ob);
		1088	}
		1089	}
		1090	/* Top face */
		1091	else if (update_space (sl, socket, ms, lastcell, 0))
		1092	mask |= 0x1;
		1093
		1094	/* Check to see if we are in fact sending anything for this
		1095	* space by checking the mask. If so, update the mask.
		1096	* if not, reset the len to that from before adding the mask
		1097	* value, so we don't send those bits.
		1098	*/
		1099	if (mask & 0xf)
		1100	sl[oldlen + 1] = mask & 0xff;
		1101	else
		1102	sl.reset (oldlen);
		1103	} /* else this is a viewable space */
		1104	ordered_mapwalk_end
		1105
		1106	socket.flush_fx ();
		1107
		1108	if (sl.length () > startlen || socket.sent_scroll)
1439	}	1109	{
1440
1441	ns->send_packet (sl);	1110	socket.send_packet (sl);
1442	}	1111	socket.sent_scroll = 0;
1443
1444	/**
1445	* This sends the spell path to name mapping. We ignore
1446	* the params - we always send the same info no matter what.
1447	*/
1448	void
1449	send_spell_paths (client * ns, char *params)
1450	{
1451	packet sl;
1452
1453	sl << "replyinfo spell_paths\n";
1454
1455	for (int i = 0; i < NRSPELLPATHS; i++)
1456	sl.printf ("%d:%s\n", 1 << i, spellpathnames[i]);
1457
1458	if (sl.length () >= MAXSOCKBUF)
1459	{	1112	}
1460	LOG (llevError, "Buffer overflow in send_spell_paths!\n");
1461	fatal (0);
1462	}
1463
1464	ns->send_packet (sl);
1465	}	1113	}
1466		1114
1467	/**	1115	/**
1468	* This looks for any spells the player may have that have changed their stats.	1116	* This looks for any spells the player may have that have changed their stats.
1469	* it then sends an updspell packet for each spell that has changed in this way	1117	* it then sends an updspell packet for each spell that has changed in this way
…		…
1472	esrv_update_spells (player *pl)	1120	esrv_update_spells (player *pl)
1473	{	1121	{
1474	if (!pl->ns)	1122	if (!pl->ns)
1475	return;	1123	return;
1476		1124
		1125	pl->ns->update_spells = false;
		1126
1477	if (!pl->ns->monitor_spells)	1127	if (!pl->ns->monitor_spells)
1478	return;	1128	return;
1479		1129
1480	for (object *spell = pl->ob->inv; spell; spell = spell->below)	1130	for (object *spell = pl->ob->inv; spell; spell = spell->below)
1481	{
1482	if (spell->type == SPELL)	1131	if (spell->type == SPELL)
1483	{	1132	{
1484	int flags = 0;	1133	int flags = 0;
		1134	int val;
1485		1135
1486	/* check if we need to update it */	1136	/* check if we need to update it */
1487	if (spell->last_sp != SP_level_spellpoint_cost (pl->ob, spell, SPELL_MANA))	1137	val = SP_level_spellpoint_cost (pl->ob, spell, SPELL_MANA);
		1138	if (spell->cached_sp != val)
1488	{	1139	{
1489	spell->last_sp = SP_level_spellpoint_cost (pl->ob, spell, SPELL_MANA);	1140	spell->cached_sp = val;
1490	flags |= UPD_SP_MANA;	1141	flags |= UPD_SP_MANA;
1491	}	1142	}
1492		1143
1493	if (spell->last_grace != SP_level_spellpoint_cost (pl->ob, spell, SPELL_GRACE))	1144	val = SP_level_spellpoint_cost (pl->ob, spell, SPELL_GRACE);
		1145	if (spell->cached_grace != val)
1494	{	1146	{
1495	spell->last_grace = SP_level_spellpoint_cost (pl->ob, spell, SPELL_GRACE);	1147	spell->cached_grace = val;
1496	flags |= UPD_SP_GRACE;	1148	flags |= UPD_SP_GRACE;
1497	}	1149	}
1498		1150
1499	if (spell->last_eat != spell->stats.dam + SP_level_dam_adjust (pl->ob, spell))	1151	val = casting_level (pl->ob, spell);
		1152	if (spell->cached_eat != val)
1500	{	1153	{
1501	spell->last_eat = spell->stats.dam + SP_level_dam_adjust (pl->ob, spell);	1154	spell->cached_eat = val;
1502	flags |= UPD_SP_DAMAGE;	1155	flags |= UPD_SP_LEVEL;
1503	}	1156	}
1504		1157
1505	if (flags)	1158	if (flags)
1506	{	1159	{
1507	packet sl;	1160	packet sl;
1508		1161
1509	sl << "updspell "	1162	sl << "updspell "
1510	<< uint8 (flags)	1163	<< uint8 (flags)
1511	<< uint32 (spell->count);	1164	<< uint32 (spell->count);
1512		1165
1513	if (flags & UPD_SP_MANA ) sl << uint16 (spell->last_sp);	1166	if (flags & UPD_SP_MANA ) sl << uint16 (spell->cached_sp);
1514	if (flags & UPD_SP_GRACE ) sl << uint16 (spell->last_grace);	1167	if (flags & UPD_SP_GRACE) sl << uint16 (spell->cached_grace);
1515	if (flags & UPD_SP_DAMAGE) sl << uint16 (spell->last_eat);	1168	if (flags & UPD_SP_LEVEL) sl << uint16 (spell->cached_eat);
1516		1169
1517	pl->ns->send_packet (sl);	1170	pl->ns->send_packet (sl);
1518	}	1171	}
1519	}	1172	}
1520	}
1521	}	1173	}
1522		1174
1523	void	1175	void
1524	esrv_remove_spell (player *pl, object *spell)	1176	esrv_remove_spell (player *pl, object *spell)
1525	{	1177	{
…		…
1541		1193
1542	/* appends the spell *spell to the Socklist we will send the data to. */	1194	/* appends the spell *spell to the Socklist we will send the data to. */
1543	static void	1195	static void
1544	append_spell (player *pl, packet &sl, object *spell)	1196	append_spell (player *pl, packet &sl, object *spell)
1545	{	1197	{
1546	int i, skill = 0;	1198	int skill = 0;
1547		1199
1548	if (!(spell->name))	1200	if (!(spell->name))
1549	{	1201	{
1550	LOG (llevError, "item number %d is a spell with no name.\n", spell->count);	1202	LOG (llevError, "item number %d is a spell with no name.\n", spell->count);
1551	return;	1203	return;
1552	}	1204	}
1553		1205
1554	/* store costs and damage in the object struct, to compare to later */	1206	/* 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);	1207	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);	1208	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);	1209	spell->cached_eat = casting_level (pl->ob, spell);
1558		1210
1559	/* figure out which skill it uses, if it uses one */	1211	/* figure out which skill it uses, if it uses one */
1560	if (spell->skill)	1212	if (spell->skill)
1561	{	1213	if (object *tmp = pl->find_skill (spell->skill))
1562	for (i = 1; i < NUM_SKILLS; i++)	1214	skill = CS_STAT_SKILLINFO + SKILL_INDEX (tmp);
1563	if (!strcmp (spell->skill, skill_names[i]))
1564	{
1565	skill = i + CS_STAT_SKILLINFO;
1566	break;
1567	}
1568	}
1569		1215
1570	// spells better have a face	1216	// spells better have a face
1571	if (!spell->face)	1217	if (!spell->face)
1572	{	1218	{
1573	LOG (llevError, "%s: spell has no face, but face is mandatory.\n", &spell->name);	1219	LOG (llevError, "%s: spell has no face, but face is mandatory.\n", &spell->name);
1574	spell->face = face_find ("burnout.x11", blank_face);	1220	spell->face = face_find ("burnout.x11", blank_face);
1575	}	1221	}
		1222
		1223	pl->ns->send_face (spell->face);
1576		1224
1577	/* send the current values */	1225	/* send the current values */
1578	sl << uint32 (spell->count)	1226	sl << uint32 (spell->count)
1579	<< uint16 (spell->level)	1227	<< uint16 (spell->level)
1580	<< uint16 (spell->casting_time)	1228	<< uint16 (spell->casting_time)
1581	<< uint16 (spell->last_sp)	1229	<< uint16 (spell->cached_sp)
1582	<< uint16 (spell->last_grace)	1230	<< uint16 (spell->cached_grace)
1583	<< uint16 (spell->last_eat)	1231	<< uint16 (spell->cached_eat)
1584	<< uint8 (skill)	1232	<< uint8 (skill)
1585	<< uint32 (spell->path_attuned)	1233	<< uint32 (spell->path_attuned)
1586	<< uint32 (spell->face)	1234	<< uint32 (spell->face)
1587	<< data8 (spell->name)	1235	<< data8 (spell->name);
		1236
		1237	if (pl->ns->monitor_spells < 2)
1588	<< data16 (spell->msg);	1238	sl << data16 (spell->msg);
1589	}	1239	}
1590		1240
1591	/**	1241	/**
1592	* This tells the client to add the spell *ob, if *ob is NULL, then add	1242	* This tells the client to add the spell *ob, if *ob is NULL, then add
1593	* all spells in the player's inventory.	1243	* all spells in the player's inventory.
…		…
1616	* bytes and 3 strings (because that is the spec) so we need to	1266	* 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,	1267	* 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,	1268	* 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	1269	* we need to send what we already have, and restart packet formation
1620	*/	1270	*/
		1271	if (spell->type != SPELL)
		1272	continue;
		1273
1621	/* Seeing crashes by overflowed buffers. Quick arithemetic seems	1274	/* Seeing crashes by overflowed buffers. Quick arithemetic seems
1622	* to show add_spell is 26 bytes + 2 strings. However, the overun	1275	* 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	1276	* is hundreds of bytes off, so correcting 22 vs 26 doesn't seem
1624	* like it will fix this	1277	* like it will fix this
1625	*/	1278	*/
1626	if (spell->type != SPELL)
1627	continue;
1628
1629	if (sl.length () >= (MAXSOCKBUF - (26 + strlen (spell->name) + (spell->msg ? strlen (spell->msg) : 0))))	1279	if (sl.length () > (MAXSOCKBUF - (26 + strlen (spell->name) + (spell->msg ? strlen (spell->msg) : 0))))
1630	{	1280	{
		1281	pl->ns->flush_fx ();
1631	pl->ns->send_packet (sl);	1282	pl->ns->send_packet (sl);
1632		1283
1633	sl.reset ();	1284	sl.reset ();
1634	sl << "addspell ";	1285	sl << "addspell ";
1635	}	1286	}
…		…
1643	return;	1294	return;
1644	}	1295	}
1645	else	1296	else
1646	append_spell (pl, sl, spell);	1297	append_spell (pl, sl, spell);
1647		1298
1648	if (sl.length () >= MAXSOCKBUF)	1299	if (sl.length () > MAXSOCKBUF)
1649	{
1650	LOG (llevError, "Buffer overflow in esrv_add_spells!\n");	1300	cleanup ("buffer overflow in esrv_add_spells!");
1651	fatal (0);
1652	}
1653		1301
1654	/* finally, we can send the packet */	1302	/* finally, we can send the packet */
		1303	pl->ns->flush_fx ();
1655	pl->ns->send_packet (sl);	1304	pl->ns->send_packet (sl);
1656	}	1305	}
1657		1306
		1307	//-GPL
		1308

Diff Legend

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