ViewVC Help

View File | Revision Log | Show Annotations | Download File

/cvs/deliantra/server/socket/request.C

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

Diff Legend

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