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

Comparing deliantra/server/server/player.C (file contents):
Revision 1.70 by root, Tue Dec 26 20:04:09 2006 UTC vs.
Revision 1.106 by pippijn, Fri Mar 2 10:15:40 2007 UTC

…		…
1	/*	1	/*
2	CrossFire, A Multiplayer game for X-windows	2	* CrossFire, A Multiplayer game
3		3	*
		4	* Copyright (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team
4	Copyright (C) 2002 Mark Wedel & Crossfire Development Team	5	* Copyright (C) 2002 Mark Wedel & Crossfire Development Team
5	Copyright (C) 1992 Frank Tore Johansen	6	* Copyright (C) 1992 Frank Tore Johansen
6		7	*
7	This program is free software; you can redistribute it and/or modify	8	* This program is free software; you can redistribute it and/or modify
8	it under the terms of the GNU General Public License as published by	9	* it under the terms of the GNU General Public License as published by
9	the Free Software Foundation; either version 2 of the License, or	10	* the Free Software Foundation; either version 2 of the License, or
10	(at your option) any later version.	11	* (at your option) any later version.
11		12	*
12	This program is distributed in the hope that it will be useful,	13	* This program is distributed in the hope that it will be useful,
13	but WITHOUT ANY WARRANTY; without even the implied warranty of	14	* but WITHOUT ANY WARRANTY; without even the implied warranty of
14	MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the	15	* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15	GNU General Public License for more details.	16	* GNU General Public License for more details.
16		17	*
17	You should have received a copy of the GNU General Public License	18	* You should have received a copy of the GNU General Public License
18	along with this program; if not, write to the Free Software	19	* along with this program; if not, write to the Free Software
19	Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.	20	* Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
20		21	*
21	The author can be reached via e-mail to <crossfire@schmorp.de>	22	* The author can be reached via e-mail to <crossfire@schmorp.de>
22	*/	23	*/
23		24
24	#include <global.h>	25	#include <global.h>
25	#include <pwd.h>	26	#include <pwd.h>
26	#include <sproto.h>	27	#include <sproto.h>
27	#include <sounds.h>	28	#include <sounds.h>
31	#include <skills.h>	32	#include <skills.h>
32		33
33	#include <algorithm>	34	#include <algorithm>
34	#include <functional>	35	#include <functional>
35		36
36	player *	37	playervec players;
37	find_player (const char *plname)
38	{
39	for_all_players (pl)
40	if (pl->ob && !strcmp (query_name (pl->ob), plname))
41	return pl;
42
43	return 0;
44	}
45		38
46	void	39	void
47	display_motd (const object *op)	40	display_motd (const object *op)
48	{	41	{
49	char buf[MAX_BUF];	42	char buf[MAX_BUF];
…		…
123		116
124	news[0] = '\0';	117	news[0] = '\0';
125	subject[0] = '\0';	118	subject[0] = '\0';
126	size = 0;	119	size = 0;
127		120
128	while (fgets (buf, MAX_BUF, fp) != NULL)	121	while (fgets (buf, MAX_BUF, fp))
129	{	122	{
130	if (*buf == '#')	123	if (*buf == '#')
131	continue;	124	continue;
132		125
133	if (*buf == '%')	126	if (*buf == '%')
134	{ /* send one news */	127	{ /* send one news */
135	if (size > 0)	128	if (size > 0)
136	draw_ext_info_format (NDI_UNIQUE \| NDI_GREEN, 0, op, MSG_TYPE_ADMIN, MSG_TYPE_ADMIN_NEWS, "INFORMATION: %s\n%s", "%s\n%s", subject, news); /send previously read news /	129	draw_ext_info_format (NDI_UNIQUE \| NDI_GREEN, 0, op, MSG_TYPE_ADMIN, MSG_TYPE_ADMIN_NEWS, "INFORMATION: %s\n%s", "%s\n%s", subject, news); /send previously read news /
		130
137	strcpy (subject, buf + 1);	131	strcpy (subject, buf + 1);
138	strip_endline (subject);	132	strip_endline (subject);
139	size = 0;	133	size = 0;
140	news[0] = '\0';	134	news[0] = '\0';
141	}	135	}
…		…
158		152
159	/* This loads the first map an puts the player on it. */	153	/* This loads the first map an puts the player on it. */
160	static void	154	static void
161	set_first_map (object *op)	155	set_first_map (object *op)
162	{	156	{
163	strcpy (op->contr->maplevel, first_map_path);	157	op->contr->maplevel = first_map_path;
164	op->x = -1;	158	op->x = -1;
165	op->y = -1;	159	op->y = -1;
		160	}
		161
		162	void
		163	player::enter_map ()
		164	{
		165	object *tmp = object::create ();
		166
		167	EXIT_PATH (tmp) = maplevel;
		168	EXIT_X (tmp) = ob->x;
		169	EXIT_Y (tmp) = ob->y;
166	enter_exit (op, 0);	170	ob->enter_exit (tmp);
		171
		172	tmp->destroy ();
		173	}
		174
		175	void
		176	player::activate ()
		177	{
		178	if (active)
		179	return;
		180
		181	players.insert (this);
		182	ob->remove ();
		183	ob->map = 0;
		184	ob->activate_recursive ();
		185	CLEAR_FLAG (ob, FLAG_FRIENDLY);
		186	add_friendly_object (ob);
		187	enter_map ();
		188	}
		189
		190	void
		191	player::deactivate ()
		192	{
		193	if (!active)
		194	return;
		195
		196	terminate_all_pets (ob);
		197	remove_friendly_object (ob);
		198	ob->deactivate_recursive ();
		199	maplevel = ob->map->path;
		200	ob->remove ();
		201	ob->map = 0;
		202	party = 0;
		203
		204	// for weird reasons, this is often "ob", keeping a circular reference
		205	ranges [range_skill] = 0;
		206
		207	players.erase (this);
167	}	208	}
168		209
169	// connect the player with a specific client	210	// connect the player with a specific client
170	// also changed, rationalises, and fixes some incorrect settings	211	// also changed, rationalises, and fixes some incorrect settings
171	void	212	void
172	player::connect (client *ns)	213	player::connect (client *ns)
173	{	214	{
174	this->ns = ns;	215	this->ns = ns;
175	ns->pl = this;	216	ns->pl = this;
176		217
177	next = first_player;	218	run_on = 0;
178	first_player = this;	219	fire_on = 0;
		220	ob->close_container (); //TODO: client-specific
179		221
180	ns->update_look = 0;	222	ns->update_look = 0;
181	ns->look_position = 0;	223	ns->look_position = 0;
182		224
183	clear_los (ob);	225	clear_los (ob);
		226
		227	ns->reset_stats ();
184		228
185	/* make sure he's a player -- needed because of class change. */	229	/* make sure he's a player -- needed because of class change. */
186	ob->type = PLAYER; // we are paranoid	230	ob->type = PLAYER; // we are paranoid
187	ob->race = ob->arch->clone.race;	231	ob->race = ob->arch->clone.race;
188		232
…		…
191		235
192	ob->carrying = sum_weight (ob);	236	ob->carrying = sum_weight (ob);
193	link_player_skills (ob);	237	link_player_skills (ob);
194		238
195	CLEAR_FLAG (ob, FLAG_NO_FIX_PLAYER);	239	CLEAR_FLAG (ob, FLAG_NO_FIX_PLAYER);
196	ob->set_speed (ob->speed);
197		240
198	assign (title, ob->arch->clone.name);	241	assign (title, ob->arch->clone.name);
199
200	/* can_use_shield is a new flag. However, the can_use.. seems to largely come
201	* from the class, and not race. I don't see any way to get the class information
202	* to then update this. I don't think this will actually break anything - anyone
203	* that can use armour should be able to use a shield. What this may 'break'
204	* are features new characters get, eg, if someone starts up with a Q, they
205	* should be able to use a shield. However, old Q's won't get that advantage.
206	*/
207	if (QUERY_FLAG (ob, FLAG_USE_ARMOUR))
208	SET_FLAG (ob, FLAG_USE_SHIELD);
209		242
210	/* if it's a dragon player, set the correct title here */	243	/* if it's a dragon player, set the correct title here */
211	if (is_dragon_pl (ob))	244	if (is_dragon_pl (ob))
212	{	245	{
213	object tmp, abil = 0, *skin = 0;	246	object tmp, abil = 0, *skin = 0;
…		…
223	skin = tmp;	256	skin = tmp;
224		257
225	set_dragon_name (ob, abil, skin);	258	set_dragon_name (ob, abil, skin);
226	}	259	}
227		260
228	CLEAR_FLAG (ob, FLAG_FRIENDLY);
229	add_friendly_object (ob);
230
231	LOG (llevInfo, "LOGIN: Player named %s from ip %s\n", &ob->name, ns->host);
232
233	new_draw_info (NDI_UNIQUE, 0, ob, "Welcome Back!");	261	new_draw_info (NDI_UNIQUE, 0, ob, "Welcome Back!");
234	new_draw_info_format (NDI_UNIQUE \| NDI_ALL \| NDI_DK_ORANGE, 5, NULL, "%s has entered the game.", &ob->name);
235		262
236	esrv_new_player (this, ob->weight + ob->carrying);	263	esrv_new_player (this, ob->weight + ob->carrying);
237		264
238	ob->update_stats ();	265	ob->update_stats ();
239	ns->floorbox_update ();	266	ns->floorbox_update ();
240		267
241	esrv_send_inventory (ob, ob);	268	esrv_send_inventory (ob, ob);
242	esrv_add_spells (this, 0);	269	esrv_add_spells (this, 0);
243		270
244	enter_exit (ob, 0);	271	activate ();
245		272
246	send_rules (ob);	273	send_rules (ob);
247	send_news (ob);	274	send_news (ob);
248	display_motd (ob);	275	display_motd (ob);
		276
		277	INVOKE_PLAYER (CONNECT, this);
249	INVOKE_PLAYER (LOGIN, this);	278	INVOKE_PLAYER (LOGIN, this);
250	}	279	}
251		280
252	void	281	void
253	player::disconnect ()	282	player::disconnect ()
254	{	283	{
255	//TODO: don't be so harsh and destroy :)
256	if (ns)	284	if (ns)
257	destroy ();	285	{
		286	if (active)
		287	INVOKE_PLAYER (LOGOUT, this, ARG_INT (0));
		288
		289	INVOKE_PLAYER (DISCONNECT, this);
		290
		291	ns->reset_stats ();
		292	ns->pl = 0;
		293	this->ns = 0;
		294	}
		295
		296	if (ob)
		297	ob->close_container (); //TODO: client-specific
		298
		299	deactivate ();
258	}	300	}
259		301
260	// the need for this function can be explained	302	// the need for this function can be explained
261	// by load_object not returning the object	303	// by load_object not returning the object
262	void	304	void
263	player::set_object (object *op)	305	player::set_object (object *op)
264	{	306	{
265	ob = op;	307	ob = op;
266	ob->contr = this; /* this aren't yet in archetype */	308	ob->contr = this; /* this aren't yet in archetype */
267		309
268	ob->speed_left = 0.5;	310	ob->speed_left = 0.5;
269	ob->speed = 1.0;	311	ob->speed = 1.0;
270	ob->direction = 5; /* So player faces south */	312	ob->direction = 5; /* So player faces south */
271	ob->stats.wc = 2;
272	ob->run_away = 25; /* Then we panick... */
273
274	set_first_map (ob);
275
276	ob->roll_stats ();
277	}	313	}
278		314
279	player::player ()	315	player::player ()
280	{	316	{
281	/* There are some elements we want initialized to non zero value -	317	/* There are some elements we want initialised to non zero value -
282	* we deal with that below this point.	318	* we deal with that below this point.
283	*/	319	*/
284	outputs_sync = 16; /* Every 2 seconds */	320	outputs_sync = 16; /* Every 2 seconds */
285	outputs_count = 8; /* Keeps present behaviour */	321	outputs_count = 8; /* Keeps present behaviour */
286	unapply = unapply_nochoice;	322	unapply = unapply_nochoice;
287		323
288	assign (savebed_map, first_map_path); /* Init. respawn position */	324	savebed_map = first_map_path; /* Init. respawn position */
289		325
290	gen_sp_armour = 10;	326	gen_sp_armour = 10;
291	last_speed = -1;
292	shoottype = range_none;	327	shoottype = range_none;
293	bowtype = bow_normal;	328	bowtype = bow_normal;
294	petmode = pet_normal;	329	petmode = pet_normal;
295	listening = 10;	330	listening = 10;
296	usekeys = containers;	331	usekeys = containers;
297	last_weapon_sp = -1;
298	peaceful = 1; /* default peaceful */	332	peaceful = 1; /* default peaceful */
299	do_los = 1;	333	do_los = 1;
300
301	/* we need to clear these to -1 and not zero - otherwise,
302	* if a player quits and starts a new character, we wont
303	* send new values to the client, as things like exp start
304	* at zero.
305	*/
306	for (int i = 0; i < NUM_SKILLS; i++)
307	last_skill_exp[i] = -1;
308
309	for (int i = 0; i < NROFATTACKS; i++)
310	last_resist[i] = -1;
311
312	last_stats.exp = -1;
313	last_weight = (uint32) - 1;
314	}	334	}
315		335
316	void	336	void
317	player::do_destroy ()	337	player::do_destroy ()
318	{	338	{
		339	disconnect ();
		340
319	attachable::do_destroy ();	341	attachable::do_destroy ();
320
321	save (false);
322	enable_save = false;
323
324	disconnect ();
325
326	terminate_all_pets (ob);
327
328	if (first_player != this)
329	{
330	player *prev = first_player;
331
332	while (prev && prev->next && prev->next != this)
333	prev = prev->next;
334
335	if (prev->next != this)
336	{
337	LOG (llevError, "Free_player: Can't find previous player.\n");
338	abort ();
339	}
340
341	prev->next = next;
342	}
343	else
344	first_player = next;
345		342
346	if (ob)	343	if (ob)
347	{	344	{
348	ob->destroy_inv (false);	345	ob->destroy_inv (false);
349	ob->destroy ();	346	ob->destroy ();
350	}
351
352	if (ns)
353	{
354	client *ns = this->ns;
355	ns->send_packet ("goodbye");
356	ns->flush ();
357	ns->pl = 0;
358	this->ns = 0;
359	ns->destroy ();
360	}	347	}
361	}	348	}
362		349
363	player::~player ()	350	player::~player ()
364	{	351	{
…		…
374	player::create ()	361	player::create ()
375	{	362	{
376	player *pl = new player;	363	player *pl = new player;
377		364
378	pl->set_object (arch_to_object (get_player_archetype (0)));	365	pl->set_object (arch_to_object (get_player_archetype (0)));
		366
		367	pl->ob->roll_stats ();
		368	pl->ob->stats.wc = 2;
		369	pl->ob->run_away = 25; /* Then we panick... */
		370
		371	set_first_map (pl->ob);
379		372
380	return pl;	373	return pl;
381	}	374	}
382		375
383	/*	376	/*
…		…
414	object *op = NULL;	407	object *op = NULL;
415	objectlink *ol;	408	objectlink *ol;
416	unsigned lastdist;	409	unsigned lastdist;
417	rv_vector rv;	410	rv_vector rv;
418		411
419	for (ol = first_friendly_object, lastdist = 1000; ol != NULL; ol = ol->next)	412	for (ol = first_friendly_object, lastdist = 1000; ol; ol = ol->next)
420	{	413	{
421	/* We should not find free objects on this friendly list, but it	414	/* We should not find free objects on this friendly list, but it
422	* does periodically happen. Given that, lets deal with it.	415	* does periodically happen. Given that, lets deal with it.
423	* While unlikely, it is possible the next object on the friendly	416	* While unlikely, it is possible the next object on the friendly
424	* list is also free, so encapsulate this in a while loop.	417	* list is also free, so encapsulate this in a while loop.
…		…
428	object *tmp = ol->ob;	421	object *tmp = ol->ob;
429		422
430	/* Can't do much more other than log the fact, because the object	423	/* Can't do much more other than log the fact, because the object
431	* itself will have been cleared.	424	* itself will have been cleared.
432	*/	425	*/
433	LOG (llevDebug, "get_nearest_player: Found free/non friendly object on friendly list\n");	426	LOG (llevDebug, "get_nearest_player: Found free/non friendly object '%s' on friendly list\n",
		427	tmp->debug_desc ());
434	ol = ol->next;	428	ol = ol->next;
435	remove_friendly_object (tmp);	429	remove_friendly_object (tmp);
436	if (!ol)	430	if (!ol)
437	return op;	431	return op;
438	}	432	}
…		…
527	x = mon->x;	521	x = mon->x;
528	y = mon->y;	522	y = mon->y;
529	m = mon->map;	523	m = mon->map;
530	dir = rv.direction;	524	dir = rv.direction;
531	lastdir = firstdir = rv.direction; /* perhaps we stand next to pl, init firstdir too */	525	lastdir = firstdir = rv.direction; /* perhaps we stand next to pl, init firstdir too */
532	diff = FABS (rv.distance_x) > FABS (rv.distance_y) ? FABS (rv.distance_x) : FABS (rv.distance_y);	526	diff = ::max (abs (rv.distance_x), abs (rv.distance_y));
		527
533	/* If we can't solve it within the search distance, return now. */	528	/* If we can't solve it within the search distance, return now. */
534	if (diff > max)	529	if (diff > max)
535	return 0;	530	return 0;
		531
536	while (diff > 1 && max > 0)	532	while (diff > 1 && max > 0)
537	{	533	{
538	lastx = x;	534	lastx = x;
539	lasty = y;	535	lasty = y;
540	lastmap = m;	536	lastmap = m;
…		…
622	max--;	618	max--;
623	lastdir = dir;	619	lastdir = dir;
624	if (!firstdir)	620	if (!firstdir)
625	firstdir = dir;	621	firstdir = dir;
626	}	622	}
		623
627	if (diff <= 1)	624	if (diff <= 1)
628	{	625	{
629	/* Recalculate diff (distance) because we may not have actually	626	/* Recalculate diff (distance) because we may not have actually
630	* headed toward player for entire distance.	627	* headed toward player for entire distance.
631	*/	628	*/
632	get_rangevector_from_mapcoord (m, x, y, pl, &rv, 0);	629	get_rangevector_from_mapcoord (m, x, y, pl, &rv, 0);
633	diff = FABS (rv.distance_x) > FABS (rv.distance_y) ? FABS (rv.distance_x) : FABS (rv.distance_y);	630	diff = ::max (abs (rv.distance_x), abs (rv.distance_y));
634	}	631	}
		632
635	if (diff > max)	633	if (diff > max)
636	return 0;	634	return 0;
637	}	635	}
		636
638	/* If we reached the max, didn't find a direction in time */	637	/* If we reached the max, didn't find a direction in time */
639	if (!max)	638	if (!max)
640	return 0;	639	return 0;
641		640
642	return firstdir;	641	return firstdir;
…		…
756	roll_stat (void)	755	roll_stat (void)
757	{	756	{
758	int a[4], i, j, k;	757	int a[4], i, j, k;
759		758
760	for (i = 0; i < 4; i++)	759	for (i = 0; i < 4; i++)
761	a[i] = (int) RANDOM () % 6 + 1;	760	a[i] = (int) rndm (6) + 1;
762		761
763	for (i = 0, j = 0, k = 7; i < 4; i++)	762	for (i = 0, j = 0, k = 7; i < 4; i++)
764	if (a[i] < k)	763	if (a[i] < k)
765	k = a[i], j = i;	764	k = a[i], j = i;
766		765
…		…
847	contr->levsp[1] = 6;	846	contr->levsp[1] = 6;
848	contr->levgrace[1] = 3;	847	contr->levgrace[1] = 3;
849		848
850	contr->orig_stats = stats;	849	contr->orig_stats = stats;
851	}	850	}
		851	}
		852
		853	static void
		854	start_info (object *op)
		855	{
		856	char buf[MAX_BUF];
		857
		858	sprintf (buf, "Welcome to Crossfire v%s!", VERSION);
		859	new_draw_info (NDI_UNIQUE, 0, op, buf);
		860	//new_draw_info (NDI_UNIQUE, 0, op, "Press `?' for help");
		861	//new_draw_info (NDI_UNIQUE, 0, op, " ");
852	}	862	}
853		863
854	/* This function takes the key that is passed, and does the	864	/* This function takes the key that is passed, and does the
855	* appropriate action with it (change race, or other things).	865	* appropriate action with it (change race, or other things).
856	* The function name is for historical reasons - now we have	866	* The function name is for historical reasons - now we have
…		…
885	* to save here.	895	* to save here.
886	*/	896	*/
887	sprintf (buf, "%s/%s/%s", settings.localdir, settings.playerdir, &op->name);	897	sprintf (buf, "%s/%s/%s", settings.localdir, settings.playerdir, &op->name);
888	make_path_to_file (buf);	898	make_path_to_file (buf);
889		899
890	#ifdef AUTOSAVE
891	op->contr->last_save_tick = pticks;
892	#endif
893	start_info (op);	900	start_info (op);
894	CLEAR_FLAG (op, FLAG_WIZ);	901	CLEAR_FLAG (op, FLAG_WIZ);
895	give_initial_items (op, op->randomitems);	902	give_initial_items (op, op->randomitems);
896	link_player_skills (op);	903	link_player_skills (op);
897	esrv_send_inventory (op, op);	904	esrv_send_inventory (op, op);
…		…
903	if (*first_map_ext_path)	910	if (*first_map_ext_path)
904	{	911	{
905	object *tmp;	912	object *tmp;
906	char mapname[MAX_BUF];	913	char mapname[MAX_BUF];
907		914
908	snprintf (mapname, MAX_BUF - 1, "%s/%s", first_map_ext_path, &op->arch->name);	915	snprintf (mapname, MAX_BUF - 1, "%s/%s", &first_map_ext_path, &op->arch->name);
909	tmp = object::create ();	916	tmp = object::create ();
910	EXIT_PATH (tmp) = mapname;	917	EXIT_PATH (tmp) = mapname;
911	EXIT_X (tmp) = op->x;	918	EXIT_X (tmp) = op->x;
912	EXIT_Y (tmp) = op->y;	919	EXIT_Y (tmp) = op->y;
913	enter_exit (op, tmp); /* we don't really care if it succeeded;	920	op->enter_exit (tmp); /* we don't really care if it succeeded;
914	* if the map isn't there, then stay on the	921	* if the map isn't there, then stay on the
915	* default initial map */	922	* default initial map */
916	tmp->destroy ();	923	tmp->destroy ();
917	}	924	}
918	else	925	else
…		…
959		966
960	send_query (op->contr->ns, CS_QUERY_SINGLECHAR, "Press any key for the next race.\nPress `d' to play this race.\n");	967	send_query (op->contr->ns, CS_QUERY_SINGLECHAR, "Press any key for the next race.\nPress `d' to play this race.\n");
961	return 0;	968	return 0;
962	}	969	}
963		970
964	int
965	key_confirm_quit (object *op, char key)
966	{
967	if (key != 'y' && key != 'Y' && key != 'q' && key != 'Q')
968	{
969	op->contr->ns->state = ST_PLAYING;
970	new_draw_info (NDI_UNIQUE, 0, op, "OK, continuing to play.");
971	return 1;
972	}
973
974	INVOKE_PLAYER (LOGOUT, op->contr);
975	INVOKE_PLAYER (QUIT, op->contr);
976
977	op->contr->enable_save = false;
978
979	terminate_all_pets (op);
980	leave_map (op);
981	op->direction = 0;
982	new_draw_info_format (NDI_UNIQUE \| NDI_ALL, 5, NULL, "%s quits the game.", &op->name);
983
984	strcpy (op->contr->killer, "quit");
985	check_score (op);
986	op->contr->party = 0;
987	op->contr->own_title[0] = '\0';
988
989	object_ptr ob = op;
990
991	/* We need to hunt for any per player unique maps in memory and
992	* get rid of them. The trailing slash in the path is intentional,
993	* so that players named 'Ab' won't match against players 'Abe' pathname
994	*/
995	char buf[MAX_BUF];
996	sprintf (buf, "%s/%s/%s/", settings.localdir, settings.playerdir, &op->name);
997
998	for (maptile next, mp = first_map; mp; mp = next)
999	{
1000	next = mp->next;
1001
1002	if (!strncmp (mp->path, buf, strlen (buf)))
1003	delete_map (mp);
1004	}
1005
1006	delete_character (ob->name, 1);
1007	ob->contr->destroy ();
1008
1009	return 1;
1010	}
1011
1012	void	971	void
1013	flee_player (object *op)	972	flee_player (object *op)
1014	{	973	{
1015	int dir, diff;	974	int dir, diff;
1016	rv_vector rv;	975	rv_vector rv;
…		…
1071	int	1030	int
1072	check_pick (object *op)	1031	check_pick (object *op)
1073	{	1032	{
1074	object tmp, next;	1033	object tmp, next;
1075	int stop = 0;	1034	int stop = 0;
1076	int j, k, wvratio;	1035	int wvratio;
1077	char putstring[128], tmpstr[16];	1036	char putstring[128];
1078		1037
1079	/* if you're flying, you cna't pick up anything */	1038	/* if you're flying, you cna't pick up anything */
1080	if (op->move_type & MOVE_FLYING)	1039	if (op->move_type & MOVE_FLYING)
1081	return 1;	1040	return 1;
1082		1041
…		…
1419	* found object is returned.	1378	* found object is returned.
1420	*/	1379	*/
1421	object *	1380	object *
1422	find_arrow (object op, const char type)	1381	find_arrow (object op, const char type)
1423	{	1382	{
1424	object *tmp = NULL;	1383	object *tmp = 0;
1425		1384
1426	for (op = op->inv; op; op = op->below)	1385	for (op = op->inv; op; op = op->below)
1427	if (!tmp && op->type == CONTAINER && op->race == type && QUERY_FLAG (op, FLAG_APPLIED))	1386	if (!tmp && op->type == CONTAINER && op->race == type && QUERY_FLAG (op, FLAG_APPLIED))
1428	tmp = find_arrow (op, type);	1387	tmp = find_arrow (op, type);
1429	else if (op->type == ARROW && op->race == type)	1388	else if (op->type == ARROW && op->race == type)
1430	return op;	1389	return op;
		1390
1431	return tmp;	1391	return tmp;
1432	}	1392	}
1433		1393
1434	/*	1394	/*
1435	* Similar to find_arrow, but looks for (roughly) the best arrow to use	1395	* Similar to find_arrow, but looks for (roughly) the best arrow to use
1436	* against the target. A full test is not performed, simply a basic test	1396	* against the target. A full test is not performed, simply a basic test
1437	* of resistances. The archer is making a quick guess at what he sees down	1397	* of resistances. The archer is making a quick guess at what he sees down
1438	* the hall. Failing that it does it's best to pick the highest plus arrow.	1398	* the hall. Failing that it does it's best to pick the highest plus arrow.
1439	*/	1399	*/
1440
1441	object *	1400	object *
1442	find_better_arrow (object op, object target, const char type, int better)	1401	find_better_arrow (object op, object target, const char type, int better)
1443	{	1402	{
1444	object tmp = NULL, arrow, *ntmp;	1403	object tmp = NULL, arrow, *ntmp;
1445	int attacknum, attacktype, betterby = 0, i;	1404	int attacknum, attacktype, betterby = 0, i;
…		…
1756	}	1715	}
1757	else if (op->contr->bowtype >= bow_n && op->contr->bowtype <= bow_nw)	1716	else if (op->contr->bowtype >= bow_n && op->contr->bowtype <= bow_nw)
1758	{	1717	{
1759	if (!similar_direction (dir, op->contr->bowtype - bow_n + 1))	1718	if (!similar_direction (dir, op->contr->bowtype - bow_n + 1))
1760	wcmod = -1;	1719	wcmod = -1;
		1720
1761	ret = fire_bow (op, op, NULL, op->contr->bowtype - bow_n + 1, wcmod, op->x, op->y);	1721	ret = fire_bow (op, op, NULL, op->contr->bowtype - bow_n + 1, wcmod, op->x, op->y);
1762	}	1722	}
1763	else if (op->contr->bowtype == bow_threewide)	1723	else if (op->contr->bowtype == bow_threewide)
1764	{	1724	{
1765	ret = fire_bow (op, op, NULL, dir, 0, op->x, op->y);	1725	ret = fire_bow (op, op, NULL, dir, 0, op->x, op->y);
…		…
1892	{	1852	{
1893	if (op->type == PLAYER)	1853	if (op->type == PLAYER)
1894	new_draw_info (NDI_UNIQUE, 0, op, "You have no applicable skill to use.");	1854	new_draw_info (NDI_UNIQUE, 0, op, "You have no applicable skill to use.");
1895	return;	1855	return;
1896	}	1856	}
		1857
1897	(void) do_skill (op, op, op->chosen_skill, dir, NULL);	1858	do_skill (op, op, op->chosen_skill, dir, NULL);
1898	return;	1859	return;
1899	case range_builder:	1860	case range_builder:
1900	apply_map_builder (op, dir);	1861	apply_map_builder (op, dir);
1901	return;	1862	return;
1902	default:	1863	default:
1903	new_draw_info (NDI_UNIQUE, 0, op, "Illegal shoot type.");	1864	new_draw_info (NDI_UNIQUE, 0, op, "Illegal shoot type.");
1904	return;	1865	return;
1905	}	1866	}
1906	}	1867	}
1907
1908
1909		1868
1910	/* find_key	1869	/* find_key
1911	* We try to find a key for the door as passed. If we find a key	1870	* We try to find a key for the door as passed. If we find a key
1912	* and successfully use it, we return the key, otherwise NULL	1871	* and successfully use it, we return the key, otherwise NULL
1913	* This function merges both normal and locked door, since the logic	1872	* This function merges both normal and locked door, since the logic
…		…
1915	* pl is the player,	1874	* pl is the player,
1916	* inv is the objects inventory to searched	1875	* inv is the objects inventory to searched
1917	* door is the door we are trying to match against.	1876	* door is the door we are trying to match against.
1918	* This function can be called recursively to search containers.	1877	* This function can be called recursively to search containers.
1919	*/	1878	*/
1920
1921	object *	1879	object *
1922	find_key (object pl, object container, object *door)	1880	find_key (object pl, object container, object *door)
1923	{	1881	{
1924	object tmp, key;	1882	object tmp, key;
1925		1883
1926	/* Should not happen, but sanity checking is never bad */	1884	/* Should not happen, but sanity checking is never bad */
1927	if (container->inv == NULL)	1885	if (!container->inv)
1928	return NULL;	1886	return 0;
1929		1887
1930	/* First, lets try to find a key in the top level inventory */	1888	/* First, lets try to find a key in the top level inventory */
1931	for (tmp = container->inv; tmp != NULL; tmp = tmp->below)	1889	for (tmp = container->inv; tmp; tmp = tmp->below)
1932	{	1890	{
1933	if (door->type == DOOR && tmp->type == KEY)	1891	if (door->type == DOOR && tmp->type == KEY)
1934	break;	1892	break;
1935	/* For sanity, we should really check door type, but other stuff	1893	/* For sanity, we should really check door type, but other stuff
1936	* (like containers) can be locked with special keys	1894	* (like containers) can be locked with special keys
1937	*/	1895	*/
1938	if (tmp->slaying && tmp->type == SPECIAL_KEY && tmp->slaying == door->slaying)	1896	if (tmp->slaying && tmp->type == SPECIAL_KEY && tmp->slaying == door->slaying)
1939	break;	1897	break;
1940	}	1898	}
		1899
1941	/* No key found - lets search inventories now */	1900	/* No key found - lets search inventories now */
1942	/* If we find and use a key in an inventory, return at that time.	1901	/* If we find and use a key in an inventory, return at that time.
1943	* otherwise, if we search all the inventories and still don't find	1902	* otherwise, if we search all the inventories and still don't find
1944	* a key, return	1903	* a key, return
1945	*/	1904	*/
1946	if (!tmp)	1905	if (!tmp)
1947	{	1906	{
1948	for (tmp = container->inv; tmp != NULL; tmp = tmp->below)	1907	for (tmp = container->inv; tmp; tmp = tmp->below)
1949	{	1908	{
1950	/* No reason to search empty containers */	1909	/* No reason to search empty containers */
1951	if (tmp->type == CONTAINER && tmp->inv)	1910	if (tmp->type == CONTAINER && tmp->inv)
1952	{	1911	{
1953	if ((key = find_key (pl, tmp, door)) != NULL)	1912	if ((key = find_key (pl, tmp, door)))
1954	return key;	1913	return key;
1955	}	1914	}
1956	}	1915	}
		1916
1957	if (!tmp)	1917	if (!tmp)
1958	return NULL;	1918	return NULL;
1959	}	1919	}
		1920
1960	/* We get down here if we have found a key. Now if its in a container,	1921	/* We get down here if we have found a key. Now if its in a container,
1961	* see if we actually want to use it	1922	* see if we actually want to use it
1962	*/	1923	*/
1963	if (pl != container)	1924	if (pl != container)
1964	{	1925	{
…		…
1985	new_draw_info_format (NDI_UNIQUE \| NDI_BROWN, 0, pl,	1946	new_draw_info_format (NDI_UNIQUE \| NDI_BROWN, 0, pl,
1986	"The %s in your %s vibrates as you approach the door", query_name (tmp), query_name (container));	1947	"The %s in your %s vibrates as you approach the door", query_name (tmp), query_name (container));
1987	return NULL;	1948	return NULL;
1988	}	1949	}
1989	}	1950	}
		1951
1990	return tmp;	1952	return tmp;
1991	}	1953	}
1992		1954
1993	/* moved door processing out of move_player_attack.	1955	/* moved door processing out of move_player_attack.
1994	* returns 1 if player has opened the door with a key	1956	* returns 1 if player has opened the door with a key
…		…
2012	play_sound_map (op->map, op->x, op->y, SOUND_OPEN_DOOR);	1974	play_sound_map (op->map, op->x, op->y, SOUND_OPEN_DOOR);
2013	if (action_makes_visible (op))	1975	if (action_makes_visible (op))
2014	make_visible (op);	1976	make_visible (op);
2015	if (door->inv && (door->inv->type == RUNE \|\| door->inv->type == TRAP))	1977	if (door->inv && (door->inv->type == RUNE \|\| door->inv->type == TRAP))
2016	spring_trap (door->inv, op);	1978	spring_trap (door->inv, op);
		1979
2017	if (door->type == DOOR)	1980	if (door->type == DOOR)
2018	{
2019	hit_player (door, 9998, op, AT_PHYSICAL, 1); /* Break through the door */	1981	hit_player (door, 9998, op, AT_PHYSICAL, 1); /* Break through the door */
2020	}
2021	else if (door->type == LOCKED_DOOR)	1982	else if (door->type == LOCKED_DOOR)
2022	{	1983	{
2023	new_draw_info_format (NDI_UNIQUE, NDI_BROWN, op, "You open the door with the %s", query_short_name (key));	1984	new_draw_info_format (NDI_UNIQUE, NDI_BROWN, op, "You open the door with the %s", query_short_name (key));
2024	remove_door2 (door); /* remove door without violence ;-) */	1985	remove_door2 (door); /* remove door without violence ;-) */
2025	}	1986	}
		1987
2026	/* Do this after we print the message */	1988	/* Do this after we print the message */
2027	decrease_ob (key); /* Use up one of the keys */	1989	decrease_ob (key); /* Use up one of the keys */
2028	/* Need to update the weight the container the key was in */	1990	/* Need to update the weight the container the key was in */
2029	if (container != op)	1991	if (container != op)
2030	esrv_update_item (UPD_WEIGHT, op, container);	1992	esrv_update_item (UPD_WEIGHT, op, container);
		1993
2031	return 1; /* Nothing more to do below */	1994	return 1; /* Nothing more to do below */
2032	}	1995	}
2033	else if (door->type == LOCKED_DOOR)	1996	else if (door->type == LOCKED_DOOR)
2034	{	1997	{
2035	/* Might as well return now - no other way to open this */	1998	/* Might as well return now - no other way to open this */
2036	new_draw_info (NDI_UNIQUE \| NDI_NAVY, 0, op, door->msg);	1999	new_draw_info (NDI_UNIQUE \| NDI_NAVY, 0, op, door->msg);
2037	return 1;	2000	return 1;
2038	}	2001	}
		2002
2039	return 0;	2003	return 0;
2040	}	2004	}
2041		2005
2042	/* This function is just part of a breakup from move_player.	2006	/* This function is just part of a breakup from move_player.
2043	* It should keep the code cleaner.	2007	* It should keep the code cleaner.
…		…
2069	*/	2033	*/
2070	if ((op->contr->braced \|\| !move_ob (op, dir, op)) && !out_of_map (op->map, nx, ny))	2034	if ((op->contr->braced \|\| !move_ob (op, dir, op)) && !out_of_map (op->map, nx, ny))
2071	{	2035	{
2072	if (OUT_OF_REAL_MAP (op->map, nx, ny))	2036	if (OUT_OF_REAL_MAP (op->map, nx, ny))
2073	{	2037	{
2074	m = get_map_from_coord (op->map, &nx, &ny);	2038	m = op->map->xy_find (nx, ny);
2075	if (!m)	2039	if (!m)
2076	return; /* Don't think this should happen */	2040	return; /* Don't think this should happen */
2077	}	2041	}
2078	else	2042	else
2079	m = op->map;	2043	m = op->map;
2080		2044
2081	if ((tmp = GET_MAP_OB (m, nx, ny)) == NULL)	2045	if (!(tmp = m->at (nx, ny).bot))
2082	{
2083	/* LOG(llevError,"player_move_attack: GET_MAP_OB returns NULL, but player can not move there.\n"); */
2084	return;	2046	return;
2085	}
2086		2047
2087	mon = 0;	2048	mon = 0;
2088	/* Go through all the objects, and find ones of interest. Only stop if	2049	/* Go through all the objects, and find ones of interest. Only stop if
2089	* we find a monster - that is something we know we want to attack.	2050	* we find a monster - that is something we know we want to attack.
2090	* if its a door or barrel (can roll) see if there may be monsters	2051	* if its a door or barrel (can roll) see if there may be monsters
…		…
2143	&& (QUERY_FLAG (mon, FLAG_UNAGGRESSIVE) \|\| QUERY_FLAG (mon, FLAG_FRIENDLY)))	2104	&& (QUERY_FLAG (mon, FLAG_UNAGGRESSIVE) \|\| QUERY_FLAG (mon, FLAG_FRIENDLY)))
2144	{	2105	{
2145	/* If we're braced, we don't want to switch places with it */	2106	/* If we're braced, we don't want to switch places with it */
2146	if (op->contr->braced)	2107	if (op->contr->braced)
2147	return;	2108	return;
		2109
2148	play_sound_map (op->map, op->x, op->y, SOUND_PUSH_PLAYER);	2110	play_sound_map (op->map, op->x, op->y, SOUND_PUSH_PLAYER);
2149	(void) push_ob (mon, dir, op);	2111	(void) push_ob (mon, dir, op);
2150	if (op->contr->tmp_invis \|\| op->hide)	2112	if (op->contr->tmp_invis \|\| op->hide)
2151	make_visible (op);	2113	make_visible (op);
		2114
2152	return;	2115	return;
2153	}	2116	}
2154		2117
2155	/* in certain circumstances, you shouldn't attack friendly	2118	/* in certain circumstances, you shouldn't attack friendly
2156	* creatures. Note that if you are braced, you can't push	2119	* creatures. Note that if you are braced, you can't push
…		…
2170	!on_battleground))	2133	!on_battleground))
2171	{	2134	{
2172	if (!op->contr->braced)	2135	if (!op->contr->braced)
2173	{	2136	{
2174	play_sound_map (op->map, op->x, op->y, SOUND_PUSH_PLAYER);	2137	play_sound_map (op->map, op->x, op->y, SOUND_PUSH_PLAYER);
2175	(void) push_ob (mon, dir, op);	2138	push_ob (mon, dir, op);
2176	}	2139	}
2177	else	2140	else
2178	new_draw_info (0, 0, op, "You withhold your attack");	2141	new_draw_info (0, 0, op, "You withhold your attack");
2179		2142
2180	if (op->contr->tmp_invis \|\| op->hide)	2143	if (op->contr->tmp_invis \|\| op->hide)
…		…
2195	* Way it works is like this: First, it must have some hit points	2158	* Way it works is like this: First, it must have some hit points
2196	* and be living. Then, it must be one of the following:	2159	* and be living. Then, it must be one of the following:
2197	* 1) Not a player, 2) A player, but of a different party. Note	2160	* 1) Not a player, 2) A player, but of a different party. Note
2198	* that party_number -1 is no party, so attacks can still happen.	2161	* that party_number -1 is no party, so attacks can still happen.
2199	*/	2162	*/
2200
2201	else if ((mon->stats.hp >= 0) && QUERY_FLAG (mon, FLAG_ALIVE) &&	2163	else if ((mon->stats.hp >= 0) && QUERY_FLAG (mon, FLAG_ALIVE) &&
2202	((mon->type != PLAYER \|\| op->contr->party == NULL \|\| op->contr->party != mon->contr->party)))	2164	((mon->type != PLAYER \|\| op->contr->party == NULL \|\| op->contr->party != mon->contr->party)))
2203	{	2165	{
2204		2166
2205	/* If the player hasn't hit something this tick, and does	2167	/* If the player hasn't hit something this tick, and does
…		…
2239	int	2201	int
2240	move_player (object *op, int dir)	2202	move_player (object *op, int dir)
2241	{	2203	{
2242	int pick;	2204	int pick;
2243		2205
2244	if (op->map == NULL \|\| op->map->in_memory != MAP_IN_MEMORY)	2206	if (!op->map \|\| op->map->in_memory != MAP_IN_MEMORY)
2245	return 0;	2207	return 0;
2246		2208
2247	/* Sanity check: make sure dir is valid */	2209	/* Sanity check: make sure dir is valid */
2248	if ((dir < 0) \|\| (dir >= 9))	2210	if ((dir < 0) \|\| (dir >= 9))
2249	{	2211	{
2250	LOG (llevError, "move_player: invalid direction %d\n", dir);	2212	LOG (llevError, "move_player: invalid direction %d\n", dir);
2251	return 0;	2213	return 0;
2252	}	2214	}
2253		2215
2254	/* peterm: added following line */	2216	/* peterm: added following line */
2255	if (QUERY_FLAG (op, FLAG_CONFUSED) && dir)	2217	if (QUERY_FLAG (op, FLAG_CONFUSED) && dir)
2256	dir = absdir (dir + RANDOM () % 3 + RANDOM () % 3 - 2);	2218	dir = absdir (dir + rndm (3) + rndm (3) - 2);
2257		2219
2258	op->facing = dir;	2220	op->facing = dir;
2259		2221
2260	if (op->hide)	2222	if (op->hide)
2261	do_hidden_move (op);	2223	do_hidden_move (op);
…		…
2337		2299
2338	/* call this here - we also will call this in do_ericserver, but	2300	/* call this here - we also will call this in do_ericserver, but
2339	* the players time has been increased when doericserver has been	2301	* the players time has been increased when doericserver has been
2340	* called, so we recheck it here.	2302	* called, so we recheck it here.
2341	*/	2303	*/
2342	//TODO: better than handling 8 commands, use some more intelligent rate-limiting	2304	if (op->contr->ns->handle_command ())
2343	for (int rep = 8; --rep && op->contr->ns->handle_command (); )	2305	return 1;
2344	;
2345		2306
2346	if (op->speed_left < 0)	2307	if (op->speed_left > 0)
2347	return 0;	2308	{
2348
2349	if (op->direction && (op->contr->run_on \|\| op->contr->fire_on))	2309	if (op->direction && (op->contr->run_on \|\| op->contr->fire_on))
2350	{	2310	{
2351	/* All move commands take 1 tick, at least for now */	2311	/* All move commands take 1 tick, at least for now */
2352	op->speed_left--;	2312	op->speed_left--;
2353		2313
2354	/* Instead of all the stuff below, let move_player take care	2314	/* Instead of all the stuff below, let move_player take care
2355	* of it. Also, some of the skill stuff is only put in	2315	* of it. Also, some of the skill stuff is only put in
2356	* there, as well as the confusion stuff.	2316	* there, as well as the confusion stuff.
2357	*/	2317	*/
2358	move_player (op, op->direction);	2318	move_player (op, op->direction);
2359	if (op->speed_left > 0)	2319
2360	return 1;	2320	return op->speed_left > 0;
2361	else	2321	}
2362	return 0;
2363	}	2322	}
2364		2323
2365	return 0;	2324	return 0;
2366	}	2325	}
2367		2326
…		…
2405	* from.	2364	* from.
2406	*/	2365	*/
2407	void	2366	void
2408	remove_unpaid_objects (object op, object env)	2367	remove_unpaid_objects (object op, object env)
2409	{	2368	{
2410	object *next;
2411
2412	while (op)	2369	while (op)
2413	{	2370	{
2414	object next = op->below; / Make sure we have a good value, in case we remove object 'op' */	2371	object next = op->below; / Make sure we have a good value, in case we remove object 'op' */
2415		2372
2416	if (QUERY_FLAG (op, FLAG_UNPAID))	2373	if (QUERY_FLAG (op, FLAG_UNPAID))
…		…
2746	tmp->name = buf;	2703	tmp->name = buf;
2747	sprintf (buf, " This finger has been cut off %s\n"	2704	sprintf (buf, " This finger has been cut off %s\n"
2748	" the %s, when he was defeated at\n level %d by %s.\n",	2705	" the %s, when he was defeated at\n level %d by %s.\n",
2749	&op->name, op->contr->title, (int) (op->level), op->contr->killer);	2706	&op->name, op->contr->title, (int) (op->level), op->contr->killer);
2750	tmp->msg = buf;	2707	tmp->msg = buf;
2751	tmp->value = 0, tmp->material = 0, tmp->type = 0;	2708	tmp->value = 0, tmp->type = 0;
2752	tmp->materialname = NULL;	2709	tmp->materialname = "organics";
2753	op->insert_at (tmp, op);	2710	tmp->insert_at (op, tmp);
2754	}	2711	}
2755		2712
2756	/* teleport defeated player to new destination */	2713	/* teleport defeated player to new destination */
2757	transfer_ob (op, x, y, 0, NULL);	2714	transfer_ob (op, x, y, 0, NULL);
2758	op->contr->braced = 0;	2715	op->contr->braced = 0;
…		…
2763		2720
2764	command_kill_pets (op, 0);	2721	command_kill_pets (op, 0);
2765		2722
2766	if (op->stats.food < 0)	2723	if (op->stats.food < 0)
2767	{	2724	{
2768	if (op->contr->explore)
2769	{
2770	new_draw_info (NDI_UNIQUE, 0, op, "You would have starved, but you are");
2771	new_draw_info (NDI_UNIQUE, 0, op, "in explore mode, so...");
2772	op->stats.food = 999;
2773	return;
2774	}
2775	sprintf (buf, "%s starved to death.", &op->name);	2725	sprintf (buf, "%s starved to death.", &op->name);
2776	strcpy (op->contr->killer, "starvation");	2726	strcpy (op->contr->killer, "starvation");
2777	}	2727	}
2778	else	2728	else
2779	{
2780	if (op->contr->explore)
2781	{
2782	new_draw_info (NDI_UNIQUE, 0, op, "You would have died, but you are");
2783	new_draw_info (NDI_UNIQUE, 0, op, "in explore mode, so...");
2784	op->stats.hp = op->stats.maxhp;
2785	return;
2786	}
2787	sprintf (buf, "%s died.", &op->name);	2729	sprintf (buf, "%s died.", &op->name);
2788	}
2789		2730
2790	play_sound_player_only (op->contr, SOUND_PLAYER_DIES, 0, 0);	2731	play_sound_player_only (op->contr, SOUND_PLAYER_DIES, 0, 0);
2791		2732
2792	/* save the map location for corpse, gravestone */	2733	/* save the map location for corpse, gravestone */
2793	x = op->x;	2734	x = op->x;
…		…
2986	/* */	2927	/* */
2987	/****************************************/	2928	/****************************************/
2988		2929
2989	enter_player_savebed (op);	2930	enter_player_savebed (op);
2990		2931
2991	/* Save the player before inserting the force to reduce
2992	* chance of abuse.
2993	*/
2994	op->contr->braced = 0;	2932	op->contr->braced = 0;
2995	op->contr->save ();
2996		2933
2997	/* it is possible that the player has blown something up	2934	/* it is possible that the player has blown something up
2998	* at his savebed location, and that can have long lasting	2935	* at his savebed location, and that can have long lasting
2999	* spell effects. So first see if there is a spell effect	2936	* spell effects. So first see if there is a spell effect
3000	* on the space that might harm the player.	2937	* on the space that might harm the player.
…		…
3029	void	2966	void
3030	loot_object (object *op)	2967	loot_object (object *op)
3031	{ /* Grab and destroy some treasure */	2968	{ /* Grab and destroy some treasure */
3032	object tmp, tmp2, *next;	2969	object tmp, tmp2, *next;
3033		2970
3034	if (op->container)	2971	op->close_container (); /* close open sack first */
3035	esrv_apply_container (op, op->container); /* close open sack first */
3036		2972
3037	for (tmp = op->inv; tmp; tmp = next)	2973	for (tmp = op->inv; tmp; tmp = next)
3038	{	2974	{
3039	next = tmp->below;	2975	next = tmp->below;
3040		2976
3041	if (tmp->invisible)	2977	if (tmp->invisible)
3042	continue;	2978	continue;
3043		2979
3044	tmp->remove ();	2980	tmp->remove ();
3045	tmp->x = op->x, tmp->y = op->y;	2981	tmp->x = op->x, tmp->y = op->y;
		2982
3046	if (tmp->type == CONTAINER)	2983	if (tmp->type == CONTAINER)
3047	{ /* empty container to ground */	2984	loot_object (tmp); /* empty container to ground */
3048	loot_object (tmp);	2985
3049	}
3050	if (!QUERY_FLAG (tmp, FLAG_UNIQUE) && (QUERY_FLAG (tmp, FLAG_STARTEQUIP) \|\| QUERY_FLAG (tmp, FLAG_NO_DROP) \|\| !(RANDOM () % 3)))	2986	if (!QUERY_FLAG (tmp, FLAG_UNIQUE) && (QUERY_FLAG (tmp, FLAG_STARTEQUIP) \|\| QUERY_FLAG (tmp, FLAG_NO_DROP) \|\| !(rndm (3))))
3051	{	2987	{
3052	if (tmp->nrof > 1)	2988	if (tmp->nrof > 1)
3053	{	2989	{
3054	tmp2 = get_split_ob (tmp, 1 + RANDOM () % (tmp->nrof - 1));	2990	tmp2 = get_split_ob (tmp, 1 + RANDOM () % (tmp->nrof - 1));
3055	tmp2->destroy ();	2991	tmp2->destroy ();
…		…
3066	/*	3002	/*
3067	* fix_weight(): Check recursively the weight of all players, and fix	3003	* fix_weight(): Check recursively the weight of all players, and fix
3068	* what needs to be fixed. Refresh windows and fix speed if anything	3004	* what needs to be fixed. Refresh windows and fix speed if anything
3069	* was changed.	3005	* was changed.
3070	*/	3006	*/
3071
3072	void	3007	void
3073	fix_weight (void)	3008	fix_weight (void)
3074	{	3009	{
3075	for_all_players (pl)	3010	for_all_players (pl)
3076	{	3011	{
…		…
3142	}	3077	}
3143		3078
3144	int	3079	int
3145	is_true_undead (object *op)	3080	is_true_undead (object *op)
3146	{	3081	{
3147	object *tmp = NULL;
3148
3149	if (QUERY_FLAG (&op->arch->clone, FLAG_UNDEAD))	3082	if (QUERY_FLAG (&op->arch->clone, FLAG_UNDEAD))
3150	return 1;	3083	return 1;
3151		3084
3152	return 0;	3085	return 0;
3153	}	3086	}
…		…
3212		3145
3213	skop = find_obj_by_type_subtype (op, SKILL, SK_HIDING);	3146	skop = find_obj_by_type_subtype (op, SKILL, SK_HIDING);
3214		3147
3215	/* its extremely hard to run and sneak/hide at the same time! */	3148	/* its extremely hard to run and sneak/hide at the same time! */
3216	if (op->type == PLAYER && op->contr->run_on)	3149	if (op->type == PLAYER && op->contr->run_on)
3217	{
3218	if (!skop \|\| num >= skop->level)	3150	if (!skop \|\| num >= skop->level)
3219	{	3151	{
3220	new_draw_info (NDI_UNIQUE, 0, op, "You ran too much! You are no longer hidden!");	3152	new_draw_info (NDI_UNIQUE, 0, op, "You ran too much! You are no longer hidden!");
3221	make_visible (op);	3153	make_visible (op);
3222	return;	3154	return;
3223	}	3155	}
3224	else	3156	else
3225	num += 20;	3157	num += 20;
3226	}	3158
3227	num += op->map->difficulty;	3159	num += op->map->difficulty;
3228	hide = hideability (op); /* modify by terrain hidden level */	3160	hide = hideability (op); /* modify by terrain hidden level */
3229	num -= hide;	3161	num -= hide;
		3162
3230	if ((op->type == PLAYER && hide < -10) \|\| ((op->invisible -= num) <= 0))	3163	if ((op->type == PLAYER && hide < -10) \|\| ((op->invisible -= num) <= 0))
3231	{	3164	{
3232	make_visible (op);	3165	make_visible (op);
3233	if (op->type == PLAYER)	3166	if (op->type == PLAYER)
3234	new_draw_info (NDI_UNIQUE, 0, op, "You moved out of hiding! You are visible!");	3167	new_draw_info (NDI_UNIQUE, 0, op, "You moved out of hiding! You are visible!");
3235	}	3168	}
3236	else if (op->type == PLAYER && skop)	3169	else if (op->type == PLAYER && skop)
3237	{
3238	change_exp (op, calc_skill_exp (op, NULL, skop), skop->skill, 0);	3170	change_exp (op, calc_skill_exp (op, NULL, skop), skop->skill, 0);
3239	}
3240	}	3171	}
3241		3172
3242	/* determine if who is standing near a hostile creature. */	3173	/* determine if who is standing near a hostile creature. */
3243		3174
3244	int	3175	int
…		…
3311	if (pl->type != PLAYER)	3242	if (pl->type != PLAYER)
3312	{	3243	{
3313	LOG (llevError, "player_can_view() called for non-player object\n");	3244	LOG (llevError, "player_can_view() called for non-player object\n");
3314	return -1;	3245	return -1;
3315	}	3246	}
		3247
3316	if (!pl \|\| !op)	3248	if (!pl \|\| !op)
3317	return 0;	3249	return 0;
3318		3250
3319	if (op->head)
3320	{
3321	op = op->head;	3251	op = op->head_ ();
3322	}	3252
3323	get_rangevector (pl, op, &rv, 0x1);	3253	get_rangevector (pl, op, &rv, 0x1);
3324		3254
3325	/* starting with the 'head' part, lets loop	3255	/* starting with the 'head' part, lets loop
3326	* through the object and find if it has any	3256	* through the object and find if it has any
3327	* part that is in the los array but isnt on	3257	* part that is in the los array but isnt on
…		…
3457	if (trlist == NULL \|\| who->type != PLAYER)	3387	if (trlist == NULL \|\| who->type != PLAYER)
3458	return;	3388	return;
3459		3389
3460	for (i = 0, tr = trlist->items; tr != NULL && i < level - 1; tr = tr->next, i++);	3390	for (i = 0, tr = trlist->items; tr != NULL && i < level - 1; tr = tr->next, i++);
3461		3391
3462	if (tr == NULL \|\| tr->item == NULL)	3392	if (!tr \|\| !tr->item)
3463	{	3393	{
3464	/* LOG(llevDebug, "-> no more treasure for %s\n", change_resist_msg[atnr]); */	3394	/* LOG(llevDebug, "-> no more treasure for %s\n", change_resist_msg[atnr]); */
3465	return;	3395	return;
3466	}	3396	}
3467		3397
…		…
3592	* not readied.	3522	* not readied.
3593	*/	3523	*/
3594	void	3524	void
3595	player_unready_range_ob (player pl, object ob)	3525	player_unready_range_ob (player pl, object ob)
3596	{	3526	{
3597	rangetype i;
3598
3599	for (i = (rangetype) 0; i < range_size; i = (rangetype) ((int) i + 1))	3527	for (rangetype i = (rangetype) 0; i < range_size; i = (rangetype) ((int) i + 1))
3600	{
3601	if (pl->ranges[i] == ob)	3528	if (pl->ranges[i] == ob)
3602	{	3529	{
3603	pl->ranges[i] = NULL;	3530	pl->ranges[i] = 0;
3604	if (pl->shoottype == i)	3531	if (pl->shoottype == i)
3605	{
3606	pl->shoottype = range_none;	3532	pl->shoottype = range_none;
3607	}
3608	}	3533	}
3609	}
3610	}	3534	}
		3535
		3536	sint8
		3537	player::visibility_at (maptile *map, int x, int y) const
		3538	{
		3539	if (!ns)
		3540	return 0;
		3541
		3542	int dx, dy;
		3543	if (!adjacent_map (map, ns->current_map, &dx, &dy))
		3544	return 0;
		3545
		3546	x += dx - ns->current_x + ns->mapx / 2;
		3547	y += dy - ns->current_y + ns->mapy / 2;
		3548
		3549	if (!IN_RANGE_EXC (x, 0, ns->mapx) \|\| !IN_RANGE_EXC (y, 0, ns->mapy))
		3550	return 0;
		3551
		3552	return 100 - blocked_los [x][y];
		3553	}

Diff Legend

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

Comparing deliantra/server/server/player.C (file contents): Revision 1.70 by root, Tue Dec 26 20:04:09 2006 UTC vs. Revision 1.106 by pippijn, Fri Mar 2 10:15:40 2007 UTC

Diff Legend

Comparing deliantra/server/server/player.C (file contents):
Revision 1.70 by root, Tue Dec 26 20:04:09 2006 UTC vs.
Revision 1.106 by pippijn, Fri Mar 2 10:15:40 2007 UTC