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

Comparing deliantra/server/common/object.C (file contents):
Revision 1.142 by root, Mon Apr 30 04:25:29 2007 UTC vs.
Revision 1.201 by root, Tue Jan 22 16:22:45 2008 UTC

…		…
1	/*	1	/*
2	* CrossFire, A Multiplayer game	2	* This file is part of Deliantra, the Roguelike Realtime MMORPG.
3	*	3	*
4	* Copyright (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team	4	* Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
5	* Copyright (C) 2001 Mark Wedel & Crossfire Development Team	5	* Copyright (©) 2001,2007 Mark Wedel & Crossfire Development Team
6	* Copyright (C) 1992 Frank Tore Johansen	6	* Copyright (©) 1992,2007 Frank Tore Johansen
7	*	7	*
8	* This program is free software; you can redistribute it and/or modify	8	* Deliantra is free software: you can redistribute it and/or modify
9	* 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
10	* the Free Software Foundation; either version 2 of the License, or	10	* the Free Software Foundation, either version 3 of the License, or
11	* (at your option) any later version.	11	* (at your option) any later version.
12	*	12	*
13	* This program is distributed in the hope that it will be useful,	13	* This program is distributed in the hope that it will be useful,
14	* but WITHOUT ANY WARRANTY; without even the implied warranty of	14	* but WITHOUT ANY WARRANTY; without even the implied warranty of
15	* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the	15	* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16	* GNU General Public License for more details.	16	* GNU General Public License for more details.
17	*	17	*
18	* You should have received a copy of the GNU General Public License	18	* You should have received a copy of the GNU General Public License
19	* along with this program; if not, write to the Free Software	19	* along with this program. If not, see <http://www.gnu.org/licenses/>.
20	* Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
21	*	20	*
22	* The authors can be reached via e-mail at <crossfire@schmorp.de>	21	* The authors can be reached via e-mail to <support@deliantra.net>
23	*/	22	*/
24		23
25	/* Eneq(@csd.uu.se): Added weight-modifiers in environment of objects.	24	/* Eneq(@csd.uu.se): Added weight-modifiers in environment of objects.
26	sub/add_weight will transcend the environment updating the carrying	25	sub/add_weight will transcend the environment updating the carrying
27	variable. */	26	variable. */
29	#include <stdio.h>	28	#include <stdio.h>
30	#include <sys/types.h>	29	#include <sys/types.h>
31	#include <sys/uio.h>	30	#include <sys/uio.h>
32	#include <object.h>	31	#include <object.h>
33	#include <funcpoint.h>	32	#include <funcpoint.h>
		33	#include <sproto.h>
34	#include <loader.h>	34	#include <loader.h>
35		35
36	#include <bitset>	36	#include <bitset>
37		37
38	int nrofallocobjects = 0;	38	int nrofallocobjects = 0;
…		…
254	/* This is really a spellbook check - really, we should	254	/* This is really a spellbook check - really, we should
255	* check all objects in the inventory.	255	* check all objects in the inventory.
256	*/	256	*/
257	if (ob1->inv \|\| ob2->inv)	257	if (ob1->inv \|\| ob2->inv)
258	{	258	{
259	/* if one object has inventory but the other doesn't, not equiv */	259	if (!(ob1->inv && ob2->inv))
260	if ((ob1->inv && !ob2->inv) \|\| (ob2->inv && !ob1->inv))	260	return 0; /* inventories differ in length */
261	return 0;
262		261
263	/* Now check to see if the two inventory objects could merge */	262	if (ob1->inv->below \|\| ob2->inv->below)
		263	return 0; /* more than one object in inv */
		264
264	if (!object::can_merge (ob1->inv, ob2->inv))	265	if (!object::can_merge (ob1->inv, ob2->inv))
265	return 0;	266	return 0; /* inventory objexts differ */
266		267
267	/* inventory ok - still need to check rest of this object to see	268	/* inventory ok - still need to check rest of this object to see
268	* if it is valid.	269	* if it is valid.
269	*/	270	*/
270	}	271	}
…		…
299	return 0;	300	return 0;
300	else if (!compare_ob_value_lists (ob1, ob2))	301	else if (!compare_ob_value_lists (ob1, ob2))
301	return 0;	302	return 0;
302	}	303	}
303		304
304	//TODO: generate an event or call into perl for additional checks
305	if (ob1->self \|\| ob2->self)	305	if (ob1->self \|\| ob2->self)
306	{	306	{
307	ob1->optimise ();	307	ob1->optimise ();
308	ob2->optimise ();	308	ob2->optimise ();
309		309
310	if (ob1->self \|\| ob2->self)	310	if (ob1->self \|\| ob2->self)
		311	{
		312	int k1 = ob1->self ? HvTOTALKEYS (ob1->self) : 0;
		313	int k2 = ob2->self ? HvTOTALKEYS (ob2->self) : 0;
		314
		315	if (k1 != k2)
311	return 0;	316	return 0;
		317	else if (k1 == 0)
		318	return 1;
		319	else if (!cfperl_can_merge (ob1, ob2))
		320	return 0;
		321	}
312	}	322	}
313		323
314	/* Everything passes, must be OK. */	324	/* Everything passes, must be OK. */
315	return 1;	325	return 1;
316	}	326	}
…		…
374	/*	384	/*
375	* get_nearest_part(multi-object, object 2) returns the part of the	385	* get_nearest_part(multi-object, object 2) returns the part of the
376	* multi-object 1 which is closest to the second object.	386	* multi-object 1 which is closest to the second object.
377	* If it's not a multi-object, it is returned.	387	* If it's not a multi-object, it is returned.
378	*/	388	*/
379
380	object *	389	object *
381	get_nearest_part (object op, const object pl)	390	get_nearest_part (object op, const object pl)
382	{	391	{
383	object tmp, closest;	392	object tmp, closest;
384	int last_dist, i;	393	int last_dist, i;
…		…
429	}	438	}
430		439
431	/*	440	/*
432	* Sets the owner and sets the skill and exp pointers to owner's current	441	* Sets the owner and sets the skill and exp pointers to owner's current
433	* skill and experience objects.	442	* skill and experience objects.
		443	* ACTUALLY NO! investigate! TODO
434	*/	444	*/
435	void	445	void
436	object::set_owner (object *owner)	446	object::set_owner (object *owner)
437	{	447	{
		448	// allow objects which own objects
438	if (!owner)	449	if (owner)
439	return;
440
441	/* next line added to allow objects which own objects */
442	/* Add a check for ownercounts in here, as I got into an endless loop
443	* with the fireball owning a poison cloud which then owned the
444	* fireball. I believe that was caused by one of the objects getting
445	* freed and then another object replacing it. Since the ownercounts
446	* didn't match, this check is valid and I believe that cause is valid.
447	*/
448	while (owner->owner)	450	while (owner->owner)
449	owner = owner->owner;	451	owner = owner->owner;
		452
		453	if (flag [FLAG_FREED])
		454	{
		455	LOG (llevError \| logBacktrace, "tried to set owner of %s to %s\n", debug_desc (), owner->debug_desc ());
		456	return;
		457	}
450		458
451	this->owner = owner;	459	this->owner = owner;
		460	}
		461
		462	int
		463	object::slottype () const
		464	{
		465	if (type == SKILL)
		466	{
		467	if (IS_COMBAT_SKILL (subtype)) return slot_combat;
		468	if (IS_RANGED_SKILL (subtype)) return slot_ranged;
		469	}
		470	else
		471	{
		472	if (slot [body_combat].info) return slot_combat;
		473	if (slot [body_range ].info) return slot_ranged;
		474	}
		475
		476	return slot_none;
		477	}
		478
		479	bool
		480	object::change_weapon (object *ob)
		481	{
		482	if (current_weapon == ob)
		483	return true;
		484
		485	if (chosen_skill)
		486	chosen_skill->flag [FLAG_APPLIED] = false;
		487
		488	current_weapon = ob;
		489	chosen_skill = !ob \|\| ob->type == SKILL ? ob : find_skill_by_name (this, ob->skill);
		490
		491	if (chosen_skill)
		492	chosen_skill->flag [FLAG_APPLIED] = true;
		493
		494	update_stats ();
		495
		496	if (ob)
		497	{
		498	// now check wether any body locations became invalid, in which case
		499	// we cannot apply the weapon at the moment.
		500	for (int i = 0; i < NUM_BODY_LOCATIONS; ++i)
		501	if (slot[i].used < 0)
		502	{
		503	current_weapon = chosen_skill = 0;
		504	update_stats ();
		505
		506	new_draw_info_format (NDI_UNIQUE, 0, this,
		507	"You try to balance all your items at once, "
		508	"but the %s is just too much for your body. "
		509	"[You need to unapply some items first.]", &ob->name);
		510	return false;
		511	}
		512
		513	//new_draw_info_format (NDI_UNIQUE, 0, this, "You switch to your %s.", &ob->name);
		514	}
		515	else
		516	;//new_draw_info_format (NDI_UNIQUE, 0, this, "You unwield your weapons.");
		517
		518	if (ob && !ob->flag [FLAG_APPLIED] && ob->type != SPELL)
		519	{
		520	LOG (llevError \| logBacktrace, "%s changed to unapplied weapon %s",
		521	&name, ob->debug_desc ());
		522	return false;
		523	}
		524
		525	return true;
452	}	526	}
453		527
454	/* Zero the key_values on op, decrementing the shared-string	528	/* Zero the key_values on op, decrementing the shared-string
455	* refcounts and freeing the links.	529	* refcounts and freeing the links.
456	*/	530	*/
…		…
520	object::copy_to (object *dst)	594	object::copy_to (object *dst)
521	{	595	{
522	dst = this;	596	dst = this;
523		597
524	if (speed < 0)	598	if (speed < 0)
525	dst->speed_left = speed_left - rndm ();	599	dst->speed_left -= rndm ();
526		600
527	dst->set_speed (dst->speed);	601	dst->set_speed (dst->speed);
528	}	602	}
529		603
530	void	604	void
…		…
538	* need for monsters, but doesn't hurt to do it for everything.	612	* need for monsters, but doesn't hurt to do it for everything.
539	* by doing so, when a monster is created, it has good starting	613	* by doing so, when a monster is created, it has good starting
540	* values for the body_used info, so when items are created	614	* values for the body_used info, so when items are created
541	* for it, they can be properly equipped.	615	* for it, they can be properly equipped.
542	*/	616	*/
543	memcpy (body_used, body_info, sizeof (body_used));	617	for (int i = NUM_BODY_LOCATIONS; i--; )
		618	slot[i].used = slot[i].info;
544		619
545	attachable::instantiate ();	620	attachable::instantiate ();
546	}	621	}
547		622
548	object *	623	object *
…		…
856		931
857	if (!freed_map)	932	if (!freed_map)
858	{	933	{
859	freed_map = new maptile;	934	freed_map = new maptile;
860		935
		936	freed_map->path = "<freed objects map>";
861	freed_map->name = "/internal/freed_objects_map";	937	freed_map->name = "/internal/freed_objects_map";
862	freed_map->width = 3;	938	freed_map->width = 3;
863	freed_map->height = 3;	939	freed_map->height = 3;
		940	freed_map->nodrop = 1;
864		941
865	freed_map->alloc ();	942	freed_map->alloc ();
866	freed_map->in_memory = MAP_IN_MEMORY;	943	freed_map->in_memory = MAP_IN_MEMORY;
867	}	944	}
868		945
869	map = freed_map;	946	map = freed_map;
870	x = 1;	947	x = 1;
871	y = 1;	948	y = 1;
872	}	949	}
873		950
874	head = 0;
875
876	if (more)	951	if (more)
877	{	952	{
878	more->destroy ();	953	more->destroy ();
879	more = 0;	954	more = 0;
880	}	955	}
881		956
		957	head = 0;
		958
882	// clear those pointers that likely might have circular references to us	959	// clear those pointers that likely might cause circular references
883	owner = 0;	960	owner = 0;
884	enemy = 0;	961	enemy = 0;
885	attacked_by = 0;	962	attacked_by = 0;
		963	current_weapon = 0;
886	}	964	}
887		965
888	void	966	void
889	object::destroy (bool destroy_inventory)	967	object::destroy (bool destroy_inventory)
890	{	968	{
891	if (destroyed ())	969	if (destroyed ())
892	return;	970	return;
893		971
894	if (destroy_inventory)	972	if (destroy_inventory)
895	destroy_inv (false);	973	destroy_inv (false);
		974
		975	if (is_head ())
		976	if (sound_destroy)
		977	play_sound (sound_destroy);
		978	else if (flag [FLAG_MONSTER])
		979	play_sound (sound_find ("monster_destroy")); // quick hack, too lazy to create a generic mechanism
896		980
897	attachable::destroy ();	981	attachable::destroy ();
898	}	982	}
899		983
900	/*	984	/*
…		…
1015	if (map->in_memory == MAP_SAVING)	1099	if (map->in_memory == MAP_SAVING)
1016	return;	1100	return;
1017		1101
1018	int check_walk_off = !flag [FLAG_NO_APPLY];	1102	int check_walk_off = !flag [FLAG_NO_APPLY];
1019		1103
		1104	if (object *pl = ms.player ())
		1105	{
		1106	if (pl->container == this)
		1107	/* If a container that the player is currently using somehow gets
		1108	* removed (most likely destroyed), update the player view
		1109	* appropriately.
		1110	*/
		1111	pl->close_container ();
		1112
		1113	pl->contr->ns->floorbox_update ();
		1114	}
		1115
1020	for (tmp = ms.bot; tmp; tmp = tmp->above)	1116	for (tmp = ms.bot; tmp; tmp = tmp->above)
1021	{	1117	{
1022	/* No point updating the players look faces if he is the object	1118	/* No point updating the players look faces if he is the object
1023	* being removed.	1119	* being removed.
1024	*/	1120	*/
1025
1026	if (tmp->type == PLAYER && tmp != this)
1027	{
1028	/* If a container that the player is currently using somehow gets
1029	* removed (most likely destroyed), update the player view
1030	* appropriately.
1031	*/
1032	if (tmp->container == this)
1033	{
1034	flag [FLAG_APPLIED] = 0;
1035	tmp->container = 0;
1036	}
1037
1038	if (tmp->contr->ns)
1039	tmp->contr->ns->floorbox_update ();
1040	}
1041		1121
1042	/* See if object moving off should effect something */	1122	/* See if object moving off should effect something */
1043	if (check_walk_off	1123	if (check_walk_off
1044	&& ((move_type & tmp->move_off)	1124	&& ((move_type & tmp->move_off)
1045	&& (move_type & ~tmp->move_off & ~tmp->move_block) == 0))	1125	&& (move_type & ~tmp->move_off & ~tmp->move_block) == 0))
…		…
1048		1128
1049	if (destroyed ())	1129	if (destroyed ())
1050	LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ());	1130	LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ());
1051	}	1131	}
1052		1132
1053	/* Eneq(@csd.uu.se): Fixed this to skip tmp->above=tmp */
1054	//TODO: why is this horrible hacka fix? get rid of this code=bug! (schmorp)
1055	if (tmp->above == tmp)
1056	tmp->above = 0;
1057
1058	last = tmp;	1133	last = tmp;
1059	}	1134	}
1060		1135
1061	/* last == NULL if there are no objects on this space */	1136	/* last == NULL if there are no objects on this space */
1062	//TODO: this makes little sense, why only update the topmost object?	1137	//TODO: this makes little sense, why only update the topmost object?
…		…
1082	merge_ob (object op, object top)	1157	merge_ob (object op, object top)
1083	{	1158	{
1084	if (!op->nrof)	1159	if (!op->nrof)
1085	return 0;	1160	return 0;
1086		1161
1087	if (top)	1162	if (!top)
1088	for (top = op; top && top->above; top = top->above)	1163	for (top = op; top && top->above; top = top->above)
1089	;	1164	;
1090		1165
1091	for (; top; top = top->below)	1166	for (; top; top = top->below)
1092	{	1167	{
…		…
1113	if (more)	1188	if (more)
1114	return;	1189	return;
1115		1190
1116	object *prev = this;	1191	object *prev = this;
1117		1192
1118	for (archetype *at = arch->more; at; at = at->more)	1193	for (archetype at = (archetype )arch->more; at; at = (archetype *)at->more)
1119	{	1194	{
1120	object *op = arch_to_object (at);	1195	object *op = arch_to_object (at);
1121		1196
1122	op->name = name;	1197	op->name = name;
1123	op->name_pl = name_pl;	1198	op->name_pl = name_pl;
…		…
1137	object *	1212	object *
1138	insert_ob_in_map_at (object op, maptile m, object *originator, int flag, int x, int y)	1213	insert_ob_in_map_at (object op, maptile m, object *originator, int flag, int x, int y)
1139	{	1214	{
1140	for (object *tmp = op->head_ (); tmp; tmp = tmp->more)	1215	for (object *tmp = op->head_ (); tmp; tmp = tmp->more)
1141	{	1216	{
1142	tmp->x = x + tmp->arch->clone.x;	1217	tmp->x = x + tmp->arch->x;
1143	tmp->y = y + tmp->arch->clone.y;	1218	tmp->y = y + tmp->arch->y;
1144	}	1219	}
1145		1220
1146	return insert_ob_in_map (op, m, originator, flag);	1221	return insert_ob_in_map (op, m, originator, flag);
1147	}	1222	}
1148		1223
…		…
1169	object *	1244	object *
1170	insert_ob_in_map (object op, maptile m, object *originator, int flag)	1245	insert_ob_in_map (object op, maptile m, object *originator, int flag)
1171	{	1246	{
1172	assert (!op->flag [FLAG_FREED]);	1247	assert (!op->flag [FLAG_FREED]);
1173		1248
1174	object tmp, top, *floor = NULL;	1249	object top, floor = NULL;
1175		1250
1176	op->remove ();	1251	op->remove ();
1177
1178	#if 0
1179	if (!m->active != !op->active)
1180	if (m->active)
1181	op->activate_recursive ();
1182	else
1183	op->deactivate_recursive ();
1184	#endif
1185
1186	if (out_of_map (m, op->x, op->y))
1187	{
1188	LOG (llevError, "Trying to insert object outside the map.\n%s\n", op->debug_desc ());
1189	#ifdef MANY_CORES
1190	/* Better to catch this here, as otherwise the next use of this object
1191	* is likely to cause a crash. Better to find out where it is getting
1192	* improperly inserted.
1193	*/
1194	abort ();
1195	#endif
1196	return op;
1197	}
1198
1199	if (object *more = op->more)
1200	{
1201	if (!insert_ob_in_map (more, m, originator, flag))
1202	{
1203	if (!op->head)
1204	LOG (llevError, "BUG: insert_ob_in_map(): inserting op->more killed op\n");
1205
1206	return 0;
1207	}
1208	}
1209
1210	CLEAR_FLAG (op, FLAG_REMOVED);
1211		1252
1212	/* Ideally, the caller figures this out. However, it complicates a lot	1253	/* Ideally, the caller figures this out. However, it complicates a lot
1213	* of areas of callers (eg, anything that uses find_free_spot would now	1254	* of areas of callers (eg, anything that uses find_free_spot would now
1214	* need extra work	1255	* need extra work
1215	*/	1256	*/
1216	if (!xy_normalise (m, op->x, op->y))	1257	if (!xy_normalise (m, op->x, op->y))
		1258	{
		1259	op->destroy ();
1217	return 0;	1260	return 0;
		1261	}
		1262
		1263	if (object *more = op->more)
		1264	if (!insert_ob_in_map (more, m, originator, flag))
		1265	return 0;
		1266
		1267	CLEAR_FLAG (op, FLAG_REMOVED);
1218		1268
1219	op->map = m;	1269	op->map = m;
1220	mapspace &ms = op->ms ();	1270	mapspace &ms = op->ms ();
1221		1271
1222	/* this has to be done after we translate the coordinates.	1272	/* this has to be done after we translate the coordinates.
1223	*/	1273	*/
1224	if (op->nrof && !(flag & INS_NO_MERGE))	1274	if (op->nrof && !(flag & INS_NO_MERGE))
1225	for (tmp = ms.bot; tmp; tmp = tmp->above)	1275	for (object *tmp = ms.bot; tmp; tmp = tmp->above)
1226	if (object::can_merge (op, tmp))	1276	if (object::can_merge (op, tmp))
1227	{	1277	{
1228	op->nrof += tmp->nrof;	1278	op->nrof += tmp->nrof;
1229	tmp->destroy ();	1279	tmp->destroy ();
1230	}	1280	}
…		…
1257	else	1307	else
1258	{	1308	{
1259	top = ms.bot;	1309	top = ms.bot;
1260		1310
1261	/* If there are other objects, then */	1311	/* If there are other objects, then */
1262	if ((!(flag & INS_MAP_LOAD)) && top)	1312	if (top)
1263	{	1313	{
1264	object *last = 0;	1314	object *last = 0;
1265		1315
1266	/*	1316	/*
1267	* If there are multiple objects on this space, we do some trickier handling.	1317	* If there are multiple objects on this space, we do some trickier handling.
…		…
1320	if (last && last->below && last != floor)	1370	if (last && last->below && last != floor)
1321	top = last->below;	1371	top = last->below;
1322	}	1372	}
1323	} /* If objects on this space */	1373	} /* If objects on this space */
1324		1374
1325	if (flag & INS_MAP_LOAD)
1326	top = ms.top;
1327
1328	if (flag & INS_ABOVE_FLOOR_ONLY)	1375	if (flag & INS_ABOVE_FLOOR_ONLY)
1329	top = floor;	1376	top = floor;
1330		1377
1331	/* Top is the object that our object (op) is going to get inserted above.	1378	/* Top is the object that our object (op) is going to get inserted above.
1332	*/	1379	*/
…		…
1364	op->map->touch ();	1411	op->map->touch ();
1365	}	1412	}
1366		1413
1367	op->map->dirty = true;	1414	op->map->dirty = true;
1368		1415
1369	/* If we have a floor, we know the player, if any, will be above
1370	* it, so save a few ticks and start from there.
1371	*/
1372	if (!(flag & INS_MAP_LOAD))
1373	if (object *pl = ms.player ())	1416	if (object *pl = ms.player ())
1374	if (pl->contr->ns)
1375	pl->contr->ns->floorbox_update ();	1417	pl->contr->ns->floorbox_update ();
1376		1418
1377	/* If this object glows, it may affect lighting conditions that are	1419	/* If this object glows, it may affect lighting conditions that are
1378	* visible to others on this map. But update_all_los is really	1420	* visible to others on this map. But update_all_los is really
1379	* an inefficient way to do this, as it means los for all players	1421	* an inefficient way to do this, as it means los for all players
1380	* on the map will get recalculated. The players could very well	1422	* on the map will get recalculated. The players could very well
…		…
1399	* blocked() and wall() work properly), and these flags are updated by	1441	* blocked() and wall() work properly), and these flags are updated by
1400	* update_object().	1442	* update_object().
1401	*/	1443	*/
1402		1444
1403	/* if this is not the head or flag has been passed, don't check walk on status */	1445	/* if this is not the head or flag has been passed, don't check walk on status */
1404	if (!(flag & INS_NO_WALK_ON) && !op->head)	1446	if (!(flag & INS_NO_WALK_ON) && op->head_ () == op)
1405	{	1447	{
1406	if (check_move_on (op, originator))	1448	if (check_move_on (op, originator))
1407	return 0;	1449	return 0;
1408		1450
1409	/* If we are a multi part object, lets work our way through the check	1451	/* If we are a multi part object, lets work our way through the check
1410	* walk on's.	1452	* walk on's.
1411	*/	1453	*/
1412	for (tmp = op->more; tmp != NULL; tmp = tmp->more)	1454	for (object *tmp = op->more; tmp; tmp = tmp->more)
1413	if (check_move_on (tmp, originator))	1455	if (check_move_on (tmp, originator))
1414	return 0;	1456	return 0;
1415	}	1457	}
1416		1458
1417	return op;	1459	return op;
…		…
1427	object tmp, tmp1;	1469	object tmp, tmp1;
1428		1470
1429	/* first search for itself and remove any old instances */	1471	/* first search for itself and remove any old instances */
1430		1472
1431	for (tmp = op->ms ().bot; tmp; tmp = tmp->above)	1473	for (tmp = op->ms ().bot; tmp; tmp = tmp->above)
1432	if (!strcmp (tmp->arch->name, arch_string)) /* same archetype */	1474	if (!strcmp (tmp->arch->archname, arch_string)) /* same archetype */
1433	tmp->destroy ();	1475	tmp->destroy ();
1434		1476
1435	tmp1 = arch_to_object (archetype::find (arch_string));	1477	tmp1 = arch_to_object (archetype::find (arch_string));
1436		1478
1437	tmp1->x = op->x;	1479	tmp1->x = op->x;
…		…
1598	LOG (llevError, "Trying to put object in NULL.\n%s\n", dump);	1640	LOG (llevError, "Trying to put object in NULL.\n%s\n", dump);
1599	free (dump);	1641	free (dump);
1600	return op;	1642	return op;
1601	}	1643	}
1602		1644
1603	if (where->head)	1645	if (where->head_ () != where)
1604	{	1646	{
1605	LOG (llevDebug, "Warning: Tried to insert object into wrong part of multipart object.\n");	1647	LOG (llevError \| logBacktrace, "Warning: Tried to insert object into wrong part of multipart object.\n");
1606	where = where->head;	1648	where = where->head;
1607	}	1649	}
1608		1650
1609	return where->insert (op);	1651	return where->insert (op);
1610	}	1652	}
…		…
1618	* be != op, if items are merged. -Tero	1660	* be != op, if items are merged. -Tero
1619	*/	1661	*/
1620	object *	1662	object *
1621	object::insert (object *op)	1663	object::insert (object *op)
1622	{	1664	{
1623	object tmp, otmp;
1624
1625	if (!QUERY_FLAG (op, FLAG_REMOVED))	1665	if (!QUERY_FLAG (op, FLAG_REMOVED))
1626	op->remove ();	1666	op->remove ();
1627		1667
1628	if (op->more)	1668	if (op->more)
1629	{	1669	{
…		…
1631	return op;	1671	return op;
1632	}	1672	}
1633		1673
1634	CLEAR_FLAG (op, FLAG_OBJ_ORIGINAL);	1674	CLEAR_FLAG (op, FLAG_OBJ_ORIGINAL);
1635	CLEAR_FLAG (op, FLAG_REMOVED);	1675	CLEAR_FLAG (op, FLAG_REMOVED);
		1676
1636	if (op->nrof)	1677	if (op->nrof)
1637	{	1678	{
1638	for (tmp = inv; tmp != NULL; tmp = tmp->below)	1679	for (object *tmp = inv; tmp; tmp = tmp->below)
1639	if (object::can_merge (tmp, op))	1680	if (object::can_merge (tmp, op))
1640	{	1681	{
1641	/* return the original object and remove inserted object	1682	/* return the original object and remove inserted object
1642	(client needs the original object) */	1683	(client needs the original object) */
1643	tmp->nrof += op->nrof;	1684	tmp->nrof += op->nrof;
…		…
1662	add_weight (this, op->weight * op->nrof);	1703	add_weight (this, op->weight * op->nrof);
1663	}	1704	}
1664	else	1705	else
1665	add_weight (this, (op->weight + op->carrying));	1706	add_weight (this, (op->weight + op->carrying));
1666		1707
1667	otmp = this->in_player ();	1708	if (object *otmp = this->in_player ())
1668	if (otmp && otmp->contr)
1669	if (!QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))	1709	if (otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))
1670	otmp->update_stats ();	1710	otmp->update_stats ();
1671		1711
		1712	op->owner = 0; // its his/hers now. period.
1672	op->map = 0;	1713	op->map = 0;
1673	op->env = this;	1714	op->env = this;
1674	op->above = 0;	1715	op->above = 0;
1675	op->below = 0;	1716	op->below = 0;
1676	op->x = 0, op->y = 0;	1717	op->x = op->y = 0;
1677		1718
1678	/* reset the light list and los of the players on the map */	1719	/* reset the light list and los of the players on the map */
1679	if ((op->glow_radius != 0) && map)	1720	if (op->glow_radius && map)
1680	{	1721	{
1681	#ifdef DEBUG_LIGHTS	1722	#ifdef DEBUG_LIGHTS
1682	LOG (llevDebug, " insert_ob_in_ob(): got %s to insert in map/op\n", op->name);	1723	LOG (llevDebug, " insert_ob_in_ob(): got %s to insert in map/op\n", op->name);
1683	#endif /* DEBUG_LIGHTS */	1724	#endif /* DEBUG_LIGHTS */
1684	if (map->darkness)	1725	if (map->darkness)
…		…
1918	* activate recursively a flag on an object inventory	1959	* activate recursively a flag on an object inventory
1919	*/	1960	*/
1920	void	1961	void
1921	flag_inv (object *op, int flag)	1962	flag_inv (object *op, int flag)
1922	{	1963	{
1923	if (op->inv)
1924	for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below)	1964	for (object *tmp = op->inv; tmp; tmp = tmp->below)
1925	{	1965	{
1926	SET_FLAG (tmp, flag);	1966	SET_FLAG (tmp, flag);
1927	flag_inv (tmp, flag);	1967	flag_inv (tmp, flag);
1928	}	1968	}
1929	}	1969	}
1930		1970
1931	/*	1971	/*
1932	* deactivate recursively a flag on an object inventory	1972	* deactivate recursively a flag on an object inventory
1933	*/	1973	*/
1934	void	1974	void
1935	unflag_inv (object *op, int flag)	1975	unflag_inv (object *op, int flag)
1936	{	1976	{
1937	if (op->inv)
1938	for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below)	1977	for (object *tmp = op->inv; tmp; tmp = tmp->below)
1939	{	1978	{
1940	CLEAR_FLAG (tmp, flag);	1979	CLEAR_FLAG (tmp, flag);
1941	unflag_inv (tmp, flag);	1980	unflag_inv (tmp, flag);
1942	}	1981	}
1943	}
1944
1945	/*
1946	* set_cheat(object) sets the cheat flag (WAS_WIZ) in the object and in
1947	* all it's inventory (recursively).
1948	* If checksums are used, a player will get set_cheat called for
1949	* him/her-self and all object carried by a call to this function.
1950	*/
1951	void
1952	set_cheat (object *op)
1953	{
1954	SET_FLAG (op, FLAG_WAS_WIZ);
1955	flag_inv (op, FLAG_WAS_WIZ);
1956	}	1982	}
1957		1983
1958	/*	1984	/*
1959	* find_free_spot(object, map, x, y, start, stop) will search for	1985	* find_free_spot(object, map, x, y, start, stop) will search for
1960	* a spot at the given map and coordinates which will be able to contain	1986	* a spot at the given map and coordinates which will be able to contain
…		…
1962	* to search (see the freearr_x/y[] definition).	1988	* to search (see the freearr_x/y[] definition).
1963	* It returns a random choice among the alternatives found.	1989	* It returns a random choice among the alternatives found.
1964	* start and stop are where to start relative to the free_arr array (1,9	1990	* start and stop are where to start relative to the free_arr array (1,9
1965	* does all 4 immediate directions). This returns the index into the	1991	* does all 4 immediate directions). This returns the index into the
1966	* array of the free spot, -1 if no spot available (dir 0 = x,y)	1992	* array of the free spot, -1 if no spot available (dir 0 = x,y)
1967	* Note - this only checks to see if there is space for the head of the
1968	* object - if it is a multispace object, this should be called for all
1969	* pieces.
1970	* Note2: This function does correctly handle tiled maps, but does not	1993	* Note: This function does correctly handle tiled maps, but does not
1971	* inform the caller. However, insert_ob_in_map will update as	1994	* inform the caller. However, insert_ob_in_map will update as
1972	* necessary, so the caller shouldn't need to do any special work.	1995	* necessary, so the caller shouldn't need to do any special work.
1973	* Note - updated to take an object instead of archetype - this is necessary	1996	* Note - updated to take an object instead of archetype - this is necessary
1974	* because arch_blocked (now ob_blocked) needs to know the movement type	1997	* because arch_blocked (now ob_blocked) needs to know the movement type
1975	* to know if the space in question will block the object. We can't use	1998	* to know if the space in question will block the object. We can't use
…		…
1977	* customized, changed states, etc.	2000	* customized, changed states, etc.
1978	*/	2001	*/
1979	int	2002	int
1980	find_free_spot (const object ob, maptile m, int x, int y, int start, int stop)	2003	find_free_spot (const object ob, maptile m, int x, int y, int start, int stop)
1981	{	2004	{
		2005	int altern[SIZEOFFREE];
1982	int index = 0, flag;	2006	int index = 0, flag;
1983	int altern[SIZEOFFREE];
1984		2007
1985	for (int i = start; i < stop; i++)	2008	for (int i = start; i < stop; i++)
1986	{	2009	{
1987	flag = ob_blocked (ob, m, x + freearr_x[i], y + freearr_y[i]);	2010	mapxy pos (m, x, y); pos.move (i);
1988	if (!flag)	2011
		2012	if (!pos.normalise ())
		2013	continue;
		2014
		2015	mapspace &ms = *pos;
		2016
		2017	if (ms.flags () & P_IS_ALIVE)
		2018	continue;
		2019
		2020	/* However, often
		2021	* ob doesn't have any move type (when used to place exits)
		2022	* so the AND operation in OB_TYPE_MOVE_BLOCK doesn't work.
		2023	*/
		2024	if (ob && ob->move_type == 0 && ms.move_block != MOVE_ALL)
		2025	{
1989	altern [index++] = i;	2026	altern [index++] = i;
		2027	continue;
		2028	}
1990		2029
1991	/* Basically, if we find a wall on a space, we cut down the search size.	2030	/* Basically, if we find a wall on a space, we cut down the search size.
1992	* In this way, we won't return spaces that are on another side of a wall.	2031	* In this way, we won't return spaces that are on another side of a wall.
1993	* This mostly work, but it cuts down the search size in all directions -	2032	* This mostly work, but it cuts down the search size in all directions -
1994	* if the space being examined only has a wall to the north and empty	2033	* if the space being examined only has a wall to the north and empty
1995	* spaces in all the other directions, this will reduce the search space	2034	* spaces in all the other directions, this will reduce the search space
1996	* to only the spaces immediately surrounding the target area, and	2035	* to only the spaces immediately surrounding the target area, and
1997	* won't look 2 spaces south of the target space.	2036	* won't look 2 spaces south of the target space.
1998	*/	2037	*/
1999	else if ((flag & P_NO_PASS) && maxfree[i] < stop)	2038	if (ms.move_block == MOVE_ALL && maxfree[i] < stop)
		2039	{
2000	stop = maxfree[i];	2040	stop = maxfree[i];
		2041	continue;
		2042	}
		2043
		2044	/* Note it is intentional that we check ob - the movement type of the
		2045	* head of the object should correspond for the entire object.
		2046	*/
		2047	if (OB_TYPE_MOVE_BLOCK (ob, ms.move_block))
		2048	continue;
		2049
		2050	if (ob->blocked (m, pos.x, pos.y))
		2051	continue;
		2052
		2053	altern [index++] = i;
2001	}	2054	}
2002		2055
2003	if (!index)	2056	if (!index)
2004	return -1;	2057	return -1;
2005		2058
…		…
2014	*/	2067	*/
2015	int	2068	int
2016	find_first_free_spot (const object ob, maptile m, int x, int y)	2069	find_first_free_spot (const object ob, maptile m, int x, int y)
2017	{	2070	{
2018	for (int i = 0; i < SIZEOFFREE; i++)	2071	for (int i = 0; i < SIZEOFFREE; i++)
2019	if (!ob_blocked (ob, m, x + freearr_x[i], y + freearr_y[i]))	2072	if (!ob->blocked (m, x + freearr_x[i], y + freearr_y[i]))
2020	return i;	2073	return i;
2021		2074
2022	return -1;	2075	return -1;
2023	}	2076	}
2024		2077
…		…
2078	object *tmp;	2131	object *tmp;
2079	maptile *mp;	2132	maptile *mp;
2080		2133
2081	MoveType blocked, move_type;	2134	MoveType blocked, move_type;
2082		2135
2083	if (exclude && exclude->head)	2136	if (exclude && exclude->head_ () != exclude)
2084	{	2137	{
2085	exclude = exclude->head;	2138	exclude = exclude->head;
2086	move_type = exclude->move_type;	2139	move_type = exclude->move_type;
2087	}	2140	}
2088	else	2141	else
…		…
2111	max = maxfree[i];	2164	max = maxfree[i];
2112	else if (mflags & P_IS_ALIVE)	2165	else if (mflags & P_IS_ALIVE)
2113	{	2166	{
2114	for (tmp = ms.bot; tmp; tmp = tmp->above)	2167	for (tmp = ms.bot; tmp; tmp = tmp->above)
2115	if ((tmp->flag [FLAG_MONSTER] \|\| tmp->type == PLAYER)	2168	if ((tmp->flag [FLAG_MONSTER] \|\| tmp->type == PLAYER)
2116	&& (tmp != exclude \|\| (tmp->head && tmp->head != exclude)))	2169	&& (tmp != exclude \|\| (tmp->head_ () != tmp && tmp->head_ () != exclude)))
2117	break;	2170	break;
2118		2171
2119	if (tmp)	2172	if (tmp)
2120	return freedir[i];	2173	return freedir[i];
2121	}	2174	}
…		…
2301	* Cf 0.91.3 - don't let WIZ's pick up anything - will likely cause	2354	* Cf 0.91.3 - don't let WIZ's pick up anything - will likely cause
2302	* core dumps if they do.	2355	* core dumps if they do.
2303	*	2356	*
2304	* Add a check so we can't pick up invisible objects (0.93.8)	2357	* Add a check so we can't pick up invisible objects (0.93.8)
2305	*/	2358	*/
2306
2307	int	2359	int
2308	can_pick (const object who, const object item)	2360	can_pick (const object who, const object item)
2309	{	2361	{
2310	return /QUERY_FLAG(who,FLAG_WIZ)\|\| /	2362	return /QUERY_FLAG(who,FLAG_WIZ)\|\| /
2311	(item->weight > 0 && !QUERY_FLAG (item, FLAG_NO_PICK) &&	2363	(item->weight > 0 && !QUERY_FLAG (item, FLAG_NO_PICK) &&
…		…
2316	* create clone from object to another	2368	* create clone from object to another
2317	*/	2369	*/
2318	object *	2370	object *
2319	object_create_clone (object *asrc)	2371	object_create_clone (object *asrc)
2320	{	2372	{
2321	object dst = 0, tmp, src, part, prev, item;	2373	object dst = 0, tmp, src, prev, *item;
2322		2374
2323	if (!asrc)	2375	if (!asrc)
2324	return 0;	2376	return 0;
2325		2377
2326	src = asrc;
2327	if (src->head)
2328	src = src->head;	2378	src = asrc->head_ ();
2329		2379
2330	prev = 0;	2380	prev = 0;
2331	for (part = src; part; part = part->more)	2381	for (object *part = src; part; part = part->more)
2332	{	2382	{
2333	tmp = part->clone ();	2383	tmp = part->clone ();
2334	tmp->x -= src->x;	2384	tmp->x -= src->x;
2335	tmp->y -= src->y;	2385	tmp->y -= src->y;
2336		2386
…		…
2449	/* Basically, if the archetype has this key set,	2499	/* Basically, if the archetype has this key set,
2450	* we need to store the null value so when we save	2500	* we need to store the null value so when we save
2451	* it, we save the empty value so that when we load,	2501	* it, we save the empty value so that when we load,
2452	* we get this value back again.	2502	* we get this value back again.
2453	*/	2503	*/
2454	if (get_ob_key_link (&op->arch->clone, canonical_key))	2504	if (get_ob_key_link (op->arch, canonical_key))
2455	field->value = 0;	2505	field->value = 0;
2456	else	2506	else
2457	{	2507	{
2458	if (last)	2508	if (last)
2459	last->next = field->next;	2509	last->next = field->next;
…		…
2528	}	2578	}
2529	else	2579	else
2530	item = item->env;	2580	item = item->env;
2531	}	2581	}
2532		2582
2533
2534	const char *	2583	const char *
2535	object::flag_desc (char *desc, int len) const	2584	object::flag_desc (char *desc, int len) const
2536	{	2585	{
2537	char *p = desc;	2586	char *p = desc;
2538	bool first = true;	2587	bool first = true;
…		…
2572	&name,	2621	&name,
2573	title ? "\",title:\"" : "",	2622	title ? "\",title:\"" : "",
2574	title ? (const char *)title : "",	2623	title ? (const char *)title : "",
2575	flag_desc (flagdesc, 512), type);	2624	flag_desc (flagdesc, 512), type);
2576		2625
2577	if (env)	2626	if (!this->flag[FLAG_REMOVED] && env)
2578	p += snprintf (p, 256, "(in %s)", env->debug_desc (info2));	2627	p += snprintf (p, 256, "(in %s)", env->debug_desc (info2));
2579		2628
2580	if (map)	2629	if (map)
2581	p += snprintf (p, 256, "(on %s@%d+%d)", &map->path, x, y);	2630	p += snprintf (p, 256, "(on %s@%d+%d)", &map->path, x, y);
2582		2631
…		…
2584	}	2633	}
2585		2634
2586	const char *	2635	const char *
2587	object::debug_desc () const	2636	object::debug_desc () const
2588	{	2637	{
2589	static char info[256 * 4];	2638	static char info[3][256 * 4];
		2639	static int info_idx;
		2640
2590	return debug_desc (info);	2641	return debug_desc (info [++info_idx % 3]);
2591	}
2592
2593	const char *
2594	object::debug_desc2 () const
2595	{
2596	static char info[256 * 4];
2597	return debug_desc (info);
2598	}	2642	}
2599		2643
2600	struct region *	2644	struct region *
2601	object::region () const	2645	object::region () const
2602	{	2646	{
…		…
2605	}	2649	}
2606		2650
2607	const materialtype_t *	2651	const materialtype_t *
2608	object::dominant_material () const	2652	object::dominant_material () const
2609	{	2653	{
2610	if (materialtype_t *mat = name_to_material (materialname))	2654	if (materialtype_t *mt = name_to_material (materialname))
2611	return mat;	2655	return mt;
2612		2656
2613	// omfg this is slow, this has to be temporary :)
2614	shstr unknown ("unknown");
2615
2616	return name_to_material (unknown);	2657	return name_to_material (shstr_unknown);
2617	}	2658	}
2618		2659
2619	void	2660	void
2620	object::open_container (object *new_container)	2661	object::open_container (object *new_container)
2621	{	2662	{
…		…
2637	old_container->flag [FLAG_APPLIED] = 0;	2678	old_container->flag [FLAG_APPLIED] = 0;
2638	container = 0;	2679	container = 0;
2639		2680
2640	esrv_update_item (UPD_FLAGS, this, old_container);	2681	esrv_update_item (UPD_FLAGS, this, old_container);
2641	new_draw_info_format (NDI_UNIQUE, 0, this, "You close %s.", query_name (old_container));	2682	new_draw_info_format (NDI_UNIQUE, 0, this, "You close %s.", query_name (old_container));
		2683	play_sound (sound_find ("chest_close"));
2642	}	2684	}
2643		2685
2644	if (new_container)	2686	if (new_container)
2645	{	2687	{
2646	if (INVOKE_OBJECT (OPEN, new_container, ARG_OBJECT (this)))	2688	if (INVOKE_OBJECT (OPEN, new_container, ARG_OBJECT (this)))
…		…
2662	new_container->flag [FLAG_APPLIED] = 1;	2704	new_container->flag [FLAG_APPLIED] = 1;
2663	container = new_container;	2705	container = new_container;
2664		2706
2665	esrv_update_item (UPD_FLAGS, this, new_container);	2707	esrv_update_item (UPD_FLAGS, this, new_container);
2666	esrv_send_inventory (this, new_container);	2708	esrv_send_inventory (this, new_container);
		2709	play_sound (sound_find ("chest_open"));
		2710	}
		2711	}
		2712
		2713	object *
		2714	object::force_find (const shstr name)
		2715	{
		2716	/* cycle through his inventory to look for the MARK we want to
		2717	* place
		2718	*/
		2719	for (object *tmp = inv; tmp; tmp = tmp->below)
		2720	if (tmp->type == FORCE && tmp->slaying == name)
		2721	return splay (tmp);
		2722
		2723	return 0;
		2724	}
		2725
		2726	void
		2727	object::force_add (const shstr name, int duration)
		2728	{
		2729	if (object *force = force_find (name))
		2730	force->destroy ();
		2731
		2732	object *force = get_archetype (FORCE_NAME);
		2733
		2734	force->slaying = name;
		2735	force->stats.food = 1;
		2736	force->speed_left = -1.f;
		2737
		2738	force->set_speed (duration ? 1.f / duration : 0.f);
		2739	force->flag [FLAG_IS_USED_UP] = true;
		2740	force->flag [FLAG_APPLIED] = true;
		2741
		2742	insert (force);
		2743	}
		2744
		2745	void
		2746	object::play_sound (faceidx sound) const
		2747	{
		2748	if (!sound)
		2749	return;
		2750
		2751	if (flag [FLAG_REMOVED])
		2752	return;
		2753
		2754	if (env)
2667	}	2755	{
		2756	if (object *pl = in_player ())
		2757	pl->contr->play_sound (sound);
		2758	}
		2759	else
		2760	map->play_sound (sound, x, y);
2668	}	2761	}
2669		2762
2670

Diff Legend

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

Comparing deliantra/server/common/object.C (file contents): Revision 1.142 by root, Mon Apr 30 04:25:29 2007 UTC vs. Revision 1.201 by root, Tue Jan 22 16:22:45 2008 UTC

Diff Legend

Comparing deliantra/server/common/object.C (file contents):
Revision 1.142 by root, Mon Apr 30 04:25:29 2007 UTC vs.
Revision 1.201 by root, Tue Jan 22 16:22:45 2008 UTC