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

Comparing deliantra/server/server/player.C (file contents):
Revision 1.56 by root, Sat Dec 23 05:25:18 2006 UTC vs.
Revision 1.104 by root, Fri Feb 16 19:43:41 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	player *pl;
40
41	for (pl = first_player; pl; pl = pl->next)
42	if (pl->ob && !strcmp (query_name (pl->ob), plname))
43	return pl;
44
45	return 0;
46	}
47		38
48	void	39	void
49	display_motd (const object *op)	40	display_motd (const object *op)
50	{	41	{
51	char buf[MAX_BUF];	42	char buf[MAX_BUF];
…		…
125		116
126	news[0] = '\0';	117	news[0] = '\0';
127	subject[0] = '\0';	118	subject[0] = '\0';
128	size = 0;	119	size = 0;
129		120
130	while (fgets (buf, MAX_BUF, fp) != NULL)	121	while (fgets (buf, MAX_BUF, fp))
131	{	122	{
132	if (*buf == '#')	123	if (*buf == '#')
133	continue;	124	continue;
134		125
135	if (*buf == '%')	126	if (*buf == '%')
136	{ /* send one news */	127	{ /* send one news */
137	if (size > 0)	128	if (size > 0)
138	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
139	strcpy (subject, buf + 1);	131	strcpy (subject, buf + 1);
140	strip_endline (subject);	132	strip_endline (subject);
141	size = 0;	133	size = 0;
142	news[0] = '\0';	134	news[0] = '\0';
143	}	135	}
…		…
160		152
161	/* This loads the first map an puts the player on it. */	153	/* This loads the first map an puts the player on it. */
162	static void	154	static void
163	set_first_map (object *op)	155	set_first_map (object *op)
164	{	156	{
165	strcpy (op->contr->maplevel, first_map_path);	157	op->contr->maplevel = first_map_path;
166	op->x = -1;	158	op->x = -1;
167	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;
168	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);
169	}	208	}
170		209
171	// connect the player with a specific client	210	// connect the player with a specific client
172	// also changed, rationalises, and fixes some incorrect settings	211	// also changed, rationalises, and fixes some incorrect settings
173	void	212	void
174	player::connect (client *ns)	213	player::connect (client *ns)
175	{	214	{
176	this->ns = ns;	215	this->ns = ns;
177	ns->pl = this;	216	ns->pl = this;
178		217
179	next = first_player;	218	run_on = 0;
180	first_player = this;	219	fire_on = 0;
		220	ob->close_container (); //TODO: client-specific
181		221
182	ns->update_look = 0;	222	ns->update_look = 0;
183	ns->look_position = 0;	223	ns->look_position = 0;
184		224
185	clear_los (ob);	225	clear_los (ob);
186		226
		227	ns->reset_stats ();
		228
		229	/* make sure he's a player -- needed because of class change. */
187	ob->type = PLAYER; // we are paranoid	230	ob->type = PLAYER; // we are paranoid
188	ob->race = ob->arch->clone.race;	231	ob->race = ob->arch->clone.race;
189		232
190	if (!legal_range (ob, shoottype))	233	if (!legal_range (ob, shoottype))
191	shoottype = range_none;	234	shoottype = range_none;
192		235
193	ob->carrying = sum_weight (ob);	236	ob->carrying = sum_weight (ob);
194	link_player_skills (ob);	237	link_player_skills (ob);
195		238
196	CLEAR_FLAG (ob, FLAG_NO_FIX_PLAYER);	239	CLEAR_FLAG (ob, FLAG_NO_FIX_PLAYER);
197	ob->update_stats ();
198	update_ob_speed (ob);
199		240
200	assign (title, ob->arch->clone.name);	241	assign (title, ob->arch->clone.name);
201
202	/* can_use_shield is a new flag. However, the can_use.. seems to largely come
203	* from the class, and not race. I don't see any way to get the class information
204	* to then update this. I don't think this will actually break anything - anyone
205	* that can use armour should be able to use a shield. What this may 'break'
206	* are features new characters get, eg, if someone starts up with a Q, they
207	* should be able to use a shield. However, old Q's won't get that advantage.
208	*/
209	if (QUERY_FLAG (ob, FLAG_USE_ARMOUR))
210	SET_FLAG (ob, FLAG_USE_SHIELD);
211		242
212	/* if it's a dragon player, set the correct title here */	243	/* if it's a dragon player, set the correct title here */
213	if (is_dragon_pl (ob))	244	if (is_dragon_pl (ob))
214	{	245	{
215	object tmp, abil = 0, *skin = 0;	246	object tmp, abil = 0, *skin = 0;
…		…
225	skin = tmp;	256	skin = tmp;
226		257
227	set_dragon_name (ob, abil, skin);	258	set_dragon_name (ob, abil, skin);
228	}	259	}
229		260
230	CLEAR_FLAG (ob, FLAG_FRIENDLY);
231	add_friendly_object (ob);
232
233	LOG (llevInfo, "LOGIN: Player named %s from ip %s\n", &ob->name, ns->host);
234
235	new_draw_info (NDI_UNIQUE, 0, ob, "Welcome Back!");	261	new_draw_info (NDI_UNIQUE, 0, ob, "Welcome Back!");
236	new_draw_info_format (NDI_UNIQUE \| NDI_ALL \| NDI_DK_ORANGE, 5, NULL, "%s has entered the game.", &ob->name);
237		262
		263	esrv_new_player (this, ob->weight + ob->carrying);
		264
		265	ob->update_stats ();
238	ns->floorbox_update ();	266	ns->floorbox_update ();
239		267
240	esrv_new_player (this, ob->weight + ob->carrying);
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);//TODO	273	send_rules (ob);
247	// send_news (ob);//TODO	274	send_news (ob);
248	// display_motd (ob);//TODO	275	display_motd (ob);
		276
		277	INVOKE_PLAYER (CONNECT, this);
249	INVOKE_PLAYER (LOGIN, this);	278	INVOKE_PLAYER (LOGIN, this);
		279	}
		280
		281	void
		282	player::disconnect ()
		283	{
		284	if (ns)
		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	ob->close_container (); //TODO: client-specific
		297	deactivate ();
250	}	298	}
251		299
252	// the need for this function can be explained	300	// the need for this function can be explained
253	// by load_object not returning the object	301	// by load_object not returning the object
254	void	302	void
255	player::set_object (object *op)	303	player::set_object (object *op)
256	{	304	{
257	ob = op;	305	ob = op;
258	ob->contr = this; /* this aren't yet in archetype */	306	ob->contr = this; /* this aren't yet in archetype */
259		307
260	ob->speed_left = 0.5;	308	ob->speed_left = 0.5;
261	ob->speed = 1.0;	309	ob->speed = 1.0;
262	ob->direction = 5; /* So player faces south */	310	ob->direction = 5; /* So player faces south */
263	ob->stats.wc = 2;
264	ob->run_away = 25; /* Then we panick... */
265
266	set_first_map (ob);
267
268	ob->roll_stats ();
269	}	311	}
270		312
271	player::player ()	313	player::player ()
272	{	314	{
273	/* There are some elements we want initialized to non zero value -	315	/* There are some elements we want initialised to non zero value -
274	* we deal with that below this point.	316	* we deal with that below this point.
275	*/	317	*/
276	outputs_sync = 16; /* Every 2 seconds */	318	outputs_sync = 16; /* Every 2 seconds */
277	outputs_count = 8; /* Keeps present behaviour */	319	outputs_count = 8; /* Keeps present behaviour */
278	unapply = unapply_nochoice;	320	unapply = unapply_nochoice;
279		321
280	assign (savebed_map, first_map_path); /* Init. respawn position */	322	savebed_map = first_map_path; /* Init. respawn position */
281		323
282	gen_sp_armour = 10;	324	gen_sp_armour = 10;
283	last_speed = -1;
284	shoottype = range_none;	325	shoottype = range_none;
285	bowtype = bow_normal;	326	bowtype = bow_normal;
286	petmode = pet_normal;	327	petmode = pet_normal;
287	listening = 10;	328	listening = 10;
288	usekeys = containers;	329	usekeys = containers;
289	last_weapon_sp = -1;
290	peaceful = 1; /* default peaceful */	330	peaceful = 1; /* default peaceful */
291	do_los = 1;	331	do_los = 1;
		332	}
292		333
293	/* we need to clear these to -1 and not zero - otherwise,	334	void
294	* if a player quits and starts a new character, we wont	335	player::do_destroy ()
295	* send new values to the client, as things like exp start	336	{
296	* at zero.	337	disconnect ();
297	*/
298	for (int i = 0; i < NUM_SKILLS; i++)
299	last_skill_exp[i] = -1;
300		338
301	for (int i = 0; i < NROFATTACKS; i++)	339	attachable::do_destroy ();
302	last_resist[i] = -1;
303		340
304	last_stats.exp = -1;	341	if (ob)
305	last_weight = (uint32) - 1;	342	{
		343	ob->destroy_inv (false);
		344	ob->destroy ();
		345	}
306	}	346	}
307		347
308	player::~player ()	348	player::~player ()
309	{	349	{
310	terminate_all_pets (ob);
311
312	if (first_player != this)
313	{
314	player *prev = first_player;
315
316	while (prev && prev->next && prev->next != this)
317	prev = prev->next;
318
319	if (prev->next != this)
320	{
321	LOG (llevError, "Free_player: Can't find previous player.\n");
322	abort ();
323	}
324
325	prev->next = next;
326	}
327	else
328	first_player = next;
329
330	if (ob)
331	{
332	ob->contr = 0;
333	ob->destroy (1);
334	}
335
336	if (ns)
337	{
338	ns->send_packet ("goodbye");
339	ns->flush ();
340	ns->pl = 0;
341	ns->destroy ();
342	}
343
344	/* Clear item stack */	350	/* Clear item stack */
345	free (stack_items);	351	free (stack_items);
346	}	352	}
347		353
348	/* Tries to add player on the connection passed in ns.	354	/* Tries to add player on the connection passed in ns.
…		…
353	player::create ()	359	player::create ()
354	{	360	{
355	player *pl = new player;	361	player *pl = new player;
356		362
357	pl->set_object (arch_to_object (get_player_archetype (0)));	363	pl->set_object (arch_to_object (get_player_archetype (0)));
		364
		365	pl->ob->roll_stats ();
		366	pl->ob->stats.wc = 2;
		367	pl->ob->run_away = 25; /* Then we panick... */
		368
		369	set_first_map (pl->ob);
358		370
359	return pl;	371	return pl;
360	}	372	}
361		373
362	/*	374	/*
…		…
389		401
390	object *	402	object *
391	get_nearest_player (object *mon)	403	get_nearest_player (object *mon)
392	{	404	{
393	object *op = NULL;	405	object *op = NULL;
394	player *pl = NULL;
395	objectlink *ol;	406	objectlink *ol;
396	unsigned lastdist;	407	unsigned lastdist;
397	rv_vector rv;	408	rv_vector rv;
398		409
399	for (ol = first_friendly_object, lastdist = 1000; ol != NULL; ol = ol->next)	410	for (ol = first_friendly_object, lastdist = 1000; ol; ol = ol->next)
400	{	411	{
401	/* We should not find free objects on this friendly list, but it	412	/* We should not find free objects on this friendly list, but it
402	* does periodically happen. Given that, lets deal with it.	413	* does periodically happen. Given that, lets deal with it.
403	* While unlikely, it is possible the next object on the friendly	414	* While unlikely, it is possible the next object on the friendly
404	* list is also free, so encapsulate this in a while loop.	415	* list is also free, so encapsulate this in a while loop.
…		…
408	object *tmp = ol->ob;	419	object *tmp = ol->ob;
409		420
410	/* Can't do much more other than log the fact, because the object	421	/* Can't do much more other than log the fact, because the object
411	* itself will have been cleared.	422	* itself will have been cleared.
412	*/	423	*/
413	LOG (llevDebug, "get_nearest_player: Found free/non friendly object on friendly list\n");	424	LOG (llevDebug, "get_nearest_player: Found free/non friendly object '%s' on friendly list\n",
		425	tmp->debug_desc ());
414	ol = ol->next;	426	ol = ol->next;
415	remove_friendly_object (tmp);	427	remove_friendly_object (tmp);
416	if (!ol)	428	if (!ol)
417	return op;	429	return op;
418	}	430	}
…		…
431	{	443	{
432	op = ol->ob;	444	op = ol->ob;
433	lastdist = rv.distance;	445	lastdist = rv.distance;
434	}	446	}
435	}	447	}
436	for (pl = first_player; pl != NULL; pl = pl->next)	448
437	{	449	for_all_players (pl)
438	if (can_detect_enemy (mon, pl->ob, &rv))	450	if (can_detect_enemy (mon, pl->ob, &rv))
439	{
440
441	if (lastdist > rv.distance)	451	if (lastdist > rv.distance)
442	{	452	{
443	op = pl->ob;	453	op = pl->ob;
444	lastdist = rv.distance;	454	lastdist = rv.distance;
445	}	455	}
446	}	456
447	}
448	#if 0	457	#if 0
449	LOG (llevDebug, "get_nearest_player() finds player: %s\n", op ? &op->name : "(null)");	458	LOG (llevDebug, "get_nearest_player() finds player: %s\n", op ? &op->name : "(null)");
450	#endif	459	#endif
451	return op;	460	return op;
452	}	461	}
…		…
510	x = mon->x;	519	x = mon->x;
511	y = mon->y;	520	y = mon->y;
512	m = mon->map;	521	m = mon->map;
513	dir = rv.direction;	522	dir = rv.direction;
514	lastdir = firstdir = rv.direction; /* perhaps we stand next to pl, init firstdir too */	523	lastdir = firstdir = rv.direction; /* perhaps we stand next to pl, init firstdir too */
515	diff = FABS (rv.distance_x) > FABS (rv.distance_y) ? FABS (rv.distance_x) : FABS (rv.distance_y);	524	diff = ::max (abs (rv.distance_x), abs (rv.distance_y));
		525
516	/* If we can't solve it within the search distance, return now. */	526	/* If we can't solve it within the search distance, return now. */
517	if (diff > max)	527	if (diff > max)
518	return 0;	528	return 0;
		529
519	while (diff > 1 && max > 0)	530	while (diff > 1 && max > 0)
520	{	531	{
521	lastx = x;	532	lastx = x;
522	lasty = y;	533	lasty = y;
523	lastmap = m;	534	lastmap = m;
…		…
605	max--;	616	max--;
606	lastdir = dir;	617	lastdir = dir;
607	if (!firstdir)	618	if (!firstdir)
608	firstdir = dir;	619	firstdir = dir;
609	}	620	}
		621
610	if (diff <= 1)	622	if (diff <= 1)
611	{	623	{
612	/* Recalculate diff (distance) because we may not have actually	624	/* Recalculate diff (distance) because we may not have actually
613	* headed toward player for entire distance.	625	* headed toward player for entire distance.
614	*/	626	*/
615	get_rangevector_from_mapcoord (m, x, y, pl, &rv, 0);	627	get_rangevector_from_mapcoord (m, x, y, pl, &rv, 0);
616	diff = FABS (rv.distance_x) > FABS (rv.distance_y) ? FABS (rv.distance_x) : FABS (rv.distance_y);	628	diff = ::max (abs (rv.distance_x), abs (rv.distance_y));
617	}	629	}
		630
618	if (diff > max)	631	if (diff > max)
619	return 0;	632	return 0;
620	}	633	}
		634
621	/* If we reached the max, didn't find a direction in time */	635	/* If we reached the max, didn't find a direction in time */
622	if (!max)	636	if (!max)
623	return 0;	637	return 0;
624		638
625	return firstdir;	639	return firstdir;
…		…
739	roll_stat (void)	753	roll_stat (void)
740	{	754	{
741	int a[4], i, j, k;	755	int a[4], i, j, k;
742		756
743	for (i = 0; i < 4; i++)	757	for (i = 0; i < 4; i++)
744	a[i] = (int) RANDOM () % 6 + 1;	758	a[i] = (int) rndm (6) + 1;
745		759
746	for (i = 0, j = 0, k = 7; i < 4; i++)	760	for (i = 0, j = 0, k = 7; i < 4; i++)
747	if (a[i] < k)	761	if (a[i] < k)
748	k = a[i], j = i;	762	k = a[i], j = i;
749		763
…		…
830	contr->levsp[1] = 6;	844	contr->levsp[1] = 6;
831	contr->levgrace[1] = 3;	845	contr->levgrace[1] = 3;
832		846
833	contr->orig_stats = stats;	847	contr->orig_stats = stats;
834	}	848	}
		849	}
		850
		851	static void
		852	start_info (object *op)
		853	{
		854	char buf[MAX_BUF];
		855
		856	sprintf (buf, "Welcome to Crossfire v%s!", VERSION);
		857	new_draw_info (NDI_UNIQUE, 0, op, buf);
		858	//new_draw_info (NDI_UNIQUE, 0, op, "Press `?' for help");
		859	//new_draw_info (NDI_UNIQUE, 0, op, " ");
835	}	860	}
836		861
837	/* This function takes the key that is passed, and does the	862	/* This function takes the key that is passed, and does the
838	* appropriate action with it (change race, or other things).	863	* appropriate action with it (change race, or other things).
839	* The function name is for historical reasons - now we have	864	* The function name is for historical reasons - now we have
…		…
868	* to save here.	893	* to save here.
869	*/	894	*/
870	sprintf (buf, "%s/%s/%s", settings.localdir, settings.playerdir, &op->name);	895	sprintf (buf, "%s/%s/%s", settings.localdir, settings.playerdir, &op->name);
871	make_path_to_file (buf);	896	make_path_to_file (buf);
872		897
873	#ifdef AUTOSAVE
874	op->contr->last_save_tick = pticks;
875	#endif
876	start_info (op);	898	start_info (op);
877	CLEAR_FLAG (op, FLAG_WIZ);	899	CLEAR_FLAG (op, FLAG_WIZ);
878	give_initial_items (op, op->randomitems);	900	give_initial_items (op, op->randomitems);
879	link_player_skills (op);	901	link_player_skills (op);
880	esrv_send_inventory (op, op);	902	esrv_send_inventory (op, op);
…		…
886	if (*first_map_ext_path)	908	if (*first_map_ext_path)
887	{	909	{
888	object *tmp;	910	object *tmp;
889	char mapname[MAX_BUF];	911	char mapname[MAX_BUF];
890		912
891	snprintf (mapname, MAX_BUF - 1, "%s/%s", first_map_ext_path, &op->arch->name);	913	snprintf (mapname, MAX_BUF - 1, "%s/%s", &first_map_ext_path, &op->arch->name);
892	tmp = object::create ();	914	tmp = object::create ();
893	EXIT_PATH (tmp) = mapname;	915	EXIT_PATH (tmp) = mapname;
894	EXIT_X (tmp) = op->x;	916	EXIT_X (tmp) = op->x;
895	EXIT_Y (tmp) = op->y;	917	EXIT_Y (tmp) = op->y;
896	enter_exit (op, tmp); /* we don't really care if it succeeded;	918	op->enter_exit (tmp); /* we don't really care if it succeeded;
897	* if the map isn't there, then stay on the	919	* if the map isn't there, then stay on the
898	* default initial map */	920	* default initial map */
899	tmp->destroy ();	921	tmp->destroy ();
900	}	922	}
901	else	923	else
…		…
940	if (op->msg)	962	if (op->msg)
941	new_draw_info (NDI_BLUE, 0, op, op->msg);	963	new_draw_info (NDI_BLUE, 0, op, op->msg);
942		964
943	send_query (op->contr->ns, CS_QUERY_SINGLECHAR, "Press any key for the next race.\nPress `d' to play this race.\n");	965	send_query (op->contr->ns, CS_QUERY_SINGLECHAR, "Press any key for the next race.\nPress `d' to play this race.\n");
944	return 0;	966	return 0;
945	}
946
947	int
948	key_confirm_quit (object *op, char key)
949	{
950	if (key != 'y' && key != 'Y' && key != 'q' && key != 'Q')
951	{
952	op->contr->ns->state = ST_PLAYING;
953	new_draw_info (NDI_UNIQUE, 0, op, "OK, continuing to play.");
954	return 1;
955	}
956
957	INVOKE_PLAYER (LOGOUT, op->contr);
958	INVOKE_PLAYER (QUIT, op->contr);
959
960	terminate_all_pets (op);
961	leave_map (op);
962	op->direction = 0;
963	new_draw_info_format (NDI_UNIQUE \| NDI_ALL, 5, NULL, "%s quits the game.", &op->name);
964
965	strcpy (op->contr->killer, "quit");
966	check_score (op);
967	op->contr->party = 0;
968	op->contr->own_title[0] = '\0';
969
970	object_ptr ob = op;
971
972	delete ob->contr;
973
974	/* We need to hunt for any per player unique maps in memory and
975	* get rid of them. The trailing slash in the path is intentional,
976	* so that players named 'Ab' won't match against players 'Abe' pathname
977	*/
978	char buf[MAX_BUF];
979	sprintf (buf, "%s/%s/%s/", settings.localdir, settings.playerdir, &op->name);
980
981	for (maptile next, mp = first_map; mp; mp = next)
982	{
983	next = mp->next;
984
985	if (!strncmp (mp->path, buf, strlen (buf)))
986	delete_map (mp);
987	}
988
989	delete_character (ob->name, 1);
990
991	return 1;
992	}	967	}
993		968
994	void	969	void
995	flee_player (object *op)	970	flee_player (object *op)
996	{	971	{
…		…
1133	sprintf (putstring, "item name: %s item type: %d weight/value: %d",	1108	sprintf (putstring, "item name: %s item type: %d weight/value: %d",
1134	&tmp->name, tmp->type, (int) (query_cost (tmp, op, F_TRUE) * 100 / (tmp->weight * MAX (tmp->nrof, 1))));	1109	&tmp->name, tmp->type, (int) (query_cost (tmp, op, F_TRUE) * 100 / (tmp->weight * MAX (tmp->nrof, 1))));
1135	else	1110	else
1136	sprintf (putstring, "item name: %s item type: %d weight/value: %d",	1111	sprintf (putstring, "item name: %s item type: %d weight/value: %d",
1137	&tmp->arch->name, tmp->type, (int) (query_cost (tmp, op, F_TRUE) * 100 / (tmp->weight * MAX (tmp->nrof, 1))));	1112	&tmp->arch->name, tmp->type, (int) (query_cost (tmp, op, F_TRUE) * 100 / (tmp->weight * MAX (tmp->nrof, 1))));
		1113
1138	new_draw_info (NDI_UNIQUE, 0, op, putstring);	1114	new_draw_info (NDI_UNIQUE, 0, op, putstring);
1139
1140	sprintf (putstring, "...flags: ");
1141	for (k = 0; k < 4; k++)
1142	{
1143	for (j = 0; j < 32; j++)
1144	{
1145	if ((tmp->flags[k] >> j) & 0x01)
1146	{
1147	sprintf (tmpstr, "%d ", k * 32 + j);
1148	strcat (putstring, tmpstr);
1149	}
1150	}
1151	}
1152	new_draw_info (NDI_UNIQUE, 0, op, putstring);
1153
1154	#if 0
1155	/* print the flags too */
1156	for (k = 0; k < 4; k++)
1157	{
1158	fprintf (stderr, "%d [%d] ", k, k * 32 + 31);
1159	for (j = 0; j < 32; j++)
1160	{
1161	fprintf (stderr, "%d", tmp->flags[k] >> (31 - j) & 0x01);
1162	if (!((j + 1) % 4))
1163	fprintf (stderr, " ");
1164	}
1165	fprintf (stderr, " [%d]\n", k * 32);
1166	}
1167	#endif
1168	}	1115	}
		1116
1169	/* philosophy:	1117	/* philosophy:
1170	* It's easy to grab an item type from a pile, as long as it's	1118	* It's easy to grab an item type from a pile, as long as it's
1171	* generic. This takes no game-time. For more detailed pickups	1119	* generic. This takes no game-time. For more detailed pickups
1172	* and selections, select-items shoul dbe used. This is a	1120	* and selections, select-items should be used. This is a
1173	* grab-as-you-run type mode that's really useful for arrows for	1121	* grab-as-you-run type mode that's really useful for arrows for
1174	* example.	1122	* example.
1175	* The drawback: right now it has no frontend, so you need to	1123	* The drawback: right now it has no frontend, so you need to
1176	* stick the bits you want into a calculator in hex mode and then	1124	* stick the bits you want into a calculator in hex mode and then
1177	* convert to decimal and then 'pickup <#>	1125	* convert to decimal and then 'pickup <#>
…		…
1428	* found object is returned.	1376	* found object is returned.
1429	*/	1377	*/
1430	object *	1378	object *
1431	find_arrow (object op, const char type)	1379	find_arrow (object op, const char type)
1432	{	1380	{
1433	object *tmp = NULL;	1381	object *tmp = 0;
1434		1382
1435	for (op = op->inv; op; op = op->below)	1383	for (op = op->inv; op; op = op->below)
1436	if (!tmp && op->type == CONTAINER && op->race == type && QUERY_FLAG (op, FLAG_APPLIED))	1384	if (!tmp && op->type == CONTAINER && op->race == type && QUERY_FLAG (op, FLAG_APPLIED))
1437	tmp = find_arrow (op, type);	1385	tmp = find_arrow (op, type);
1438	else if (op->type == ARROW && op->race == type)	1386	else if (op->type == ARROW && op->race == type)
1439	return op;	1387	return op;
		1388
1440	return tmp;	1389	return tmp;
1441	}	1390	}
1442		1391
1443	/*	1392	/*
1444	* Similar to find_arrow, but looks for (roughly) the best arrow to use	1393	* Similar to find_arrow, but looks for (roughly) the best arrow to use
1445	* against the target. A full test is not performed, simply a basic test	1394	* against the target. A full test is not performed, simply a basic test
1446	* of resistances. The archer is making a quick guess at what he sees down	1395	* of resistances. The archer is making a quick guess at what he sees down
1447	* the hall. Failing that it does it's best to pick the highest plus arrow.	1396	* the hall. Failing that it does it's best to pick the highest plus arrow.
1448	*/	1397	*/
1449
1450	object *	1398	object *
1451	find_better_arrow (object op, object target, const char type, int better)	1399	find_better_arrow (object op, object target, const char type, int better)
1452	{	1400	{
1453	object tmp = NULL, arrow, *ntmp;	1401	object tmp = NULL, arrow, *ntmp;
1454	int attacknum, attacktype, betterby = 0, i;	1402	int attacknum, attacktype, betterby = 0, i;
…		…
1677	return 0;	1625	return 0;
1678	}	1626	}
1679		1627
1680	arrow->set_owner (op);	1628	arrow->set_owner (op);
1681	arrow->skill = bow->skill;	1629	arrow->skill = bow->skill;
1682
1683	arrow->direction = dir;	1630	arrow->direction = dir;
1684	arrow->x = sx;
1685	arrow->y = sy;
1686		1631
1687	if (op->type == PLAYER)	1632	if (op->type == PLAYER)
1688	{	1633	{
1689	op->speed_left = 0.01 - (float) FABS (op->speed) * 100 / bowspeed;	1634	op->speed_left = 0.01 - (float) FABS (op->speed) * 100 / bowspeed;
1690	op->update_stats ();	1635	op->update_stats ();
…		…
1705		1650
1706	/* update the speed */	1651	/* update the speed */
1707	arrow->speed = (float) ((QUERY_FLAG (bow, FLAG_NO_STRENGTH) ?	1652	arrow->speed = (float) ((QUERY_FLAG (bow, FLAG_NO_STRENGTH) ?
1708	0 : dam_bonus[op->stats.Str]) + bow->magic + arrow->magic) / 5.0 + (float) bow->stats.dam / 7.0;	1653	0 : dam_bonus[op->stats.Str]) + bow->magic + arrow->magic) / 5.0 + (float) bow->stats.dam / 7.0;
1709		1654
1710	if (arrow->speed < 1.0)	1655	arrow->set_speed (max (arrow->speed, 1.0));
1711	arrow->speed = 1.0;
1712	update_ob_speed (arrow);
1713	arrow->speed_left = 0;	1656	arrow->speed_left = 0;
1714		1657
1715	if (op->type == PLAYER)	1658	if (op->type == PLAYER)
1716	{	1659	{
1717	arrow->stats.wc = 20 - bow->magic - arrow->magic -	1660	arrow->stats.wc = 20 - bow->magic - arrow->magic -
…		…
1730	arrow->attacktype \|= bow->attacktype;	1673	arrow->attacktype \|= bow->attacktype;
1731		1674
1732	if (bow->slaying)	1675	if (bow->slaying)
1733	arrow->slaying = bow->slaying;	1676	arrow->slaying = bow->slaying;
1734		1677
1735	arrow->map = m;
1736	arrow->move_type = MOVE_FLY_LOW;	1678	arrow->move_type = MOVE_FLY_LOW;
1737	arrow->move_on = MOVE_FLY_LOW \| MOVE_WALK;	1679	arrow->move_on = MOVE_FLY_LOW \| MOVE_WALK;
1738		1680
1739	play_sound_map (op->map, op->x, op->y, SOUND_FIRE_ARROW);	1681	play_sound_map (op->map, op->x, op->y, SOUND_FIRE_ARROW);
1740	insert_ob_in_map (arrow, m, op, 0);	1682	m->insert (arrow, sx, sy, op);
1741		1683
1742	if (!arrow->destroyed ())	1684	if (!arrow->destroyed ())
1743	move_arrow (arrow);	1685	move_arrow (arrow);
1744		1686
1745	if (op->type == PLAYER)	1687	if (op->type == PLAYER)
…		…
1771	}	1713	}
1772	else if (op->contr->bowtype >= bow_n && op->contr->bowtype <= bow_nw)	1714	else if (op->contr->bowtype >= bow_n && op->contr->bowtype <= bow_nw)
1773	{	1715	{
1774	if (!similar_direction (dir, op->contr->bowtype - bow_n + 1))	1716	if (!similar_direction (dir, op->contr->bowtype - bow_n + 1))
1775	wcmod = -1;	1717	wcmod = -1;
		1718
1776	ret = fire_bow (op, op, NULL, op->contr->bowtype - bow_n + 1, wcmod, op->x, op->y);	1719	ret = fire_bow (op, op, NULL, op->contr->bowtype - bow_n + 1, wcmod, op->x, op->y);
1777	}	1720	}
1778	else if (op->contr->bowtype == bow_threewide)	1721	else if (op->contr->bowtype == bow_threewide)
1779	{	1722	{
1780	ret = fire_bow (op, op, NULL, dir, 0, op->x, op->y);	1723	ret = fire_bow (op, op, NULL, dir, 0, op->x, op->y);
…		…
1850		1793
1851	if (item->arch)	1794	if (item->arch)
1852	{	1795	{
1853	CLEAR_FLAG (item, FLAG_ANIMATE);	1796	CLEAR_FLAG (item, FLAG_ANIMATE);
1854	item->face = item->arch->clone.face;	1797	item->face = item->arch->clone.face;
1855	item->speed = 0;	1798	item->set_speed (0);
1856	update_ob_speed (item);
1857	}	1799	}
		1800
1858	if ((tmp = item->in_player ()))	1801	if ((tmp = item->in_player ()))
1859	esrv_update_item (UPD_ANIM, tmp, item);	1802	esrv_update_item (UPD_ANIM, tmp, item);
1860	}	1803	}
1861	}	1804	}
1862	else if (item->type == ROD \|\| item->type == HORN)	1805	else if (item->type == ROD \|\| item->type == HORN)
1863	{
1864	drain_rod_charge (item);	1806	drain_rod_charge (item);
1865	}
1866	}	1807	}
1867	}	1808	}
1868		1809
1869	/* Received a fire command for the player - go and do it.	1810	/* Received a fire command for the player - go and do it.
1870	*/	1811	*/
…		…
1909	{	1850	{
1910	if (op->type == PLAYER)	1851	if (op->type == PLAYER)
1911	new_draw_info (NDI_UNIQUE, 0, op, "You have no applicable skill to use.");	1852	new_draw_info (NDI_UNIQUE, 0, op, "You have no applicable skill to use.");
1912	return;	1853	return;
1913	}	1854	}
		1855
1914	(void) do_skill (op, op, op->chosen_skill, dir, NULL);	1856	do_skill (op, op, op->chosen_skill, dir, NULL);
1915	return;	1857	return;
1916	case range_builder:	1858	case range_builder:
1917	apply_map_builder (op, dir);	1859	apply_map_builder (op, dir);
1918	return;	1860	return;
1919	default:	1861	default:
1920	new_draw_info (NDI_UNIQUE, 0, op, "Illegal shoot type.");	1862	new_draw_info (NDI_UNIQUE, 0, op, "Illegal shoot type.");
1921	return;	1863	return;
1922	}	1864	}
1923	}	1865	}
1924
1925
1926		1866
1927	/* find_key	1867	/* find_key
1928	* We try to find a key for the door as passed. If we find a key	1868	* We try to find a key for the door as passed. If we find a key
1929	* and successfully use it, we return the key, otherwise NULL	1869	* and successfully use it, we return the key, otherwise NULL
1930	* This function merges both normal and locked door, since the logic	1870	* This function merges both normal and locked door, since the logic
…		…
1932	* pl is the player,	1872	* pl is the player,
1933	* inv is the objects inventory to searched	1873	* inv is the objects inventory to searched
1934	* door is the door we are trying to match against.	1874	* door is the door we are trying to match against.
1935	* This function can be called recursively to search containers.	1875	* This function can be called recursively to search containers.
1936	*/	1876	*/
1937
1938	object *	1877	object *
1939	find_key (object pl, object container, object *door)	1878	find_key (object pl, object container, object *door)
1940	{	1879	{
1941	object tmp, key;	1880	object tmp, key;
1942		1881
1943	/* Should not happen, but sanity checking is never bad */	1882	/* Should not happen, but sanity checking is never bad */
1944	if (container->inv == NULL)	1883	if (!container->inv)
1945	return NULL;	1884	return 0;
1946		1885
1947	/* First, lets try to find a key in the top level inventory */	1886	/* First, lets try to find a key in the top level inventory */
1948	for (tmp = container->inv; tmp != NULL; tmp = tmp->below)	1887	for (tmp = container->inv; tmp; tmp = tmp->below)
1949	{	1888	{
1950	if (door->type == DOOR && tmp->type == KEY)	1889	if (door->type == DOOR && tmp->type == KEY)
1951	break;	1890	break;
1952	/* For sanity, we should really check door type, but other stuff	1891	/* For sanity, we should really check door type, but other stuff
1953	* (like containers) can be locked with special keys	1892	* (like containers) can be locked with special keys
1954	*/	1893	*/
1955	if (tmp->slaying && tmp->type == SPECIAL_KEY && tmp->slaying == door->slaying)	1894	if (tmp->slaying && tmp->type == SPECIAL_KEY && tmp->slaying == door->slaying)
1956	break;	1895	break;
1957	}	1896	}
		1897
1958	/* No key found - lets search inventories now */	1898	/* No key found - lets search inventories now */
1959	/* If we find and use a key in an inventory, return at that time.	1899	/* If we find and use a key in an inventory, return at that time.
1960	* otherwise, if we search all the inventories and still don't find	1900	* otherwise, if we search all the inventories and still don't find
1961	* a key, return	1901	* a key, return
1962	*/	1902	*/
1963	if (!tmp)	1903	if (!tmp)
1964	{	1904	{
1965	for (tmp = container->inv; tmp != NULL; tmp = tmp->below)	1905	for (tmp = container->inv; tmp; tmp = tmp->below)
1966	{	1906	{
1967	/* No reason to search empty containers */	1907	/* No reason to search empty containers */
1968	if (tmp->type == CONTAINER && tmp->inv)	1908	if (tmp->type == CONTAINER && tmp->inv)
1969	{	1909	{
1970	if ((key = find_key (pl, tmp, door)) != NULL)	1910	if ((key = find_key (pl, tmp, door)))
1971	return key;	1911	return key;
1972	}	1912	}
1973	}	1913	}
		1914
1974	if (!tmp)	1915	if (!tmp)
1975	return NULL;	1916	return NULL;
1976	}	1917	}
		1918
1977	/* We get down here if we have found a key. Now if its in a container,	1919	/* We get down here if we have found a key. Now if its in a container,
1978	* see if we actually want to use it	1920	* see if we actually want to use it
1979	*/	1921	*/
1980	if (pl != container)	1922	if (pl != container)
1981	{	1923	{
…		…
2002	new_draw_info_format (NDI_UNIQUE \| NDI_BROWN, 0, pl,	1944	new_draw_info_format (NDI_UNIQUE \| NDI_BROWN, 0, pl,
2003	"The %s in your %s vibrates as you approach the door", query_name (tmp), query_name (container));	1945	"The %s in your %s vibrates as you approach the door", query_name (tmp), query_name (container));
2004	return NULL;	1946	return NULL;
2005	}	1947	}
2006	}	1948	}
		1949
2007	return tmp;	1950	return tmp;
2008	}	1951	}
2009		1952
2010	/* moved door processing out of move_player_attack.	1953	/* moved door processing out of move_player_attack.
2011	* returns 1 if player has opened the door with a key	1954	* returns 1 if player has opened the door with a key
…		…
2029	play_sound_map (op->map, op->x, op->y, SOUND_OPEN_DOOR);	1972	play_sound_map (op->map, op->x, op->y, SOUND_OPEN_DOOR);
2030	if (action_makes_visible (op))	1973	if (action_makes_visible (op))
2031	make_visible (op);	1974	make_visible (op);
2032	if (door->inv && (door->inv->type == RUNE \|\| door->inv->type == TRAP))	1975	if (door->inv && (door->inv->type == RUNE \|\| door->inv->type == TRAP))
2033	spring_trap (door->inv, op);	1976	spring_trap (door->inv, op);
		1977
2034	if (door->type == DOOR)	1978	if (door->type == DOOR)
2035	{
2036	hit_player (door, 9998, op, AT_PHYSICAL, 1); /* Break through the door */	1979	hit_player (door, 9998, op, AT_PHYSICAL, 1); /* Break through the door */
2037	}
2038	else if (door->type == LOCKED_DOOR)	1980	else if (door->type == LOCKED_DOOR)
2039	{	1981	{
2040	new_draw_info_format (NDI_UNIQUE, NDI_BROWN, op, "You open the door with the %s", query_short_name (key));	1982	new_draw_info_format (NDI_UNIQUE, NDI_BROWN, op, "You open the door with the %s", query_short_name (key));
2041	remove_door2 (door); /* remove door without violence ;-) */	1983	remove_door2 (door); /* remove door without violence ;-) */
2042	}	1984	}
		1985
2043	/* Do this after we print the message */	1986	/* Do this after we print the message */
2044	decrease_ob (key); /* Use up one of the keys */	1987	decrease_ob (key); /* Use up one of the keys */
2045	/* Need to update the weight the container the key was in */	1988	/* Need to update the weight the container the key was in */
2046	if (container != op)	1989	if (container != op)
2047	esrv_update_item (UPD_WEIGHT, op, container);	1990	esrv_update_item (UPD_WEIGHT, op, container);
		1991
2048	return 1; /* Nothing more to do below */	1992	return 1; /* Nothing more to do below */
2049	}	1993	}
2050	else if (door->type == LOCKED_DOOR)	1994	else if (door->type == LOCKED_DOOR)
2051	{	1995	{
2052	/* Might as well return now - no other way to open this */	1996	/* Might as well return now - no other way to open this */
2053	new_draw_info (NDI_UNIQUE \| NDI_NAVY, 0, op, door->msg);	1997	new_draw_info (NDI_UNIQUE \| NDI_NAVY, 0, op, door->msg);
2054	return 1;	1998	return 1;
2055	}	1999	}
		2000
2056	return 0;	2001	return 0;
2057	}	2002	}
2058		2003
2059	/* This function is just part of a breakup from move_player.	2004	/* This function is just part of a breakup from move_player.
2060	* It should keep the code cleaner.	2005	* It should keep the code cleaner.
…		…
2086	*/	2031	*/
2087	if ((op->contr->braced \|\| !move_ob (op, dir, op)) && !out_of_map (op->map, nx, ny))	2032	if ((op->contr->braced \|\| !move_ob (op, dir, op)) && !out_of_map (op->map, nx, ny))
2088	{	2033	{
2089	if (OUT_OF_REAL_MAP (op->map, nx, ny))	2034	if (OUT_OF_REAL_MAP (op->map, nx, ny))
2090	{	2035	{
2091	m = get_map_from_coord (op->map, &nx, &ny);	2036	m = op->map->xy_find (nx, ny);
2092	if (!m)	2037	if (!m)
2093	return; /* Don't think this should happen */	2038	return; /* Don't think this should happen */
2094	}	2039	}
2095	else	2040	else
2096	m = op->map;	2041	m = op->map;
2097		2042
2098	if ((tmp = GET_MAP_OB (m, nx, ny)) == NULL)	2043	if (!(tmp = m->at (nx, ny).bot))
2099	{
2100	/* LOG(llevError,"player_move_attack: GET_MAP_OB returns NULL, but player can not move there.\n"); */
2101	return;	2044	return;
2102	}
2103		2045
2104	mon = 0;	2046	mon = 0;
2105	/* Go through all the objects, and find ones of interest. Only stop if	2047	/* Go through all the objects, and find ones of interest. Only stop if
2106	* we find a monster - that is something we know we want to attack.	2048	* we find a monster - that is something we know we want to attack.
2107	* if its a door or barrel (can roll) see if there may be monsters	2049	* if its a door or barrel (can roll) see if there may be monsters
…		…
2160	&& (QUERY_FLAG (mon, FLAG_UNAGGRESSIVE) \|\| QUERY_FLAG (mon, FLAG_FRIENDLY)))	2102	&& (QUERY_FLAG (mon, FLAG_UNAGGRESSIVE) \|\| QUERY_FLAG (mon, FLAG_FRIENDLY)))
2161	{	2103	{
2162	/* If we're braced, we don't want to switch places with it */	2104	/* If we're braced, we don't want to switch places with it */
2163	if (op->contr->braced)	2105	if (op->contr->braced)
2164	return;	2106	return;
		2107
2165	play_sound_map (op->map, op->x, op->y, SOUND_PUSH_PLAYER);	2108	play_sound_map (op->map, op->x, op->y, SOUND_PUSH_PLAYER);
2166	(void) push_ob (mon, dir, op);	2109	(void) push_ob (mon, dir, op);
2167	if (op->contr->tmp_invis \|\| op->hide)	2110	if (op->contr->tmp_invis \|\| op->hide)
2168	make_visible (op);	2111	make_visible (op);
		2112
2169	return;	2113	return;
2170	}	2114	}
2171		2115
2172	/* in certain circumstances, you shouldn't attack friendly	2116	/* in certain circumstances, you shouldn't attack friendly
2173	* creatures. Note that if you are braced, you can't push	2117	* creatures. Note that if you are braced, you can't push
…		…
2187	!on_battleground))	2131	!on_battleground))
2188	{	2132	{
2189	if (!op->contr->braced)	2133	if (!op->contr->braced)
2190	{	2134	{
2191	play_sound_map (op->map, op->x, op->y, SOUND_PUSH_PLAYER);	2135	play_sound_map (op->map, op->x, op->y, SOUND_PUSH_PLAYER);
2192	(void) push_ob (mon, dir, op);	2136	push_ob (mon, dir, op);
2193	}	2137	}
2194	else	2138	else
2195	new_draw_info (0, 0, op, "You withhold your attack");	2139	new_draw_info (0, 0, op, "You withhold your attack");
2196		2140
2197	if (op->contr->tmp_invis \|\| op->hide)	2141	if (op->contr->tmp_invis \|\| op->hide)
…		…
2212	* Way it works is like this: First, it must have some hit points	2156	* Way it works is like this: First, it must have some hit points
2213	* and be living. Then, it must be one of the following:	2157	* and be living. Then, it must be one of the following:
2214	* 1) Not a player, 2) A player, but of a different party. Note	2158	* 1) Not a player, 2) A player, but of a different party. Note
2215	* that party_number -1 is no party, so attacks can still happen.	2159	* that party_number -1 is no party, so attacks can still happen.
2216	*/	2160	*/
2217
2218	else if ((mon->stats.hp >= 0) && QUERY_FLAG (mon, FLAG_ALIVE) &&	2161	else if ((mon->stats.hp >= 0) && QUERY_FLAG (mon, FLAG_ALIVE) &&
2219	((mon->type != PLAYER \|\| op->contr->party == NULL \|\| op->contr->party != mon->contr->party)))	2162	((mon->type != PLAYER \|\| op->contr->party == NULL \|\| op->contr->party != mon->contr->party)))
2220	{	2163	{
2221		2164
2222	/* If the player hasn't hit something this tick, and does	2165	/* If the player hasn't hit something this tick, and does
…		…
2256	int	2199	int
2257	move_player (object *op, int dir)	2200	move_player (object *op, int dir)
2258	{	2201	{
2259	int pick;	2202	int pick;
2260		2203
2261	if (op->map == NULL \|\| op->map->in_memory != MAP_IN_MEMORY)	2204	if (!op->map \|\| op->map->in_memory != MAP_IN_MEMORY)
2262	return 0;	2205	return 0;
2263		2206
2264	/* Sanity check: make sure dir is valid */	2207	/* Sanity check: make sure dir is valid */
2265	if ((dir < 0) \|\| (dir >= 9))	2208	if ((dir < 0) \|\| (dir >= 9))
2266	{	2209	{
2267	LOG (llevError, "move_player: invalid direction %d\n", dir);	2210	LOG (llevError, "move_player: invalid direction %d\n", dir);
2268	return 0;	2211	return 0;
2269	}	2212	}
2270		2213
2271	/* peterm: added following line */	2214	/* peterm: added following line */
2272	if (QUERY_FLAG (op, FLAG_CONFUSED) && dir)	2215	if (QUERY_FLAG (op, FLAG_CONFUSED) && dir)
2273	dir = absdir (dir + RANDOM () % 3 + RANDOM () % 3 - 2);	2216	dir = absdir (dir + rndm (3) + rndm (3) - 2);
2274		2217
2275	op->facing = dir;	2218	op->facing = dir;
2276		2219
2277	if (op->hide)	2220	if (op->hide)
2278	do_hidden_move (op);	2221	do_hidden_move (op);
…		…
2354		2297
2355	/* call this here - we also will call this in do_ericserver, but	2298	/* call this here - we also will call this in do_ericserver, but
2356	* the players time has been increased when doericserver has been	2299	* the players time has been increased when doericserver has been
2357	* called, so we recheck it here.	2300	* called, so we recheck it here.
2358	*/	2301	*/
2359	//TODO: better than handling 8 commands, use some more intelligent rate-limiting	2302	if (op->contr->ns->handle_command ())
2360	for (int rep = 8; --rep && op->contr->ns->handle_command (); )	2303	return 1;
2361	;
2362		2304
2363	if (op->speed_left < 0)	2305	if (op->speed_left > 0)
2364	return 0;	2306	{
2365
2366	if (op->direction && (op->contr->run_on \|\| op->contr->fire_on))	2307	if (op->direction && (op->contr->run_on \|\| op->contr->fire_on))
2367	{	2308	{
2368	/* All move commands take 1 tick, at least for now */	2309	/* All move commands take 1 tick, at least for now */
2369	op->speed_left--;	2310	op->speed_left--;
2370		2311
2371	/* Instead of all the stuff below, let move_player take care	2312	/* Instead of all the stuff below, let move_player take care
2372	* of it. Also, some of the skill stuff is only put in	2313	* of it. Also, some of the skill stuff is only put in
2373	* there, as well as the confusion stuff.	2314	* there, as well as the confusion stuff.
2374	*/	2315	*/
2375	move_player (op, op->direction);	2316	move_player (op, op->direction);
2376	if (op->speed_left > 0)	2317
2377	return 1;	2318	return op->speed_left > 0;
2378	else	2319	}
2379	return 0;
2380	}	2320	}
2381		2321
2382	return 0;	2322	return 0;
2383	}	2323	}
2384		2324
…		…
2422	* from.	2362	* from.
2423	*/	2363	*/
2424	void	2364	void
2425	remove_unpaid_objects (object op, object env)	2365	remove_unpaid_objects (object op, object env)
2426	{	2366	{
2427	object *next;
2428
2429	while (op)	2367	while (op)
2430	{	2368	{
2431	next = op->below; /* Make sure we have a good value, in case	2369	object next = op->below; / Make sure we have a good value, in case we remove object 'op' */
2432	* we remove object 'op'	2370
2433	*/
2434	if (QUERY_FLAG (op, FLAG_UNPAID))	2371	if (QUERY_FLAG (op, FLAG_UNPAID))
2435	{	2372	{
2436	op->remove ();
2437	op->x = env->x;
2438	op->y = env->y;
2439	if (env->type == PLAYER)	2373	if (env->type == PLAYER)
2440	esrv_del_item (env->contr, op->count);	2374	esrv_del_item (env->contr, op->count);
2441	insert_ob_in_map (op, env->map, NULL, 0);	2375
		2376	op->insert_at (env);
2442	}	2377	}
2443	else if (op->inv)	2378	else if (op->inv)
2444	remove_unpaid_objects (op->inv, env);	2379	remove_unpaid_objects (op->inv, env);
2445		2380
2446	op = next;	2381	op = next;
…		…
2739	new_draw_info (NDI_UNIQUE \| NDI_NAVY, 0, op, "You have been defeated in combat!");	2674	new_draw_info (NDI_UNIQUE \| NDI_NAVY, 0, op, "You have been defeated in combat!");
2740	new_draw_info (NDI_UNIQUE \| NDI_NAVY, 0, op, "Local medics have saved your life...");	2675	new_draw_info (NDI_UNIQUE \| NDI_NAVY, 0, op, "Local medics have saved your life...");
2741		2676
2742	/* restore player */	2677	/* restore player */
2743	at = archetype::find ("poisoning");	2678	at = archetype::find ("poisoning");
2744	tmp = present_arch_in_ob (at, op);	2679	if (object *tmp = present_arch_in_ob (at, op))
2745	if (tmp)
2746	{	2680	{
2747	tmp->destroy ();	2681	tmp->destroy ();
2748	new_draw_info (NDI_UNIQUE, 0, op, "Your body feels cleansed");	2682	new_draw_info (NDI_UNIQUE, 0, op, "Your body feels cleansed");
2749	}	2683	}
2750		2684
2751	at = archetype::find ("confusion");	2685	at = archetype::find ("confusion");
2752	tmp = present_arch_in_ob (at, op);	2686	if (object *tmp = present_arch_in_ob (at, op))
2753	if (tmp)
2754	{	2687	{
2755	tmp->destroy ();	2688	tmp->destroy ();
2756	new_draw_info (NDI_UNIQUE, 0, tmp, "Your mind feels clearer");	2689	new_draw_info (NDI_UNIQUE, 0, tmp, "Your mind feels clearer");
2757	}	2690	}
2758		2691
…		…
2760	op->stats.hp = op->stats.maxhp;	2693	op->stats.hp = op->stats.maxhp;
2761	if (op->stats.food <= 0)	2694	if (op->stats.food <= 0)
2762	op->stats.food = 999;	2695	op->stats.food = 999;
2763		2696
2764	/* create a bodypart-trophy to make the winner happy */	2697	/* create a bodypart-trophy to make the winner happy */
2765	tmp = arch_to_object (archetype::find ("finger"));	2698	if (object *tmp = arch_to_object (archetype::find ("finger")))
2766	if (tmp != NULL)
2767	{	2699	{
2768	sprintf (buf, "%s's finger", &op->name);	2700	sprintf (buf, "%s's finger", &op->name);
2769	tmp->name = buf;	2701	tmp->name = buf;
2770	sprintf (buf, " This finger has been cut off %s\n"	2702	sprintf (buf, " This finger has been cut off %s\n"
2771	" the %s, when he was defeated at\n level %d by %s.\n",	2703	" the %s, when he was defeated at\n level %d by %s.\n",
2772	&op->name, op->contr->title, (int) (op->level), op->contr->killer);	2704	&op->name, op->contr->title, (int) (op->level), op->contr->killer);
2773	tmp->msg = buf;	2705	tmp->msg = buf;
2774	tmp->value = 0, tmp->material = 0, tmp->type = 0;	2706	tmp->value = 0, tmp->type = 0;
2775	tmp->materialname = NULL;	2707	tmp->materialname = "organics";
2776	tmp->x = op->x, tmp->y = op->y;	2708	tmp->insert_at (op, tmp);
2777	insert_ob_in_map (tmp, op->map, op, 0);
2778	}	2709	}
2779		2710
2780	/* teleport defeated player to new destination */	2711	/* teleport defeated player to new destination */
2781	transfer_ob (op, x, y, 0, NULL);	2712	transfer_ob (op, x, y, 0, NULL);
2782	op->contr->braced = 0;	2713	op->contr->braced = 0;
…		…
2787		2718
2788	command_kill_pets (op, 0);	2719	command_kill_pets (op, 0);
2789		2720
2790	if (op->stats.food < 0)	2721	if (op->stats.food < 0)
2791	{	2722	{
2792	if (op->contr->explore)
2793	{
2794	new_draw_info (NDI_UNIQUE, 0, op, "You would have starved, but you are");
2795	new_draw_info (NDI_UNIQUE, 0, op, "in explore mode, so...");
2796	op->stats.food = 999;
2797	return;
2798	}
2799	sprintf (buf, "%s starved to death.", &op->name);	2723	sprintf (buf, "%s starved to death.", &op->name);
2800	strcpy (op->contr->killer, "starvation");	2724	strcpy (op->contr->killer, "starvation");
2801	}	2725	}
2802	else	2726	else
2803	{
2804	if (op->contr->explore)
2805	{
2806	new_draw_info (NDI_UNIQUE, 0, op, "You would have died, but you are");
2807	new_draw_info (NDI_UNIQUE, 0, op, "in explore mode, so...");
2808	op->stats.hp = op->stats.maxhp;
2809	return;
2810	}
2811	sprintf (buf, "%s died.", &op->name);	2727	sprintf (buf, "%s died.", &op->name);
2812	}	2728
2813	play_sound_player_only (op->contr, SOUND_PLAYER_DIES, 0, 0);	2729	play_sound_player_only (op->contr, SOUND_PLAYER_DIES, 0, 0);
2814		2730
2815	/* save the map location for corpse, gravestone */	2731	/* save the map location for corpse, gravestone */
2816	x = op->x;	2732	x = op->x;
2817	y = op->y;	2733	y = op->y;
2818	map = op->map;	2734	map = op->map;
2819
2820		2735
2821	/* NOT_PERMADEATH code. This basically brings the character back to	2736	/* NOT_PERMADEATH code. This basically brings the character back to
2822	* life if they are dead - it takes some exp and a random stat.	2737	* life if they are dead - it takes some exp and a random stat.
2823	* See the config.h file for a little more in depth detail about this.	2738	* See the config.h file for a little more in depth detail about this.
2824	*/	2739	*/
…		…
2841	num_stats_lose = 1;	2756	num_stats_lose = 1;
2842	else	2757	else
2843	num_stats_lose = 1 + op->level / BALSL_NUMBER_LOSSES_RATIO;	2758	num_stats_lose = 1 + op->level / BALSL_NUMBER_LOSSES_RATIO;
2844	}	2759	}
2845	else	2760	else
2846	{
2847	num_stats_lose = 1;	2761	num_stats_lose = 1;
2848	}	2762
2849	lost_a_stat = 0;	2763	lost_a_stat = 0;
2850		2764
2851	for (z = 0; z < num_stats_lose; z++)	2765	for (z = 0; z < num_stats_lose; z++)
2852	{	2766	{
2853	i = RANDOM () % NUM_STATS;	2767	i = RANDOM () % NUM_STATS;
…		…
3011	/* */	2925	/* */
3012	/****************************************/	2926	/****************************************/
3013		2927
3014	enter_player_savebed (op);	2928	enter_player_savebed (op);
3015		2929
3016	/* Save the player before inserting the force to reduce
3017	* chance of abuse.
3018	*/
3019	op->contr->braced = 0;	2930	op->contr->braced = 0;
3020	op->contr->save ();
3021		2931
3022	/* it is possible that the player has blown something up	2932	/* it is possible that the player has blown something up
3023	* at his savebed location, and that can have long lasting	2933	* at his savebed location, and that can have long lasting
3024	* spell effects. So first see if there is a spell effect	2934	* spell effects. So first see if there is a spell effect
3025	* on the space that might harm the player.	2935	* on the space that might harm the player.
…		…
3054	void	2964	void
3055	loot_object (object *op)	2965	loot_object (object *op)
3056	{ /* Grab and destroy some treasure */	2966	{ /* Grab and destroy some treasure */
3057	object tmp, tmp2, *next;	2967	object tmp, tmp2, *next;
3058		2968
3059	if (op->container)	2969	op->close_container (); /* close open sack first */
3060	esrv_apply_container (op, op->container); /* close open sack first */
3061		2970
3062	for (tmp = op->inv; tmp; tmp = next)	2971	for (tmp = op->inv; tmp; tmp = next)
3063	{	2972	{
3064	next = tmp->below;	2973	next = tmp->below;
3065		2974
3066	if (tmp->invisible)	2975	if (tmp->invisible)
3067	continue;	2976	continue;
3068		2977
3069	tmp->remove ();	2978	tmp->remove ();
3070	tmp->x = op->x, tmp->y = op->y;	2979	tmp->x = op->x, tmp->y = op->y;
		2980
3071	if (tmp->type == CONTAINER)	2981	if (tmp->type == CONTAINER)
3072	{ /* empty container to ground */	2982	loot_object (tmp); /* empty container to ground */
3073	loot_object (tmp);	2983
3074	}
3075	if (!QUERY_FLAG (tmp, FLAG_UNIQUE) && (QUERY_FLAG (tmp, FLAG_STARTEQUIP) \|\| QUERY_FLAG (tmp, FLAG_NO_DROP) \|\| !(RANDOM () % 3)))	2984	if (!QUERY_FLAG (tmp, FLAG_UNIQUE) && (QUERY_FLAG (tmp, FLAG_STARTEQUIP) \|\| QUERY_FLAG (tmp, FLAG_NO_DROP) \|\| !(rndm (3))))
3076	{	2985	{
3077	if (tmp->nrof > 1)	2986	if (tmp->nrof > 1)
3078	{	2987	{
3079	tmp2 = get_split_ob (tmp, 1 + RANDOM () % (tmp->nrof - 1));	2988	tmp2 = get_split_ob (tmp, 1 + RANDOM () % (tmp->nrof - 1));
3080	tmp2->destroy ();	2989	tmp2->destroy ();
…		…
3091	/*	3000	/*
3092	* fix_weight(): Check recursively the weight of all players, and fix	3001	* fix_weight(): Check recursively the weight of all players, and fix
3093	* what needs to be fixed. Refresh windows and fix speed if anything	3002	* what needs to be fixed. Refresh windows and fix speed if anything
3094	* was changed.	3003	* was changed.
3095	*/	3004	*/
3096
3097	void	3005	void
3098	fix_weight (void)	3006	fix_weight (void)
3099	{	3007	{
3100	for (player *pl = first_player; pl; pl = pl->next)	3008	for_all_players (pl)
3101	{	3009	{
3102	int old = pl->ob->carrying, sum = sum_weight (pl->ob);	3010	int old = pl->ob->carrying, sum = sum_weight (pl->ob);
3103		3011
3104	if (old == sum)	3012	if (old == sum)
3105	continue;	3013	continue;
…		…
3109	}	3017	}
3110		3018
3111	void	3019	void
3112	fix_luck (void)	3020	fix_luck (void)
3113	{	3021	{
3114	for (player *pl = first_player; pl; pl = pl->next)	3022	for_all_players (pl)
3115	if (!pl->ob->contr->ns->state)	3023	if (!pl->ob->contr->ns->state)
3116	pl->ob->change_luck (0);	3024	pl->ob->change_luck (0);
3117	}	3025	}
3118		3026
3119	/* cast_dust() - handles op throwing objects of type 'DUST'.	3027	/* cast_dust() - handles op throwing objects of type 'DUST'.
…		…
3237		3145
3238	skop = find_obj_by_type_subtype (op, SKILL, SK_HIDING);	3146	skop = find_obj_by_type_subtype (op, SKILL, SK_HIDING);
3239		3147
3240	/* 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! */
3241	if (op->type == PLAYER && op->contr->run_on)	3149	if (op->type == PLAYER && op->contr->run_on)
3242	{
3243	if (!skop \|\| num >= skop->level)	3150	if (!skop \|\| num >= skop->level)
3244	{	3151	{
3245	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!");
3246	make_visible (op);	3153	make_visible (op);
3247	return;	3154	return;
3248	}	3155	}
3249	else	3156	else
3250	num += 20;	3157	num += 20;
3251	}	3158
3252	num += op->map->difficulty;	3159	num += op->map->difficulty;
3253	hide = hideability (op); /* modify by terrain hidden level */	3160	hide = hideability (op); /* modify by terrain hidden level */
3254	num -= hide;	3161	num -= hide;
		3162
3255	if ((op->type == PLAYER && hide < -10) \|\| ((op->invisible -= num) <= 0))	3163	if ((op->type == PLAYER && hide < -10) \|\| ((op->invisible -= num) <= 0))
3256	{	3164	{
3257	make_visible (op);	3165	make_visible (op);
3258	if (op->type == PLAYER)	3166	if (op->type == PLAYER)
3259	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!");
3260	}	3168	}
3261	else if (op->type == PLAYER && skop)	3169	else if (op->type == PLAYER && skop)
3262	{
3263	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);
3264	}
3265	}	3171	}
3266		3172
3267	/* determine if who is standing near a hostile creature. */	3173	/* determine if who is standing near a hostile creature. */
3268		3174
3269	int	3175	int
…		…
3336	if (pl->type != PLAYER)	3242	if (pl->type != PLAYER)
3337	{	3243	{
3338	LOG (llevError, "player_can_view() called for non-player object\n");	3244	LOG (llevError, "player_can_view() called for non-player object\n");
3339	return -1;	3245	return -1;
3340	}	3246	}
		3247
3341	if (!pl \|\| !op)	3248	if (!pl \|\| !op)
3342	return 0;	3249	return 0;
3343		3250
3344	if (op->head)
3345	{
3346	op = op->head;	3251	op = op->head_ ();
3347	}	3252
3348	get_rangevector (pl, op, &rv, 0x1);	3253	get_rangevector (pl, op, &rv, 0x1);
3349		3254
3350	/* starting with the 'head' part, lets loop	3255	/* starting with the 'head' part, lets loop
3351	* through the object and find if it has any	3256	* through the object and find if it has any
3352	* part that is in the los array but isnt on	3257	* part that is in the los array but isnt on
…		…
3482	if (trlist == NULL \|\| who->type != PLAYER)	3387	if (trlist == NULL \|\| who->type != PLAYER)
3483	return;	3388	return;
3484		3389
3485	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++);
3486		3391
3487	if (tr == NULL \|\| tr->item == NULL)	3392	if (!tr \|\| !tr->item)
3488	{	3393	{
3489	/* 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]); */
3490	return;	3395	return;
3491	}	3396	}
3492		3397
…		…
3617	* not readied.	3522	* not readied.
3618	*/	3523	*/
3619	void	3524	void
3620	player_unready_range_ob (player pl, object ob)	3525	player_unready_range_ob (player pl, object ob)
3621	{	3526	{
3622	rangetype i;
3623
3624	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))
3625	{
3626	if (pl->ranges[i] == ob)	3528	if (pl->ranges[i] == ob)
3627	{	3529	{
3628	pl->ranges[i] = NULL;	3530	pl->ranges[i] = 0;
3629	if (pl->shoottype == i)	3531	if (pl->shoottype == i)
3630	{
3631	pl->shoottype = range_none;	3532	pl->shoottype = range_none;
3632	}
3633	}	3533	}
3634	}
3635	}	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.56 by root, Sat Dec 23 05:25:18 2006 UTC vs. Revision 1.104 by root, Fri Feb 16 19:43:41 2007 UTC

Diff Legend

Comparing deliantra/server/server/player.C (file contents):
Revision 1.56 by root, Sat Dec 23 05:25:18 2006 UTC vs.
Revision 1.104 by root, Fri Feb 16 19:43:41 2007 UTC