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.78 by root, Thu Mar 15 14:59:43 2007 UTC vs.
Revision 1.150 by root, Mon Oct 12 14:00:59 2009 UTC

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

Diff Legend

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