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.70 by root, Sun Mar 11 21:26:05 2007 UTC vs.
Revision 1.158 by root, Fri Nov 6 13:11:28 2009 UTC

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

Diff Legend

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