[ViewVC] Diff of: cvs/deliantra/server/socket/request.C

Comparing deliantra/server/socket/request.C (file contents):
Revision 1.44 by root, Sat Dec 16 21:40:26 2006 UTC vs.
Revision 1.150 by root, Mon Oct 12 14:00:59 2009 UTC

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

Diff Legend

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

Comparing deliantra/server/socket/request.C (file contents): Revision 1.44 by root, Sat Dec 16 21:40:26 2006 UTC vs. Revision 1.150 by root, Mon Oct 12 14:00:59 2009 UTC

Diff Legend

Comparing deliantra/server/socket/request.C (file contents):
Revision 1.44 by root, Sat Dec 16 21:40:26 2006 UTC vs.
Revision 1.150 by root, Mon Oct 12 14:00:59 2009 UTC