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.67 by pippijn, Thu Mar 1 12:28:17 2007 UTC vs.
Revision 1.164 by root, Fri Mar 26 00:59:22 2010 UTC

1	/*	1	/*
2	* CrossFire, A Multiplayer game for X-windows	2	* This file is part of Deliantra, the Roguelike Realtime MMORPG.
3	*	3	*
4	* Copyright (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team	4	* Copyright (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
5	* Copyright (C) 2001 Mark Wedel	5	* Copyright (©) 2001 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	*	17	*
18	* You should have received a copy of the GNU General Public License	18	* You should have received a copy of the Affero GNU General Public License
19	* along with this program; if not, write to the Free Software	19	* and the GNU General Public License along with this program. If not, see
20	* Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.	20	* <http://www.gnu.org/licenses/>.
21	*	21	*
22	* The author can be reached via e-mail to <crossfire@schmorp.de>	22	* The authors can be reached via e-mail to <support@deliantra.net>
23	*/	23	*/
		24
		25	//+GPL
24		26
25	/**	27	/**
26	* \file	28	* \file
27	* Client handling.	29	* Client handling.
28	*	30	*
…		…
64	* This table translates the attack numbers as used within the	66	* This table translates the attack numbers as used within the
65	* program to the value we use when sending STATS command to the	67	* 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	68	* client. If a value is -1, then we don't send that to the
67	* client.	69	* client.
68	*/	70	*/
69	short atnr_cs_stat[NROFATTACKS] = { CS_STAT_RES_PHYS,	71	static short atnr_cs_stat[NROFATTACKS] = { CS_STAT_RES_PHYS,
70	CS_STAT_RES_MAG, CS_STAT_RES_FIRE, CS_STAT_RES_ELEC,	72	CS_STAT_RES_MAG, CS_STAT_RES_FIRE, CS_STAT_RES_ELEC,
71	CS_STAT_RES_COLD, CS_STAT_RES_CONF, CS_STAT_RES_ACID,	73	CS_STAT_RES_COLD, CS_STAT_RES_CONF, CS_STAT_RES_ACID,
72	CS_STAT_RES_DRAIN, -1 /* weaponmagic */ ,	74	CS_STAT_RES_DRAIN, -1 /* weaponmagic */ ,
73	CS_STAT_RES_GHOSTHIT, CS_STAT_RES_POISON,	75	CS_STAT_RES_GHOSTHIT, CS_STAT_RES_POISON,
74	CS_STAT_RES_SLOW, CS_STAT_RES_PARA, CS_STAT_TURN_UNDEAD,	76	CS_STAT_RES_SLOW, CS_STAT_RES_PARA, CS_STAT_TURN_UNDEAD,
…		…
98	* that much difference in bandwidth.	100	* that much difference in bandwidth.
99	*/	101	*/
100	mx = ns->mapx;	102	mx = ns->mapx;
101	my = ns->mapy;	103	my = ns->mapy;
102		104
103	if (ns->mapmode == Map1aCmd)
104	{
105	mx += MAX_HEAD_OFFSET;
106	my += MAX_HEAD_OFFSET;
107	}
108
109	/* the x and y here are coordinates for the new map, i.e. if we moved	105	/* the x and y here are coordinates for the new map, i.e. if we moved
110	* (dx,dy), newmap[x][y] = oldmap[x-dx][y-dy]. For this reason,	106	* (dx,dy), newmap[x][y] = oldmap[x-dx][y-dy]. For this reason,
111	* if the destination x or y coordinate is outside the viewable	107	* if the destination x or y coordinate is outside the viewable
112	* area, we clear the values - otherwise, the old values	108	* area, we clear the values - otherwise, the old values
113	* are preserved, and the check_head thinks it needs to clear them.	109	* are preserved, and the check_head thinks it needs to clear them.
114	*/	110	*/
115	for (x = 0; x < mx; x++)	111	for (x = 0; x < mx; x++)
116	{
117	for (y = 0; y < my; y++)	112	for (y = 0; y < my; y++)
118	{
119	if (x >= ns->mapx || y >= ns->mapy)	113	if (x >= ns->mapx || y >= ns->mapy)
120	/* clear cells outside the viewable area */	114	/* clear cells outside the viewable area */
121	memset (&newmap.cells[x][y], 0, sizeof (struct MapCell));	115	memset (&newmap.cells[x][y], 0, sizeof (struct MapCell));
122	else if ((x + dx) < 0 || (x + dx) >= ns->mapx || (y + dy) < 0 || (y + dy) >= ns->mapy)	116	else if ((x + dx) < 0 || (x + dx) >= ns->mapx || (y + dy) < 0 || (y + dy) >= ns->mapy)
123	/* clear newly visible tiles within the viewable area */	117	/* clear newly visible tiles within the viewable area */
124	memset (&(newmap.cells[x][y]), 0, sizeof (struct MapCell));	118	memset (&(newmap.cells[x][y]), 0, sizeof (struct MapCell));
125	else	119	else
126	memcpy (&(newmap.cells[x][y]), &(ns->lastmap.cells[x + dx][y + dy]), sizeof (struct MapCell));	120	memcpy (&(newmap.cells[x][y]), &(ns->lastmap.cells[x + dx][y + dy]), sizeof (struct MapCell));
127	}
128	}
129		121
130	memcpy (&(ns->lastmap), &newmap, sizeof (struct Map));	122	memcpy (&(ns->lastmap), &newmap, sizeof (struct Map));
131		123
132	/* Make sure that the next "map1" command will be sent (even if it is	124	/* Make sure that the next "map1" command will be sent (even if it is
133	* empty).	125	* empty).
…		…
136	}	128	}
137		129
138	static void	130	static void
139	clear_map (player *pl)	131	clear_map (player *pl)
140	{	132	{
		133	pl->ns->mapinfo_queue_clear ();
		134
141	memset (&pl->ns->lastmap, 0, sizeof (pl->ns->lastmap));	135	memset (&pl->ns->lastmap, 0, sizeof (pl->ns->lastmap));
		136
		137	pl->ns->force_newmap = false;
142		138
143	if (pl->ns->newmapcmd == 1)	139	if (pl->ns->newmapcmd == 1)
144	pl->ns->send_packet ("newmap");	140	pl->ns->send_packet ("newmap");
145		141
146	pl->ns->floorbox_reset ();	142	pl->ns->floorbox_reset ();
		143	}
		144
		145	static void
		146	send_map_info (player *pl)
		147	{
		148	client &socket = *pl->ns;
		149	object *ob = pl->viewpoint;
		150
		151	if (socket.mapinfocmd)
		152	{
		153	if (ob->map && ob->map->path[0])
		154	{
		155	int flags = 0;
		156
		157	if (ob->map->tile_path[0]) flags |= 1;
		158	if (ob->map->tile_path[1]) flags |= 2;
		159	if (ob->map->tile_path[2]) flags |= 4;
		160	if (ob->map->tile_path[3]) flags |= 8;
		161
		162	socket.send_packet_printf ("mapinfo - spatial %d %d %d %d %d %s",
		163	flags, socket.mapx / 2 - ob->x, socket.mapy / 2 - ob->y,
		164	ob->map->width, ob->map->height, &ob->map->path);
		165	}
		166	else
		167	socket.send_packet ("mapinfo current");
		168	}
147	}	169	}
148		170
149	/** check for map/region change and send new map data */	171	/** check for map/region change and send new map data */
150	static void	172	static void
151	check_map_change (player *pl)	173	check_map_change (player *pl)
152	{	174	{
153	client &socket = *pl->ns;	175	client &socket = *pl->ns;
154	object *ob = pl->ob;	176	object *ob = pl->viewpoint;
155	char buf[MAX_BUF]; /* eauugggh */
156		177
157	if (socket.current_map != ob->map)	178	region *reg = ob->region ();
		179	if (socket.current_region != reg)
		180	{
		181	INVOKE_PLAYER (REGION_CHANGE, pl, ARG_REGION (reg), ARG_REGION (socket.current_region));
		182	socket.current_region = reg;
158	{	183	}
		184
		185	// first try to aovid a full newmap on tiled map scrolls
		186	if (socket.current_map != ob->map && !socket.force_newmap)
		187	{
		188	rv_vector rv;
		189
		190	get_rangevector_from_mapcoord (socket.current_map, socket.current_x, socket.current_y, ob, &rv, 0);
		191
		192	// manhattan distance is very handy here
		193	if (rv.distance < 8) // 8 works nicely for speed << 70 and buggy gcfclient
		194	{
		195	socket.current_map = ob->map;
		196	socket.current_x = ob->x;
		197	socket.current_y = ob->y;
		198
		199	socket_map_scroll (&socket, rv.distance_x, rv.distance_y);
		200	socket.floorbox_reset ();
		201	send_map_info (pl);
		202	}
		203	}
		204
		205	if (socket.current_map != ob->map || socket.force_newmap)
		206	{
		207	clear_map (pl);
159	socket.current_map = ob->map;	208	socket.current_map = ob->map;
160		209	send_map_info (pl);
161	clear_map (pl);
162
163	if (socket.mapinfocmd)
164	{
165	if (ob->map && ob->map->path[0])
166	{
167	int flags = 0;
168
169	if (ob->map->tile_path[0])
170	flags |= 1;
171	if (ob->map->tile_path[1])
172	flags |= 2;
173	if (ob->map->tile_path[2])
174	flags |= 4;
175	if (ob->map->tile_path[3])
176	flags |= 8;
177
178	snprintf (buf, MAX_BUF, "mapinfo - spatial %d %d %d %d %d %s",
179	flags, socket.mapx / 2 - ob->x, socket.mapy / 2 - ob->y, ob->map->width, ob->map->height, &ob->map->path);
180	}
181	else
182	snprintf (buf, MAX_BUF, "mapinfo current");
183
184	socket.send_packet (buf);
185	}
186	}	210	}
187	else if (socket.current_x != ob->x || socket.current_y != ob->y)	211	else if (socket.current_x != ob->x || socket.current_y != ob->y)
188	{	212	{
189	int dx = ob->x - socket.current_x;	213	int dx = ob->x - socket.current_x;
190	int dy = ob->y - socket.current_y;	214	int dy = ob->y - socket.current_y;
191		215
192	if (socket.buggy_mapscroll && (abs (dx) > 8 || abs (dy) > 8))
193	clear_map (pl); // current (<= 1.9.1) clients have unchecked buffer overflows
194	else
195	{
196	socket_map_scroll (&socket, ob->x - socket.current_x, ob->y - socket.current_y);	216	socket_map_scroll (&socket, ob->x - socket.current_x, ob->y - socket.current_y);
197	socket.floorbox_reset ();	217	socket.floorbox_reset ();
198	}
199	}	218	}
200		219
201	socket.current_x = ob->x;	220	socket.current_x = ob->x;
202	socket.current_y = ob->y;	221	socket.current_y = ob->y;
		222	}
203		223
204	region *reg = ob->region ();	224	/**
205	if (socket.current_region != reg)	225	* This sends the skill number to name mapping. We ignore
206	{	226	* the params - we always send the same info no matter what.
207	socket.current_region = reg;	227	*/
208	socket.send_packet_printf ("drawinfo 0 You are now %s.\n(use whereami for more details)", &reg->longname);	228	static void
		229	send_skill_info (client *ns, char *params)
		230	{
		231	packet sl;
		232	sl << "replyinfo skill_info\n";
		233
		234	for (int i = 1; i < NUM_SKILLS; i++)
		235	sl.printf ("%d:%s\n", i + CS_STAT_SKILLINFO, &skill_names [i]);
		236
		237	if (sl.length () > MAXSOCKBUF)
209	}	238	{
		239	LOG (llevError, "Buffer overflow in send_skill_info!\n");
		240	fatal (0);
		241	}
		242
		243	ns->send_packet (sl);
		244	}
		245
		246	/**
		247	* This sends the spell path to name mapping. We ignore
		248	* the params - we always send the same info no matter what.
		249	*/
		250	static void
		251	send_spell_paths (client * ns, char *params)
		252	{
		253	packet sl;
		254
		255	sl << "replyinfo spell_paths\n";
		256
		257	for (int i = 0; i < NRSPELLPATHS; i++)
		258	sl.printf ("%d:%s\n", 1 << i, spellpathnames[i]);
		259
		260	if (sl.length () > MAXSOCKBUF)
		261	{
		262	LOG (llevError, "Buffer overflow in send_spell_paths!\n");
		263	fatal (0);
		264	}
		265
		266	ns->send_packet (sl);
210	}	267	}
211		268
212	/**	269	/**
213	* RequestInfo is sort of a meta command. There is some specific	270	* RequestInfo is sort of a meta command. There is some specific
214	* request of information, but we call other functions to provide	271	* request of information, but we call other functions to provide
215	* that information.	272	* that information.
216	*/	273	*/
217	void	274	void
218	RequestInfo (char *buf, int len, client * ns)	275	RequestInfo (char *buf, int len, client *ns)
219	{	276	{
220	char *params = NULL, *cp;	277	char *params;
221
222	/* No match */
223	char bigbuf[MAX_BUF];
224	int slen;
225
226	/* Set up replyinfo before we modify any of the buffers - this is used
227	* if we don't find a match.
228	*/
229	strcpy (bigbuf, "replyinfo ");
230	slen = strlen (bigbuf);
231	safe_strcat (bigbuf, buf, &slen, MAX_BUF);
232		278
233	/* find the first space, make it null, and update the	279	/* find the first space, make it null, and update the
234	* params pointer.	280	* params pointer.
235	*/	281	*/
236	for (cp = buf; *cp != '\0'; cp++)	282	for (params = buf; *params; params++)
237	if (*cp == ' ')	283	if (*params == ' ')
238	{	284	{
239	*cp = '\0';
240	params = cp + 1;	285	*params++ = 0;
241	break;	286	break;
242	}	287	}
243		288
244	if (!strcmp (buf, "image_info"))
245	send_image_info (ns, params);
246	else if (!strcmp (buf, "image_sums"))
247	send_image_sums (ns, params);
248	else if (!strcmp (buf, "skill_info"))	289	if (!strcmp (buf, "skill_info"))
249	send_skill_info (ns, params);	290	send_skill_info (ns, params);
250	else if (!strcmp (buf, "spell_paths"))	291	else if (!strcmp (buf, "spell_paths"))
251	send_spell_paths (ns, params);	292	send_spell_paths (ns, params);
252	else	293	else
253	ns->send_packet (bigbuf, len);	294	{
		295	// undo tokenisation above and send replyinfo with the request unchanged
		296	if (*params)
		297	*--params = ' ';
		298
		299	ns->send_packet_printf ("replyinfo %s", buf);
		300	}
254	}	301	}
255		302
256	void	303	void
257	ExtCmd (char *buf, int len, player *pl)	304	ExtCmd (char *buf, int len, player *pl)
258	{	305	{
…		…
261		308
262	void	309	void
263	ExtiCmd (char *buf, int len, client *ns)	310	ExtiCmd (char *buf, int len, client *ns)
264	{	311	{
265	INVOKE_CLIENT (EXTICMD, ns, ARG_DATA (buf, len));	312	INVOKE_CLIENT (EXTICMD, ns, ARG_DATA (buf, len));
		313	}
		314
		315	//-GPL
		316
		317	void
		318	client::mapinfo_queue_clear ()
		319	{
		320	for (auto (i, mapinfo_queue.begin ()); i != mapinfo_queue.end (); ++i)
		321	free (*i);
		322
		323	mapinfo_queue.clear ();
		324	}
		325
		326	bool
		327	client::mapinfo_try (char *buf)
		328	{
		329	char *token = buf;
		330	buf += strlen (buf) + 9;
		331
		332	// initial map and its origin
		333	maptile *map = pl->viewpoint->map;
		334	int mapx = pl->ns->mapx / 2 - pl->viewpoint->x;
		335	int mapy = pl->ns->mapy / 2 - pl->viewpoint->y;
		336	int max_distance = 8; // limit maximum path length to something generous
		337
		338	while (*buf && map && max_distance)
		339	{
		340	int dir = *buf++ - '1';
		341
		342	if (dir >= 0 && dir <= 3)
		343	{
		344	if (!map->tile_path [dir])
		345	map = 0;
		346	else if (map->tile_available (dir, false))
		347	{
		348	maptile *neigh = map->tile_map [dir];
		349
		350	switch (dir)
		351	{
		352	case 0: mapy -= neigh->height; break;
		353	case 2: mapy += map ->height; break;
		354	case 3: mapx -= neigh->width ; break;
		355	case 1: mapx += map ->width ; break;
		356	}
		357
		358	map = neigh;
		359	--max_distance;
		360	}
		361	else
		362	return 0;
		363	}
		364	else
		365	max_distance = 0;
		366	}
		367
		368	if (!max_distance)
		369	send_packet_printf ("mapinfo %s error", token);
		370	else if (!map || !map->path)
		371	send_packet_printf ("mapinfo %s nomap", token);
		372	else
		373	{
		374	int flags = 0;
		375
		376	if (map->tile_path[0]) flags |= 1;
		377	if (map->tile_path[1]) flags |= 2;
		378	if (map->tile_path[2]) flags |= 4;
		379	if (map->tile_path[3]) flags |= 8;
		380
		381	send_packet_printf ("mapinfo %s spatial %d %d %d %d %d %s", token, flags, mapx, mapy, map->width, map->height, &map->path);
		382	}
		383
		384	return 1;
		385	}
		386
		387	void
		388	client::mapinfo_queue_run ()
		389	{
		390	if (mapinfo_queue.empty () || !pl)
		391	return;
		392
		393	for (int i = 0; i < mapinfo_queue.size (); ++i)
		394	if (mapinfo_try (mapinfo_queue [i]))
		395	{
		396	free (mapinfo_queue [i]);
		397	mapinfo_queue.erase (i);
		398	}
		399	else
		400	++i;
266	}	401	}
267		402
268	void	403	void
269	MapInfoCmd (char *buf, int len, player *pl)	404	MapInfoCmd (char *buf, int len, player *pl)
270	{	405	{
271	// <mapinfo tag spatial tile-path	406	// <mapinfo tag spatial tile-path
272	// >mapinfo tag spatial flags x y w h hash	407	// >mapinfo tag spatial flags x y w h hash
273		408
274	char bigbuf[MAX_BUF], *token;
275
276	token = buf;	409	char *token = buf;
277	// copy token	410
278	if (!(buf = strchr (buf, ' ')))	411	if (!(buf = strchr (buf, ' ')))
279	return;	412	return;
280		413
281	*buf++ = 0;
282
283	if (!strncmp (buf, "spatial ", 8))	414	if (!strncmp (buf, " spatial ", 9))
284	{	415	{
285	buf += 8;	416	char *copy = strdup (token);
		417	copy [buf - token] = 0;
286		418
287	// initial map and its origin	419	#if 0
288	maptile *map = pl->ob->map;	420	// this makes only sense when we flush the buffer immediately
289	sint16 dx, dy;	421	if (pl->ns->mapinfo_try (copy))
290	int mapx = pl->ns->mapx / 2 - pl->ob->x;	422	free (copy);
291	int mapy = pl->ns->mapy / 2 - pl->ob->y;
292	int max_distance = 8; // limit maximum path length to something generous
293
294	while (*buf && map && max_distance)
295	{
296	int dir = *buf++;
297
298	switch (dir)
299	{
300	case '1':
301	dx = 0;
302	dy = -1;
303	map = map->xy_find (dx, dy);
304	map && (mapy -= map->height);
305	break;
306	case '2':
307	mapx += map->width;
308	dx = map->width;
309	dy = 0;
310	map = map->xy_find (dx, dy);
311	break;
312	case '3':
313	mapy += map->height;
314	dx = 0;
315	dy = map->height;
316	map = map->xy_find (dx, dy);
317	break;
318	case '4':
319	dx = -1;
320	dy = 0;
321	map = map->xy_find (dx, dy);
322	map && (mapx -= map->width);
323	break;
324	}
325
326	--max_distance;
327	}
328
329	if (!max_distance)
330	snprintf (bigbuf, MAX_BUF, "mapinfo %s error", token);
331	else if (map && map->path[0])
332	{
333	int flags = 0;
334
335	if (map->tile_path[0])
336	flags |= 1;
337	if (map->tile_path[1])
338	flags |= 2;
339	if (map->tile_path[2])
340	flags |= 4;
341	if (map->tile_path[3])
342	flags |= 8;
343
344	snprintf (bigbuf, MAX_BUF, "mapinfo %s spatial %d %d %d %d %d %s", token, flags, mapx, mapy, map->width, map->height, &map->path);
345	}
346	else	423	else
347	snprintf (bigbuf, MAX_BUF, "mapinfo %s nomap", token);	424	#endif
		425	pl->ns->mapinfo_queue.push_back (copy);
348	}	426	}
349	else	427	else
350	snprintf (bigbuf, MAX_BUF, "mapinfo %s unsupported", token);	428	pl->ns->send_packet_printf ("mapinfo %s unsupported", token);
351
352	pl->ns->send_packet (bigbuf);
353	}	429	}
354		430
355	/** This is the Setup cmd - easy first implementation */	431	/** This is the Setup cmd */
356	void	432	void
357	SetUp (char *buf, int len, client * ns)	433	SetUp (char *buf, int len, client * ns)
358	{	434	{
359	int s, slen;	435	INVOKE_CLIENT (SETUP, ns, ARG_DATA (buf, len));
360	char *cmd, *param, cmdback[HUGE_BUF];
361
362	/* run through the cmds of setup
363	* syntax is setup <cmdname1> <parameter> <cmdname2> <parameter> ...
364	*
365	* we send the status of the cmd back, or a FALSE is the cmd is the server unknown
366	* The client then must sort this out
367	*/
368
369	//LOG (llevInfo, "Get SetupCmd:: %s\n", buf);
370
371	strcpy (cmdback, "setup");
372	for (s = 0; s < len; )
373	{
374	cmd = &buf[s];
375
376	/* find the next space, and put a null there */
377	for (; buf[s] && buf[s] != ' '; s++)
378	;
379
380	buf[s++] = 0;
381
382	while (buf[s] == ' ')
383	s++;
384
385	if (s >= len)
386	break;
387
388	param = &buf[s];
389
390	for (; buf[s] && buf[s] != ' '; s++)
391	;
392
393	buf[s++] = 0;
394
395	while (buf[s] == ' ')
396	s++;
397
398	slen = strlen (cmdback);
399	safe_strcat (cmdback, " ", &slen, HUGE_BUF);
400	safe_strcat (cmdback, cmd, &slen, HUGE_BUF);
401	safe_strcat (cmdback, " ", &slen, HUGE_BUF);
402
403	if (!strcmp (cmd, "sound"))
404	{
405	ns->sound = atoi (param);
406	safe_strcat (cmdback, param, &slen, HUGE_BUF);
407	}
408	else if (!strcmp (cmd, "exp64"))
409	safe_strcat (cmdback, param, &slen, HUGE_BUF);
410	else if (!strcmp (cmd, "spellmon"))
411	{
412	ns->monitor_spells = atoi (param);
413	safe_strcat (cmdback, param, &slen, HUGE_BUF);
414	}
415	else if (!strcmp (cmd, "darkness"))
416	{
417	ns->darkness = atoi (param);
418	safe_strcat (cmdback, param, &slen, HUGE_BUF);
419	}
420	else if (!strcmp (cmd, "map1cmd"))
421	{
422	if (atoi (param))
423	ns->mapmode = Map1Cmd;
424	/* if beyond this size, need to use map1cmd no matter what */
425	if (ns->mapx > 11 || ns->mapy > 11)
426	ns->mapmode = Map1Cmd;
427	safe_strcat (cmdback, ns->mapmode == Map1Cmd ? "1" : "0", &slen, HUGE_BUF);
428	}
429	else if (!strcmp (cmd, "map1acmd"))
430	{
431	if (atoi (param))
432	ns->mapmode = Map1aCmd;
433	/* if beyond this size, need to use map1acmd no matter what */
434	if (ns->mapx > 11 || ns->mapy > 11)
435	ns->mapmode = Map1aCmd;
436	safe_strcat (cmdback, ns->mapmode == Map1aCmd ? "1" : "0", &slen, HUGE_BUF);
437	}
438	else if (!strcmp (cmd, "newmapcmd"))
439	{
440	ns->newmapcmd = atoi (param);
441	safe_strcat (cmdback, param, &slen, HUGE_BUF);
442	// } else if (!strcmp(cmd,"plugincmd")) {
443	// ns->plugincmd = atoi(param);
444	// safe_strcat(cmdback, param, &slen, HUGE_BUF);
445	}
446	else if (!strcmp (cmd, "mapinfocmd"))
447	{
448	ns->mapinfocmd = atoi (param);
449	safe_strcat (cmdback, "1", &slen, HUGE_BUF);
450	}
451	else if (!strcmp (cmd, "extcmd"))
452	{
453	ns->extcmd = atoi (param);
454	safe_strcat (cmdback, "1", &slen, HUGE_BUF);
455	}
456	else if (!strcmp (cmd, "extmap"))
457	{
458	ns->extmap = atoi (param);
459	safe_strcat (cmdback, "1", &slen, HUGE_BUF);
460	}
461	else if (!strcmp (cmd, "facecache"))
462	{
463	ns->facecache = atoi (param);
464	safe_strcat (cmdback, param, &slen, HUGE_BUF);
465	}
466	else if (!strcmp (cmd, "faceset"))
467	{
468	char tmpbuf[20];
469	int q = atoi (param);
470
471	if (is_valid_faceset (q))
472	ns->faceset = q;
473	sprintf (tmpbuf, "%d", ns->faceset);
474	safe_strcat (cmdback, tmpbuf, &slen, HUGE_BUF);
475	/* if the client is using faceset, it knows about image2 command */
476	ns->image2 = 1;
477	}
478	else if (!strcmp (cmd, "itemcmd"))
479	{
480	/* Version of the item protocol command to use. Currently,
481	* only supported versions are 1 and 2. Using a numeric
482	* value will make it very easy to extend this in the future.
483	*/
484	char tmpbuf[20];
485	int q = atoi (param);
486
487	if (q < 1 || q > 2)
488	{
489	strcpy (tmpbuf, "FALSE");
490	}
491	else
492	{
493	ns->itemcmd = q;
494	sprintf (tmpbuf, "%d", ns->itemcmd);
495	}
496	safe_strcat (cmdback, tmpbuf, &slen, HUGE_BUF);
497	}
498	else if (!strcmp (cmd, "mapsize"))
499	{
500	int x, y = 0;
501	char tmpbuf[MAX_BUF], *cp;
502
503	x = atoi (param);
504	for (cp = param; *cp != 0; cp++)
505	if (*cp == 'x' || *cp == 'X')
506	{
507	y = atoi (cp + 1);
508	break;
509	}
510	if (x < 9 || y < 9 || x > MAP_CLIENT_X || y > MAP_CLIENT_Y)
511	{
512	sprintf (tmpbuf, " %dx%d", MAP_CLIENT_X, MAP_CLIENT_Y);
513	safe_strcat (cmdback, tmpbuf, &slen, HUGE_BUF);
514	}
515	else
516	{
517	ns->mapx = x;
518	ns->mapy = y;
519	/* better to send back what we are really using and not the
520	* param as given to us in case it gets parsed differently.
521	*/
522	sprintf (tmpbuf, "%dx%d", x, y);
523	safe_strcat (cmdback, tmpbuf, &slen, HUGE_BUF);
524	/* If beyond this size and still using orig map command, need to
525	* go to map1cmd.
526	*/
527	if ((x > 11 || y > 11) && ns->mapmode == Map0Cmd)
528	ns->mapmode = Map1Cmd;
529	}
530	}
531	else if (!strcmp (cmd, "extendedMapInfos"))
532	{
533	/* Added by tchize
534	* prepare to use the mapextended command
535	*/
536	char tmpbuf[20];
537
538	ns->ext_mapinfos = (atoi (param));
539	sprintf (tmpbuf, "%d", ns->ext_mapinfos);
540	safe_strcat (cmdback, tmpbuf, &slen, HUGE_BUF);
541	}
542	else if (!strcmp (cmd, "extendedTextInfos"))
543	{
544	/* Added by tchize
545	* prepare to use the extended text commands
546	* Client toggle this to non zero to get exttext
547	*/
548	char tmpbuf[20];
549
550	ns->has_readable_type = (atoi (param));
551	sprintf (tmpbuf, "%d", ns->has_readable_type);
552	safe_strcat (cmdback, tmpbuf, &slen, HUGE_BUF);
553	}
554	else
555	{
556	/* Didn't get a setup command we understood -
557	* report a failure to the client.
558	*/
559	safe_strcat (cmdback, "FALSE", &slen, HUGE_BUF);
560	}
561	} /* for processing all the setup commands */
562
563	LOG (llevInfo, "SendBack SetupCmd:: %s\n", cmdback);
564	ns->send_packet (cmdback);
565	}	436	}
566		437
567	/**	438	/**
568	* The client has requested to be added to the game.	439	* The client has requested to be added to the game.
569	* This is what takes care of it. We tell the client how things worked out.	440	* This is what takes care of it. We tell the client how things worked out.
570	* I am not sure if this file is the best place for this function. however,	441	* I am not sure if this file is the best place for this function. however,
571	* it either has to be here or init_sockets needs to be exported.	442	* it either has to be here or init_sockets needs to be exported.
572	*/	443	*/
573	void	444	void
574	AddMeCmd (char *buf, int len, client * ns)	445	AddMeCmd (char *buf, int len, client *ns)
575	{	446	{
576	INVOKE_CLIENT (ADDME, ns, ARG_DATA (buf, len));	447	INVOKE_CLIENT (ADDME, ns, ARG_DATA (buf, len));
577	}	448	}
578		449
579	/** Reply to ExtendedInfos command */	450	//+GPL
580	void
581	ToggleExtendedInfos (char *buf, int len, client * ns)
582	{
583	char cmdback[MAX_BUF];
584	char command[50];
585	int info, nextinfo;
586
587	cmdback[0] = '\0';
588	nextinfo = 0;
589
590	while (1)
591	{
592	/* 1. Extract an info */
593	info = nextinfo;
594
595	while ((info < len) && (buf[info] == ' '))
596	info++;
597
598	if (info >= len)
599	break;
600
601	nextinfo = info + 1;
602
603	while ((nextinfo < len) && (buf[nextinfo] != ' '))
604	nextinfo++;
605
606	if (nextinfo - info >= 49) /*Erroneous info asked */
607	continue;
608
609	strncpy (command, &(buf[info]), nextinfo - info);
610
611	/* 2. Interpret info */
612	if (!strcmp ("smooth", command))
613	/* Toggle smoothing */
614	ns->EMI_smooth = !ns->EMI_smooth;
615	else
616	/*bad value */;
617
618	/*3. Next info */
619	}
620
621	strcpy (cmdback, "ExtendedInfoSet");
622
623	if (ns->EMI_smooth)
624	{
625	strcat (cmdback, " ");
626	strcat (cmdback, "smoothing");
627	}
628
629	ns->send_packet (cmdback);
630	}
631		451
632	/*	452	/*
633	#define MSG_TYPE_BOOK 1	453	#define MSG_TYPE_BOOK 1
634	#define MSG_TYPE_CARD 2	454	#define MSG_TYPE_CARD 2
635	#define MSG_TYPE_PAPER 3	455	#define MSG_TYPE_PAPER 3
…		…
652	while (1)	472	while (1)
653	{	473	{
654	/* 1. Extract an info */	474	/* 1. Extract an info */
655	info = nextinfo;	475	info = nextinfo;
656		476
657	while ((info < len) && (buf[info] == ' '))	477	while ((info < len) && (buf [info] == ' '))
658	info++;	478	info++;
659		479
660	if (info >= len)	480	if (info >= len)
661	break;	481	break;
662		482
663	nextinfo = info + 1;	483	nextinfo = info + 1;
664		484
665	while ((nextinfo < len) && (buf[nextinfo] != ' '))	485	while ((nextinfo < len) && (buf [nextinfo] != ' '))
666	nextinfo++;	486	nextinfo++;
667		487
668	if (nextinfo - info >= 49) /*Erroneous info asked */	488	if (nextinfo - info >= 49) /*Erroneous info asked */
669	continue;	489	continue;
670		490
671	strncpy (command, &(buf[info]), nextinfo - info);	491	memcpy (command, buf + info, nextinfo - info);
672	command[nextinfo - info] = '\0';	492	command [nextinfo - info] = 0;
		493
673	/* 2. Interpret info */	494	/* 2. Interpret info */
674	i = sscanf (command, "%d", &flag);	495	i = sscanf (command, "%d", &flag);
675		496
676	if ((i == 1) && (flag > 0) && (flag <= MSG_TYPE_LAST))	497	if ((i == 1) && (flag > 0) && (flag <= MSG_TYPE_LAST))
677	ns->supported_readables |= (1 << flag);	498	ns->supported_readables |= (1 << flag);
…		…
691		512
692	ns->send_packet (cmdback);	513	ns->send_packet (cmdback);
693	}	514	}
694		515
695	/**	516	/**
696	* A lot like the old AskSmooth (in fact, now called by AskSmooth).
697	* Basically, it makes no sense to wait for the client to request a
698	* a piece of data from us that we know the client wants. So
699	* if we know the client wants it, might as well push it to the
700	* client.
701	*/
702	static void
703	SendSmooth (client *ns, uint16 face)
704	{
705	uint16 smoothface;
706
707	/* If we can't find a face, return and set it so we won't try to send this
708	* again.
709	*/
710	if ((!FindSmooth (face, &smoothface)) && (!FindSmooth (smooth_face->number, &smoothface)))
711	{
712
713	LOG (llevError, "could not findsmooth for %d. Neither default (%s)\n", face, &smooth_face->name);
714	ns->faces_sent[face] |= NS_FACESENT_SMOOTH;
715	return;
716	}
717
718	if (!(ns->faces_sent[smoothface] & NS_FACESENT_FACE))
719	esrv_send_face (ns, smoothface, 0);
720
721	ns->faces_sent[face] |= NS_FACESENT_SMOOTH;
722
723	packet sl ("smooth");
724
725	sl << uint16 (face)
726	<< uint16 (smoothface);
727
728	ns->send_packet (sl);
729	}
730
731	/**
732	* Tells client the picture it has to use
733	* to smooth a picture number given as argument.
734	*/
735	void
736	AskSmooth (char *buf, int len, client *ns)
737	{
738	SendSmooth (ns, atoi (buf));
739	}
740
741	/**
742	* This handles the general commands from the client (ie, north, fire, cast,	517	* This handles the general commands from the client (ie, north, fire, cast,
743	* etc.)	518	* etc.)
744	*/	519	*/
745	void	520	void
746	PlayerCmd (char *buf, int len, player *pl)	521	PlayerCmd (char *buf, int len, player *pl)
…		…
757	return;	532	return;
758		533
759	buf++;	534	buf++;
760	}	535	}
761		536
762	execute_newserver_command (pl->ob, (char *) buf);	537	execute_newserver_command (pl->ob, (char *)buf);
763		538
764	/* Perhaps something better should be done with a left over count.	539	/* Perhaps something better should be done with a left over count.
765	* Cleaning up the input should probably be done first - all actions	540	* Cleaning up the input should probably be done first - all actions
766	* for the command that issued the count should be done before any other	541	* for the command that issued the count should be done before any other
767	* commands.	542	* commands.
768	*/	543	*/
769	pl->count = 0;	544	pl->count = 0;
770	}	545	}
771		546
772
773	/**	547	/**
774	* This handles the general commands from the client (ie, north, fire, cast,	548	* This handles the general commands from the client (ie, north, fire, cast,
775	* etc.). It is a lot like PlayerCmd above, but is called with the	549	* etc.). It is a lot like PlayerCmd above, but is called with the
776	* 'ncom' method which gives more information back to the client so it	550	* 'ncom' method which gives more information back to the client so it
777	* can throttle.	551	* can throttle.
…		…
779	void	553	void
780	NewPlayerCmd (char *buf, int len, player *pl)	554	NewPlayerCmd (char *buf, int len, player *pl)
781	{	555	{
782	if (len <= 6)	556	if (len <= 6)
783	{	557	{
784	LOG (llevDebug, "Corrupt ncom command <%s> not long enough - discarding\n", buf);	558	LOG (llevDebug, "%s: corrupt ncom command <%s>: not long enough (%d) - discarding\n", pl->ns->host, buf, len);
785	return;	559	return;
786	}	560	}
787		561
788	uint16 cmdid = net_uint16 ((uint8 *)buf);	562	uint16 cmdid = net_uint16 ((uint8 *)buf);
789	sint32 repeat = net_sint32 ((uint8 *)buf + 2);	563	sint32 repeat = net_sint32 ((uint8 *)buf + 2);
…		…
802	* commands.	576	* commands.
803	*/	577	*/
804	pl->count = 0;	578	pl->count = 0;
805		579
806	//TODO: schmorp thinks whatever this calculates, it makes no sense at all	580	//TODO: schmorp thinks whatever this calculates, it makes no sense at all
807	int time = fabs (pl->ob->speed) < 0.001	581	int time = pl->ob->has_active_speed ()
808	? time = MAX_TIME * 100
809	: time = (int) (MAX_TIME / fabs (pl->ob->speed));	582	? (int) (MAX_TIME / pl->ob->speed)
		583	: MAX_TIME * 100;
810		584
811	/* Send confirmation of command execution now */	585	/* Send confirmation of command execution now */
812	packet sl ("comc");	586	packet sl ("comc");
813	sl << uint16 (cmdid) << uint32 (time);	587	sl << uint16 (cmdid) << uint32 (time);
814	pl->ns->send_packet (sl);	588	pl->ns->send_packet (sl);
…		…
846	{	620	{
847	case ST_PLAYING:	621	case ST_PLAYING:
848	LOG (llevError, "Got reply message with ST_PLAYING input state\n");	622	LOG (llevError, "Got reply message with ST_PLAYING input state\n");
849	break;	623	break;
850		624
851	case ST_CHANGE_CLASS:
852	key_change_class (pl->ob, buf[0]);
853	break;
854
855	case ST_GET_PARTY_PASSWORD: /* Get password for party */	625	case ST_GET_PARTY_PASSWORD: /* Get password for party */
856	receive_party_password (pl->ob, 13);	626	receive_party_password (pl->ob, 13);
857	break;	627	break;
858		628
859	default:	629	default:
…		…
880	ns->cs_version = atoi (buf);	650	ns->cs_version = atoi (buf);
881	ns->sc_version = ns->cs_version;	651	ns->sc_version = ns->cs_version;
882		652
883	LOG (llevDebug, "connection from client <%s>\n", buf);	653	LOG (llevDebug, "connection from client <%s>\n", buf);
884		654
885
886	//TODO: should log here just for statistics	655	//TODO: should log here just for statistics
887		656
888	//if (VERSION_CS != ns->cs_version)	657	//if (VERSION_CS != ns->cs_version)
889	// unchecked;	658	// unchecked;
890		659
…		…
899		668
900	cp = strchr (cp + 1, ' ');	669	cp = strchr (cp + 1, ' ');
901		670
902	if (cp)	671	if (cp)
903	{	672	{
904	assign (ns->version, cp + 1);	673	ns->version = cp + 1;
905		674
906	if (ns->sc_version < 1026)	675	if (ns->sc_version < 1026)
907	ns->send_packet_printf ("drawinfo %d %s", NDI_RED,	676	ns->send_packet_printf ("drawinfo %d %s", NDI_RED,
908	"**** VERSION WARNING ****\n**** CLIENT IS TOO OLD!! UPDATE THE CLIENT!! ****");	677	"**** VERSION WARNING ****\n**** CLIENT IS TOO OLD!! UPDATE THE CLIENT!! ****");
909	}	678	}
…		…
932	* syntax is: move (to) (tag) (nrof)	701	* syntax is: move (to) (tag) (nrof)
933	*/	702	*/
934	void	703	void
935	MoveCmd (char *buf, int len, player *pl)	704	MoveCmd (char *buf, int len, player *pl)
936	{	705	{
937	int vals[3], i;	706	int to, tag, nrof;
938		707
939	/* A little funky here. We only cycle for 2 records, because	708	if (3 != sscanf (buf, "%d %d %d", &to, &tag, &nrof))
940	* we obviously are not going to find a space after the third
941	* record. Perhaps we should just replace this with a
942	* sscanf?
943	*/
944	for (i = 0; i < 2; i++)
945	{	709	{
946	vals[i] = atoi (buf);
947
948	if (!(buf = strchr (buf, ' ')))
949	{
950	LOG (llevError, "Incomplete move command: %s\n", buf);	710	LOG (llevError, "Incomplete move command: %s\n", buf);
951	return;	711	return;
952	}
953
954	buf++;
955	}	712	}
956		713
957	vals[2] = atoi (buf);	714	esrv_move_object (pl->ob, to, tag, nrof);
958
959	/* LOG(llevDebug,"Move item %d (nrof=%d) to %d.\n", vals[1], vals[2], vals[0]);*/
960	esrv_move_object (pl->ob, vals[0], vals[1], vals[2]);
961	}	715	}
962		716
963	/******************************************************************************	717	/******************************************************************************
964	*	718	*
965	* Start of commands the server sends to the client.	719	* Start of commands the server sends to the client.
…		…
969	/**	723	/**
970	* Asks the client to query the user. This way, the client knows	724	* Asks the client to query the user. This way, the client knows
971	* it needs to send something back (vs just printing out a message)	725	* it needs to send something back (vs just printing out a message)
972	*/	726	*/
973	void	727	void
974	send_query (client *ns, uint8 flags, char *text)	728	send_query (client *ns, uint8 flags, const char *text)
975	{	729	{
976	ns->send_packet_printf ("query %d %s", flags, text ? text : "");	730	ns->send_packet_printf ("query %d %s", flags, text ? text : "");
		731	}
		732
		733	/**
		734	* Get player's current range attack in obuf.
		735	*/
		736	static void
		737	rangetostring (player *pl, char *obuf)
		738	{
		739	dynbuf_text &buf = msg_dynbuf; buf.clear ();
		740
		741	if (pl->ranged_ob)
		742	buf << " Range" << (pl->ob->current_weapon == pl->ranged_ob ? "*" : "") << ": " << pl->ranged_ob->name;
		743
		744	if (pl->combat_ob)
		745	buf << " Combat" << (pl->ob->current_weapon == pl->combat_ob ? "*" : "") << ": " << pl->combat_ob->name;
		746
		747	#if 0
		748	//TODO: remove this when slot system is working, this is only for debugging
		749	if (pl->ob->chosen_skill)
		750	buf << " Skill*: " << pl->ob->chosen_skill->name;
		751	#endif
		752
		753	//TODO: maybe golem should become the current_weapon, quite simply?
		754	if (pl->golem)
		755	buf << " Golem*: " << pl->golem->name;
		756
		757	buf << '\0';
		758	buf.linearise (obuf);
977	}	759	}
978		760
979	#define AddIfInt64(Old,New,Type) if (Old != New) {\	761	#define AddIfInt64(Old,New,Type) if (Old != New) {\
980	Old = New; \	762	Old = New; \
981	sl << uint8 (Type) << uint64 (New); \	763	sl << uint8 (Type) << uint64 (New); \
…		…
989	#define AddIfShort(Old,New,Type) if (Old != New) {\	771	#define AddIfShort(Old,New,Type) if (Old != New) {\
990	Old = New; \	772	Old = New; \
991	sl << uint8 (Type) << uint16 (New); \	773	sl << uint8 (Type) << uint16 (New); \
992	}	774	}
993		775
994	#define AddIfFloat(Old,New,Type) if (Old != New) {\	776	#define AddIfFloat(Old,New,Type,mult) if (Old != New) {\
995	Old = New; \	777	Old = New; \
996	sl << uint8 (Type) << uint32 (New*FLOAT_MULTI); \	778	sl << uint8 (Type) << uint32 (New*FLOAT_MULTI*mult); \
997	}	779	}
998		780
999	#define AddIfString(Old,New,Type) if (Old == NULL || strcmp(Old,New)) {\	781	#define AddIfString(Old,New,Type) if (Old == NULL || strcmp(Old,New)) {\
1000	free(Old); Old = strdup (New);\	782	free(Old); Old = strdup (New);\
1001	sl << uint8 (Type) << data8 (New); \	783	sl << uint8 (Type) << data8 (New); \
…		…
1015		797
1016	client *ns = pl->ns;	798	client *ns = pl->ns;
1017	if (!ns)	799	if (!ns)
1018	return;	800	return;
1019		801
1020	object *ob = pl->ob;	802	object *ob = pl->observe;
1021	if (!ob)	803	if (!ob)
1022	return;	804	return;
		805
		806	player *opl = ob->contr ? static_cast<player *>(ob->contr) : pl;
1023		807
1024	packet sl ("stats");	808	packet sl ("stats");
1025		809
1026	AddIfShort (ns->last_stats.hp, ob->stats.hp, CS_STAT_HP);	810	AddIfShort (ns->last_stats.hp, ob->stats.hp, CS_STAT_HP);
1027	AddIfShort (ns->last_stats.maxhp, ob->stats.maxhp, CS_STAT_MAXHP);	811	AddIfShort (ns->last_stats.maxhp, ob->stats.maxhp, CS_STAT_MAXHP);
…		…
1036	AddIfShort (ns->last_stats.Wis, ob->stats.Wis, CS_STAT_WIS);	820	AddIfShort (ns->last_stats.Wis, ob->stats.Wis, CS_STAT_WIS);
1037	AddIfShort (ns->last_stats.Pow, ob->stats.Pow, CS_STAT_POW);	821	AddIfShort (ns->last_stats.Pow, ob->stats.Pow, CS_STAT_POW);
1038	AddIfShort (ns->last_stats.Cha, ob->stats.Cha, CS_STAT_CHA);	822	AddIfShort (ns->last_stats.Cha, ob->stats.Cha, CS_STAT_CHA);
1039		823
1040	for (int s = 0; s < NUM_SKILLS; s++)	824	for (int s = 0; s < NUM_SKILLS; s++)
1041	if (object *skill = pl->last_skill_ob[s])	825	if (object *skill = opl->last_skill_ob [s])
1042	if (skill->stats.exp != ns->last_skill_exp [s])	826	if (skill->stats.exp != ns->last_skill_exp [s])
1043	{	827	{
1044	ns->last_skill_exp [s] = skill->stats.exp;	828	ns->last_skill_exp [s] = skill->stats.exp;
1045		829
1046	/* Always send along the level if exp changes. This is only	830	/* Always send along the level if exp changes. This is only
…		…
1054	AddIfInt64 (ns->last_stats.exp, ob->stats.exp, CS_STAT_EXP64);	838	AddIfInt64 (ns->last_stats.exp, ob->stats.exp, CS_STAT_EXP64);
1055	AddIfShort (ns->last_level, ob->level, CS_STAT_LEVEL);	839	AddIfShort (ns->last_level, ob->level, CS_STAT_LEVEL);
1056	AddIfShort (ns->last_stats.wc, ob->stats.wc, CS_STAT_WC);	840	AddIfShort (ns->last_stats.wc, ob->stats.wc, CS_STAT_WC);
1057	AddIfShort (ns->last_stats.ac, ob->stats.ac, CS_STAT_AC);	841	AddIfShort (ns->last_stats.ac, ob->stats.ac, CS_STAT_AC);
1058	AddIfShort (ns->last_stats.dam, ob->stats.dam, CS_STAT_DAM);	842	AddIfShort (ns->last_stats.dam, ob->stats.dam, CS_STAT_DAM);
1059	AddIfFloat (ns->last_speed, ob->speed, CS_STAT_SPEED);	843	AddIfFloat (ns->last_speed, ob->speed, CS_STAT_SPEED, 1.f / TICK);
1060	AddIfShort (ns->last_stats.food, ob->stats.food, CS_STAT_FOOD);	844	AddIfShort (ns->last_stats.food, ob->stats.food, CS_STAT_FOOD);
1061	AddIfFloat (ns->last_weapon_sp, pl->weapon_sp, CS_STAT_WEAP_SP);	845	AddIfFloat (ns->last_weapon_sp, pl->weapon_sp, CS_STAT_WEAP_SP, 1.f / TICK);
1062	AddIfInt (ns->last_weight_limit, weight_limit[ob->stats.Str], CS_STAT_WEIGHT_LIM);	846	AddIfInt (ns->last_weight_limit, weight_limit[ob->stats.Str], CS_STAT_WEIGHT_LIM);
1063		847
1064	flags = 0;	848	flags = 0;
1065		849
1066	if (pl->fire_on)	850	if (opl->fire_on)
1067	flags |= SF_FIREON;	851	flags |= SF_FIREON;
1068		852
1069	if (pl->run_on)	853	if (opl->run_on)
1070	flags |= SF_RUNON;	854	flags |= SF_RUNON;
1071		855
1072	AddIfShort (ns->last_flags, flags, CS_STAT_FLAGS);	856	AddIfShort (ns->last_flags, flags, CS_STAT_FLAGS);
1073		857
1074	if (ns->sc_version < 1025)
1075	{ AddIfShort (ns->last_resist[ATNR_PHYSICAL], ob->resist[ATNR_PHYSICAL], CS_STAT_ARMOUR) }
1076	else
1077	for (int i = 0; i < NROFATTACKS; i++)	858	for (int i = 0; i < NROFATTACKS; i++)
1078	{	859	{
1079	/* Skip ones we won't send */	860	/* Skip ones we won't send */
1080	if (atnr_cs_stat[i] == -1)	861	if (atnr_cs_stat[i] == -1)
1081	continue;	862	continue;
1082		863
1083	AddIfShort (ns->last_resist[i], ob->resist[i], atnr_cs_stat[i]);	864	AddIfShort (ns->last_resist[i], ob->resist[i], atnr_cs_stat[i]);
1084	}	865	}
1085		866
1086	if (pl->ns->monitor_spells)	867	if (pl->ns->monitor_spells)
1087	{	868	{
1088	AddIfInt (ns->last_path_attuned, ob->path_attuned, CS_STAT_SPELL_ATTUNE);	869	AddIfInt (ns->last_path_attuned, ob->path_attuned, CS_STAT_SPELL_ATTUNE);
1089	AddIfInt (ns->last_path_repelled, ob->path_repelled, CS_STAT_SPELL_REPEL);	870	AddIfInt (ns->last_path_repelled, ob->path_repelled, CS_STAT_SPELL_REPEL);
1090	AddIfInt (ns->last_path_denied, ob->path_denied, CS_STAT_SPELL_DENY);	871	AddIfInt (ns->last_path_denied, ob->path_denied, CS_STAT_SPELL_DENY);
1091	}	872	}
1092		873
1093	rangetostring (ob, buf); /* we want use the new fire & run system in new client */	874	rangetostring (opl, buf); /* we want use the new fire & run system in new client */
1094	AddIfString (ns->stats.range, buf, CS_STAT_RANGE);	875	AddIfString (ns->stats.range, buf, CS_STAT_RANGE);
1095	set_title (ob, buf);	876	set_title (ob, buf);
1096	AddIfString (ns->stats.title, buf, CS_STAT_TITLE);	877	AddIfString (ns->stats.title, buf, CS_STAT_TITLE);
1097		878
1098	/* Only send it away if we have some actual data */	879	/* Only send it away if we have some actual data */
…		…
1102		883
1103	/**	884	/**
1104	* Tells the client that here is a player it should start using.	885	* Tells the client that here is a player it should start using.
1105	*/	886	*/
1106	void	887	void
1107	esrv_new_player (player *pl, uint32 weight)	888	esrv_new_player (player *pl)
1108	{	889	{
		890	sint32 weight = pl->ob->client_weight ();
		891
1109	packet sl ("player");	892	packet sl ("player");
1110		893
1111	sl << uint32 (pl->ob->count)	894	sl << uint32 (pl->ob->count)
1112	<< uint32 (weight)	895	<< uint32 (weight)
1113	<< uint32 (pl->ob->face->number)	896	<< uint32 (pl->ob->face)
1114	<< data8 (pl->ob->name);	897	<< data8 (pl->ob->name);
1115		898
1116	pl->ns->last_weight = weight;	899	pl->ns->last_weight = weight;
1117	pl->ns->send_packet (sl);	900	pl->ns->send_packet (sl);
1118	SET_FLAG (pl->ob, FLAG_CLIENT_SENT);
1119	}	901	}
1120
1121	/**
1122	* Need to send an animation sequence to the client.
1123	* We will send appropriate face commands to the client if we haven't
1124	* sent them the face yet (this can become quite costly in terms of
1125	* how much we are sending - on the other hand, this should only happen
1126	* when the player logs in and picks stuff up.
1127	*/
1128	void
1129	esrv_send_animation (client * ns, short anim_num)
1130	{
1131	/* Do some checking on the anim_num we got. Note that the animations
1132	* are added in contigous order, so if the number is in the valid
1133	* range, it must be a valid animation.
1134	*/
1135	if (anim_num < 0 || anim_num > num_animations)
1136	{
1137	LOG (llevError, "esrv_send_anim (%d) out of bounds??\n", anim_num);
1138	return;
1139	}
1140
1141	packet sl ("anim");
1142
1143	sl << uint16 (anim_num)
1144	<< uint16 (0); /* flags - not used right now */
1145
1146	/* Build up the list of faces. Also, send any information (ie, the
1147	* the face itself) down to the client.
1148	*/
1149	for (int i = 0; i < animations[anim_num].num_animations; i++)
1150	{
1151	if (!(ns->faces_sent[animations[anim_num].faces[i]] & NS_FACESENT_FACE))
1152	esrv_send_face (ns, animations[anim_num].faces[i], 0);
1153
1154	sl << uint16 (animations[anim_num].faces[i]); /* flags - not used right now */
1155	}
1156
1157	ns->send_packet (sl);
1158
1159	ns->anims_sent[anim_num] = 1;
1160	}
1161
1162		902
1163	/******************************************************************************	903	/******************************************************************************
1164	*	904	*
1165	* Start of map related commands.	905	* Start of map related commands.
1166	*	906	*
1167	******************************************************************************/	907	******************************************************************************/
1168		908
1169	/** Clears a map cell */	909	/** Clears a map cell */
1170	static void	910	static void
1171	map_clearcell (struct MapCell *cell, int face0, int face1, int face2, int count)	911	map_clearcell (struct MapCell *cell, int count)
1172	{	912	{
1173	cell->faces[0] = face0;	913	cell->faces[0] = 0;
1174	cell->faces[1] = face1;	914	cell->faces[1] = 0;
1175	cell->faces[2] = face2;	915	cell->faces[2] = 0;
		916	cell->smooth[0] = 0;
		917	cell->smooth[1] = 0;
		918	cell->smooth[2] = 0;
1176	cell->count = count;	919	cell->count = count;
1177	cell->stat_hp = 0;	920	cell->stat_hp = 0;
1178	cell->flags = 0;	921	cell->flags = 0;
1179	cell->player = 0;	922	cell->player = 0;
1180	}	923	}
1181		924
1182	#define MAX_HEAD_POS MAX(MAX_CLIENT_X, MAX_CLIENT_Y)
1183	#define MAX_LAYERS 3	925	#define MAX_LAYERS 3
1184
1185	/* Using a global really isn't a good approach, but saves the over head of
1186	* allocating and deallocating such a block of data each time run through,
1187	* and saves the space of allocating this in the socket object when we only
1188	* need it for this cycle. If the server is ever threaded, this needs to be
1189	* re-examined.
1190	*/
1191	static object *heads[MAX_HEAD_POS * MAX_HEAD_POS * MAX_LAYERS];
1192
1193	/**
1194	* Returns true if any of the heads for this
1195	* space is set. Returns false if all are blank - this is used
1196	* for empty space checking.
1197	*/
1198	static inline int
1199	have_head (int ax, int ay)
1200	{
1201	if (heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS] ||
1202	heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS + 1] || heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS + 2])
1203	return 1;
1204
1205	return 0;
1206	}
1207
1208	/**
1209	* check_head is a bit simplistic version of update_space below.
1210	* basically, it only checks the that the head on space ax,ay at layer
1211	* needs to get sent - if so, it adds the data, sending the head
1212	* if needed, and returning 1. If this no data needs to get
1213	* sent, it returns zero.
1214	*/
1215	static int
1216	check_head (packet &sl, client &ns, int ax, int ay, int layer)
1217	{
1218	short face_num;
1219
1220	if (heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS + layer])
1221	face_num = heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS + layer]->face->number;
1222	else
1223	face_num = 0;
1224
1225	if (face_num != ns.lastmap.cells[ax][ay].faces[layer])
1226	{
1227	sl << uint16 (face_num);
1228	if (face_num && !(ns.faces_sent[face_num] & NS_FACESENT_FACE))
1229	esrv_send_face (&ns, face_num, 0);
1230
1231	heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS + layer] = NULL;
1232	ns.lastmap.cells[ax][ay].faces[layer] = face_num;
1233	return 1;
1234	}
1235
1236	return 0; /* No change */
1237	}
1238		926
1239	/**	927	/**
1240	* Removes the need to replicate the same code for each layer.	928	* Removes the need to replicate the same code for each layer.
1241	* this returns true if this space is now in fact different than	929	* this returns true if this space is now in fact different than
1242	* it was.	930	* it was.
1243	* sl is the socklist this data is going into.	931	* sl is the socklist this data is going into.
1244	* ns is the socket we are working on - all the info we care	932	* ns is the socket we are working on - all the info we care
1245	* about is in this socket structure, so now need not pass the	933	* about is in this socket structure, so now need not pass the
1246	* entire player object.	934	* entire player object.
1247	* mx and my are map coordinate offsets for map mp
1248	* sx and sy are the offsets into the socket structure that
1249	* holds the old values.
1250	* layer is the layer to update, with 2 being the floor and 0 the	935	* layer is the layer to update, with 2 being the floor and 0 the
1251	* top layer (this matches what the GET_MAP_FACE and GET_MAP_FACE_OBJ)	936	* top layer (this matches what the GET_MAP_FACE and GET_MAP_FACE_OBJ)
1252	* take. Interesting to note that before this function, the map1 function	937	* take. Interesting to note that before this function, the map1 function
1253	* numbers the spaces differently - I think this was a leftover from	938	* numbers the spaces differently - I think this was a leftover from
1254	* the map command, where the faces stack up. Sinces that is no longer	939	* the map command, where the faces stack up. Sinces that is no longer
1255	* the case, it seems to make more sense to have these layer values	940	* the case, it seems to make more sense to have these layer values
1256	* actually match.	941	* actually match.
1257	*/	942	*/
1258	static int	943	static int
1259	update_space (packet &sl, client &ns, maptile *mp, int mx, int my, int sx, int sy, int layer)	944	update_space (packet &sl, client &ns, mapspace &ms, MapCell &lastcell, int layer)
1260	{	945	{
1261	object *ob, *head;	946	object *ob = ms.faces_obj [layer];
1262	uint16 face_num;
1263	int bx, by, i;
1264
1265	/* If there is a multipart object stored away, treat that as more important.
1266	* If not, then do the normal processing.
1267	*/
1268	head = heads[(sy * MAX_HEAD_POS + sx) * MAX_LAYERS + layer];
1269
1270	/* Check to see if this head is part of the set of objects
1271	* we would normally send for this space. If so, then
1272	* don't use the head value. We need to do the check
1273	* here and not when setting up the heads[] value for two reasons -
1274	* 1) the heads[] values will get used even if the space is not visible.
1275	* 2) its possible the head is not on the same map as a part, and I'd
1276	* rather not need to do the map translation overhead.
1277	* 3) We need to do some extra checking to make sure that we will
1278	* otherwise send the image as this layer, eg, either it matches
1279	* the head value, or is not multipart.
1280	*/
1281	if (head && !head->more)
1282	{
1283	for (i = 0; i < MAP_LAYERS; i++)
1284	{
1285	ob = GET_MAP_FACE_OBJ (mp, mx, my, i);
1286	if (!ob)
1287	continue;
1288
1289	if (ob->head)
1290	ob = ob->head;
1291
1292	if (ob == head)
1293	{
1294	heads[(sy * MAX_HEAD_POS + sx) * MAX_LAYERS + layer] = NULL;
1295	head = NULL;
1296	break;
1297	}
1298	}
1299	}
1300
1301	ob = head;
1302	if (!ob)
1303	ob = GET_MAP_FACE_OBJ (mp, mx, my, layer);
1304		947
1305	/* If there is no object for this space, or if the face for the object	948	/* If there is no object for this space, or if the face for the object
1306	* is the blank face, set the face number to zero.	949	* is the blank face, set the face number to zero.
1307	* else if we have the stored head object for this space, that takes	950	* else if we have the stored head object for this space, that takes
1308	* precedence over the other object for this space.	951	* precedence over the other object for this space.
1309	* otherwise, we do special head processing	952	* otherwise, we do special head processing
1310	*/	953	*/
1311	if (!ob || ob->face == blank_face)	954	uint16 face_num = ob && ob->face != blank_face ? ob->face : 0;
1312	face_num = 0;
1313	else if (head)
1314	{
1315	/* if this is a head that had previously been stored */
1316	face_num = ob->face->number;
1317	}
1318	else
1319	{
1320	/* if the faces for the different parts of a multipart object
1321	* are the same, we only want to send the bottom right most
1322	* portion of the object. That info is in the tail_.. values
1323	* of the head. Note that for the head itself, ob->head will
1324	* be null, so we only do this block if we are working on
1325	* a tail piece.
1326	*/
1327
1328	/* tail_x and tail_y will only be set in the head object. If
1329	* this is the head object and these are set, we proceed
1330	* with logic to only send bottom right. Similarly, if
1331	* this is one of the more parts but the head has those values
1332	* set, we want to do the processing. There can be cases where
1333	* the head is not visible but one of its parts is, so we just
1334	* can always expect that ob->arch->tail_x will be true for all
1335	* object we may want to display.
1336	*/
1337	if ((ob->arch->tail_x || ob->arch->tail_y) || (ob->head && (ob->head->arch->tail_x || ob->head->arch->tail_y)))
1338	{
1339
1340	if (ob->head)
1341	head = ob->head;
1342	else
1343	head = ob;
1344
1345	/* Basically figure out where the offset is from where we are right
1346	* now. the ob->arch->clone.{x,y} values hold the offset that this current
1347	* piece is from the head, and the tail is where the tail is from the
1348	* head. Note that bx and by will equal sx and sy if we are already working
1349	* on the bottom right corner. If ob is the head, the clone values
1350	* will be zero, so the right thing will still happen.
1351	*/
1352	bx = sx + head->arch->tail_x - ob->arch->clone.x;
1353	by = sy + head->arch->tail_y - ob->arch->clone.y;
1354
1355	/* I don't think this can ever happen, but better to check for it just
1356	* in case.
1357	*/
1358	if (bx < sx || by < sy)
1359	{
1360	LOG (llevError, "update_space: bx (%d) or by (%d) is less than sx (%d) or sy (%d)\n", bx, by, sx, sy);
1361	face_num = 0;
1362	}
1363	/* single part object, multipart object with non merged faces,
1364	* of multipart object already at lower right.
1365	*/
1366	else if (bx == sx && by == sy)
1367	{
1368	face_num = ob->face->number;
1369
1370	/* if this face matches one stored away, clear that one away.
1371	* this code relies on the fact that the map1 commands
1372	* goes from 2 down to 0.
1373	*/
1374	for (i = 0; i < MAP_LAYERS; i++)
1375	if (heads[(sy * MAX_HEAD_POS + sx) * MAX_LAYERS + i] &&
1376	heads[(sy * MAX_HEAD_POS + sx) * MAX_LAYERS + i]->face->number == face_num)
1377	heads[(sy * MAX_HEAD_POS + sx) * MAX_LAYERS + i] = NULL;
1378	}
1379	else
1380	{
1381	/* If this head is stored away, clear it - otherwise,
1382	* there can be cases where a object is on multiple layers -
1383	* we only want to send it once.
1384	*/
1385	face_num = head->face->number;
1386	for (i = 0; i < MAP_LAYERS; i++)
1387	if (heads[(by * MAX_HEAD_POS + bx) * MAX_LAYERS + i] &&
1388	heads[(by * MAX_HEAD_POS + bx) * MAX_LAYERS + i]->face->number == face_num)
1389	heads[(by * MAX_HEAD_POS + bx) * MAX_LAYERS + i] = NULL;
1390
1391	/* First, try to put the new head on the same layer. If that is used up,
1392	* then find another layer.
1393	*/
1394	if (heads[(by * MAX_HEAD_POS + bx) * MAX_LAYERS + layer] == NULL)
1395	{
1396	heads[(by * MAX_HEAD_POS + bx) * MAX_LAYERS + layer] = head;
1397	}
1398	else
1399	for (i = 0; i < MAX_LAYERS; i++)
1400	{
1401	if (heads[(by * MAX_HEAD_POS + bx) * MAX_LAYERS + i] == NULL ||
1402	heads[(by * MAX_HEAD_POS + bx) * MAX_LAYERS + i] == head)
1403	{
1404	heads[(by * MAX_HEAD_POS + bx) * MAX_LAYERS + i] = head;
1405	}
1406	}
1407	face_num = 0; /* Don't send this object - we'll send the head later */
1408	}
1409	}
1410	else
1411	{
1412	/* In this case, we are already at the lower right or single part object,
1413	* so nothing special
1414	*/
1415	face_num = ob->face->number;
1416
1417	/* clear out any head entries that have the same face as this one */
1418	for (bx = 0; bx < layer; bx++)
1419	if (heads[(sy * MAX_HEAD_POS + sx) * MAX_LAYERS + bx] &&
1420	heads[(sy * MAX_HEAD_POS + sx) * MAX_LAYERS + bx]->face->number == face_num)
1421	heads[(sy * MAX_HEAD_POS + sx) * MAX_LAYERS + bx] = NULL;
1422	}
1423	} /* else not already head object or blank face */
1424
1425	/* This is a real hack. Basically, if we have nothing to send for this layer,
1426	* but there is a head on the next layer, send that instead.
1427	* Without this, what happens is you can get the case where the player stands
1428	* on the same space as the head. However, if you have overlapping big objects
1429	* of the same type, what happens then is it doesn't think it needs to send
1430	* This tends to make stacking also work/look better.
1431	*/
1432	if (!face_num && layer > 0 && heads[(sy * MAX_HEAD_POS + sx) * MAX_LAYERS + layer - 1])
1433	{
1434	face_num = heads[(sy * MAX_HEAD_POS + sx) * MAX_LAYERS + layer - 1]->face->number;
1435	heads[(sy * MAX_HEAD_POS + sx) * MAX_LAYERS + layer - 1] = NULL;
1436	}
1437
1438	/* Another hack - because of heads and whatnot, this face may match one
1439	* we already sent for a lower layer. In that case, don't send
1440	* this one.
1441	*/
1442	if (face_num && layer + 1 < MAP_LAYERS && ns.lastmap.cells[sx][sy].faces[layer + 1] == face_num)
1443	face_num = 0;
1444		955
1445	/* We've gotten what face we want to use for the object. Now see if	956	/* We've gotten what face we want to use for the object. Now see if
1446	* if it has changed since we last sent it to the client.	957	* if it has changed since we last sent it to the client.
1447	*/	958	*/
1448	if (ns.lastmap.cells[sx][sy].faces[layer] != face_num)	959	if (lastcell.faces[layer] != face_num)
1449	{	960	{
1450	ns.lastmap.cells[sx][sy].faces[layer] = face_num;	961	lastcell.faces[layer] = face_num;
		962
1451	if (!(ns.faces_sent[face_num] & NS_FACESENT_FACE))	963	if (!ns.faces_sent[face_num])
		964	if (ob)
		965	ns.send_faces (ob);
		966	else
1452	esrv_send_face (&ns, face_num, 0);	967	ns.send_face (face_num, 10);
1453		968
1454	sl << uint16 (face_num);	969	sl << uint16 (face_num);
1455	return 1;	970	return 1;
1456	}	971	}
1457		972
1458	/* Nothing changed */	973	/* Nothing changed */
1459	return 0;	974	return 0;
1460	}	975	}
1461		976
1462	/**	977	//-GPL
1463	* This function is mainly a copy of update_space,
1464	* except it handles update of the smoothing updates,
1465	* not the face updates.
1466	* Removes the need to replicate the same code for each layer.
1467	* this returns true if this smooth is now in fact different
1468	* than it was.
1469	* sl is the socklist this data is going into.
1470	* ns is the socket we are working on - all the info we care
1471	* about is in this socket structure, so know need to pass the
1472	* entire player object.
1473	* mx and my are map coordinate offsets for map mp
1474	* sx and sy are the offsets into the socket structure that
1475	* holds the old values.
1476	* layer is the layer to update, with 2 being the floor and 0 the
1477	* top layer (this matches what the GET_MAP_FACE and GET_MAP_FACE_OBJ
1478	* take.
1479	*/
1480
1481	static inline int
1482	update_smooth (packet &sl, client &ns, maptile *mp, int mx, int my, int sx, int sy, int layer)
1483	{
1484	object *ob;
1485	int smoothlevel; /* old face_num; */
1486
1487	ob = GET_MAP_FACE_OBJ (mp, mx, my, layer);
1488
1489	/* If there is no object for this space, or if the face for the object
1490	* is the blank face, set the smoothlevel to zero.
1491	*/
1492	if (!ob || ob->face == blank_face)
1493	smoothlevel = 0;
1494	else
1495	{
1496	smoothlevel = ob->smoothlevel;
1497	if (smoothlevel && !(ns.faces_sent[ob->face->number] & NS_FACESENT_SMOOTH))
1498	SendSmooth (&ns, ob->face->number);
1499	} /* else not already head object or blank face */
1500
1501	/* We've gotten what face we want to use for the object. Now see if
1502	* if it has changed since we last sent it to the client.
1503	*/
1504	if (smoothlevel > 255)
1505	smoothlevel = 255;
1506	else if (smoothlevel < 0)
1507	smoothlevel = 0;
1508
1509	if (ns.lastmap.cells[sx][sy].smooth[layer] != smoothlevel)
1510	{
1511	ns.lastmap.cells[sx][sy].smooth[layer] = smoothlevel;
1512	sl << uint8 (smoothlevel);
1513	return 1;
1514	}
1515
1516	/* Nothing changed */
1517	return 0;
1518	}
1519
1520	/**
1521	* Returns the size of a data for a map square as returned by
1522	* mapextended. There are CLIENTMAPX*CLIENTMAPY*LAYERS entries
1523	* available.
1524	*/
1525	int
1526	getExtendedMapInfoSize (client * ns)
1527	{
1528	int result = 0;
1529
1530	if (ns->ext_mapinfos)
1531	{
1532	if (ns->EMI_smooth)
1533	result += 1; /*One byte for smoothlevel */
1534	}
1535
1536	return result;
1537	}
1538		978
1539	// prefetch (and touch) all maps within a specific distancd	979	// prefetch (and touch) all maps within a specific distancd
1540	static void	980	static void
1541	prefetch_surrounding_maps (maptile *map, int distance)	981	prefetch_surrounding_maps (maptile *map, int distance)
1542	{	982	{
1543	map->last_access = runtime;	983	map->touch ();
1544		984
1545	if (--distance)	985	if (--distance)
1546	for (int dir = 4; --dir; )	986	for (int dir = 4; dir--; )
1547	if (const shstr &path = map->tile_path [dir])	987	if (const shstr &path = map->tile_path [dir])
1548	if (maptile *&neigh = map->tile_map [dir])	988	if (maptile *&neigh = map->tile_map [dir])
1549	prefetch_surrounding_maps (neigh, distance);	989	prefetch_surrounding_maps (neigh, distance);
1550	else	990	else
1551	neigh = maptile::find_async (path, map);	991	neigh = maptile::find_async (path, map);
…		…
1556	prefetch_surrounding_maps (object *op)	996	prefetch_surrounding_maps (object *op)
1557	{	997	{
1558	prefetch_surrounding_maps (op->map, 3);	998	prefetch_surrounding_maps (op->map, 3);
1559	}	999	}
1560		1000
		1001	//+GPL
		1002
1561	/**	1003	/**
1562	* This function uses the new map1 protocol command to send the map	1004	* Draws client map.
1563	* to the client. It is necessary because the old map command supports
1564	* a maximum map size of 15x15.
1565	* This function is much simpler than the old one. This is because
1566	* the old function optimized to send as few face identifiers as possible,
1567	* at the expense of sending more coordinate location (coordinates were
1568	* only 1 byte, faces 2 bytes, so this was a worthwhile savings). Since
1569	* we need 2 bytes for coordinates and 2 bytes for faces, such a trade off
1570	* maps no sense. Instead, we actually really only use 12 bits for coordinates,
1571	* and use the other 4 bits for other informatiion. For full documentation
1572	* of what we send, see the doc/Protocol file.
1573	* I will describe internally what we do:
1574	* the ns->lastmap shows how the map last looked when sent to the client.
1575	* in the lastmap structure, there is a cells array, which is set to the
1576	* maximum viewable size (As set in config.h).
1577	* in the cells, there are faces and a count value.
1578	* we use the count value to hold the darkness value. If -1, then this space
1579	* is not viewable.
1580	* we use faces[0] faces[1] faces[2] to hold what the three layers
1581	* look like.
1582	*/	1005	*/
1583	void	1006	void
1584	draw_client_map1 (object *pl)	1007	draw_client_map (player *pl)
1585	{	1008	{
1586	int x, y, ax, ay, d, startlen, max_x, max_y, oldlen;	1009	object *ob = pl->viewpoint;
1587	sint16 nx, ny;
1588	int estartlen, eoldlen;
1589	uint16 mask, emask;
1590	uint8 eentrysize;
1591	uint16 ewhatstart, ewhatflag;
1592	uint8 extendedinfos;
1593	maptile *m;
1594
1595	client &socket = *pl->contr->ns;
1596
1597	if (!pl->active)	1010	if (!pl->observe->active)
1598	return;	1011	return;
1599
1600	check_map_change (pl->contr);
1601	prefetch_surrounding_maps (pl);
1602
1603	packet sl (socket.mapmode == Map1Cmd ? "map1" : "map1a");
1604	packet esl;
1605
1606	startlen = sl.length ();
1607
1608	/*Extendedmapinfo structure initialisation */
1609	if (socket.ext_mapinfos)
1610	{
1611	extendedinfos = EMI_NOREDRAW;
1612
1613	if (socket.EMI_smooth)
1614	extendedinfos |= EMI_SMOOTH;
1615
1616	ewhatstart = esl.length ();
1617	ewhatflag = extendedinfos; /*The EMI_NOREDRAW bit
1618	could need to be taken away */
1619	eentrysize = getExtendedMapInfoSize (&socket);
1620	esl << "mapextended "
1621	<< uint8 (extendedinfos)
1622	<< uint8 (eentrysize);
1623
1624	estartlen = esl.length ();
1625	}
1626	else
1627	{
1628	/* suppress compiler warnings */
1629	ewhatstart = 0;
1630	ewhatflag = 0;
1631	estartlen = 0;
1632	}
1633
1634	/* Init data to zero */
1635	memset (heads, 0, sizeof (object *) * MAX_HEAD_POS * MAX_HEAD_POS * MAX_LAYERS);
1636
1637	/* x,y are the real map locations. ax, ay are viewport relative
1638	* locations.
1639	*/
1640	ay = 0;
1641
1642	/* We could do this logic as conditionals in the if statement,
1643	* but that started to get a bit messy to look at.
1644	*/
1645	max_x = pl->x + (socket.mapx + 1) / 2;
1646	max_y = pl->y + (socket.mapy + 1) / 2;
1647
1648	if (socket.mapmode == Map1aCmd)
1649	{
1650	max_x += MAX_HEAD_OFFSET;
1651	max_y += MAX_HEAD_OFFSET;
1652	}
1653
1654	for (y = pl->y - socket.mapy / 2; y < max_y; y++, ay++)
1655	{
1656	ax = 0;
1657	for (x = pl->x - socket.mapx / 2; x < max_x; x++, ax++)
1658	{
1659	emask = mask = (ax & 0x3f) << 10 | (ay & 0x3f) << 4;
1660
1661	/* If this space is out of the normal viewable area, we only check
1662	* the heads value ax or ay will only be greater than what
1663	* the client wants if using the map1a command - this is because
1664	* if the map1a command is not used, max_x and max_y will be
1665	* set to lower values.
1666	*/
1667	if (ax >= socket.mapx || ay >= socket.mapy)
1668	{
1669	int i, got_one;
1670
1671	oldlen = sl.length ();
1672
1673	sl << uint16 (mask);
1674
1675	if (check_head (sl, socket, ax, ay, 2)) mask |= 0x4;
1676	if (check_head (sl, socket, ax, ay, 1)) mask |= 0x2;
1677	if (check_head (sl, socket, ax, ay, 0)) mask |= 0x1;
1678
1679	/* If all we are doing is sending 0 (blank) faces, we don't
1680	* actually need to send that - just the coordinates
1681	* with no faces tells the client to blank out the
1682	* space.
1683	*/
1684	got_one = 0;
1685	for (i = oldlen + 2; i < sl.length (); i++)
1686	if (sl[i])
1687	got_one = 1;
1688
1689	if (got_one && (mask & 0xf))
1690	sl[oldlen + 1] = mask & 0xff;
1691	else
1692	{ /*either all faces blank, either no face at all */
1693	if (mask & 0xf) /*at least 1 face, we know it's blank, only send coordinates */
1694	sl.reset (oldlen + 2);
1695	else
1696	sl.reset (oldlen);
1697	}
1698
1699	/*What concerns extendinfos, nothing to be done for now
1700	* (perhaps effects layer later)
1701	*/
1702	continue; /* don't do processing below */
1703	}
1704
1705	MapCell &lastcell = socket.lastmap.cells[ax][ay];
1706
1707	d = pl->contr->blocked_los[ax][ay];
1708
1709	/* If the coordinates are not valid, or it is too dark to see,
1710	* we tell the client as such
1711	*/
1712	nx = x;
1713	ny = y;
1714	m = get_map_from_coord (pl->map, &nx, &ny);
1715
1716	if (!m)
1717	{
1718	/* space is out of map. Update space and clear values
1719	* if this hasn't already been done. If the space is out
1720	* of the map, it shouldn't have a head
1721	*/
1722	if (lastcell.count != -1)
1723	{
1724	sl << uint16 (mask);
1725	map_clearcell (&lastcell, 0, 0, 0, -1);
1726	}
1727	}
1728	else if (d > 3)
1729	{
1730	m->touch ();
1731
1732	int need_send = 0, count;
1733
1734	/* This block deals with spaces that are not visible for whatever
1735	* reason. Still may need to send the head for this space.
1736	*/
1737
1738	oldlen = sl.length ();
1739
1740	sl << uint16 (mask);
1741
1742	if (lastcell.count != -1)
1743	need_send = 1;
1744
1745	count = -1;
1746
1747	if (socket.mapmode == Map1aCmd && have_head (ax, ay))
1748	{
1749	/* Now check to see if any heads need to be sent */
1750
1751	if (check_head (sl, socket, ax, ay, 2)) mask |= 0x4;
1752	if (check_head (sl, socket, ax, ay, 1)) mask |= 0x2;
1753	if (check_head (sl, socket, ax, ay, 0)) mask |= 0x1;
1754
1755	lastcell.count = count;
1756	}
1757	else
1758	{
1759	/* properly clear a previously sent big face */
1760	if (lastcell.faces[0] != 0 || lastcell.faces[1] != 0 || lastcell.faces[2] != 0
1761	|| lastcell.stat_hp || lastcell.flags || lastcell.player)
1762	need_send = 1;
1763
1764	map_clearcell (&lastcell, 0, 0, 0, count);
1765	}
1766
1767	if ((mask & 0xf) || need_send)
1768	sl[oldlen + 1] = mask & 0xff;
1769	else
1770	sl.reset (oldlen);
1771	}
1772	else
1773	{
1774	m->touch ();
1775
1776	/* In this block, the space is visible or there are head objects
1777	* we need to send.
1778	*/
1779
1780	/* Rather than try to figure out what everything that we might
1781	* need to send is, then form the packet after that,
1782	* we presume that we will in fact form a packet, and update
1783	* the bits by what we do actually send. If we send nothing,
1784	* we just back out sl.length () to the old value, and no harm
1785	* is done.
1786	* I think this is simpler than doing a bunch of checks to see
1787	* what if anything we need to send, setting the bits, then
1788	* doing those checks again to add the real data.
1789	*/
1790	oldlen = sl.length ();
1791	mask = (ax & 0x3f) << 10 | (ay & 0x3f) << 4;
1792	eoldlen = esl.length ();
1793	emask = (ax & 0x3f) << 10 | (ay & 0x3f) << 4;
1794	sl << uint16 (mask);
1795
1796	if (socket.ext_mapinfos)
1797	esl << uint16 (emask);
1798
1799	unsigned char dummy;
1800	unsigned char *last_ext = &dummy;
1801
1802	/* Darkness changed */
1803	if (lastcell.count != d && socket.darkness)
1804	{
1805	mask |= 0x8;
1806
1807	if (socket.extmap)
1808	{
1809	*last_ext |= 0x80;
1810	last_ext = &sl[sl.length ()];
1811	sl << uint8 (d);
1812	}
1813	else
1814	sl << uint8 (255 - 64 * d);
1815	}
1816
1817	lastcell.count = d;
1818
1819	if (socket.extmap)
1820	{
1821	uint8 stat_hp = 0;
1822	uint8 stat_width = 0;
1823	uint8 flags = 0;
1824	UUID player = 0;
1825
1826	// send hp information, if applicable
1827	if (object *op = GET_MAP_FACE_OBJ (m, nx, ny, 0))
1828	{
1829	if (op->head || op->invisible)
1830	; // do not show
1831	else if (op->type == PLAYER
1832	|| QUERY_FLAG (op, FLAG_MONSTER) || QUERY_FLAG (op, FLAG_ALIVE) || QUERY_FLAG (op, FLAG_GENERATOR))
1833	{
1834	if (op->stats.maxhp > 0 && (unsigned) op->stats.maxhp > (unsigned) op->stats.hp)
1835	{
1836	stat_hp = 255 - (op->stats.hp * 255 + 254) / op->stats.maxhp;
1837	stat_width = op->arch->tail_x;
1838	}
1839	}
1840
1841	if (op->msg && op->msg[0] == '@')
1842	flags |= 1;
1843
1844	if (op->type == PLAYER && op != pl)
1845	player = op->count;
1846	}
1847
1848	if (lastcell.stat_hp != stat_hp)
1849	{
1850	lastcell.stat_hp = stat_hp;
1851
1852	mask |= 0x8;
1853	*last_ext |= 0x80;
1854	last_ext = &sl[sl.length ()];
1855
1856	sl << uint8 (5) << uint8 (stat_hp);
1857
1858	if (stat_width > 1)
1859	{
1860	*last_ext |= 0x80;
1861	last_ext = &sl[sl.length ()];
1862
1863	sl << uint8 (6) << uint8 (stat_width);
1864	}
1865	}
1866
1867	if (lastcell.player != player)
1868	{
1869	lastcell.player = player;
1870
1871	mask |= 0x8;
1872	*last_ext |= 0x80;
1873	last_ext = &sl[sl.length ()];
1874
1875	sl << uint8 (0x47) << uint8 (8) << (uint64)player;
1876	}
1877
1878	if (lastcell.flags != flags)
1879	{
1880	lastcell.flags = flags;
1881
1882	mask |= 0x8;
1883	*last_ext |= 0x80;
1884	last_ext = &sl[sl.length ()];
1885
1886	sl << uint8 (8) << uint8 (flags);
1887	}
1888	}
1889
1890	/* Floor face */
1891	if (update_space (sl, socket, m, nx, ny, ax, ay, 2))
1892	mask |= 0x4;
1893
1894	if (socket.EMI_smooth)
1895	if (update_smooth (esl, socket, m, nx, ny, ax, ay, 2))
1896	emask |= 0x4;
1897
1898	/* Middle face */
1899	if (update_space (sl, socket, m, nx, ny, ax, ay, 1))
1900	mask |= 0x2;
1901
1902	if (socket.EMI_smooth)
1903	if (update_smooth (esl, socket, m, nx, ny, ax, ay, 1))
1904	emask |= 0x2;
1905
1906	if (nx == pl->x && ny == pl->y && pl->invisible & (pl->invisible < 50 ? 4 : 1))
1907	{
1908	if (lastcell.faces[0] != pl->face->number)
1909	{
1910	lastcell.faces[0] = pl->face->number;
1911	mask |= 0x1;
1912
1913	if (!(socket.faces_sent[pl->face->number] & NS_FACESENT_FACE))
1914	esrv_send_face (&socket, pl->face->number, 0);
1915
1916	sl << uint16 (pl->face->number);
1917	}
1918	}
1919	else
1920	{
1921	/* Top face */
1922	if (update_space (sl, socket, m, nx, ny, ax, ay, 0))
1923	mask |= 0x1;
1924
1925	if (socket.EMI_smooth)
1926	if (update_smooth (esl, socket, m, nx, ny, ax, ay, 0))
1927	emask |= 0x1;
1928	}
1929
1930	/* Check to see if we are in fact sending anything for this
1931	* space by checking the mask. If so, update the mask.
1932	* if not, reset the len to that from before adding the mask
1933	* value, so we don't send those bits.
1934	*/
1935	if (mask & 0xf)
1936	sl[oldlen + 1] = mask & 0xff;
1937	else
1938	sl.reset (oldlen);
1939
1940	if (emask & 0xf)
1941	esl[eoldlen + 1] = emask & 0xff;
1942	else
1943	esl.reset (eoldlen);
1944	} /* else this is a viewable space */
1945	} /* for x loop */
1946	} /* for y loop */
1947
1948	/* Verify that we in fact do need to send this */
1949	if (socket.ext_mapinfos)
1950	{
1951	if (!(sl.length () > startlen || socket.sent_scroll))
1952	{
1953	/* No map data will follow, so don't say the client
1954	* it doesn't need draw!
1955	*/
1956	ewhatflag &= (~EMI_NOREDRAW);
1957	esl[ewhatstart + 1] = ewhatflag & 0xff;
1958	}
1959
1960	if (esl.length () > estartlen)
1961	socket.send_packet (esl);
1962	}
1963
1964	if (sl.length () > startlen || socket.sent_scroll)
1965	{
1966	socket.send_packet (sl);
1967	socket.sent_scroll = 0;
1968	}
1969	}
1970
1971	/**
1972	* Draws client map.
1973	*/
1974	void
1975	draw_client_map (object *pl)
1976	{
1977	int i, j;
1978	sint16 ax, ay; /* ax and ay goes from 0 to max-size of arrays */
1979	int mflags;
1980	struct Map newmap;
1981	maptile *m, *pm;
1982
1983	if (pl->type != PLAYER)
1984	{
1985	LOG (llevError, "draw_client_map called with non player/non eric-server\n");
1986	return;
1987	}
1988
1989	pm = pl->map;
1990		1012
1991	/* If player is just joining the game, he isn't here yet, so the map	1013	/* If player is just joining the game, he isn't here yet, so the map
1992	* can get swapped out. If so, don't try to send them a map. All will	1014	* can get swapped out. If so, don't try to send them a map. All will
1993	* be OK once they really log in.	1015	* be OK once they really log in.
1994	*/	1016	*/
1995	if (pm == NULL || pm->in_memory != MAP_IN_MEMORY)	1017	if (!ob->map || ob->map->in_memory != MAP_ACTIVE)
1996	return;	1018	return;
1997		1019
1998	memset (&newmap, 0, sizeof (struct Map));	1020	int startlen, oldlen;
1999		1021
2000	for (j = (pl->y - pl->contr->ns->mapy / 2); j < (pl->y + (pl->contr->ns->mapy + 1) / 2); j++)	1022	check_map_change (pl);
2001	for (i = (pl->x - pl->contr->ns->mapx / 2); i < (pl->x + (pl->contr->ns->mapx + 1) / 2); i++)	1023	prefetch_surrounding_maps (pl->ob);
		1024
		1025	/* do LOS after calls to update_position */
		1026	/* unfortunately, we need to udpate los when observing, currently */
		1027	if (pl->do_los || pl->viewpoint != pl->ob)
		1028	{
		1029	pl->do_los = 0;
		1030	pl->update_los ();
		1031	}
		1032
		1033	/**
		1034	* This function uses the new map1 protocol command to send the map
		1035	* to the client. It is necessary because the old map command supports
		1036	* a maximum map size of 15x15.
		1037	* This function is much simpler than the old one. This is because
		1038	* the old function optimized to send as few face identifiers as possible,
		1039	* at the expense of sending more coordinate location (coordinates were
		1040	* only 1 byte, faces 2 bytes, so this was a worthwhile savings). Since
		1041	* we need 2 bytes for coordinates and 2 bytes for faces, such a trade off
		1042	* maps no sense. Instead, we actually really only use 12 bits for coordinates,
		1043	* and use the other 4 bits for other informatiion. For full documentation
		1044	* of what we send, see the doc/Protocol file.
		1045	* I will describe internally what we do:
		1046	* the ns->lastmap shows how the map last looked when sent to the client.
		1047	* in the lastmap structure, there is a cells array, which is set to the
		1048	* maximum viewable size (As set in config.h).
		1049	* in the cells, there are faces and a count value.
		1050	* we use the count value to hold the darkness value. If -1, then this space
		1051	* is not viewable.
		1052	* we use faces[0] faces[1] faces[2] to hold what the three layers
		1053	* look like.
		1054	*/
		1055
		1056	client &socket = *pl->ns;
		1057
		1058	packet sl (socket.mapmode == Map1Cmd ? "map1" : "map1a");
		1059
		1060	startlen = sl.length ();
		1061
		1062	int hx = socket.mapx / 2;
		1063	int hy = socket.mapy / 2;
		1064
		1065	ordered_mapwalk_begin (ob, -hx, -hy, hx, hy)
		1066	int ax = dx + hx;
		1067	int ay = dy + hy;
		1068
		1069	int mask = (ax << 10) | (ay << 4);
		1070	MapCell &lastcell = socket.lastmap.cells[ax][ay];
		1071
		1072	/* If the coordinates are not valid, or it is too dark to see,
		1073	* we tell the client as such
		1074	*/
		1075	if (!m)
2002	{	1076	{
2003	ax = i;	1077	/* space is out of map. Update space and clear values
2004	ay = j;	1078	* if this hasn't already been done. If the space is out
2005	m = pm;	1079	* of the map, it shouldn't have a head.
2006	mflags = get_map_flags (m, &m, ax, ay, &ax, &ay);
2007
2008	if (mflags & P_OUT_OF_MAP)
2009	continue;
2010
2011	/* If a map is visible to the player, we don't want to swap it out
2012	* just to reload it. This should really call something like
2013	* swap_map, but this is much more efficient and 'good enough'
2014	*/	1080	*/
2015	if (mflags & P_NEW_MAP)	1081	if (lastcell.count != -1)
2016	m->timeout = 50;	1082	{
		1083	sl << uint16 (mask);
		1084	map_clearcell (&lastcell, -1);
		1085	}
		1086
		1087	continue;
2017	}	1088	}
2018		1089
2019	/* do LOS after calls to update_position */	1090	int d = pl->blocked_los_uc (dx, dy);
2020	if (pl->contr->do_los)	1091
		1092	if (d > 3)
2021	{	1093	{
2022	update_los (pl);	1094	/* This block deals with spaces that are not visible for whatever
2023	pl->contr->do_los = 0;	1095	* reason. Still may need to send the head for this space.
		1096	*/
		1097	if (lastcell.count != -1
		1098	|| lastcell.faces[0]
		1099	|| lastcell.faces[1]
		1100	|| lastcell.faces[2]
		1101	|| lastcell.stat_hp
		1102	|| lastcell.flags
		1103	|| lastcell.player)
		1104	sl << uint16 (mask);
		1105
		1106	/* properly clear a previously sent big face */
		1107	map_clearcell (&lastcell, -1);
2024	}	1108	}
2025		1109	else
2026	/* Big maps need a different drawing mechanism to work */
2027	draw_client_map1 (pl);
2028	}
2029
2030
2031	/*****************************************************************************/
2032
2033	/* GROS: The following one is used to allow a plugin to send a generic cmd to*/
2034
2035	/* a player. Of course, the client need to know the command to be able to */
2036
2037	/* manage it ! */
2038
2039	/*****************************************************************************/
2040	void
2041	send_plugin_custom_message (object *pl, char *buf)
2042	{
2043	pl->contr->ns->send_packet (buf);
2044	}
2045
2046	/**
2047	* This sends the skill number to name mapping. We ignore
2048	* the params - we always send the same info no matter what.
2049	*/
2050	void
2051	send_skill_info (client *ns, char *params)
2052	{
2053	packet sl;
2054	sl << "replyinfo skill_info\n";
2055
2056	for (int i = 1; i < NUM_SKILLS; i++)
2057	sl.printf ("%d:%s\n", i + CS_STAT_SKILLINFO, &skill_names[i]);
2058
2059	if (sl.length () >= MAXSOCKBUF)
2060	{	1110	{
2061	LOG (llevError, "Buffer overflow in send_skill_info!\n");	1111	/* In this block, the space is visible.
2062	fatal (0);	1112	*/
		1113
		1114	/* Rather than try to figure out what everything that we might
		1115	* need to send is, then form the packet after that,
		1116	* we presume that we will in fact form a packet, and update
		1117	* the bits by what we do actually send. If we send nothing,
		1118	* we just back out sl.length () to the old value, and no harm
		1119	* is done.
		1120	* I think this is simpler than doing a bunch of checks to see
		1121	* what if anything we need to send, setting the bits, then
		1122	* doing those checks again to add the real data.
		1123	*/
		1124	oldlen = sl.length ();
		1125
		1126	sl << uint16 (mask);
		1127
		1128	unsigned char dummy;
		1129	unsigned char *last_ext = &dummy;
		1130
		1131	/* Darkness changed */
		1132	if (lastcell.count != d)
		1133	{
		1134	mask |= 0x8;
		1135
		1136	*last_ext |= 0x80;
		1137	last_ext = &sl[sl.length ()];
		1138	sl << uint8 (d);
		1139	}
		1140
		1141	lastcell.count = d;
		1142
		1143	mapspace &ms = m->at (nx, ny);
		1144	ms.update ();
		1145
		1146	// extmap handling
		1147	uint8 stat_hp = 0;
		1148	uint8 stat_width = 0;
		1149	uint8 flags = 0;
		1150	tag_t player = 0;
		1151
		1152	// send hp information, if applicable
		1153	if (object *op = ms.faces_obj [0])
		1154	if (op->is_head () && !op->invisible)
		1155	{
		1156	if (op->stats.maxhp > op->stats.hp
		1157	&& op->stats.maxhp > 0
		1158	&& (op->type == PLAYER
		1159	|| op->type == DOOR // does not work, have maxhp 0
		1160	|| QUERY_FLAG (op, FLAG_MONSTER)
		1161	|| QUERY_FLAG (op, FLAG_ALIVE)
		1162	|| QUERY_FLAG (op, FLAG_GENERATOR)))
		1163	{
		1164	stat_hp = 255 - (op->stats.hp * 255 + 254) / op->stats.maxhp;
		1165	stat_width = op->arch->max_x - op->arch->x; //TODO: should be upper-left edge
		1166	}
		1167
		1168	if (expect_false (op->has_dialogue ()))
		1169	flags |= 1;
		1170
		1171	if (expect_false (op->type == PLAYER))
		1172	player = op == ob ? pl->ob->count
		1173	: op == pl->ob ? ob->count
		1174	: op->count;
		1175	}
		1176
		1177	if (expect_false (lastcell.stat_hp != stat_hp))
		1178	{
		1179	lastcell.stat_hp = stat_hp;
		1180
		1181	mask |= 0x8;
		1182	*last_ext |= 0x80;
		1183	last_ext = &sl[sl.length ()];
		1184
		1185	sl << uint8 (5) << uint8 (stat_hp);
		1186
		1187	if (stat_width > 1)
		1188	{
		1189	*last_ext |= 0x80;
		1190	last_ext = &sl[sl.length ()];
		1191
		1192	sl << uint8 (6) << uint8 (stat_width);
		1193	}
		1194	}
		1195
		1196	if (expect_false (lastcell.player != player))
		1197	{
		1198	lastcell.player = player;
		1199
		1200	mask |= 0x8;
		1201	*last_ext |= 0x80;
		1202	last_ext = &sl[sl.length ()];
		1203
		1204	sl << uint8 (0x47) << uint8 (4) << (uint32)player;
		1205	}
		1206
		1207	if (expect_false (lastcell.flags != flags))
		1208	{
		1209	lastcell.flags = flags;
		1210
		1211	mask |= 0x8;
		1212	*last_ext |= 0x80;
		1213	last_ext = &sl[sl.length ()];
		1214
		1215	sl << uint8 (8) << uint8 (flags);
		1216	}
		1217
		1218	// faces
		1219
		1220	/* Floor face */
		1221	if (update_space (sl, socket, ms, lastcell, 2))
		1222	mask |= 0x4;
		1223
		1224	/* Middle face */
		1225	if (update_space (sl, socket, ms, lastcell, 1))
		1226	mask |= 0x2;
		1227
		1228	if (expect_false (ob->invisible)
		1229	&& ob->invisible & (ob->invisible < 50 ? 1 : 7)
		1230	&& ms.player () == ob)
		1231	{
		1232	// force player to be visible to himself if invisible
		1233	if (lastcell.faces[0] != ob->face)
		1234	{
		1235	lastcell.faces[0] = ob->face;
		1236
		1237	mask |= 0x1;
		1238	sl << uint16 (ob->face);
		1239
		1240	socket.send_faces (ob);
		1241	}
		1242	}
		1243	/* Top face */
		1244	else if (update_space (sl, socket, ms, lastcell, 0))
		1245	mask |= 0x1;
		1246
		1247	/* Check to see if we are in fact sending anything for this
		1248	* space by checking the mask. If so, update the mask.
		1249	* if not, reset the len to that from before adding the mask
		1250	* value, so we don't send those bits.
		1251	*/
		1252	if (mask & 0xf)
		1253	sl[oldlen + 1] = mask & 0xff;
		1254	else
		1255	sl.reset (oldlen);
		1256	} /* else this is a viewable space */
		1257	ordered_mapwalk_end
		1258
		1259	socket.flush_fx ();
		1260
		1261	if (sl.length () > startlen || socket.sent_scroll)
2063	}	1262	{
2064
2065	ns->send_packet (sl);	1263	socket.send_packet (sl);
2066	}	1264	socket.sent_scroll = 0;
2067
2068	/**
2069	* This sends the spell path to name mapping. We ignore
2070	* the params - we always send the same info no matter what.
2071	*/
2072	void
2073	send_spell_paths (client * ns, char *params)
2074	{
2075	packet sl;
2076
2077	sl << "replyinfo spell_paths\n";
2078
2079	for (int i = 0; i < NRSPELLPATHS; i++)
2080	sl.printf ("%d:%s\n", 1 << i, spellpathnames[i]);
2081
2082	if (sl.length () >= MAXSOCKBUF)
2083	{	1265	}
2084	LOG (llevError, "Buffer overflow in send_spell_paths!\n");
2085	fatal (0);
2086	}
2087
2088	ns->send_packet (sl);
2089	}	1266	}
2090		1267
2091	/**	1268	/**
2092	* This looks for any spells the player may have that have changed their stats.	1269	* This looks for any spells the player may have that have changed their stats.
2093	* it then sends an updspell packet for each spell that has changed in this way	1270	* it then sends an updspell packet for each spell that has changed in this way
…		…
2096	esrv_update_spells (player *pl)	1273	esrv_update_spells (player *pl)
2097	{	1274	{
2098	if (!pl->ns)	1275	if (!pl->ns)
2099	return;	1276	return;
2100		1277
		1278	pl->ns->update_spells = false;
		1279
2101	if (!pl->ns->monitor_spells)	1280	if (!pl->ns->monitor_spells)
2102	return;	1281	return;
2103		1282
2104	for (object *spell = pl->ob->inv; spell; spell = spell->below)	1283	for (object *spell = pl->ob->inv; spell; spell = spell->below)
2105	{
2106	if (spell->type == SPELL)	1284	if (spell->type == SPELL)
2107	{	1285	{
2108	int flags = 0;	1286	int flags = 0;
		1287	int val;
2109		1288
2110	/* check if we need to update it */	1289	/* check if we need to update it */
2111	if (spell->last_sp != SP_level_spellpoint_cost (pl->ob, spell, SPELL_MANA))	1290	val = SP_level_spellpoint_cost (pl->ob, spell, SPELL_MANA);
		1291	if (spell->cached_sp != val)
2112	{	1292	{
2113	spell->last_sp = SP_level_spellpoint_cost (pl->ob, spell, SPELL_MANA);	1293	spell->cached_sp = val;
2114	flags |= UPD_SP_MANA;	1294	flags |= UPD_SP_MANA;
2115	}	1295	}
2116		1296
2117	if (spell->last_grace != SP_level_spellpoint_cost (pl->ob, spell, SPELL_GRACE))	1297	val = SP_level_spellpoint_cost (pl->ob, spell, SPELL_GRACE);
		1298	if (spell->cached_grace != val)
2118	{	1299	{
2119	spell->last_grace = SP_level_spellpoint_cost (pl->ob, spell, SPELL_GRACE);	1300	spell->cached_grace = val;
2120	flags |= UPD_SP_GRACE;	1301	flags |= UPD_SP_GRACE;
2121	}	1302	}
2122		1303
2123	if (spell->last_eat != spell->stats.dam + SP_level_dam_adjust (pl->ob, spell))	1304	val = casting_level (pl->ob, spell);
		1305	if (spell->cached_eat != val)
2124	{	1306	{
2125	spell->last_eat = spell->stats.dam + SP_level_dam_adjust (pl->ob, spell);	1307	spell->cached_eat = val;
2126	flags |= UPD_SP_DAMAGE;	1308	flags |= UPD_SP_LEVEL;
2127	}	1309	}
2128		1310
2129	if (flags)	1311	if (flags)
2130	{	1312	{
2131	packet sl;	1313	packet sl;
2132		1314
2133	sl << "updspell "	1315	sl << "updspell "
2134	<< uint8 (flags)	1316	<< uint8 (flags)
2135	<< uint32 (spell->count);	1317	<< uint32 (spell->count);
2136		1318
2137	if (flags & UPD_SP_MANA ) sl << uint16 (spell->last_sp);	1319	if (flags & UPD_SP_MANA ) sl << uint16 (spell->cached_sp);
2138	if (flags & UPD_SP_GRACE ) sl << uint16 (spell->last_grace);	1320	if (flags & UPD_SP_GRACE) sl << uint16 (spell->cached_grace);
2139	if (flags & UPD_SP_DAMAGE) sl << uint16 (spell->last_eat);	1321	if (flags & UPD_SP_LEVEL) sl << uint16 (spell->cached_eat);
2140		1322
2141	pl->ns->send_packet (sl);	1323	pl->ns->send_packet (sl);
2142	}	1324	}
2143	}	1325	}
2144	}
2145	}	1326	}
2146		1327
2147	void	1328	void
2148	esrv_remove_spell (player *pl, object *spell)	1329	esrv_remove_spell (player *pl, object *spell)
2149	{	1330	{
…		…
2174	LOG (llevError, "item number %d is a spell with no name.\n", spell->count);	1355	LOG (llevError, "item number %d is a spell with no name.\n", spell->count);
2175	return;	1356	return;
2176	}	1357	}
2177		1358
2178	/* store costs and damage in the object struct, to compare to later */	1359	/* store costs and damage in the object struct, to compare to later */
2179	spell->last_sp = SP_level_spellpoint_cost (pl->ob, spell, SPELL_MANA);	1360	spell->cached_sp = SP_level_spellpoint_cost (pl->ob, spell, SPELL_MANA);
2180	spell->last_grace = SP_level_spellpoint_cost (pl->ob, spell, SPELL_GRACE);	1361	spell->cached_grace = SP_level_spellpoint_cost (pl->ob, spell, SPELL_GRACE);
2181	spell->last_eat = spell->stats.dam + SP_level_dam_adjust (pl->ob, spell);	1362	spell->cached_eat = casting_level (pl->ob, spell);
2182		1363
2183	/* figure out which skill it uses, if it uses one */	1364	/* figure out which skill it uses, if it uses one */
2184	if (spell->skill)	1365	if (spell->skill)
2185	{	1366	if (object *tmp = pl->find_skill (spell->skill))
2186	for (i = 1; i < NUM_SKILLS; i++)
2187	if (!strcmp (spell->skill, skill_names[i]))
2188	{
2189	skill = i + CS_STAT_SKILLINFO;	1367	skill = tmp->subtype + CS_STAT_SKILLINFO;
2190	break;	1368
2191	}	1369	// spells better have a face
		1370	if (!spell->face)
2192	}	1371	{
		1372	LOG (llevError, "%s: spell has no face, but face is mandatory.\n", &spell->name);
		1373	spell->face = face_find ("burnout.x11", blank_face);
		1374	}
		1375
		1376	pl->ns->send_face (spell->face);
2193		1377
2194	/* send the current values */	1378	/* send the current values */
2195	sl << uint32 (spell->count)	1379	sl << uint32 (spell->count)
2196	<< uint16 (spell->level)	1380	<< uint16 (spell->level)
2197	<< uint16 (spell->casting_time)	1381	<< uint16 (spell->casting_time)
2198	<< uint16 (spell->last_sp)	1382	<< uint16 (spell->cached_sp)
2199	<< uint16 (spell->last_grace)	1383	<< uint16 (spell->cached_grace)
2200	<< uint16 (spell->last_eat)	1384	<< uint16 (spell->cached_eat)
2201	<< uint8 (skill)	1385	<< uint8 (skill)
2202	<< uint32 (spell->path_attuned)	1386	<< uint32 (spell->path_attuned)
2203	<< uint32 (spell->face ? spell->face->number : 0)	1387	<< uint32 (spell->face)
2204	<< data8 (spell->name)	1388	<< data8 (spell->name)
2205	<< data16 (spell->msg);	1389	<< data16 (spell->msg);
2206	}	1390	}
2207		1391
2208	/**	1392	/**
…		…
2223		1407
2224	packet sl ("addspell");	1408	packet sl ("addspell");
2225		1409
2226	if (!spell)	1410	if (!spell)
2227	{	1411	{
2228	for (spell = pl->ob->inv; spell != NULL; spell = spell->below)	1412	for (spell = pl->ob->inv; spell; spell = spell->below)
2229	{	1413	{
2230	/* were we to simply keep appending data here, we could exceed	1414	/* were we to simply keep appending data here, we could exceed
2231	* MAXSOCKBUF if the player has enough spells to add, we know that	1415	* MAXSOCKBUF if the player has enough spells to add, we know that
2232	* append_spells will always append 19 data bytes, plus 4 length	1416	* append_spells will always append 19 data bytes, plus 4 length
2233	* bytes and 3 strings (because that is the spec) so we need to	1417	* bytes and 3 strings (because that is the spec) so we need to
2234	* check that the length of those 3 strings, plus the 23 bytes,	1418	* check that the length of those 3 strings, plus the 23 bytes,
2235	* won't take us over the length limit for the socket, if it does,	1419	* won't take us over the length limit for the socket, if it does,
2236	* we need to send what we already have, and restart packet formation	1420	* we need to send what we already have, and restart packet formation
2237	*/	1421	*/
		1422	if (spell->type != SPELL)
		1423	continue;
		1424
2238	/* Seeing crashes by overflowed buffers. Quick arithemetic seems	1425	/* Seeing crashes by overflowed buffers. Quick arithemetic seems
2239	* to show add_spell is 26 bytes + 2 strings. However, the overun	1426	* to show add_spell is 26 bytes + 2 strings. However, the overun
2240	* is hundreds of bytes off, so correcting 22 vs 26 doesn't seem	1427	* is hundreds of bytes off, so correcting 22 vs 26 doesn't seem
2241	* like it will fix this	1428	* like it will fix this
2242	*/	1429	*/
2243	if (spell->type != SPELL)
2244	continue;
2245
2246	if (sl.length () >= (MAXSOCKBUF - (26 + strlen (spell->name) + (spell->msg ? strlen (spell->msg) : 0))))	1430	if (sl.length () > (MAXSOCKBUF - (26 + strlen (spell->name) + (spell->msg ? strlen (spell->msg) : 0))))
2247	{	1431	{
		1432	pl->ns->flush_fx ();
2248	pl->ns->send_packet (sl);	1433	pl->ns->send_packet (sl);
2249		1434
2250	sl.reset ();	1435	sl.reset ();
2251	sl << "addspell ";	1436	sl << "addspell ";
2252	}	1437	}
…		…
2260	return;	1445	return;
2261	}	1446	}
2262	else	1447	else
2263	append_spell (pl, sl, spell);	1448	append_spell (pl, sl, spell);
2264		1449
2265	if (sl.length () >= MAXSOCKBUF)	1450	if (sl.length () > MAXSOCKBUF)
2266	{	1451	{
2267	LOG (llevError, "Buffer overflow in esrv_add_spells!\n");	1452	LOG (llevError, "Buffer overflow in esrv_add_spells!\n");
2268	fatal (0);	1453	fatal (0);
2269	}	1454	}
2270		1455
2271	/* finally, we can send the packet */	1456	/* finally, we can send the packet */
		1457	pl->ns->flush_fx ();
2272	pl->ns->send_packet (sl);	1458	pl->ns->send_packet (sl);
2273	}	1459	}
2274		1460
		1461	//-GPL
		1462

Diff Legend

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