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.129 by root, Tue May 6 19:37:01 2008 UTC vs.
Revision 1.196 by root, Sun Nov 18 00:37:11 2018 UTC

1	/*	1	/*
2	* This file is part of Deliantra, the Roguelike Realtime MMORPG.	2	* This file is part of Deliantra, the Roguelike Realtime MMORPG.
3	*	3	*
		4	* Copyright (©) 2017,2018 Marc Alexander Lehmann / the Deliantra team
4	* Copyright (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra team	5	* Copyright (©) 2005,2006,2007,2008,2009,2010,2011,2012,2013,2014,2015,2016 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
5	* Copyright (©) 2001,2007 Mark Wedel	6	* Copyright (©) 2001 Mark Wedel
6	* Copyright (©) 1992,2007 Frank Tore Johansen	7	* Copyright (©) 1992 Frank Tore Johansen
7	*	8	*
8	* Deliantra is free software: you can redistribute it and/or modify	9	* 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	10	* the terms of the Affero GNU General Public License as published by the
10	* the Free Software Foundation, either version 3 of the License, or	11	* Free Software Foundation, either version 3 of the License, or (at your
11	* (at your option) any later version.	12	* option) any later version.
12	*	13	*
13	* This program is distributed in the hope that it will be useful,	14	* This program is distributed in the hope that it will be useful,
14	* but WITHOUT ANY WARRANTY; without even the implied warranty of	15	* but WITHOUT ANY WARRANTY; without even the implied warranty of
15	* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the	16	* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16	* GNU General Public License for more details.	17	* GNU General Public License for more details.
17	*	18	*
18	* You should have received a copy of the GNU General Public License	19	* You should have received a copy of the Affero GNU General Public License
19	* along with this program. If not, see <http://www.gnu.org/licenses/>.	20	* and the GNU General Public License along with this program. If not, see
		21	* <http://www.gnu.org/licenses/>.
20	*	22	*
21	* The authors can be reached via e-mail to <support@deliantra.net>	23	* The authors can be reached via e-mail to <support@deliantra.net>
22	*/	24	*/
		25
		26	//+GPL
23		27
24	/**	28	/**
25	* \file	29	* \file
26	* Client handling.	30	* Client handling.
27	*	31	*
28	* \date 2003-12-02	32	* \date 2003-12-02
29	*	33	*
30	* This file implements all of the goo on the server side for handling	34	* This file implements all of the goo on the server side for handling
31	* clients. It's got a bunch of global variables for keeping track of	35	* clients. It's got a bunch of global variables for keeping track of
32	* each of the clients.	36	* each of the clients.
33	*	37	*
34	* Note: All functions that are used to process data from the client	38	* Note: All functions that are used to process data from the client
35	* have the prototype of (char *data, int datalen, int client_num). This	39	* have the prototype of (char *data, int datalen, int client_num). This
36	* way, we can use one dispatch table.	40	* way, we can use one dispatch table.
37	*	41	*
…		…
41		45
42	#include <global.h>	46	#include <global.h>
43	#include <sproto.h>	47	#include <sproto.h>
44		48
45	#include <living.h>	49	#include <living.h>
46	#include <commands.h>
47		50
48	/* This block is basically taken from socket.c - I assume if it works there,	51	/* This block is basically taken from socket.c - I assume if it works there,
49	* it should work here.	52	* it should work here.
50	*/	53	*/
51	#include <sys/types.h>	54	#include <sys/types.h>
…		…
63	* This table translates the attack numbers as used within the	66	* This table translates the attack numbers as used within the
64	* 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
65	* 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
66	* client.	69	* client.
67	*/	70	*/
68	short atnr_cs_stat[NROFATTACKS] = { CS_STAT_RES_PHYS,	71	static short atnr_cs_stat[NROFATTACKS] =
69	CS_STAT_RES_MAG, CS_STAT_RES_FIRE, CS_STAT_RES_ELEC,	72	{
70	CS_STAT_RES_COLD, CS_STAT_RES_CONF, CS_STAT_RES_ACID,	73	CS_STAT_RES_PHYS,
71	CS_STAT_RES_DRAIN, -1 /* weaponmagic */ ,	74	CS_STAT_RES_MAG,
72	CS_STAT_RES_GHOSTHIT, CS_STAT_RES_POISON,	75	CS_STAT_RES_FIRE,
73	CS_STAT_RES_SLOW, CS_STAT_RES_PARA, CS_STAT_TURN_UNDEAD,	76	CS_STAT_RES_ELEC,
74	CS_STAT_RES_FEAR, -1 /* Cancellation */ ,	77	CS_STAT_RES_COLD,
75	CS_STAT_RES_DEPLETE, CS_STAT_RES_DEATH,	78	CS_STAT_RES_CONF,
76	-1 /* Chaos */ , -1 /* Counterspell */ ,	79	CS_STAT_RES_ACID,
77	-1 /* Godpower */ , CS_STAT_RES_HOLYWORD,	80	CS_STAT_RES_DRAIN,
		81	-1 /* weaponmagic */,
		82	CS_STAT_RES_GHOSTHIT,
		83	CS_STAT_RES_POISON,
		84	CS_STAT_RES_SLOW,
		85	CS_STAT_RES_PARA,
		86	CS_STAT_TURN_UNDEAD,
		87	CS_STAT_RES_FEAR,
		88	-1 /* Cancellation */,
		89	CS_STAT_RES_DEPLETE,
		90	CS_STAT_RES_DEATH,
		91	-1 /* Chaos */,
		92	-1 /* Counterspell */,
		93	-1 /* Godpower */,
		94	CS_STAT_RES_HOLYWORD,
78	CS_STAT_RES_BLIND,	95	CS_STAT_RES_BLIND,
79	-1, /* Internal */	96	-1, /* Internal */
80	-1, /* life stealing */	97	-1, /* life stealing */
81	-1 /* Disease - not fully done yet */	98	-1 /* Disease - not fully done yet */
82	};	99	};
…		…
98	*/	115	*/
99	mx = ns->mapx;	116	mx = ns->mapx;
100	my = ns->mapy;	117	my = ns->mapy;
101		118
102	/* the x and y here are coordinates for the new map, i.e. if we moved	119	/* the x and y here are coordinates for the new map, i.e. if we moved
103	* (dx,dy), newmap[x][y] = oldmap[x-dx][y-dy]. For this reason,	120	* (dx,dy), newmap[x][y] = oldmap[x-dx][y-dy]. For this reason,
104	* if the destination x or y coordinate is outside the viewable	121	* if the destination x or y coordinate is outside the viewable
105	* area, we clear the values - otherwise, the old values	122	* area, we clear the values - otherwise, the old values
106	* are preserved, and the check_head thinks it needs to clear them.	123	* are preserved, and the check_head thinks it needs to clear them.
107	*/	124	*/
108	for (x = 0; x < mx; x++)	125	for (x = 0; x < mx; x++)
109	{
110	for (y = 0; y < my; y++)	126	for (y = 0; y < my; y++)
111	{
112	if (x >= ns->mapx || y >= ns->mapy)	127	if (x >= ns->mapx || y >= ns->mapy)
113	/* clear cells outside the viewable area */	128	/* clear cells outside the viewable area */
114	memset (&newmap.cells[x][y], 0, sizeof (struct MapCell));	129	memset (&newmap.cells[x][y], 0, sizeof (struct MapCell));
115	else if ((x + dx) < 0 || (x + dx) >= ns->mapx || (y + dy) < 0 || (y + dy) >= ns->mapy)	130	else if ((x + dx) < 0 || (x + dx) >= ns->mapx || (y + dy) < 0 || (y + dy) >= ns->mapy)
116	/* clear newly visible tiles within the viewable area */	131	/* clear newly visible tiles within the viewable area */
117	memset (&(newmap.cells[x][y]), 0, sizeof (struct MapCell));	132	memset (&(newmap.cells[x][y]), 0, sizeof (struct MapCell));
118	else	133	else
119	memcpy (&(newmap.cells[x][y]), &(ns->lastmap.cells[x + dx][y + dy]), sizeof (struct MapCell));	134	memcpy (&(newmap.cells[x][y]), &(ns->lastmap.cells[x + dx][y + dy]), sizeof (struct MapCell));
120	}
121	}
122		135
123	memcpy (&(ns->lastmap), &newmap, sizeof (struct Map));	136	memcpy (&(ns->lastmap), &newmap, sizeof (struct Map));
124		137
125	/* Make sure that the next "map1" command will be sent (even if it is	138	/* Make sure that the next "map1" command will be sent (even if it is
126	* empty).	139	* empty).
…		…
134	pl->ns->mapinfo_queue_clear ();	147	pl->ns->mapinfo_queue_clear ();
135		148
136	memset (&pl->ns->lastmap, 0, sizeof (pl->ns->lastmap));	149	memset (&pl->ns->lastmap, 0, sizeof (pl->ns->lastmap));
137		150
138	pl->ns->force_newmap = false;	151	pl->ns->force_newmap = false;
139
140	if (pl->ns->newmapcmd == 1)
141	pl->ns->send_packet ("newmap");	152	pl->ns->send_packet ("newmap");
142
143	pl->ns->floorbox_reset ();	153	pl->ns->floorbox_reset ();
		154	}
		155
		156	static void
		157	send_map_info (player *pl)
		158	{
		159	client &socket = *pl->ns;
		160	object *ob = pl->viewpoint;
		161
		162	if (socket.mapinfocmd)
		163	{
		164	if (ob->map && ob->map->path)
		165	{
		166	int flags = 0;
		167
		168	// due to historical glitches, the bit ordering and map index ordering differs
		169	if (ob->map->tile_path [TILE_NORTH]) flags |= 0x01;
		170	if (ob->map->tile_path [TILE_EAST ]) flags |= 0x02;
		171	if (ob->map->tile_path [TILE_SOUTH]) flags |= 0x04;
		172	if (ob->map->tile_path [TILE_WEST ]) flags |= 0x08;
		173	// these two are debatable
		174	if (ob->map->tile_path [TILE_UP ]) flags |= 0x10;
		175	if (ob->map->tile_path [TILE_DOWN ]) flags |= 0x20;
		176
		177	socket.send_packet_printf ("mapinfo - spatial %d %d %d %d %d %s",
		178	flags, socket.mapx / 2 - ob->x, socket.mapy / 2 - ob->y,
		179	ob->map->width, ob->map->height, &ob->map->path);
		180	}
		181	else
		182	socket.send_packet ("mapinfo current");
		183	}
144	}	184	}
145		185
146	/** check for map/region change and send new map data */	186	/** check for map/region change and send new map data */
147	static void	187	static void
148	check_map_change (player *pl)	188	check_map_change (player *pl)
149	{	189	{
150	client &socket = *pl->ns;	190	client &socket = *pl->ns;
151	object *ob = pl->observe;	191	object *ob = pl->viewpoint;
		192
		193	region *reg = ob->region ();
		194	if (socket.current_region != reg)
		195	{
		196	INVOKE_PLAYER (REGION_CHANGE, pl, ARG_REGION (reg), ARG_REGION (socket.current_region));
		197	socket.current_region = reg;
		198	}
		199
		200	// first try to avoid a full newmap on tiled map scrolls
		201	if (socket.current_map != ob->map && !socket.force_newmap)
		202	{
		203	rv_vector rv;
		204
		205	get_rangevector_from_mapcoord (socket.current_map, socket.current_x, socket.current_y, ob, &rv, 0);
		206
		207	// manhattan distance is very handy here
		208	if (rv.distance < 8) // 8 works nicely for speed << 70 and buggy gcfclient
		209	{
		210	socket.current_map = ob->map;
		211	socket.current_x = ob->x;
		212	socket.current_y = ob->y;
		213
		214	socket_map_scroll (&socket, rv.distance_x, rv.distance_y);
		215	socket.floorbox_reset ();
		216	send_map_info (pl);
		217	}
		218	}
152		219
153	if (socket.current_map != ob->map || socket.force_newmap)	220	if (socket.current_map != ob->map || socket.force_newmap)
154	{	221	{
155	clear_map (pl);	222	clear_map (pl);
156	socket.current_map = ob->map;	223	socket.current_map = ob->map;
157		224	send_map_info (pl);
158	if (socket.mapinfocmd)
159	{
160	if (ob->map && ob->map->path[0])
161	{
162	int flags = 0;
163
164	if (ob->map->tile_path[0]) flags |= 1;
165	if (ob->map->tile_path[1]) flags |= 2;
166	if (ob->map->tile_path[2]) flags |= 4;
167	if (ob->map->tile_path[3]) flags |= 8;
168
169	socket.send_packet_printf ("mapinfo - spatial %d %d %d %d %d %s",
170	flags, socket.mapx / 2 - ob->x, socket.mapy / 2 - ob->y,
171	ob->map->width, ob->map->height, &ob->map->path);
172	}
173	else
174	socket.send_packet ("mapinfo current");
175	}
176	}	225	}
177	else if (socket.current_x != ob->x || socket.current_y != ob->y)	226	else if (socket.current_x != ob->x || socket.current_y != ob->y)
178	{	227	{
179	int dx = ob->x - socket.current_x;	228	int dx = ob->x - socket.current_x;
180	int dy = ob->y - socket.current_y;	229	int dy = ob->y - socket.current_y;
181		230
182	if (socket.buggy_mapscroll && (abs (dx) > 8 || abs (dy) > 8))
183	clear_map (pl); // current (<= 1.9.1) clients have unchecked buffer overflows
184	else
185	{
186	socket_map_scroll (&socket, ob->x - socket.current_x, ob->y - socket.current_y);	231	socket_map_scroll (&socket, ob->x - socket.current_x, ob->y - socket.current_y);
187	socket.floorbox_reset ();	232	socket.floorbox_reset ();
188	}
189	}	233	}
190		234
191	socket.current_x = ob->x;	235	socket.current_x = ob->x;
192	socket.current_y = ob->y;	236	socket.current_y = ob->y;
		237	}
193		238
194	region *reg = ob->region ();	239	/**
195	if (socket.current_region != reg)	240	* This sends the skill number to name mapping. We ignore
196	{	241	* the params - we always send the same info no matter what.
197	INVOKE_PLAYER (REGION_CHANGE, pl, ARG_REGION (reg), ARG_REGION (socket.current_region));	242	*/
198	socket.current_region = reg;	243	static void
199	}	244	send_skill_info (client *ns, char *params)
		245	{
		246	packet sl;
		247	sl << "replyinfo skill_info\n";
		248
		249	for (int i = 0; i < skillvec.size (); ++i)
		250	sl.printf ("%d:%s\n", CS_STAT_SKILLINFO + i, &skillvec [i]->name);
		251
		252	if (sl.length () > MAXSOCKBUF)
		253	cleanup ("buffer overflow in send_skill_info!");
		254
		255	ns->send_packet (sl);
		256	}
		257
		258	/**
		259	* This sends the spell path to name mapping. We ignore
		260	* the params - we always send the same info no matter what.
		261	*/
		262	static void
		263	send_spell_paths (client * ns, char *params)
		264	{
		265	packet sl;
		266
		267	sl << "replyinfo spell_paths\n";
		268
		269	for (int i = 0; i < NRSPELLPATHS; i++)
		270	sl.printf ("%d:%s\n", 1 << i, spellpathnames[i]);
		271
		272	if (sl.length () > MAXSOCKBUF)
		273	cleanup ("buffer overflow in send_spell_paths!");
		274
		275	ns->send_packet (sl);
200	}	276	}
201		277
202	/**	278	/**
203	* RequestInfo is sort of a meta command. There is some specific	279	* RequestInfo is sort of a meta command. There is some specific
204	* request of information, but we call other functions to provide	280	* request of information, but we call other functions to provide
205	* that information.	281	* that information.
		282	* requestinfo is completely deprecated, use resource exti request
		283	* and the fxix or http protocols.
206	*/	284	*/
207	void	285	void
208	RequestInfo (char *buf, int len, client *ns)	286	RequestInfo (char *buf, int len, client *ns)
209	{	287	{
210	char *params;	288	char *params;
…		…
217	{	295	{
218	*params++ = 0;	296	*params++ = 0;
219	break;	297	break;
220	}	298	}
221		299
222	if (!strcmp (buf, "image_info"))
223	send_image_info (ns, params);
224	else if (!strcmp (buf, "image_sums"))
225	send_image_sums (ns, params);
226	else if (!strcmp (buf, "skill_info"))	300	if (!strcmp (buf, "skill_info"))
227	send_skill_info (ns, params);	301	send_skill_info (ns, params);
228	else if (!strcmp (buf, "spell_paths"))	302	else if (!strcmp (buf, "spell_paths"))
229	send_spell_paths (ns, params);	303	send_spell_paths (ns, params);
230	else	304	else
231	{	305	{
…		…
247	ExtiCmd (char *buf, int len, client *ns)	321	ExtiCmd (char *buf, int len, client *ns)
248	{	322	{
249	INVOKE_CLIENT (EXTICMD, ns, ARG_DATA (buf, len));	323	INVOKE_CLIENT (EXTICMD, ns, ARG_DATA (buf, len));
250	}	324	}
251		325
		326	//-GPL
		327
252	void	328	void
253	client::mapinfo_queue_clear ()	329	client::mapinfo_queue_clear ()
254	{	330	{
255	for (auto (i, mapinfo_queue.begin ()); i != mapinfo_queue.end (); ++i)	331	for (auto &&i : mapinfo_queue)
256	free (*i);	332	free (i);
257		333
258	mapinfo_queue.clear ();	334	mapinfo_queue.clear ();
259	}	335	}
260		336
261	bool	337	bool
…		…
263	{	339	{
264	char *token = buf;	340	char *token = buf;
265	buf += strlen (buf) + 9;	341	buf += strlen (buf) + 9;
266		342
267	// initial map and its origin	343	// initial map and its origin
268	maptile *map = pl->observe->map;	344	maptile *map = pl->viewpoint->map;
269	int mapx = pl->ns->mapx / 2 - pl->observe->x;	345	int mapx = pl->ns->mapx / 2 - pl->viewpoint->x;
270	int mapy = pl->ns->mapy / 2 - pl->observe->y;	346	int mapy = pl->ns->mapy / 2 - pl->viewpoint->y;
271	int max_distance = 8; // limit maximum path length to something generous	347	int max_distance = 8; // limit maximum path length to something generous
272		348
273	while (*buf && map && max_distance)	349	while (*buf && map && max_distance)
274	{	350	{
275	int dir = *buf++ - '1';	351	int dir = *buf++ - '1';
276		352
277	if (dir >= 0 && dir <= 3)	353	// due to historical glitches, the mapinfo index and tile index differs
		354	static unsigned char dirmap [] = { TILE_NORTH, TILE_EAST, TILE_SOUTH, TILE_WEST, TILE_UP, TILE_DOWN };
		355
		356	// maybe we should only allow the four flat directions
		357	if (IN_RANGE_EXC (dir, 0, array_length (dirmap)))
278	{	358	{
		359	dir = dirmap [dir];
		360
279	if (!map->tile_path [dir])	361	if (!map->tile_path [dir])
280	map = 0;	362	map = 0;
281	else if (map->tile_available (dir, false))	363	else if (map->tile_available (dir, false))
282	{	364	{
283	maptile *neigh = map->tile_map [dir];	365	maptile *neigh = map->tile_map [dir];
…		…
306	send_packet_printf ("mapinfo %s nomap", token);	388	send_packet_printf ("mapinfo %s nomap", token);
307	else	389	else
308	{	390	{
309	int flags = 0;	391	int flags = 0;
310		392
		393	// due to historical glitches, the bit ordering and map index ordering differs
311	if (map->tile_path[0]) flags |= 1;	394	if (map->tile_path [TILE_NORTH]) flags |= 0x01;
312	if (map->tile_path[1]) flags |= 2;	395	if (map->tile_path [TILE_EAST ]) flags |= 0x02;
313	if (map->tile_path[2]) flags |= 4;	396	if (map->tile_path [TILE_SOUTH]) flags |= 0x04;
314	if (map->tile_path[3]) flags |= 8;	397	if (map->tile_path [TILE_WEST ]) flags |= 0x08;
		398	// these two are debatable
		399	if (map->tile_path [TILE_UP ]) flags |= 0x10;
		400	if (map->tile_path [TILE_DOWN ]) flags |= 0x20;
315		401
316	send_packet_printf ("mapinfo %s spatial %d %d %d %d %d %s", token, flags, mapx, mapy, map->width, map->height, &map->path);	402	send_packet_printf ("mapinfo %s spatial %d %d %d %d %d %s", token, flags, mapx, mapy, map->width, map->height, &map->path);
317	}	403	}
318		404
319	return 1;	405	return 1;
…		…
380	AddMeCmd (char *buf, int len, client *ns)	466	AddMeCmd (char *buf, int len, client *ns)
381	{	467	{
382	INVOKE_CLIENT (ADDME, ns, ARG_DATA (buf, len));	468	INVOKE_CLIENT (ADDME, ns, ARG_DATA (buf, len));
383	}	469	}
384		470
385	/** Reply to ExtendedInfos command */	471	//+GPL
386	void
387	ToggleExtendedInfos (char *buf, int len, client * ns)
388	{
389	char cmdback[MAX_BUF];
390	char command[50];
391	int info, nextinfo;
392
393	cmdback[0] = '\0';
394	nextinfo = 0;
395
396	while (1)
397	{
398	/* 1. Extract an info */
399	info = nextinfo;
400
401	while ((info < len) && (buf[info] == ' '))
402	info++;
403
404	if (info >= len)
405	break;
406
407	nextinfo = info + 1;
408
409	while ((nextinfo < len) && (buf[nextinfo] != ' '))
410	nextinfo++;
411
412	if (nextinfo - info >= 49) /*Erroneous info asked */
413	continue;
414
415	strncpy (command, &(buf[info]), nextinfo - info);
416
417	/* 2. Interpret info */
418	if (!strcmp ("smooth", command))
419	/* Toggle smoothing */
420	ns->EMI_smooth = !ns->EMI_smooth;
421	else
422	/*bad value */;
423
424	/*3. Next info */
425	}
426
427	strcpy (cmdback, "ExtendedInfoSet");
428
429	if (ns->EMI_smooth)
430	{
431	strcat (cmdback, " ");
432	strcat (cmdback, "smoothing");
433	}
434
435	ns->send_packet (cmdback);
436	}
437
438	/*
439	#define MSG_TYPE_BOOK 1
440	#define MSG_TYPE_CARD 2
441	#define MSG_TYPE_PAPER 3
442	#define MSG_TYPE_SIGN 4
443	#define MSG_TYPE_MONUMENT 5
444	#define MSG_TYPE_SCRIPTED_DIALOG 6*/
445
446	/** Reply to ExtendedInfos command */
447	void
448	ToggleExtendedText (char *buf, int len, client * ns)
449	{
450	char cmdback[MAX_BUF];
451	char temp[10];
452	char command[50];
453	int info, nextinfo, i, flag;
454
455	cmdback[0] = '\0';
456
457	nextinfo = 0;
458	while (1)
459	{
460	/* 1. Extract an info */
461	info = nextinfo;
462
463	while ((info < len) && (buf[info] == ' '))
464	info++;
465
466	if (info >= len)
467	break;
468
469	nextinfo = info + 1;
470
471	while ((nextinfo < len) && (buf[nextinfo] != ' '))
472	nextinfo++;
473
474	if (nextinfo - info >= 49) /*Erroneous info asked */
475	continue;
476
477	strncpy (command, &(buf[info]), nextinfo - info);
478	command[nextinfo - info] = '\0';
479	/* 2. Interpret info */
480	i = sscanf (command, "%d", &flag);
481
482	if ((i == 1) && (flag > 0) && (flag <= MSG_TYPE_LAST))
483	ns->supported_readables |= (1 << flag);
484	/*3. Next info */
485	}
486
487	/* Send resulting state */
488	strcpy (cmdback, "ExtendedTextSet");
489
490	for (i = 0; i <= MSG_TYPE_LAST; i++)
491	if (ns->supported_readables & (1 << i))
492	{
493	strcat (cmdback, " ");
494	snprintf (temp, sizeof (temp), "%d", i);
495	strcat (cmdback, temp);
496	}
497
498	ns->send_packet (cmdback);
499	}
500		472
501	/**	473	/**
502	* This handles the general commands from the client (ie, north, fire, cast,	474	* This handles the general commands from the client (ie, north, fire, cast,
503	* etc.)	475	* etc.)
504	*/	476	*/
…		…
517	return;	489	return;
518		490
519	buf++;	491	buf++;
520	}	492	}
521		493
522	execute_newserver_command (pl->ob, (char *) buf);	494	execute_newserver_command (pl->ob, (char *)buf);
523		495
524	/* Perhaps something better should be done with a left over count.	496	/* Perhaps something better should be done with a left over count.
525	* Cleaning up the input should probably be done first - all actions	497	* Cleaning up the input should probably be done first - all actions
526	* for the command that issued the count should be done before any other	498	* for the command that issued the count should be done before any other
527	* commands.	499	* commands.
528	*/	500	*/
529	pl->count = 0;	501	pl->count = 0;
530	}
531
532	/**
533	* This handles the general commands from the client (ie, north, fire, cast,
534	* etc.). It is a lot like PlayerCmd above, but is called with the
535	* 'ncom' method which gives more information back to the client so it
536	* can throttle.
537	*/
538	void
539	NewPlayerCmd (char *buf, int len, player *pl)
540	{
541	if (len <= 6)
542	{
543	LOG (llevDebug, "%s: corrupt ncom command <%s>: not long enough (%d) - discarding\n", pl->ns->host, buf, len);
544	return;
545	}
546
547	uint16 cmdid = net_uint16 ((uint8 *)buf);
548	sint32 repeat = net_sint32 ((uint8 *)buf + 2);
549
550	/* -1 is special - no repeat, but don't update */
551	if (repeat != -1)
552	pl->count = repeat;
553
554	buf += 6; //len -= 6;
555
556	execute_newserver_command (pl->ob, buf);
557
558	/* Perhaps something better should be done with a left over count.
559	* Cleaning up the input should probably be done first - all actions
560	* for the command that issued the count should be done before any other
561	* commands.
562	*/
563	pl->count = 0;
564
565	//TODO: schmorp thinks whatever this calculates, it makes no sense at all
566	int time = fabs (pl->ob->speed) < 0.001
567	? time = MAX_TIME * 100
568	: time = (int) (MAX_TIME / fabs (pl->ob->speed));
569
570	/* Send confirmation of command execution now */
571	packet sl ("comc");
572	sl << uint16 (cmdid) << uint32 (time);
573	pl->ns->send_packet (sl);
574	}	502	}
575		503
576	/** This is a reply to a previous query. */	504	/** This is a reply to a previous query. */
577	void	505	void
578	ReplyCmd (char *buf, int len, client *ns)	506	ReplyCmd (char *buf, int len, client *ns)
…		…
615	LOG (llevError, "Unknown input state: %d\n", ns->state);	543	LOG (llevError, "Unknown input state: %d\n", ns->state);
616	}	544	}
617	}	545	}
618		546
619	/**	547	/**
620	* Client tells its version. If there is a mismatch, we close the	548	* Client tells its version info.
621	* socket. In real life, all we should care about is the client having
622	* something older than the server. If we assume the client will be
623	* backwards compatible, having it be a later version should not be a
624	* problem.
625	*/	549	*/
626	void	550	void
627	VersionCmd (char *buf, int len, client * ns)	551	VersionCmd (char *buf, int len, client *ns)
628	{	552	{
629	if (!buf)	553	INVOKE_CLIENT (VERSION, ns, ARG_DATA (buf, len));
630	{
631	LOG (llevError, "CS: received corrupted version command\n");
632	return;
633	}
634
635	ns->cs_version = atoi (buf);
636	ns->sc_version = ns->cs_version;
637
638	LOG (llevDebug, "connection from client <%s>\n", buf);
639
640	//TODO: should log here just for statistics
641
642	//if (VERSION_CS != ns->cs_version)
643	// unchecked;
644
645	char *cp = strchr (buf + 1, ' ');
646	if (!cp)
647	return;
648
649	ns->sc_version = atoi (cp);
650
651	//if (VERSION_SC != ns->sc_version)
652	// unchecked;
653
654	cp = strchr (cp + 1, ' ');
655
656	if (cp)
657	{
658	ns->version = cp + 1;
659
660	if (ns->sc_version < 1026)
661	ns->send_packet_printf ("drawinfo %d %s", NDI_RED,
662	"**** VERSION WARNING ****\n**** CLIENT IS TOO OLD!! UPDATE THE CLIENT!! ****");
663	}
664	}	554	}
665		555
666	/** sound related functions. */	556	/** sound related functions. */
667	void	557	void
668	SetSound (char *buf, int len, client * ns)	558	SetSound (char *buf, int len, client * ns)
…		…
719	* Get player's current range attack in obuf.	609	* Get player's current range attack in obuf.
720	*/	610	*/
721	static void	611	static void
722	rangetostring (player *pl, char *obuf)	612	rangetostring (player *pl, char *obuf)
723	{	613	{
724	dynbuf_text buf;	614	dynbuf_text &buf = msg_dynbuf; buf.clear ();
		615
		616	#if 0
		617	// print ranged/chosen_skill etc. objects every call
		618	printf ("%s %s => %s (%s)\n",
		619	pl->ranged_ob ? &pl->ranged_ob->name : "-",
		620	pl->combat_ob ? &pl->combat_ob->name : "-",
		621	pl->ob->current_weapon ? &pl->ob->current_weapon->name : "-",
		622	pl->ob->chosen_skill ? &pl->ob->chosen_skill->name : "-"
		623	);
		624	#endif
725		625
726	if (pl->ranged_ob)	626	if (pl->ranged_ob)
727	buf << " Range" << (pl->ob->current_weapon == pl->ranged_ob ? "*" : "") << ": " << pl->ranged_ob->name;	627	buf << " Range" << (pl->ob->current_weapon == pl->ranged_ob ? "*" : "") << ": " << pl->ranged_ob->name;
728		628
729	if (pl->combat_ob)	629	if (pl->combat_ob)
…		…
775	* commands for now.	675	* commands for now.
776	*/	676	*/
777	void	677	void
778	esrv_update_stats (player *pl)	678	esrv_update_stats (player *pl)
779	{	679	{
780	char buf[MAX_BUF];
781	uint16 flags;
782
783	client *ns = pl->ns;	680	client *ns = pl->ns;
784	if (!ns)	681	if (!ns)
785	return;	682	return;
786		683
787	object *ob = pl->observe;	684	object *ob = pl->observe;
…		…
804	AddIfShort (ns->last_stats.Int, ob->stats.Int, CS_STAT_INT);	701	AddIfShort (ns->last_stats.Int, ob->stats.Int, CS_STAT_INT);
805	AddIfShort (ns->last_stats.Wis, ob->stats.Wis, CS_STAT_WIS);	702	AddIfShort (ns->last_stats.Wis, ob->stats.Wis, CS_STAT_WIS);
806	AddIfShort (ns->last_stats.Pow, ob->stats.Pow, CS_STAT_POW);	703	AddIfShort (ns->last_stats.Pow, ob->stats.Pow, CS_STAT_POW);
807	AddIfShort (ns->last_stats.Cha, ob->stats.Cha, CS_STAT_CHA);	704	AddIfShort (ns->last_stats.Cha, ob->stats.Cha, CS_STAT_CHA);
808		705
809	for (int s = 0; s < NUM_SKILLS; s++)	706	for (int s = 0; s < CS_NUM_SKILLS; s++)
810	if (object *skill = opl->last_skill_ob[s])	707	if (object *skill = opl->last_skill_ob [s])
811	if (skill->stats.exp != ns->last_skill_exp [s])	708	if (skill->stats.exp != ns->last_skill_exp [s])
812	{	709	{
813	ns->last_skill_exp [s] = skill->stats.exp;	710	ns->last_skill_exp [s] = skill->stats.exp;
814		711
815	/* Always send along the level if exp changes. This is only	712	/* Always send along the level if exp changes. This is only
816	* 1 extra byte, but keeps processing simpler.	713	* 1 extra byte, but keeps processing simpler.
817	*/	714	*/
818	sl << uint8 (s + CS_STAT_SKILLINFO)	715	sl << uint8 (CS_STAT_SKILLINFO + s)
819	<< uint8 (skill->level)	716	<< uint8 (skill->level)
820	<< uint64 (skill->stats.exp);	717	<< uint64 (skill->stats.exp);
821	}	718	}
822		719
823	AddIfInt64 (ns->last_stats.exp, ob->stats.exp, CS_STAT_EXP64);	720	AddIfInt64 (ns->last_stats.exp, ob->stats.exp, CS_STAT_EXP64);
824	AddIfShort (ns->last_level, ob->level, CS_STAT_LEVEL);	721	AddIfShort (ns->last_level, ob->level, CS_STAT_LEVEL);
825	AddIfShort (ns->last_stats.wc, ob->stats.wc, CS_STAT_WC);	722	AddIfShort (ns->last_stats.wc, ob->stats.wc, CS_STAT_WC);
826	AddIfShort (ns->last_stats.ac, ob->stats.ac, CS_STAT_AC);	723	AddIfShort (ns->last_stats.ac, ob->stats.ac, CS_STAT_AC);
827	AddIfShort (ns->last_stats.dam, ob->stats.dam, CS_STAT_DAM);	724	AddIfShort (ns->last_stats.dam, ob->stats.dam, CS_STAT_DAM);
828	AddIfFloat (ns->last_speed, ob->speed, CS_STAT_SPEED, 1.f/TICK);	725	AddIfFloat (ns->last_speed, ob->speed, CS_STAT_SPEED, 1.f / TICK);
829	AddIfShort (ns->last_stats.food, ob->stats.food, CS_STAT_FOOD);	726	AddIfShort (ns->last_stats.food, ob->stats.food, CS_STAT_FOOD);
830	AddIfFloat (ns->last_weapon_sp, pl->weapon_sp, CS_STAT_WEAP_SP, 1.f/TICK);	727	AddIfFloat (ns->last_weapon_sp, pl->weapon_sp, CS_STAT_WEAP_SP, 1.f / TICK);
831	AddIfInt (ns->last_weight_limit, weight_limit[ob->stats.Str], CS_STAT_WEIGHT_LIM);	728	AddIfInt (ns->last_weight_limit, weight_limit[ob->stats.Str], CS_STAT_WEIGHT_LIM);
832		729
833	flags = 0;	730	int flags = (opl->fire_on ? SF_FIREON : 0)
834		731	| (opl->run_on ? SF_RUNON : 0);
835	if (opl->fire_on)
836	flags |= SF_FIREON;
837
838	if (opl->run_on)
839	flags |= SF_RUNON;
840		732
841	AddIfShort (ns->last_flags, flags, CS_STAT_FLAGS);	733	AddIfShort (ns->last_flags, flags, CS_STAT_FLAGS);
842		734
843	if (ns->sc_version < 1025)
844	{ AddIfShort (ns->last_resist[ATNR_PHYSICAL], ob->resist[ATNR_PHYSICAL], CS_STAT_ARMOUR) }
845	else
846	for (int i = 0; i < NROFATTACKS; i++)	735	for (int i = 0; i < NROFATTACKS; i++)
847	{
848	/* Skip ones we won't send */	736	/* Skip ones we won't send */
849	if (atnr_cs_stat[i] == -1)	737	if (atnr_cs_stat[i] >= 0)
850	continue;
851
852	AddIfShort (ns->last_resist[i], ob->resist[i], atnr_cs_stat[i]);	738	AddIfShort (ns->last_resist[i], ob->resist[i], atnr_cs_stat[i]);
853	}
854		739
855	if (pl->ns->monitor_spells)	740	if (pl->ns->monitor_spells)
856	{	741	{
857	AddIfInt (ns->last_path_attuned, ob->path_attuned, CS_STAT_SPELL_ATTUNE);	742	AddIfInt (ns->last_path_attuned, ob->path_attuned, CS_STAT_SPELL_ATTUNE);
858	AddIfInt (ns->last_path_repelled, ob->path_repelled, CS_STAT_SPELL_REPEL);	743	AddIfInt (ns->last_path_repelled, ob->path_repelled, CS_STAT_SPELL_REPEL);
859	AddIfInt (ns->last_path_denied, ob->path_denied, CS_STAT_SPELL_DENY);	744	AddIfInt (ns->last_path_denied, ob->path_denied, CS_STAT_SPELL_DENY);
860	}	745	}
861		746
		747	char buf[MAX_BUF];
862	rangetostring (opl, buf); /* we want use the new fire & run system in new client */	748	rangetostring (opl, buf); /* we want use the new fire & run system in new client */
863	AddIfString (ns->stats.range, buf, CS_STAT_RANGE);	749	AddIfString (ns->stats.range, buf, CS_STAT_RANGE);
864	set_title (ob, buf);	750	set_title (ob, buf);
865	AddIfString (ns->stats.title, buf, CS_STAT_TITLE);	751	AddIfString (ns->stats.title, buf, CS_STAT_TITLE);
866		752
…		…
884	<< uint32 (pl->ob->face)	770	<< uint32 (pl->ob->face)
885	<< data8 (pl->ob->name);	771	<< data8 (pl->ob->name);
886		772
887	pl->ns->last_weight = weight;	773	pl->ns->last_weight = weight;
888	pl->ns->send_packet (sl);	774	pl->ns->send_packet (sl);
889	SET_FLAG (pl->ob, FLAG_CLIENT_SENT);
890	}	775	}
891		776
892	/******************************************************************************	777	/******************************************************************************
893	*	778	*
894	* Start of map related commands.	779	* Start of map related commands.
…		…
962	/* Nothing changed */	847	/* Nothing changed */
963	return 0;	848	return 0;
964	}	849	}
965		850
966	/**	851	/**
967	* Returns the size of a data for a map square as returned by
968	* mapextended. There are CLIENTMAPX*CLIENTMAPY*LAYERS entries
969	* available.
970	*/
971	int
972	getExtendedMapInfoSize (client * ns)
973	{
974	int result = 0;
975
976	if (ns->ext_mapinfos)
977	{
978	if (ns->EMI_smooth)
979	result += 1; /*One byte for smoothlevel */
980	}
981
982	return result;
983	}
984
985	// prefetch (and touch) all maps within a specific distancd
986	static void
987	prefetch_surrounding_maps (maptile *map, int distance)
988	{
989	map->last_access = runtime;
990
991	if (--distance)
992	for (int dir = 4; --dir; )
993	if (const shstr &path = map->tile_path [dir])
994	if (maptile *&neigh = map->tile_map [dir])
995	prefetch_surrounding_maps (neigh, distance);
996	else
997	neigh = maptile::find_async (path, map);
998	}
999
1000	// prefetch a generous area around the player
1001	static void
1002	prefetch_surrounding_maps (object *op)
1003	{
1004	prefetch_surrounding_maps (op->map, 3);
1005	}
1006
1007	/**
1008	* Draws client map.	852	* Draws client map.
1009	*/	853	*/
1010	void	854	void
1011	draw_client_map (player *pl)	855	draw_client_map (player *pl)
1012	{	856	{
1013	object *ob = pl->observe;	857	object *ob = pl->viewpoint;
1014	if (!ob->active)	858	if (!pl->observe->active)
1015	return;	859	return;
1016
1017	maptile *plmap = ob->map;
1018		860
1019	/* If player is just joining the game, he isn't here yet, so the map	861	/* If player is just joining the game, he isn't here yet, so the map
1020	* can get swapped out. If so, don't try to send them a map. All will	862	* can get swapped out. If so, don't try to send them a map. All will
1021	* be OK once they really log in.	863	* be OK once they really log in.
1022	*/	864	*/
1023	if (!plmap || plmap->in_memory != MAP_ACTIVE)	865	if (!ob->map || ob->map->state != MAP_ACTIVE)
1024	return;	866	return;
1025		867
1026	int x, y, ax, ay, startlen, max_x, max_y, oldlen;
1027	int estartlen, eoldlen;	868	int startlen, oldlen;
1028	uint8 eentrysize;
1029	uint16 ewhatstart, ewhatflag;
1030	uint8 extendedinfos;
1031		869
1032	check_map_change (pl);	870	check_map_change (pl);
1033	prefetch_surrounding_maps (pl->ob);	871	pl->ob->prefetch_surrounding_maps ();
1034		872
1035	/* do LOS after calls to update_position */	873	/* do LOS after calls to update_position */
1036	if (ob != pl->ob)	874	/* unfortunately, we need to udpate los when observing, currently */
1037	clear_los (pl);	875	if (pl->do_los || pl->viewpoint != pl->ob)
1038	else if (pl->do_los)
1039	{	876	{
1040	update_los (ob);
1041	pl->do_los = 0;	877	pl->do_los = 0;
		878	pl->update_los ();
1042	}	879	}
1043		880
1044	/**	881	/**
1045	* This function uses the new map1 protocol command to send the map	882	* This function uses the new map1 protocol command to send the map
1046	* to the client. It is necessary because the old map command supports	883	* to the client. It is necessary because the old map command supports
…		…
1064	* look like.	901	* look like.
1065	*/	902	*/
1066		903
1067	client &socket = *pl->ns;	904	client &socket = *pl->ns;
1068		905
1069	packet sl (socket.mapmode == Map1Cmd ? "map1" : "map1a");	906	packet sl ("map1a");
1070	packet esl;
1071		907
1072	startlen = sl.length ();	908	startlen = sl.length ();
1073		909
1074	/*Extendedmapinfo structure initialisation */	910	int hx = socket.mapx / 2;
1075	if (socket.ext_mapinfos)	911	int hy = socket.mapy / 2;
1076	{
1077	extendedinfos = EMI_NOREDRAW;
1078		912
1079	if (socket.EMI_smooth)	913	ordered_mapwalk_begin (ob, -hx, -hy, hx, hy)
1080	extendedinfos |= EMI_SMOOTH;	914	int ax = dx + hx;
		915	int ay = dy + hy;
1081		916
1082	ewhatstart = esl.length ();	917	int mask = (ax << 10) | (ay << 4);
1083	ewhatflag = extendedinfos; /*The EMI_NOREDRAW bit	918	MapCell &lastcell = socket.lastmap.cells[ax][ay];
1084	could need to be taken away */
1085	eentrysize = getExtendedMapInfoSize (&socket);
1086	esl << "mapextended "
1087	<< uint8 (extendedinfos)
1088	<< uint8 (eentrysize);
1089		919
1090	estartlen = esl.length ();	920	/* If the coordinates are not valid, or it is too dark to see,
1091	}	921	* we tell the client as such
1092
1093	/* x,y are the real map locations. ax, ay are viewport relative
1094	* locations.
1095	*/	922	*/
1096	ay = 0;	923	if (!m)
1097
1098	/* We could do this logic as conditionals in the if statement,
1099	* but that started to get a bit messy to look at.
1100	*/
1101	max_x = ob->x + (socket.mapx + 1) / 2;
1102	max_y = ob->y + (socket.mapy + 1) / 2;
1103
1104	for (y = ob->y - socket.mapy / 2; y < max_y; y++, ay++)
1105	{	924	{
1106	sint16 nx, ny;	925	/* space is out of map. Update space and clear values
1107	maptile *m = 0;	926	* if this hasn't already been done. If the space is out
1108		927	* of the map, it shouldn't have a head.
1109	ax = 0;	928	*/
1110	for (x = ob->x - socket.mapx / 2; x < max_x; x++, ax++)	929	if (lastcell.count != -1)
1111	{	930	{
1112	// check to see if we can simply go one right quickly	931	sl << uint16 (mask);
		932	map_clearcell (&lastcell, -1);
1113	++nx;	933	}
1114	if (m && nx >= m->width)	934
		935	continue;
		936	}
		937
		938	int d = pl->blocked_los_uc (dx, dy);
		939
		940	if (d > 3)
		941	{
		942	/* This block deals with spaces that are not visible for whatever
		943	* reason. Still may need to send the head for this space.
		944	*/
		945	if (lastcell.count != -1
		946	|| lastcell.faces[0]
		947	|| lastcell.faces[1]
		948	|| lastcell.faces[2]
		949	|| lastcell.stat_hp
		950	|| lastcell.flags
		951	|| lastcell.player)
		952	sl << uint16 (mask);
		953
		954	/* properly clear a previously sent big face */
		955	map_clearcell (&lastcell, -1);
		956	}
		957	else
		958	{
		959	/* In this block, the space is visible.
		960	*/
		961
		962	/* Rather than try to figure out what everything that we might
		963	* need to send is, then form the packet after that,
		964	* we presume that we will in fact form a packet, and update
		965	* the bits by what we do actually send. If we send nothing,
		966	* we just back out sl.length () to the old value, and no harm
		967	* is done.
		968	* I think this is simpler than doing a bunch of checks to see
		969	* what if anything we need to send, setting the bits, then
		970	* doing those checks again to add the real data.
		971	*/
		972	oldlen = sl.length ();
		973
		974	sl << uint16 (mask);
		975
		976	unsigned char dummy;
		977	unsigned char *last_ext = &dummy;
		978
		979	/* Darkness changed */
		980	if (lastcell.count != d)
		981	{
1115	m = 0;	982	mask |= 0x8;
1116		983
1117	if (!m)	984	*last_ext |= 0x80;
		985	last_ext = &sl[sl.length ()];
		986	sl << uint8 (d);
		987	}
		988
		989	lastcell.count = d;
		990
		991	mapspace &ms = m->at (nx, ny);
		992	ms.update ();
		993
		994	// extmap handling
		995	uint8 stat_hp = 0;
		996	uint8 stat_width = 0;
		997	uint8 flags = 0;
		998	tag_t player = 0;
		999
		1000	// send hp information, if applicable
		1001	if (object *op = ms.faces_obj [0])
		1002	if (op->is_head () && !op->invisible)
1118	{	1003	{
1119	nx = x; ny = y; m = plmap;	1004	if (op->stats.maxhp > op->stats.hp
1120		1005	&& op->stats.maxhp > 0
1121	if (xy_normalise (m, nx, ny))	1006	&& (op->type == PLAYER
1122	m->touch ();	1007	|| op->type == DOOR // does not work, have maxhp 0
1123	else	1008	|| op->flag [FLAG_MONSTER]
		1009	|| op->flag [FLAG_ALIVE]
		1010	|| op->flag [FLAG_GENERATOR]))
1124	m = 0;	1011	{
		1012	stat_hp = 255 - (op->stats.hp * 255 + 254) / op->stats.maxhp;
		1013	stat_width = op->arch->max_x - op->arch->x; //TODO: should be upper-left edge
		1014	}
		1015
		1016	if (expect_false (op->has_dialogue ()))
		1017	flags |= 1;
		1018
		1019	if (expect_false (op->type == PLAYER))
		1020	player = op == ob ? pl->ob->count
		1021	: op == pl->ob ? ob->count
		1022	: op->count;
1125	}	1023	}
1126		1024
1127	int emask, mask;	1025	if (expect_false (lastcell.stat_hp != stat_hp))
1128	emask = mask = (ax & 0x3f) << 10 | (ay & 0x3f) << 4;
1129
1130	MapCell &lastcell = socket.lastmap.cells[ax][ay];
1131
1132	/* If the coordinates are not valid, or it is too dark to see,
1133	* we tell the client as such
1134	*/
1135	if (!m)
1136	{	1026	{
1137	/* space is out of map. Update space and clear values	1027	lastcell.stat_hp = stat_hp;
1138	* if this hasn't already been done. If the space is out	1028
1139	* of the map, it shouldn't have a head	1029	mask |= 0x8;
1140	*/	1030	*last_ext |= 0x80;
1141	if (lastcell.count != -1)	1031	last_ext = &sl[sl.length ()];
		1032
		1033	sl << uint8 (5) << uint8 (stat_hp);
		1034
		1035	if (stat_width > 1)
1142	{	1036	{
1143	sl << uint16 (mask);
1144	map_clearcell (&lastcell, -1);
1145	}
1146
1147	continue;
1148	}
1149
1150	int d = pl->blocked_los[ax][ay];
1151
1152	if (d > 3)
1153	{
1154
1155	int need_send = 0, count;
1156
1157	/* This block deals with spaces that are not visible for whatever
1158	* reason. Still may need to send the head for this space.
1159	*/
1160
1161	oldlen = sl.length ();
1162
1163	sl << uint16 (mask);
1164
1165	if (lastcell.count != -1)
1166	need_send = 1;
1167
1168	count = -1;
1169
1170	/* properly clear a previously sent big face */
1171	if (lastcell.faces[0] || lastcell.faces[1] || lastcell.faces[2]
1172	|| lastcell.stat_hp || lastcell.flags || lastcell.player)
1173	need_send = 1;
1174
1175	map_clearcell (&lastcell, count);
1176
1177	if ((mask & 0xf) || need_send)
1178	sl[oldlen + 1] = mask & 0xff;
1179	else
1180	sl.reset (oldlen);
1181	}
1182	else
1183	{
1184	/* In this block, the space is visible.
1185	*/
1186
1187	/* Rather than try to figure out what everything that we might
1188	* need to send is, then form the packet after that,
1189	* we presume that we will in fact form a packet, and update
1190	* the bits by what we do actually send. If we send nothing,
1191	* we just back out sl.length () to the old value, and no harm
1192	* is done.
1193	* I think this is simpler than doing a bunch of checks to see
1194	* what if anything we need to send, setting the bits, then
1195	* doing those checks again to add the real data.
1196	*/
1197	oldlen = sl.length ();
1198	eoldlen = esl.length ();
1199
1200	sl << uint16 (mask);
1201
1202	unsigned char dummy;
1203	unsigned char *last_ext = &dummy;
1204
1205	/* Darkness changed */
1206	if (lastcell.count != d && socket.darkness)
1207	{
1208	mask |= 0x8;
1209
1210	if (socket.extmap)
1211	{
1212	*last_ext |= 0x80;	1037	*last_ext |= 0x80;
1213	last_ext = &sl[sl.length ()];	1038	last_ext = &sl[sl.length ()];
1214	sl << uint8 (d);	1039
1215	}	1040	sl << uint8 (6) << uint8 (stat_width);
1216	else
1217	sl << uint8 (255 - 64 * d);
1218	}	1041	}
		1042	}
1219		1043
1220	lastcell.count = d;	1044	if (expect_false (lastcell.player != player))
1221
1222	mapspace &ms = m->at (nx, ny);
1223	ms.update ();
1224
1225	if (socket.extmap)
1226	{	1045	{
1227	uint8 stat_hp = 0;	1046	lastcell.player = player;
1228	uint8 stat_width = 0;
1229	uint8 flags = 0;
1230	tag_t player = 0;
1231		1047
1232	// send hp information, if applicable
1233	if (object *op = ms.faces_obj [0])
1234	if (op->is_head () && !op->invisible)
1235	{
1236	if (op->stats.maxhp > op->stats.hp
1237	&& op->stats.maxhp > 0
1238	&& (op->type == PLAYER
1239	|| op->type == DOOR // does not work, have maxhp 0
1240	|| QUERY_FLAG (op, FLAG_MONSTER) || QUERY_FLAG (op, FLAG_ALIVE) || QUERY_FLAG (op, FLAG_GENERATOR)))
1241	{
1242	stat_hp = 255 - (op->stats.hp * 255 + 254) / op->stats.maxhp;
1243	stat_width = op->arch->max_x - op->arch->x; //TODO: should be upper-left edge
1244	}
1245
1246	if (op->msg && op->msg[0] == '@')
1247	flags |= 1;
1248
1249	if (op->type == PLAYER && op != ob)
1250	player = op->count;
1251	}
1252
1253	if (lastcell.stat_hp != stat_hp)
1254	{
1255	lastcell.stat_hp = stat_hp;
1256
1257	mask |= 0x8;	1048	mask |= 0x8;
1258	*last_ext |= 0x80;	1049	*last_ext |= 0x80;
1259	last_ext = &sl[sl.length ()];	1050	last_ext = &sl[sl.length ()];
1260		1051
1261	sl << uint8 (5) << uint8 (stat_hp);
1262
1263	if (stat_width > 1)
1264	{
1265	*last_ext |= 0x80;
1266	last_ext = &sl[sl.length ()];
1267
1268	sl << uint8 (6) << uint8 (stat_width);
1269	}
1270	}
1271
1272	if (lastcell.player != player)
1273	{
1274	lastcell.player = player;
1275
1276	mask |= 0x8;
1277	*last_ext |= 0x80;
1278	last_ext = &sl[sl.length ()];
1279
1280	sl << uint8 (0x47) << uint8 (4) << (uint32)player;	1052	sl << uint8 (0x47) << uint8 (4) << (uint32)player;
1281	}	1053	}
1282		1054
1283	if (lastcell.flags != flags)	1055	if (expect_false (lastcell.flags != flags))
1284	{	1056	{
1285	lastcell.flags = flags;	1057	lastcell.flags = flags;
1286		1058
1287	mask |= 0x8;	1059	mask |= 0x8;
1288	*last_ext |= 0x80;	1060	*last_ext |= 0x80;
1289	last_ext = &sl[sl.length ()];	1061	last_ext = &sl[sl.length ()];
1290		1062
1291	sl << uint8 (8) << uint8 (flags);	1063	sl << uint8 (8) << uint8 (flags);
1292	}
1293	}	1064	}
1294		1065
		1066	// faces
		1067
1295	/* Floor face */	1068	/* Floor face */
1296	if (update_space (sl, socket, ms, lastcell, 2))	1069	if (update_space (sl, socket, ms, lastcell, 2))
1297	mask |= 0x4;	1070	mask |= 0x4;
1298		1071
1299	/* Middle face */	1072	/* Middle face */
1300	if (update_space (sl, socket, ms, lastcell, 1))	1073	if (update_space (sl, socket, ms, lastcell, 1))
1301	mask |= 0x2;	1074	mask |= 0x2;
1302		1075
		1076	if (expect_false (ob->invisible)
		1077	&& ob->invisible & (ob->invisible < 50 ? 1 : 7)
1303	if (ms.player () == ob	1078	&& ms.player () == ob)
1304	&& (ob->invisible & (ob->invisible < 50 ? 1 : 7)))
1305	{	1079	{
1306	// force player to be visible to himself if invisible	1080	// force player to be visible to himself if invisible
1307	if (lastcell.faces[0] != ob->face)	1081	if (lastcell.faces[0] != ob->face)
1308	{	1082	{
1309	lastcell.faces[0] = ob->face;	1083	lastcell.faces[0] = ob->face;
1310		1084
1311	mask |= 0x1;
1312	sl << uint16 (ob->face);
1313
1314	socket.send_faces (ob);
1315	}
1316	}
1317	/* Top face */
1318	else if (update_space (sl, socket, ms, lastcell, 0))
1319	mask |= 0x1;	1085	mask |= 0x1;
		1086	sl << uint16 (ob->face);
1320		1087
		1088	socket.send_faces (ob);
		1089	}
		1090	}
		1091	/* Top face */
		1092	else if (update_space (sl, socket, ms, lastcell, 0))
		1093	mask |= 0x1;
		1094
1321	/* Check to see if we are in fact sending anything for this	1095	/* Check to see if we are in fact sending anything for this
1322	* space by checking the mask. If so, update the mask.	1096	* space by checking the mask. If so, update the mask.
1323	* if not, reset the len to that from before adding the mask	1097	* if not, reset the len to that from before adding the mask
1324	* value, so we don't send those bits.	1098	* value, so we don't send those bits.
1325	*/	1099	*/
1326	if (mask & 0xf)	1100	if (mask & 0xf)
1327	sl[oldlen + 1] = mask & 0xff;	1101	sl[oldlen + 1] = mask & 0xff;
1328	else	1102	else
1329	sl.reset (oldlen);	1103	sl.reset (oldlen);
1330
1331	if (socket.ext_mapinfos)
1332	esl << uint16 (emask);
1333
1334	if (socket.EMI_smooth)
1335	{
1336	for (int layer = 2+1; layer--; )
1337	{
1338	object *ob = ms.faces_obj [layer];
1339
1340	// If there is no object for this space, or if the face for the object
1341	// is the blank face, set the smoothlevel to zero.
1342	int smoothlevel = ob && ob->face != blank_face ? ob->smoothlevel : 0;
1343
1344	// We've gotten what face we want to use for the object. Now see if
1345	// if it has changed since we last sent it to the client.
1346	if (lastcell.smooth[layer] != smoothlevel)
1347	{
1348	lastcell.smooth[layer] = smoothlevel;
1349	esl << uint8 (smoothlevel);
1350	emask |= 1 << layer;
1351	}
1352	}
1353
1354	if (emask & 0xf)
1355	esl[eoldlen + 1] = emask & 0xff;
1356	else
1357	esl.reset (eoldlen);
1358	}
1359	} /* else this is a viewable space */	1104	} /* else this is a viewable space */
1360	} /* for x loop */	1105	ordered_mapwalk_end
1361	} /* for y loop */
1362		1106
1363	socket.flush_fx ();	1107	socket.flush_fx ();
1364
1365	/* Verify that we in fact do need to send this */
1366	if (socket.ext_mapinfos)
1367	{
1368	if (!(sl.length () > startlen || socket.sent_scroll))
1369	{
1370	/* No map data will follow, so don't say the client
1371	* it doesn't need draw!
1372	*/
1373	ewhatflag &= ~EMI_NOREDRAW;
1374	esl[ewhatstart + 1] = ewhatflag & 0xff;
1375	}
1376
1377	if (esl.length () > estartlen)
1378	socket.send_packet (esl);
1379	}
1380		1108
1381	if (sl.length () > startlen || socket.sent_scroll)	1109	if (sl.length () > startlen || socket.sent_scroll)
1382	{	1110	{
1383	socket.send_packet (sl);	1111	socket.send_packet (sl);
1384	socket.sent_scroll = 0;	1112	socket.sent_scroll = 0;
1385	}	1113	}
1386	}	1114	}
1387		1115
1388	/*****************************************************************************/
1389	/* GROS: The following one is used to allow a plugin to send a generic cmd to*/
1390	/* a player. Of course, the client need to know the command to be able to */
1391	/* manage it ! */
1392	/*****************************************************************************/
1393	void
1394	send_plugin_custom_message (object *pl, char *buf)
1395	{
1396	pl->contr->ns->send_packet (buf);
1397	}
1398
1399	/**
1400	* This sends the skill number to name mapping. We ignore
1401	* the params - we always send the same info no matter what.
1402	*/
1403	void
1404	send_skill_info (client *ns, char *params)
1405	{
1406	packet sl;
1407	sl << "replyinfo skill_info\n";
1408
1409	for (int i = 1; i < NUM_SKILLS; i++)
1410	sl.printf ("%d:%s\n", i + CS_STAT_SKILLINFO, &skill_names[i]);
1411
1412	if (sl.length () > MAXSOCKBUF)
1413	{
1414	LOG (llevError, "Buffer overflow in send_skill_info!\n");
1415	fatal (0);
1416	}
1417
1418	ns->send_packet (sl);
1419	}
1420
1421	/**
1422	* This sends the spell path to name mapping. We ignore
1423	* the params - we always send the same info no matter what.
1424	*/
1425	void
1426	send_spell_paths (client * ns, char *params)
1427	{
1428	packet sl;
1429
1430	sl << "replyinfo spell_paths\n";
1431
1432	for (int i = 0; i < NRSPELLPATHS; i++)
1433	sl.printf ("%d:%s\n", 1 << i, spellpathnames[i]);
1434
1435	if (sl.length () > MAXSOCKBUF)
1436	{
1437	LOG (llevError, "Buffer overflow in send_spell_paths!\n");
1438	fatal (0);
1439	}
1440
1441	ns->send_packet (sl);
1442	}
1443
1444	/**	1116	/**
1445	* This looks for any spells the player may have that have changed their stats.	1117	* This looks for any spells the player may have that have changed their stats.
1446	* it then sends an updspell packet for each spell that has changed in this way	1118	* it then sends an updspell packet for each spell that has changed in this way
1447	*/	1119	*/
1448	void	1120	void
1449	esrv_update_spells (player *pl)	1121	esrv_update_spells (player *pl)
1450	{	1122	{
1451	if (!pl->ns)	1123	if (!pl->ns)
1452	return;	1124	return;
1453		1125
		1126	pl->ns->update_spells = false;
		1127
1454	if (!pl->ns->monitor_spells)	1128	if (!pl->ns->monitor_spells)
1455	return;	1129	return;
1456		1130
1457	for (object *spell = pl->ob->inv; spell; spell = spell->below)	1131	for (object *spell = pl->ob->inv; spell; spell = spell->below)
1458	{
1459	if (spell->type == SPELL)	1132	if (spell->type == SPELL)
1460	{	1133	{
1461	int flags = 0;	1134	int flags = 0;
		1135	int val;
1462		1136
1463	/* check if we need to update it */	1137	/* check if we need to update it */
1464	if (spell->last_sp != SP_level_spellpoint_cost (pl->ob, spell, SPELL_MANA))	1138	val = SP_level_spellpoint_cost (pl->ob, spell, SPELL_MANA);
		1139	if (spell->cached_sp != val)
1465	{	1140	{
1466	spell->last_sp = SP_level_spellpoint_cost (pl->ob, spell, SPELL_MANA);	1141	spell->cached_sp = val;
1467	flags |= UPD_SP_MANA;	1142	flags |= UPD_SP_MANA;
1468	}	1143	}
1469		1144
1470	if (spell->last_grace != SP_level_spellpoint_cost (pl->ob, spell, SPELL_GRACE))	1145	val = SP_level_spellpoint_cost (pl->ob, spell, SPELL_GRACE);
		1146	if (spell->cached_grace != val)
1471	{	1147	{
1472	spell->last_grace = SP_level_spellpoint_cost (pl->ob, spell, SPELL_GRACE);	1148	spell->cached_grace = val;
1473	flags |= UPD_SP_GRACE;	1149	flags |= UPD_SP_GRACE;
1474	}	1150	}
1475		1151
1476	if (spell->last_eat != spell->stats.dam + SP_level_dam_adjust (pl->ob, spell))	1152	val = casting_level (pl->ob, spell);
		1153	if (spell->cached_eat != val)
1477	{	1154	{
1478	spell->last_eat = spell->stats.dam + SP_level_dam_adjust (pl->ob, spell);	1155	spell->cached_eat = val;
1479	flags |= UPD_SP_DAMAGE;	1156	flags |= UPD_SP_LEVEL;
1480	}	1157	}
1481		1158
1482	if (flags)	1159	if (flags)
1483	{	1160	{
1484	packet sl;	1161	packet sl;
1485		1162
1486	sl << "updspell "	1163	sl << "updspell "
1487	<< uint8 (flags)	1164	<< uint8 (flags)
1488	<< uint32 (spell->count);	1165	<< uint32 (spell->count);
1489		1166
1490	if (flags & UPD_SP_MANA ) sl << uint16 (spell->last_sp);	1167	if (flags & UPD_SP_MANA ) sl << uint16 (spell->cached_sp);
1491	if (flags & UPD_SP_GRACE ) sl << uint16 (spell->last_grace);	1168	if (flags & UPD_SP_GRACE) sl << uint16 (spell->cached_grace);
1492	if (flags & UPD_SP_DAMAGE) sl << uint16 (spell->last_eat);	1169	if (flags & UPD_SP_LEVEL) sl << uint16 (spell->cached_eat);
1493		1170
1494	pl->ns->send_packet (sl);	1171	pl->ns->send_packet (sl);
1495	}	1172	}
1496	}	1173	}
1497	}
1498	}	1174	}
1499		1175
1500	void	1176	void
1501	esrv_remove_spell (player *pl, object *spell)	1177	esrv_remove_spell (player *pl, object *spell)
1502	{	1178	{
…		…
1518		1194
1519	/* appends the spell *spell to the Socklist we will send the data to. */	1195	/* appends the spell *spell to the Socklist we will send the data to. */
1520	static void	1196	static void
1521	append_spell (player *pl, packet &sl, object *spell)	1197	append_spell (player *pl, packet &sl, object *spell)
1522	{	1198	{
1523	int i, skill = 0;	1199	int skill = 0;
1524		1200
1525	if (!(spell->name))	1201	if (!(spell->name))
1526	{	1202	{
1527	LOG (llevError, "item number %d is a spell with no name.\n", spell->count);	1203	LOG (llevError, "item number %d is a spell with no name.\n", spell->count);
1528	return;	1204	return;
1529	}	1205	}
1530		1206
1531	/* store costs and damage in the object struct, to compare to later */	1207	/* store costs and damage in the object struct, to compare to later */
1532	spell->last_sp = SP_level_spellpoint_cost (pl->ob, spell, SPELL_MANA);	1208	spell->cached_sp = SP_level_spellpoint_cost (pl->ob, spell, SPELL_MANA);
1533	spell->last_grace = SP_level_spellpoint_cost (pl->ob, spell, SPELL_GRACE);	1209	spell->cached_grace = SP_level_spellpoint_cost (pl->ob, spell, SPELL_GRACE);
1534	spell->last_eat = spell->stats.dam + SP_level_dam_adjust (pl->ob, spell);	1210	spell->cached_eat = casting_level (pl->ob, spell);
1535		1211
1536	/* figure out which skill it uses, if it uses one */	1212	/* figure out which skill it uses, if it uses one */
1537	if (spell->skill)	1213	if (spell->skill)
1538	{	1214	if (object *tmp = pl->find_skill (spell->skill))
1539	for (i = 1; i < NUM_SKILLS; i++)	1215	skill = CS_STAT_SKILLINFO + SKILL_INDEX (tmp);
1540	if (!strcmp (spell->skill, skill_names[i]))
1541	{
1542	skill = i + CS_STAT_SKILLINFO;
1543	break;
1544	}
1545	}
1546		1216
1547	// spells better have a face	1217	// spells better have a face
1548	if (!spell->face)	1218	if (!spell->face)
1549	{	1219	{
1550	LOG (llevError, "%s: spell has no face, but face is mandatory.\n", &spell->name);	1220	LOG (llevError, "%s: spell has no face, but face is mandatory.\n", &spell->name);
…		…
1555		1225
1556	/* send the current values */	1226	/* send the current values */
1557	sl << uint32 (spell->count)	1227	sl << uint32 (spell->count)
1558	<< uint16 (spell->level)	1228	<< uint16 (spell->level)
1559	<< uint16 (spell->casting_time)	1229	<< uint16 (spell->casting_time)
1560	<< uint16 (spell->last_sp)	1230	<< uint16 (spell->cached_sp)
1561	<< uint16 (spell->last_grace)	1231	<< uint16 (spell->cached_grace)
1562	<< uint16 (spell->last_eat)	1232	<< uint16 (spell->cached_eat)
1563	<< uint8 (skill)	1233	<< uint8 (skill)
1564	<< uint32 (spell->path_attuned)	1234	<< uint32 (spell->path_attuned)
1565	<< uint32 (spell->face)	1235	<< uint32 (spell->face)
1566	<< data8 (spell->name)	1236	<< data8 (spell->name);
		1237
		1238	if (pl->ns->monitor_spells < 2)
1567	<< data16 (spell->msg);	1239	sl << data16 (spell->msg);
1568	}	1240	}
1569		1241
1570	/**	1242	/**
1571	* This tells the client to add the spell *ob, if *ob is NULL, then add	1243	* This tells the client to add the spell *ob, if *ob is NULL, then add
1572	* all spells in the player's inventory.	1244	* all spells in the player's inventory.
1573	*/	1245	*/
1574	void	1246	void
1575	esrv_add_spells (player *pl, object *spell)	1247	esrv_add_spells (player *pl, object *spell)
1576	{	1248	{
…		…
1587		1259
1588	if (!spell)	1260	if (!spell)
1589	{	1261	{
1590	for (spell = pl->ob->inv; spell; spell = spell->below)	1262	for (spell = pl->ob->inv; spell; spell = spell->below)
1591	{	1263	{
1592	/* were we to simply keep appending data here, we could exceed	1264	/* were we to simply keep appending data here, we could exceed
1593	* MAXSOCKBUF if the player has enough spells to add, we know that	1265	* MAXSOCKBUF if the player has enough spells to add, we know that
1594	* append_spells will always append 19 data bytes, plus 4 length	1266	* append_spells will always append 19 data bytes, plus 4 length
1595	* bytes and 3 strings (because that is the spec) so we need to	1267	* bytes and 3 strings (because that is the spec) so we need to
1596	* check that the length of those 3 strings, plus the 23 bytes,	1268	* check that the length of those 3 strings, plus the 23 bytes,
1597	* won't take us over the length limit for the socket, if it does,	1269	* won't take us over the length limit for the socket, if it does,
1598	* we need to send what we already have, and restart packet formation	1270	* we need to send what we already have, and restart packet formation
1599	*/	1271	*/
1600	if (spell->type != SPELL)	1272	if (spell->type != SPELL)
1601	continue;	1273	continue;
1602		1274
1603	/* Seeing crashes by overflowed buffers. Quick arithemetic seems	1275	/* Seeing crashes by overflowed buffers. Quick arithemetic seems
…		…
1624	}	1296	}
1625	else	1297	else
1626	append_spell (pl, sl, spell);	1298	append_spell (pl, sl, spell);
1627		1299
1628	if (sl.length () > MAXSOCKBUF)	1300	if (sl.length () > MAXSOCKBUF)
1629	{
1630	LOG (llevError, "Buffer overflow in esrv_add_spells!\n");	1301	cleanup ("buffer overflow in esrv_add_spells!");
1631	fatal (0);
1632	}
1633		1302
1634	/* finally, we can send the packet */	1303	/* finally, we can send the packet */
1635	pl->ns->flush_fx ();	1304	pl->ns->flush_fx ();
1636	pl->ns->send_packet (sl);	1305	pl->ns->send_packet (sl);
1637	}	1306	}
1638		1307
		1308	//-GPL
		1309

Diff Legend

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