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

Comparing deliantra/server/common/utils.C (file contents):
Revision 1.50 by root, Sat Apr 21 23:03:54 2007 UTC vs.
Revision 1.63 by root, Mon Aug 6 10:54:11 2007 UTC

…		…
1	/*	1	/*
2	* CrossFire, A Multiplayer game for X-windows	2	* This file is part of Crossfire TRT, the Roguelike Realtime MORPG.
3	*	3	*
4	* Copyright (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team	4	* Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Crossfire TRT team
5	* Copyright (C) 2002 Mark Wedel & Crossfire Development Team	5	* Copyright (©) 2002,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	* Crossfire TRT 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 <crossfire@schmorp.de>
23	*/	22	*/
24		23
25	/*	24	/*
26	* General convenience functions for crossfire.	25	* General convenience functions for crossfire.
27	*/	26	*/
36	#include <global.h>	35	#include <global.h>
37	#include <funcpoint.h>	36	#include <funcpoint.h>
38	#include <material.h>	37	#include <material.h>
39		38
40	#include <glib.h>	39	#include <glib.h>
		40
		41	refcnt_base::refcnt_t refcnt_dummy;
41		42
42	rand_gen rndm;	43	rand_gen rndm;
43		44
44	void	45	void
45	tausworthe_random_generator::seed (uint32_t seed)	46	tausworthe_random_generator::seed (uint32_t seed)
…		…
95	int	96	int
96	random_roll (int r_min, int r_max, const object *op, int goodbad)	97	random_roll (int r_min, int r_max, const object *op, int goodbad)
97	{	98	{
98	int base = r_max - r_min > 1 ? 20 : 50; /* d2 and d3 are corner cases */	99	int base = r_max - r_min > 1 ? 20 : 50; /* d2 and d3 are corner cases */
99		100
100	if (r_max < 1 \|\| r_max < r_min)	101	if (r_max < r_min)
101	{	102	{
102	LOG (llevError, "Calling random_roll with min=%d max=%d\n", r_min, r_max);	103	LOG (llevError \| logBacktrace, "Calling random_roll with min=%d max=%d\n", r_min, r_max);
103	return r_min;	104	return r_min;
104	}	105	}
105		106
106	if (op->type == PLAYER)	107	if (op->type == PLAYER)
107	{	108	{
…		…
121	* for exp loss calculations for players changing religions.	122	* for exp loss calculations for players changing religions.
122	*/	123	*/
123	sint64	124	sint64
124	random_roll64 (sint64 min, sint64 max, const object *op, int goodbad)	125	random_roll64 (sint64 min, sint64 max, const object *op, int goodbad)
125	{	126	{
126	sint64 omin, diff, luck, ran;
127	int base;
128
129	omin = min;	127	sint64 omin = min;
130	diff = max - min + 1;	128	sint64 diff = max - min + 1;
131	((diff > 2) ? (base = 20) : (base = 50)); /* d2 and d3 are corner cases */	129	int base = diff > 2 ? 20 : 50; /* d2 and d3 are corner cases */
132		130
133	if (max < 1 \|\| diff < 1)	131	if (diff < 0)
134	{	132	{
135	LOG (llevError, "Calling random_roll with min=%" PRId64 " max=%" PRId64 "\n", min, max);	133	LOG (llevError \| logBacktrace, "Calling random_roll64 with min=%" PRId64 " max=%" PRId64 "\n", min, max);
136	return (min); /* avoids a float exception */	134	return (min); /* avoids a float exception */
137	}	135	}
138		136
139	/*	137	/*
140	* Make a call to get two 32 bit unsigned random numbers, and just to	138	* Make a call to get two 32 bit unsigned random numbers, and just to
141	* a little bitshifting.	139	* a little bitshifting.
142	*/	140	*/
143	ran = (sint64) rndm.next () ^ ((sint64) rndm.next () << 31);	141	sint64 ran = (sint64) rndm.next () ^ ((sint64) rndm.next () << 31);
144		142
145	if (op->type != PLAYER)	143	if (op->type != PLAYER)
146	return ((ran % diff) + min);	144	return ((ran % diff) + min);
147		145
148	luck = op->stats.luck;	146	int luck = op->stats.luck;
		147
149	if (rndm (base) < MIN (10, abs (luck)))	148	if (rndm (base) < MIN (10, abs (luck)))
150	{	149	{
151	/* we have a winner */	150	/* we have a winner */
152	((luck > 0) ? (luck = 1) : (luck = -1));	151	((luck > 0) ? (luck = 1) : (luck = -1));
153	diff -= luck;	152	diff -= luck;
154	if (diff < 1)	153	if (diff < 1)
155	return (omin); /check again /	154	return (omin); /check again /
		155
156	((goodbad) ? (min += luck) : (diff));	156	((goodbad) ? (min += luck) : (diff));
157		157
158	return (MAX (omin, MIN (max, (ran % diff) + min)));	158	return (MAX (omin, MIN (max, (ran % diff) + min)));
159	}	159	}
160		160
161	return ((ran % diff) + min);	161	return ran % diff + min;
162	}	162	}
163		163
164	/*	164	/*
165	* Roll a number of dice (2d3, 4d6). Uses op to determine luck,	165	* Roll a number of dice (2d3, 4d6). Uses op to determine luck,
166	* If goodbad is non-zero, luck increases the roll, if zero, it decreases.	166	* If goodbad is non-zero, luck increases the roll, if zero, it decreases.
167	* Generally, op should be the player/caster/hitter requesting the roll,	167	* Generally, op should be the player/caster/hitter requesting the roll,
168	* not the recipient (ie, the poor slob getting hit).	168	* not the recipient (ie, the poor slob getting hit).
169	* The args are num D size (ie 4d6) [garbled 20010916]	169	* The args are num D size (ie 4d6) [garbled 20010916]
170	*/	170	*/
171
172	int	171	int
173	die_roll (int num, int size, const object *op, int goodbad)	172	die_roll (int num, int size, const object *op, int goodbad)
174	{	173	{
175	int min, diff, luck, total, i, gotlucky, base;	174	int min, luck, total, i, gotlucky;
176		175
177	diff = size;	176	int diff = size;
178	min = 1;	177	min = 1;
179	luck = total = gotlucky = 0;	178	luck = total = gotlucky = 0;
180	((diff > 2) ? (base = 20) : (base = 50)); /* d2 and d3 are corner cases */	179	int base = diff > 2 ? 20 : 50; /* d2 and d3 are corner cases */
		180
181	if (size < 2 \|\| diff < 1)	181	if (size < 2 \|\| diff < 1)
182	{	182	{
183	LOG (llevError, "Calling die_roll with num=%d size=%d\n", num, size);	183	LOG (llevError, "Calling die_roll with num=%d size=%d\n", num, size);
184	return (num); /* avoids a float exception */	184	return num; /* avoids a float exception */
185	}	185	}
186		186
187	if (op->type == PLAYER)	187	if (op->type == PLAYER)
188	luck = op->stats.luck;	188	luck = op->stats.luck;
189		189
…		…
205	}	205	}
206		206
207	return total;	207	return total;
208	}	208	}
209		209
210	/* decay and destroy perishable items in a map */
211	void
212	maptile::decay_objects ()
213	{
214	if (!spaces)
215	return;
216
217	for (mapspace *ms = spaces + size (); ms-- > spaces; )
218	for (object above, op = ms->bot; op; op = above)
219	{
220	above = op->above;
221
222	bool destroy = 0;
223
224	// do not decay anything above unique floor tiles (yet :)
225	if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE))
226	break;
227
228	if (QUERY_FLAG (op, FLAG_IS_FLOOR)
229	\|\| QUERY_FLAG (op, FLAG_OBJ_ORIGINAL)
230	\|\| QUERY_FLAG (op, FLAG_OBJ_SAVE_ON_OVL)
231	\|\| QUERY_FLAG (op, FLAG_UNIQUE)
232	\|\| QUERY_FLAG (op, FLAG_OVERLAY_FLOOR)
233	\|\| QUERY_FLAG (op, FLAG_UNPAID)
234	\|\| op->is_alive ())
235	; // do not decay
236	else if (op->is_weapon ())
237	{
238	op->stats.dam--;
239	if (op->stats.dam < 0)
240	destroy = 1;
241	}
242	else if (op->is_armor ())
243	{
244	op->stats.ac--;
245	if (op->stats.ac < 0)
246	destroy = 1;
247	}
248	else if (op->type == FOOD)
249	{
250	op->stats.food -= rndm (5, 20);
251	if (op->stats.food < 0)
252	destroy = 1;
253	}
254	else
255	{
256	int mat = op->materials;
257
258	if (mat & M_PAPER
259	\|\| mat & M_LEATHER
260	\|\| mat & M_WOOD
261	\|\| mat & M_ORGANIC
262	\|\| mat & M_CLOTH
263	\|\| mat & M_LIQUID
264	\|\| (mat & M_IRON && rndm (1, 5) == 1)
265	\|\| (mat & M_GLASS && rndm (1, 2) == 1)
266	\|\| ((mat & M_STONE \|\| mat & M_ADAMANT) && rndm (1, 10) == 1)
267	\|\| ((mat & M_SOFT_METAL \|\| mat & M_BONE) && rndm (1, 3) == 1)
268	\|\| (mat & M_ICE && temp > 32))
269	destroy = 1;
270	}
271
272	/* adjust overall chance below */
273	if (destroy && rndm (0, 1))
274	op->destroy ();
275	}
276	}
277
278	/* convert materialname to materialtype_t */	210	/* convert materialname to materialtype_t */
279		211
280	materialtype_t *	212	materialtype_t *
281	name_to_material (const shstr &name)	213	name_to_material (const shstr &name)
282	{	214	{
283	for (materialtype_t *mt = materialt; mt && mt->next; mt = mt->next)	215	for (materialtype_t *mt = materialt; mt && mt->next; mt = mt->next)
284	if (name == mt->name)	216	if (name == mt->name)
285	return mt;	217	return mt;
286		218
287	return materialt;	219	return 0;
288	}	220	}
289		221
290	/* when doing transmutation of objects, we have to recheck the resistances,	222	/* when doing transmutation of objects, we have to recheck the resistances,
291	* as some that did not apply previously, may apply now.	223	* as some that did not apply previously, may apply now.
292	*/	224	*/
…		…
307	return;	239	return;
308		240
309	mt = name_to_material (op->materialname);	241	mt = name_to_material (op->materialname);
310	if (!mt)	242	if (!mt)
311	{	243	{
312	LOG (llevError, "archetype '%s>%s' uses nonexistent material '%s'\n", &op->arch->name, &op->name, &op->materialname);	244	LOG (llevError, "archetype '%s>%s' uses nonexistent material '%s'\n", &op->arch->archname, &op->name, &op->materialname);
313	return;	245	return;
314	}	246	}
315		247
316	for (j = 0; j < NROFATTACKS; j++)	248	for (j = 0; j < NROFATTACKS; j++)
317	if (op->resist[j] == 0 && change->resist[j] != 0)	249	if (op->resist[j] == 0 && change->resist[j] != 0)
…		…
328	void	260	void
329	set_materialname (object op, int difficulty, materialtype_t nmt)	261	set_materialname (object op, int difficulty, materialtype_t nmt)
330	{	262	{
331	materialtype_t mt, lmt;	263	materialtype_t mt, lmt;
332		264
333	#ifdef NEW_MATERIAL_CODE
334	int j;
335	#endif
336
337	if (op->materialname != NULL)	265	if (op->materialname != NULL)
338	return;	266	return;
339		267
340
341
342	if (nmt == NULL)	268	if (nmt == NULL)
343	{	269	{
344	lmt = NULL;	270	lmt = NULL;
345	#ifndef NEW_MATERIAL_CODE	271
346	for (mt = materialt; mt && mt->next; mt = mt->next)	272	for (mt = materialt; mt && mt->next; mt = mt->next)
347	{	273	if (op->materials & mt->material && rndm (1, 100) <= mt->chance &&
348	if (op->materials & mt->material)	274	difficulty >= mt->difficulty && (op->magic >= mt->magic \|\| mt->magic == 0))
349	{	275	{
350	lmt = mt;	276	lmt = mt;
		277	if (!(op->is_weapon () \|\| op->is_armor ()))
351	break;	278	break;
352	}	279	}
353	}
354
355	#else
356	for (mt = materialt; mt && mt->next; mt = mt->next)
357	{
358	if (op->materials & mt->material && rndm (1, 100) <= mt->chance &&
359	difficulty >= mt->difficulty && (op->magic >= mt->magic \|\| mt->magic == 0))
360	{
361	lmt = mt;
362	if (!(op->is_weapon () \|\| op->is_armor ()))
363	break;
364	}
365	}
366	#endif
367	}	280	}
368	else	281	else
369	{
370	lmt = nmt;	282	lmt = nmt;
371	}
372		283
373	if (lmt != NULL)	284	if (lmt != NULL)
374	{	285	{
375	#ifndef NEW_MATERIAL_CODE
376	op->materialname = lmt->name;
377	return;
378	#else
379
380	if (op->stats.dam && op->is_weapon ())	286	if (op->stats.dam && op->is_weapon ())
381	{	287	{
382	op->stats.dam += lmt->damage;	288	op->stats.dam += lmt->damage;
383	if (op->stats.dam < 1)	289	if (op->stats.dam < 1)
384	op->stats.dam = 1;	290	op->stats.dam = 1;
…		…
390	op->stats.wc += lmt->wc;	296	op->stats.wc += lmt->wc;
391	if (op->is_armor ())	297	if (op->is_armor ())
392	{	298	{
393	if (op->stats.ac)	299	if (op->stats.ac)
394	op->stats.ac += lmt->ac;	300	op->stats.ac += lmt->ac;
		301
395	for (j = 0; j < NROFATTACKS; j++)	302	for (int j = 0; j < NROFATTACKS; j++)
396	if (op->resist[j] != 0)	303	if (op->resist[j] != 0)
397	{	304	{
398	op->resist[j] += lmt->mod[j];	305	op->resist[j] += lmt->mod[j];
399	if (op->resist[j] > 100)	306	if (op->resist[j] > 100)
400	op->resist[j] = 100;	307	op->resist[j] = 100;
401	if (op->resist[j] < -100)	308	if (op->resist[j] < -100)
402	op->resist[j] = -100;	309	op->resist[j] = -100;
403	}	310	}
404	}	311	}
		312
405	op->materialname = lmt->name;	313	op->materialname = lmt->name;
406	/* dont make it unstackable if it doesn't need to be */	314	/* dont make it unstackable if it doesn't need to be */
407	if (op->is_weapon () \|\| op->is_armor ())	315	if (op->is_weapon () \|\| op->is_armor ())
408	{	316	{
409	op->weight = (op->weight * lmt->weight) / 100;	317	op->weight = (op->weight * lmt->weight) / 100;
410	op->value = (op->value * lmt->value) / 100;	318	op->value = (op->value * lmt->value) / 100;
411	}	319	}
412	#endif
413	}	320	}
414	}	321	}
415		322
416	/*	323	/*
417	* Strip out the media tags from a String.	324	* Strip out the media tags from a String.
…		…
553	fork_abort (const char *msg)	460	fork_abort (const char *msg)
554	{	461	{
555	if (!fork ())	462	if (!fork ())
556	{	463	{
557	signal (SIGABRT, SIG_DFL);	464	signal (SIGABRT, SIG_DFL);
		465	// try to put corefiles into a subdirectory, if existing, to allow
		466	// an administrator to reduce the I/O load.
		467	chdir ("cores");
558	abort ();	468	abort ();
559	}	469	}
560		470
561	LOG (llevError, "fork abort: %s\n", msg);	471	LOG (llevError, "fork abort: %s\n", msg);
562	}	472	}
…		…
607	memcpy (dst + maxlen - 4, "...", 4);	517	memcpy (dst + maxlen - 4, "...", 4);
608	}	518	}
609	}	519	}
610	else	520	else
611	memcpy (dst, src, len + 1);	521	memcpy (dst, src, len + 1);
		522	}
		523
		524	const std::string
		525	format (const char *format, ...)
		526	{
		527	int len;
		528
		529	{
		530	char buf[128];
		531
		532	va_list ap;
		533	va_start (ap, format);
		534	len = vsnprintf (buf, sizeof (buf), format, ap);
		535	va_end (ap);
		536
		537	assert (len >= 0); // shield againstz broken vsnprintf's
		538
		539	// was our static buffer short enough?
		540	if (len < sizeof (buf))
		541	return std::string (buf, len);
		542	}
		543
		544	{
		545	// longer, try harder
		546	char *buf = salloc<char> (len + 1);
		547
		548	va_list ap;
		549	va_start (ap, format);
		550	vsnprintf (buf, len + 1, format, ap);
		551	va_end (ap);
		552
		553	const std::string s (buf, len);
		554	sfree<char> (buf, len + 1);
		555
		556	return buf;
		557	}
612	}	558	}
613		559
614	tstamp now ()	560	tstamp now ()
615	{	561	{
616	struct timeval tv;	562	struct timeval tv;
…		…
684	0xcdd70693UL, 0x54de5729UL, 0x23d967bfUL, 0xb3667a2eUL, 0xc4614ab8UL,	630	0xcdd70693UL, 0x54de5729UL, 0x23d967bfUL, 0xb3667a2eUL, 0xc4614ab8UL,
685	0x5d681b02UL, 0x2a6f2b94UL, 0xb40bbe37UL, 0xc30c8ea1UL, 0x5a05df1bUL,	631	0x5d681b02UL, 0x2a6f2b94UL, 0xb40bbe37UL, 0xc30c8ea1UL, 0x5a05df1bUL,
686	0x2d02ef8dL	632	0x2d02ef8dL
687	};	633	};
688		634
		635	#if 0
		636	void xyzzy (object_ptr &a, object_ptr &o)
		637	{
		638	asm volatile ("int3");
		639	a = o;
		640	asm volatile ("int3");
		641	}
		642	#endif
689		643

Diff Legend

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

Comparing deliantra/server/common/utils.C (file contents): Revision 1.50 by root, Sat Apr 21 23:03:54 2007 UTC vs. Revision 1.63 by root, Mon Aug 6 10:54:11 2007 UTC

Diff Legend

Comparing deliantra/server/common/utils.C (file contents):
Revision 1.50 by root, Sat Apr 21 23:03:54 2007 UTC vs.
Revision 1.63 by root, Mon Aug 6 10:54:11 2007 UTC