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

Comparing deliantra/server/common/utils.C (file contents):
Revision 1.7 by root, Fri Sep 8 17:34:02 2006 UTC vs.
Revision 1.57 by root, Mon May 28 21:21:40 2007 UTC

…		…
1	/*	1	/*
2	* static char *rcsid_utils_c =	2	* This file is part of Crossfire TRT, the Multiplayer Online Role Playing Game.
3	* "$Id: utils.C,v 1.7 2006/09/08 17:34:02 root Exp $";	3	*
4	*/	4	* Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Crossfire TRT team
5
6	/*
7	CrossFire, A Multiplayer game for X-windows
8
9	Copyright (C) 2002 Mark Wedel & Crossfire Development Team	5	* Copyright (©) 2002,2007 Mark Wedel & Crossfire Development Team
10	Copyright (C) 1992 Frank Tore Johansen	6	* Copyright (©) 1992,2007 Frank Tore Johansen
11		7	*
12	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 it
13	it under the terms of the GNU General Public License as published by	9	* under the terms of the GNU General Public License as published by the Free
14	the Free Software Foundation; either version 2 of the License, or	10	* Software Foundation; either version 2 of the License, or (at your option)
15	(at your option) any later version.	11	* any later version.
16		12	*
17	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, but
18	but WITHOUT ANY WARRANTY; without even the implied warranty of	14	* WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
19	MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the	15	* or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
20	GNU General Public License for more details.	16	* for more details.
21		17	*
22	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 along
23	along with this program; if not, write to the Free Software	19	* with Crossfire TRT; if not, write to the Free Software Foundation, Inc. 51
24	Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.	20	* Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
25		21	*
26	The authors can be reached via e-mail at crossfire-devel@real-time.com	22	* The authors can be reached via e-mail to <crossfire@schmorp.de>
27	*/	23	*/
28		24
29	/*	25	/*
30	* General convenience functions for crossfire.	26	* General convenience functions for crossfire.
31	*/	27	*/
		28
		29	#include <cstdlib>
		30	#include <sys/types.h>
		31	#include <unistd.h>
		32	#include <sys/time.h>
		33	#include <time.h>
		34	#include <signal.h>
32		35
33	#include <global.h>	36	#include <global.h>
34	#include <funcpoint.h>	37	#include <funcpoint.h>
35	#include <material.h>	38	#include <material.h>
36		39
37	#include <glib.h>	40	#include <glib.h>
		41
		42	rand_gen rndm;
		43
		44	void
		45	tausworthe_random_generator::seed (uint32_t seed)
		46	{
		47	state [0] = seed * 69069U; if (state [0] < 2U) state [0] += 2U;
		48	state [1] = state [0] * 69069U; if (state [0] < 8U) state [0] += 8U;
		49	state [2] = state [1] * 69069U; if (state [0] < 16U) state [0] += 16U;
		50	state [3] = state [2] * 69069U; if (state [0] < 128) state [0] += 128U;
		51
		52	for (int i = 11; --i; )
		53	operator ()();
		54	}
		55
		56	uint32_t
		57	tausworthe_random_generator::next ()
		58	{
		59	state [0] = ((state [0] & 0xFFFFFFFEU) << 18U) ^ (((state [0] << 6U) ^ state [0]) >> 13U);
		60	state [1] = ((state [1] & 0xFFFFFFF8U) << 2U) ^ (((state [1] << 2U) ^ state [1]) >> 27U);
		61	state [2] = ((state [2] & 0xFFFFFFF0U) << 7U) ^ (((state [2] << 13U) ^ state [2]) >> 21U);
		62	state [3] = ((state [3] & 0xFFFFFF80U) << 13U) ^ (((state [3] << 3U) ^ state [3]) >> 12U);
		63
		64	return state [0] ^ state [1] ^ state [2] ^ state [3];
		65	}
		66
		67	uint32_t
		68	tausworthe_random_generator::get_range (uint32_t num)
		69	{
		70	return (next () * (uint64_t)num) >> 32U;
		71	}
		72
		73	// return a number within (min .. max)
		74	int
		75	tausworthe_random_generator::get_range (int r_min, int r_max)
		76	{
		77	return r_min + get_range (max (r_max - r_min + 1, 0));
		78	}
38		79
39	/*	80	/*
40	* The random functions here take luck into account when rolling random	81	* The random functions here take luck into account when rolling random
41	* dice or numbers. This function has less of an impact the larger the	82	* dice or numbers. This function has less of an impact the larger the
42	* difference becomes in the random numbers. IE, the effect is lessened	83	* difference becomes in the random numbers. IE, the effect is lessened
49	* Roll a random number between min and max. Uses op to determine luck,	90	* Roll a random number between min and max. Uses op to determine luck,
50	* and if goodbad is non-zero, luck increases the roll, if zero, it decreases.	91	* and if goodbad is non-zero, luck increases the roll, if zero, it decreases.
51	* Generally, op should be the player/caster/hitter requesting the roll,	92	* Generally, op should be the player/caster/hitter requesting the roll,
52	* not the recipient (ie, the poor slob getting hit). [garbled 20010916]	93	* not the recipient (ie, the poor slob getting hit). [garbled 20010916]
53	*/	94	*/
54		95	int
55	int random_roll(int min, int max, const object *op, int goodbad) {	96	random_roll (int r_min, int r_max, const object *op, int goodbad)
56	int omin, diff, luck, base, ran;	97	{
		98	int base = r_max - r_min > 1 ? 20 : 50; /* d2 and d3 are corner cases */
57		99
58	omin = min;	100	if (r_max < r_min)
59	diff = max - min + 1;	101	{
60	((diff > 2) ? (base = 20) : (base = 50)); /* d2 and d3 are corner cases */
61
62	if (max < 1 \|\| diff < 1) {
63	LOG(llevError, "Calling random_roll with min=%d max=%d\n", min, max);	102	LOG (llevError \| logBacktrace, "Calling random_roll with min=%d max=%d\n", r_min, r_max);
64	return(min); /* avoids a float exception */	103	return r_min;
65	}	104	}
66		105
67	ran = RANDOM();
68
69	if (op->type != PLAYER)	106	if (op->type == PLAYER)
70	return((ran%diff)+min);	107	{
71
72	luck = op->stats.luck;	108	int luck = op->stats.luck;
73	if (RANDOM()%base < MIN(10, abs(luck))) {
74	/* we have a winner */
75	((luck > 0) ? (luck = 1) : (luck = -1));
76	diff -= luck;
77	if (diff < 1)
78	return(omin); /check again/
79	((goodbad) ? (min += luck) : (diff));
80		109
81	return(MAX(omin, MIN(max, (ran%diff)+min)));	110	if (rndm (base) < min (10, abs (luck)))
		111	{
		112	//TODO: take luck into account
		113	}
82	}	114	}
83	return((ran%diff)+min);	115
		116	return rndm (r_min, r_max);
84	}	117	}
85		118
86	/*	119	/*
87	* This is a 64 bit version of random_roll above. This is needed	120	* This is a 64 bit version of random_roll above. This is needed
88	* for exp loss calculations for players changing religions.	121	* for exp loss calculations for players changing religions.
89	*/	122	*/
90		123	sint64
91	sint64 random_roll64(sint64 min, sint64 max, const object *op, int goodbad) {	124	random_roll64 (sint64 min, sint64 max, const object *op, int goodbad)
92	sint64 omin, diff, luck, ran;	125	{
93	int base;
94
95	omin = min;	126	sint64 omin = min;
96	diff = max - min + 1;	127	sint64 diff = max - min + 1;
97	((diff > 2) ? (base = 20) : (base = 50)); /* d2 and d3 are corner cases */	128	int base = diff > 2 ? 20 : 50; /* d2 and d3 are corner cases */
98		129
99	if (max < 1 \|\| diff < 1) {	130	if (diff < 0)
100	#ifndef WIN32	131	{
101	LOG(llevError, "Calling random_roll with min=%lld max=%lld\n", min, max);
102	#else
103	LOG(llevError, "Calling random_roll with min=%I64d max=%I64d\n", min, max);	132	LOG (llevError \| logBacktrace, "Calling random_roll64 with min=%" PRId64 " max=%" PRId64 "\n", min, max);
104	#endif
105	return(min); /* avoids a float exception */	133	return (min); /* avoids a float exception */
106	}	134	}
107		135
108	/* Don't know of a portable call to get 64 bit random values.	136	/*
109	* So make a call to get two 32 bit random numbers, and just to	137	* Make a call to get two 32 bit unsigned random numbers, and just to
110	* a little byteshifting. Do make sure the first one is only	138	* a little bitshifting.
111	* 32 bit, so we don't get skewed results
112	*/	139	*/
113	ran = (RANDOM() & 0xffffffff) \| ((sint64)RANDOM() << 32);	140	sint64 ran = (sint64) rndm.next () ^ ((sint64) rndm.next () << 31);
114		141
115	if (op->type != PLAYER)	142	if (op->type != PLAYER)
116	return((ran%diff)+min);	143	return ((ran % diff) + min);
117		144
118	luck = op->stats.luck;	145	int luck = op->stats.luck;
		146
119	if (RANDOM()%base < MIN(10, abs(luck))) {	147	if (rndm (base) < MIN (10, abs (luck)))
		148	{
120	/* we have a winner */	149	/* we have a winner */
121	((luck > 0) ? (luck = 1) : (luck = -1));	150	((luck > 0) ? (luck = 1) : (luck = -1));
122	diff -= luck;	151	diff -= luck;
123	if (diff < 1)	152	if (diff < 1)
124	return(omin); /check again/	153	return (omin); /check again /
		154
125	((goodbad) ? (min += luck) : (diff));	155	((goodbad) ? (min += luck) : (diff));
126		156
127	return(MAX(omin, MIN(max, (ran%diff)+min)));	157	return (MAX (omin, MIN (max, (ran % diff) + min)));
128	}	158	}
		159
129	return((ran%diff)+min);	160	return ran % diff + min;
130	}	161	}
131		162
132	/*	163	/*
133	* Roll a number of dice (2d3, 4d6). Uses op to determine luck,	164	* Roll a number of dice (2d3, 4d6). Uses op to determine luck,
134	* If goodbad is non-zero, luck increases the roll, if zero, it decreases.	165	* If goodbad is non-zero, luck increases the roll, if zero, it decreases.
135	* Generally, op should be the player/caster/hitter requesting the roll,	166	* Generally, op should be the player/caster/hitter requesting the roll,
136	* not the recipient (ie, the poor slob getting hit).	167	* not the recipient (ie, the poor slob getting hit).
137	* The args are num D size (ie 4d6) [garbled 20010916]	168	* The args are num D size (ie 4d6) [garbled 20010916]
138	*/	169	*/
139		170	int
140	int die_roll(int num, int size, const object *op, int goodbad) {	171	die_roll (int num, int size, const object *op, int goodbad)
		172	{
141	int min, diff, luck, total, i, gotlucky, base, ran;	173	int min, luck, total, i, gotlucky;
142		174
143	diff = size;	175	int diff = size;
144	min = 1;	176	min = 1;
145	luck = total = gotlucky = 0;	177	luck = total = gotlucky = 0;
146	((diff > 2) ? (base = 20) : (base = 50)); /* d2 and d3 are corner cases */	178	int base = diff > 2 ? 20 : 50; /* d2 and d3 are corner cases */
		179
147	if (size < 2 \|\| diff < 1) {	180	if (size < 2 \|\| diff < 1)
		181	{
148	LOG(llevError, "Calling die_roll with num=%d size=%d\n", num, size);	182	LOG (llevError, "Calling die_roll with num=%d size=%d\n", num, size);
149	return(num); /* avoids a float exception */	183	return num; /* avoids a float exception */
150	}	184	}
151		185
152	if (op->type == PLAYER)	186	if (op->type == PLAYER)
153	luck = op->stats.luck;	187	luck = op->stats.luck;
154		188
155	for (i = 0; i < num; i++) {	189	for (i = 0; i < num; i++)
		190	{
156	if (RANDOM()%base < MIN(10, abs(luck)) && !gotlucky) {	191	if (rndm (base) < MIN (10, abs (luck)) && !gotlucky)
		192	{
157	/* we have a winner */	193	/* we have a winner */
158	gotlucky++;	194	gotlucky++;
159	((luck > 0) ? (luck = 1) : (luck = -1));	195	((luck > 0) ? (luck = 1) : (luck = -1));
160	diff -= luck;	196	diff -= luck;
161	if (diff < 1)	197	if (diff < 1)
162	return(num); /check again/	198	return (num); /check again /
163	((goodbad) ? (min += luck) : (diff));	199	((goodbad) ? (min += luck) : (diff));
164	ran = RANDOM();
165	total += MAX(1, MIN(size, (ran%diff)+min));	200	total += MAX (1, MIN (size, rndm (diff) + min));
		201	}
166	} else {	202	else
167	total += RANDOM()%size+1;	203	total += rndm (size) + 1;
168	}
169	}	204	}
		205
170	return(total);	206	return total;
171	}	207	}
172		208
173	/*
174	* Another convenience function. Returns a number between min and max.
175	* It is suggested one use these functions rather than RANDOM()%, as it
176	* would appear that a number of off-by-one-errors exist due to improper
177	* use of %. This should also prevent SIGFPE.
178	*/
179
180	int rndm(int min, int max)
181	{
182	int diff;
183
184	diff = max - min + 1;
185	if (max < 1 \|\| diff < 1)
186	return(min);
187
188	return(RANDOM()%diff+min);
189	}
190
191	/* decay and destroy persihable items in a map */	209	/* decay and destroy perishable items in a map */
192		210	void
193	void decay_objects(mapstruct *m)	211	maptile::decay_objects ()
194	{	212	{
195	int x, y, destroy;	213	if (!spaces)
196	object op, otmp;
197
198	if (m->unique)
199	return;	214	return;
200		215
201	for (x=0; x < MAP_WIDTH(m); x++)	216	for (mapspace *ms = spaces + size (); ms-- > spaces; )
202	for (y=0; y < MAP_HEIGHT(m); y++)	217	for (object above, op = ms->bot; op; op = above)
203	for (op = get_map_ob(m, x, y); op; op = otmp) {	218	{
		219	above = op->above;
		220
204	destroy = 0;	221	bool destroy = 0;
205	otmp = op->above;	222
		223	// do not decay anything above unique floor tiles (yet :)
206	if (QUERY_FLAG(op,FLAG_IS_FLOOR) && QUERY_FLAG(op, FLAG_UNIQUE))	224	if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE))
207	break;	225	break;
		226
208	if (QUERY_FLAG(op, FLAG_IS_FLOOR) \|\|	227	if (QUERY_FLAG (op, FLAG_IS_FLOOR)
209	QUERY_FLAG(op, FLAG_OBJ_ORIGINAL) \|\|	228	\|\| QUERY_FLAG (op, FLAG_OBJ_ORIGINAL)
210	QUERY_FLAG(op, FLAG_OBJ_SAVE_ON_OVL) \|\|	229	\|\| QUERY_FLAG (op, FLAG_OBJ_SAVE_ON_OVL)
211	QUERY_FLAG(op, FLAG_UNIQUE) \|\|	230	\|\| QUERY_FLAG (op, FLAG_UNIQUE)
212	QUERY_FLAG(op, FLAG_OVERLAY_FLOOR) \|\|	231	\|\| QUERY_FLAG (op, FLAG_OVERLAY_FLOOR)
213	QUERY_FLAG(op, FLAG_UNPAID) \|\| IS_LIVE(op))	232	\|\| QUERY_FLAG (op, FLAG_UNPAID)
214	continue;	233	\|\| op->is_alive ())
215	/* otherwise, we decay and destroy */	234	; // do not decay
216	if (IS_WEAPON(op)) {	235	else if (op->is_weapon ())
		236	{
217	op->stats.dam--;	237	op->stats.dam--;
218	if (op->stats.dam < 0)	238	if (op->stats.dam < 0)
219	destroy = 1;	239	destroy = 1;
220	} else if (IS_ARMOR(op)) {
221	op->stats.ac--;
222	if (op->stats.ac < 0)
223	destroy = 1;
224	} else if (op->type == FOOD) {
225	op->stats.food -= rndm(5,20);
226	if (op->stats.food < 0)
227	destroy = 1;
228	} else {
229	if (op->material & M_PAPER \|\| op->material & M_LEATHER \|\|
230	op->material & M_WOOD \|\| op->material & M_ORGANIC \|\|
231	op->material & M_CLOTH \|\| op->material & M_LIQUID)
232	destroy = 1;
233	if (op->material & M_IRON && rndm(1,5) == 1)
234	destroy = 1;
235	if (op->material & M_GLASS && rndm(1,2) == 1)
236	destroy = 1;
237	if ((op->material & M_STONE \|\| op->material & M_ADAMANT) &&
238	rndm(1,10) == 1)
239	destroy = 1;
240	if ((op->material & M_SOFT_METAL \|\| op->material & M_BONE) &&
241	rndm(1,3) == 1)
242	destroy = 1;
243	if (op->material & M_ICE && MAP_TEMP(m) > 32)
244	destroy = 1;
245	}
246	/* adjust overall chance below */
247	if (destroy && rndm(0, 1)) {
248	remove_ob(op);
249	free_object(op);
250	}
251	}	240	}
		241	else if (op->is_armor ())
		242	{
		243	op->stats.ac--;
		244	if (op->stats.ac < 0)
		245	destroy = 1;
		246	}
		247	else if (op->type == FOOD)
		248	{
		249	op->stats.food -= rndm (5, 20);
		250	if (op->stats.food < 0)
		251	destroy = 1;
		252	}
		253	else
		254	{
		255	int mat = op->materials;
		256
		257	if (mat & M_PAPER
		258	\|\| mat & M_LEATHER
		259	\|\| mat & M_WOOD
		260	\|\| mat & M_ORGANIC
		261	\|\| mat & M_CLOTH
		262	\|\| mat & M_LIQUID
		263	\|\| (mat & M_IRON && rndm (1, 5) == 1)
		264	\|\| (mat & M_GLASS && rndm (1, 2) == 1)
		265	\|\| ((mat & M_STONE \|\| mat & M_ADAMANT) && rndm (1, 10) == 1)
		266	\|\| ((mat & M_SOFT_METAL \|\| mat & M_BONE) && rndm (1, 3) == 1)
		267	\|\| (mat & M_ICE && temp > 32))
		268	destroy = 1;
		269	}
		270
		271	/* adjust overall chance below */
		272	if (destroy && rndm (0, 1))
		273	op->destroy ();
		274	}
252	}	275	}
253		276
254	/* convert materialname to materialtype_t */	277	/* convert materialname to materialtype_t */
255		278
256	materialtype_t name_to_material(const char name)	279	materialtype_t *
		280	name_to_material (const shstr &name)
257	{	281	{
258	materialtype_t mt, nmt;	282	for (materialtype_t *mt = materialt; mt && mt->next; mt = mt->next)
259		283	if (name == mt->name)
260	mt = NULL;
261	for (nmt = materialt; nmt != NULL && nmt->next != NULL; nmt=nmt->next) {
262	if (strcmp(name, nmt->name) == 0) {
263	mt = nmt;
264	break;
265	}
266	}
267	return mt;	284	return mt;
		285
		286	return materialt;
268	}	287	}
269		288
270	/* when doing transmutation of objects, we have to recheck the resistances,	289	/* when doing transmutation of objects, we have to recheck the resistances,
271	* as some that did not apply previously, may apply now.	290	* as some that did not apply previously, may apply now.
272	*/	291	*/
273		292
		293	void
274	void transmute_materialname(object op, const object change)	294	transmute_materialname (object op, const object change)
275	{	295	{
276	materialtype_t *mt;	296	materialtype_t *mt;
277	int j;	297	int j;
278		298
279	if (op->materialname == NULL)	299	if (op->materialname == NULL)
280	return;	300	return;
281		301
282	if (change->materialname != NULL &&	302	if (change->materialname != NULL && strcmp (op->materialname, change->materialname))
283	strcmp(op->materialname, change->materialname))
284	return;	303	return;
285		304
286	if (!IS_ARMOR(op))	305	if (!op->is_armor ())
287	return;	306	return;
288		307
289	mt = name_to_material(op->materialname);	308	mt = name_to_material (op->materialname);
290	if (!mt) {	309	if (!mt)
		310	{
291	LOG(llevError, "archetype '%s>%s' uses nonexistent material '%s'\n", &op->arch->name, &op->name, &op->materialname);	311	LOG (llevError, "archetype '%s>%s' uses nonexistent material '%s'\n", &op->arch->name, &op->name, &op->materialname);
292	return;	312	return;
293	}	313	}
294		314
295	for (j=0; j < NROFATTACKS; j++)	315	for (j = 0; j < NROFATTACKS; j++)
296	if (op->resist[j] == 0 && change->resist[j] != 0) {	316	if (op->resist[j] == 0 && change->resist[j] != 0)
		317	{
297	op->resist[j] += mt->mod[j];	318	op->resist[j] += mt->mod[j];
298	if (op->resist[j] > 100)	319	if (op->resist[j] > 100)
299	op->resist[j] = 100;	320	op->resist[j] = 100;
300	if (op->resist[j] < -100)	321	if (op->resist[j] < -100)
301	op->resist[j] = -100;	322	op->resist[j] = -100;
302	}	323	}
303	}	324	}
304		325
305	/* set the materialname and type for an item */	326	/* set the materialname and type for an item */
		327	void
306	void set_materialname(object op, int difficulty, materialtype_t nmt)	328	set_materialname (object op, int difficulty, materialtype_t nmt)
307	{	329	{
308	materialtype_t mt, lmt;	330	materialtype_t mt, lmt;
		331
309	#ifdef NEW_MATERIAL_CODE	332	#ifdef NEW_MATERIAL_CODE
310	int j;	333	int j;
311	#endif	334	#endif
312		335
313	if (op->materialname != NULL)	336	if (op->materialname != NULL)
314	return;	337	return;
315		338
316		339
317		340
318	if (nmt == NULL) {	341	if (nmt == NULL)
		342	{
319	lmt = NULL;	343	lmt = NULL;
320	#ifndef NEW_MATERIAL_CODE	344	#ifndef NEW_MATERIAL_CODE
321	for (mt = materialt; mt != NULL && mt->next != NULL; mt=mt->next) {	345	for (mt = materialt; mt && mt->next; mt = mt->next)
		346	{
322	if (op->material & mt->material) {	347	if (op->materials & mt->material)
		348	{
323	lmt = mt;	349	lmt = mt;
		350	break;
		351	}
		352	}
		353
		354	#else
		355	for (mt = materialt; mt && mt->next; mt = mt->next)
		356	{
		357	if (op->materials & mt->material && rndm (1, 100) <= mt->chance &&
		358	difficulty >= mt->difficulty && (op->magic >= mt->magic \|\| mt->magic == 0))
		359	{
		360	lmt = mt;
		361	if (!(op->is_weapon () \|\| op->is_armor ()))
324	break;	362	break;
325	}	363	}
326	}	364	}
		365	#endif
		366	}
		367	else
		368	{
		369	lmt = nmt;
		370	}
327		371
		372	if (lmt != NULL)
		373	{
		374	#ifndef NEW_MATERIAL_CODE
		375	op->materialname = lmt->name;
		376	return;
328	#else	377	#else
329	for (mt = materialt; mt != NULL && mt->next != NULL; mt=mt->next) {	378
330	if (op->material & mt->material && rndm(1, 100) <= mt->chance &&	379	if (op->stats.dam && op->is_weapon ())
331	difficulty >= mt->difficulty &&
332	(op->magic >= mt->magic \|\| mt->magic == 0)) {
333	lmt = mt;
334	if (!(IS_WEAPON(op) \|\| IS_ARMOR(op)))
335	break;
336	}
337	}	380	{
338	#endif
339	} else {
340	lmt = nmt;
341	}
342
343	if (lmt != NULL) {
344	#ifndef NEW_MATERIAL_CODE
345	op->materialname = lmt->name;
346	return;
347	#else
348
349	if (op->stats.dam && IS_WEAPON(op)) {
350	op->stats.dam += lmt->damage;	381	op->stats.dam += lmt->damage;
351	if (op->stats.dam < 1)	382	if (op->stats.dam < 1)
352	op->stats.dam = 1;	383	op->stats.dam = 1;
353	}	384	}
		385
354	if (op->stats.sp && op->type == BOW)	386	if (op->stats.sp && op->type == BOW)
355	op->stats.sp += lmt->sp;	387	op->stats.sp += lmt->sp;
356	if (op->stats.wc && IS_WEAPON(op))	388	if (op->stats.wc && op->is_weapon ())
357	op->stats.wc += lmt->wc;	389	op->stats.wc += lmt->wc;
358	if (IS_ARMOR(op)) {	390	if (op->is_armor ())
		391	{
359	if (op->stats.ac)	392	if (op->stats.ac)
360	op->stats.ac += lmt->ac;	393	op->stats.ac += lmt->ac;
361	for (j=0; j < NROFATTACKS; j++)	394	for (j = 0; j < NROFATTACKS; j++)
362	if (op->resist[j] != 0) {	395	if (op->resist[j] != 0)
		396	{
363	op->resist[j] += lmt->mod[j];	397	op->resist[j] += lmt->mod[j];
364	if (op->resist[j] > 100)	398	if (op->resist[j] > 100)
365	op->resist[j] = 100;	399	op->resist[j] = 100;
366	if (op->resist[j] < -100)	400	if (op->resist[j] < -100)
367	op->resist[j] = -100;	401	op->resist[j] = -100;
368	}	402	}
369	}	403	}
370	op->materialname = add_string(lmt->name);	404	op->materialname = lmt->name;
371	/* dont make it unstackable if it doesn't need to be */	405	/* dont make it unstackable if it doesn't need to be */
372	if (IS_WEAPON(op) \|\| IS_ARMOR(op)) {	406	if (op->is_weapon () \|\| op->is_armor ())
		407	{
373	op->weight = (op->weight * lmt->weight)/100;	408	op->weight = (op->weight * lmt->weight) / 100;
374	op->value = (op->value * lmt->value)/100;	409	op->value = (op->value * lmt->value) / 100;
375	}	410	}
376	#endif	411	#endif
377	}	412	}
378	}	413	}
379		414
380	/*	415	/*
381	* Strip out the media tags from a String.	416	* Strip out the media tags from a String.
382	* Warning the input string will contain the result string	417	* Warning the input string will contain the result string
383	*/	418	*/
		419	void
384	void strip_media_tag(char *message){	420	strip_media_tag (char *message)
		421	{
385	int in_tag=0;	422	int in_tag = 0;
386	char* dest;	423	char *dest;
387	char* src;	424	char *src;
		425
388	src=dest=message;	426	src = dest = message;
389	while (*src!='\0'){	427	while (*src != '\0')
		428	{
390	if (*src=='['){	429	if (*src == '[')
		430	{
391	in_tag=1;	431	in_tag = 1;
		432	}
392	} else if (in_tag && (*src==']'))	433	else if (in_tag && (*src == ']'))
393	in_tag=0;	434	in_tag = 0;
394	else if (!in_tag){	435	else if (!in_tag)
		436	{
395	dest=src;	437	dest = src;
396	dest++;	438	dest++;
397	}	439	}
398	src++;	440	src++;
399	}	441	}
400	*dest='\0';	442	*dest = '\0';
401	}	443	}
402		444
		445	const char *
403	const char* strrstr(const char* haystack, const char* needle){	446	strrstr (const char haystack, const char needle)
		447	{
404	const char* lastneedle;	448	const char *lastneedle;
		449
405	lastneedle=NULL;	450	lastneedle = NULL;
406	while((haystack=strstr(haystack,needle))!=NULL){	451	while ((haystack = strstr (haystack, needle)) != NULL)
		452	{
407	lastneedle=haystack;	453	lastneedle = haystack;
408	haystack++;	454	haystack++;
409	}	455	}
410	return lastneedle;	456	return lastneedle;
411		457
412	}	458	}
		459
413	#define EOL_SIZE (sizeof("\n")-1)	460	#define EOL_SIZE (sizeof("\n")-1)
		461	void
414	void strip_endline(char* buf){	462	strip_endline (char *buf)
		463	{
415	if (strlen(buf)<sizeof("\n")){	464	if (strlen (buf) < sizeof ("\n"))
		465	{
416	return;	466	return;
417	}	467	}
418	if (!strcmp(buf+strlen(buf)-EOL_SIZE,"\n"))	468	if (!strcmp (buf + strlen (buf) - EOL_SIZE, "\n"))
419	buf[strlen(buf)-EOL_SIZE]='\0';	469	buf[strlen (buf) - EOL_SIZE] = '\0';
420	}	470	}
421		471
422	/**	472	/**
423	* Replace in string src all occurrences of key by replacement. The resulting	473	* Replace in string src all occurrences of key by replacement. The resulting
424	* string is put into result; at most resultsize characters (including the	474	* string is put into result; at most resultsize characters (including the
425	* terminating null character) will be written to result.	475	* terminating null character) will be written to result.
426	*/	476	*/
		477	void
427	void replace(const char src, const char key, const char replacement, char result, size_t resultsize)	478	replace (const char src, const char key, const char replacement, char result, size_t resultsize)
428	{	479	{
429	size_t resultlen;	480	size_t resultlen;
430	size_t keylen;	481	size_t keylen;
431		482
432	/* special case to prevent infinite loop if key==replacement=="" */	483	/* special case to prevent infinite loop if key==replacement=="" */
433	if(strcmp(key, replacement) == 0)	484	if (strcmp (key, replacement) == 0)
434	{	485	{
435	snprintf(result, resultsize, "%s", src);	486	snprintf (result, resultsize, "%s", src);
436	return;	487	return;
437	}	488	}
438		489
439	keylen = strlen(key);	490	keylen = strlen (key);
440		491
441	resultlen = 0;	492	resultlen = 0;
442	while(*src != '\0' && resultlen+1 < resultsize)	493	while (*src != '\0' && resultlen + 1 < resultsize)
443	{	494	{
444	if(strncmp(src, key, keylen) == 0)	495	if (strncmp (src, key, keylen) == 0)
445	{	496	{
446	snprintf(result+resultlen, resultsize-resultlen, "%s", replacement);	497	snprintf (result + resultlen, resultsize - resultlen, "%s", replacement);
447	resultlen += strlen(result+resultlen);	498	resultlen += strlen (result + resultlen);
448	src += keylen;	499	src += keylen;
449	}	500	}
450	else	501	else
451	{
452	result[resultlen++] = *src++;
453	}
454	}	502	{
		503	result[resultlen++] = *src++;
		504	}
		505	}
455	result[resultlen] = '\0';	506	result[resultlen] = '\0';
456	}	507	}
457		508
458	/**	509	/**
459	* Taking a string as an argument, mutate it into a string that looks like a list.	510	* Taking a string as an argument, mutate it into a string that looks like a list.
460	* a 'list' for the purposes here, is a string of items, seperated by commas, except	511	* a 'list' for the purposes here, is a string of items, seperated by commas, except
461	* for the last entry, which has an 'and' before it, and a full stop (period) after it.	512	* for the last entry, which has an 'and' before it, and a full stop (period) after it.
462	* This function will also strip all trailing non alphanumeric characters.	513	* This function will also strip all trailing non alphanumeric characters.
463	* It does not insert an oxford comma.	514	* It does not insert an oxford comma.
464	*/	515	*/
465		516
		517	void
466	void make_list_like(char *input) {	518	make_list_like (char *input)
		519	{
467	char *p, tmp[MAX_BUF];	520	char *p, tmp[MAX_BUF];
468	int i;	521	int i;
		522
469	if (!input \|\| strlen(input) > MAX_BUF-5) return;	523	if (!input \|\| strlen (input) > MAX_BUF - 5)
470	/* bad stuff would happen if we continued here, the -5 is to make space for ' and ' */
471
472	strncpy(tmp, input, MAX_BUF-5);
473	/trim all trailing commas, spaces etc./
474	for (i=strlen(tmp); !isalnum(tmp[i]) && i >= 0; i--)
475	tmp[i]='\0';
476	strcat(tmp, ".");
477
478	p=strrchr(tmp, ',');
479	if (p) {
480	*p='\0';
481	strcpy(input, tmp);
482	p++;
483	strcat(input, " and");
484	strcat(input, p);
485	}
486	else strcpy(input, tmp);
487	return;	524	return;
488	}	525	/* bad stuff would happen if we continued here, the -5 is to make space for ' and ' */
489		526
		527	strncpy (tmp, input, MAX_BUF - 5);
		528	/trim all trailing commas, spaces etc. /
		529	for (i = strlen (tmp); !isalnum (tmp[i]) && i >= 0; i--)
		530	tmp[i] = '\0';
		531
		532	strcat (tmp, ".");
		533
		534	p = strrchr (tmp, ',');
		535	if (p)
		536	{
		537	*p = '\0';
		538	strcpy (input, tmp);
		539	p++;
		540	strcat (input, " and");
		541	strcat (input, p);
		542	}
		543	else
		544	strcpy (input, tmp);
		545
		546	return;
		547	}
		548
		549	/////////////////////////////////////////////////////////////////////////////
		550
490	void *	551	void
491	zero_initialised::operator new (size_t s)	552	fork_abort (const char *msg)
492	{
493	return g_slice_alloc0 (s);
494	}
495
496	void *
497	zero_initialised::operator new [] (size_t s)
498	{
499	return g_slice_alloc0 (s);
500	}
501
502	void
503	zero_initialised::operator delete (void *p, size_t s)
504	{	553	{
505	g_slice_free1 (s, p);	554	if (!fork ())
506	}	555	{
		556	signal (SIGABRT, SIG_DFL);
		557	// try to put corefiles into a subdirectory, if existing, to allow
		558	// an administrator to reduce the I/O load.
		559	chdir ("cores");
		560	abort ();
		561	}
507		562
508	void	563	LOG (llevError, "fork abort: %s\n", msg);
509	zero_initialised::operator delete [] (void *p, size_t s)
510	{
511	g_slice_free1 (s, p);
512	}	564	}
513		565
		566	void *salloc_ (int n) throw (std::bad_alloc)
		567	{
		568	#ifdef PREFER_MALLOC
		569	void *ptr = malloc (n);
		570	#else
		571	void *ptr = g_slice_alloc (n);
		572	#endif
		573
		574	if (!ptr)
		575	throw std::bad_alloc ();
		576
		577	return ptr;
		578	}
		579
		580	void salloc_ (int n, void src) throw (std::bad_alloc)
		581	{
		582	void *ptr = salloc_ (n);
		583
		584	if (src)
		585	memcpy (ptr, src, n);
		586	else
		587	memset (ptr, 0, n);
		588
		589	return ptr;
		590	}
		591
		592	void assign (char dst, const char src, int maxlen)
		593	{
		594	if (!src)
		595	src = "";
		596
		597	int len = strlen (src);
		598
		599	if (len >= maxlen - 1)
		600	{
		601	if (maxlen <= 4)
		602	{
		603	memset (dst, '.', maxlen - 1);
		604	dst [maxlen - 1] = 0;
		605	}
		606	else
		607	{
		608	memcpy (dst, src, maxlen - 4);
		609	memcpy (dst + maxlen - 4, "...", 4);
		610	}
		611	}
		612	else
		613	memcpy (dst, src, len + 1);
		614	}
		615
		616	const std::string
		617	format (const char *format, ...)
		618	{
		619	int len;
		620
		621	{
		622	char buf[128];
		623
		624	va_list ap;
		625	va_start (ap, format);
		626	len = vsnprintf (buf, sizeof (buf), format, ap);
		627	va_end (ap);
		628
		629	assert (len >= 0); // shield againstz broken vsnprintf's
		630
		631	// was our static buffer short enough?
		632	if (len < sizeof (buf))
		633	return std::string (buf, len);
		634	}
		635
		636	{
		637	// longer, try harder
		638	char *buf = salloc<char> (len + 1);
		639
		640	va_list ap;
		641	va_start (ap, format);
		642	vsnprintf (buf, len + 1, format, ap);
		643	va_end (ap);
		644
		645	const std::string s (buf, len);
		646	sfree<char> (buf, len + 1);
		647
		648	return buf;
		649	}
		650	}
		651
		652	tstamp now ()
		653	{
		654	struct timeval tv;
		655
		656	gettimeofday (&tv, 0);
		657	return tstamp (tv.tv_sec) + tstamp (tv.tv_usec) * tstamp (1e-6);
		658	}
		659
		660	int
		661	similar_direction (int a, int b)
		662	{
		663	if (!a \|\| !b)
		664	return 0;
		665
		666	int diff = (b - a) & 7;
		667	return diff <= 1 \|\| diff >= 7;
		668	}
		669
		670	/* crc32 0xdebb20e3 table and supplementary functions. */
		671	extern const uint32_t crc_32_tab[256] =
		672	{
		673	0x00000000UL, 0x77073096UL, 0xee0e612cUL, 0x990951baUL, 0x076dc419UL,
		674	0x706af48fUL, 0xe963a535UL, 0x9e6495a3UL, 0x0edb8832UL, 0x79dcb8a4UL,
		675	0xe0d5e91eUL, 0x97d2d988UL, 0x09b64c2bUL, 0x7eb17cbdUL, 0xe7b82d07UL,
		676	0x90bf1d91UL, 0x1db71064UL, 0x6ab020f2UL, 0xf3b97148UL, 0x84be41deUL,
		677	0x1adad47dUL, 0x6ddde4ebUL, 0xf4d4b551UL, 0x83d385c7UL, 0x136c9856UL,
		678	0x646ba8c0UL, 0xfd62f97aUL, 0x8a65c9ecUL, 0x14015c4fUL, 0x63066cd9UL,
		679	0xfa0f3d63UL, 0x8d080df5UL, 0x3b6e20c8UL, 0x4c69105eUL, 0xd56041e4UL,
		680	0xa2677172UL, 0x3c03e4d1UL, 0x4b04d447UL, 0xd20d85fdUL, 0xa50ab56bUL,
		681	0x35b5a8faUL, 0x42b2986cUL, 0xdbbbc9d6UL, 0xacbcf940UL, 0x32d86ce3UL,
		682	0x45df5c75UL, 0xdcd60dcfUL, 0xabd13d59UL, 0x26d930acUL, 0x51de003aUL,
		683	0xc8d75180UL, 0xbfd06116UL, 0x21b4f4b5UL, 0x56b3c423UL, 0xcfba9599UL,
		684	0xb8bda50fUL, 0x2802b89eUL, 0x5f058808UL, 0xc60cd9b2UL, 0xb10be924UL,
		685	0x2f6f7c87UL, 0x58684c11UL, 0xc1611dabUL, 0xb6662d3dUL, 0x76dc4190UL,
		686	0x01db7106UL, 0x98d220bcUL, 0xefd5102aUL, 0x71b18589UL, 0x06b6b51fUL,
		687	0x9fbfe4a5UL, 0xe8b8d433UL, 0x7807c9a2UL, 0x0f00f934UL, 0x9609a88eUL,
		688	0xe10e9818UL, 0x7f6a0dbbUL, 0x086d3d2dUL, 0x91646c97UL, 0xe6635c01UL,
		689	0x6b6b51f4UL, 0x1c6c6162UL, 0x856530d8UL, 0xf262004eUL, 0x6c0695edUL,
		690	0x1b01a57bUL, 0x8208f4c1UL, 0xf50fc457UL, 0x65b0d9c6UL, 0x12b7e950UL,
		691	0x8bbeb8eaUL, 0xfcb9887cUL, 0x62dd1ddfUL, 0x15da2d49UL, 0x8cd37cf3UL,
		692	0xfbd44c65UL, 0x4db26158UL, 0x3ab551ceUL, 0xa3bc0074UL, 0xd4bb30e2UL,
		693	0x4adfa541UL, 0x3dd895d7UL, 0xa4d1c46dUL, 0xd3d6f4fbUL, 0x4369e96aUL,
		694	0x346ed9fcUL, 0xad678846UL, 0xda60b8d0UL, 0x44042d73UL, 0x33031de5UL,
		695	0xaa0a4c5fUL, 0xdd0d7cc9UL, 0x5005713cUL, 0x270241aaUL, 0xbe0b1010UL,
		696	0xc90c2086UL, 0x5768b525UL, 0x206f85b3UL, 0xb966d409UL, 0xce61e49fUL,
		697	0x5edef90eUL, 0x29d9c998UL, 0xb0d09822UL, 0xc7d7a8b4UL, 0x59b33d17UL,
		698	0x2eb40d81UL, 0xb7bd5c3bUL, 0xc0ba6cadUL, 0xedb88320UL, 0x9abfb3b6UL,
		699	0x03b6e20cUL, 0x74b1d29aUL, 0xead54739UL, 0x9dd277afUL, 0x04db2615UL,
		700	0x73dc1683UL, 0xe3630b12UL, 0x94643b84UL, 0x0d6d6a3eUL, 0x7a6a5aa8UL,
		701	0xe40ecf0bUL, 0x9309ff9dUL, 0x0a00ae27UL, 0x7d079eb1UL, 0xf00f9344UL,
		702	0x8708a3d2UL, 0x1e01f268UL, 0x6906c2feUL, 0xf762575dUL, 0x806567cbUL,
		703	0x196c3671UL, 0x6e6b06e7UL, 0xfed41b76UL, 0x89d32be0UL, 0x10da7a5aUL,
		704	0x67dd4accUL, 0xf9b9df6fUL, 0x8ebeeff9UL, 0x17b7be43UL, 0x60b08ed5UL,
		705	0xd6d6a3e8UL, 0xa1d1937eUL, 0x38d8c2c4UL, 0x4fdff252UL, 0xd1bb67f1UL,
		706	0xa6bc5767UL, 0x3fb506ddUL, 0x48b2364bUL, 0xd80d2bdaUL, 0xaf0a1b4cUL,
		707	0x36034af6UL, 0x41047a60UL, 0xdf60efc3UL, 0xa867df55UL, 0x316e8eefUL,
		708	0x4669be79UL, 0xcb61b38cUL, 0xbc66831aUL, 0x256fd2a0UL, 0x5268e236UL,
		709	0xcc0c7795UL, 0xbb0b4703UL, 0x220216b9UL, 0x5505262fUL, 0xc5ba3bbeUL,
		710	0xb2bd0b28UL, 0x2bb45a92UL, 0x5cb36a04UL, 0xc2d7ffa7UL, 0xb5d0cf31UL,
		711	0x2cd99e8bUL, 0x5bdeae1dUL, 0x9b64c2b0UL, 0xec63f226UL, 0x756aa39cUL,
		712	0x026d930aUL, 0x9c0906a9UL, 0xeb0e363fUL, 0x72076785UL, 0x05005713UL,
		713	0x95bf4a82UL, 0xe2b87a14UL, 0x7bb12baeUL, 0x0cb61b38UL, 0x92d28e9bUL,
		714	0xe5d5be0dUL, 0x7cdcefb7UL, 0x0bdbdf21UL, 0x86d3d2d4UL, 0xf1d4e242UL,
		715	0x68ddb3f8UL, 0x1fda836eUL, 0x81be16cdUL, 0xf6b9265bUL, 0x6fb077e1UL,
		716	0x18b74777UL, 0x88085ae6UL, 0xff0f6a70UL, 0x66063bcaUL, 0x11010b5cUL,
		717	0x8f659effUL, 0xf862ae69UL, 0x616bffd3UL, 0x166ccf45UL, 0xa00ae278UL,
		718	0xd70dd2eeUL, 0x4e048354UL, 0x3903b3c2UL, 0xa7672661UL, 0xd06016f7UL,
		719	0x4969474dUL, 0x3e6e77dbUL, 0xaed16a4aUL, 0xd9d65adcUL, 0x40df0b66UL,
		720	0x37d83bf0UL, 0xa9bcae53UL, 0xdebb9ec5UL, 0x47b2cf7fUL, 0x30b5ffe9UL,
		721	0xbdbdf21cUL, 0xcabac28aUL, 0x53b39330UL, 0x24b4a3a6UL, 0xbad03605UL,
		722	0xcdd70693UL, 0x54de5729UL, 0x23d967bfUL, 0xb3667a2eUL, 0xc4614ab8UL,
		723	0x5d681b02UL, 0x2a6f2b94UL, 0xb40bbe37UL, 0xc30c8ea1UL, 0x5a05df1bUL,
		724	0x2d02ef8dL
		725	};
		726
		727

Diff Legend

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

Comparing deliantra/server/common/utils.C (file contents): Revision 1.7 by root, Fri Sep 8 17:34:02 2006 UTC vs. Revision 1.57 by root, Mon May 28 21:21:40 2007 UTC

Diff Legend

Comparing deliantra/server/common/utils.C (file contents):
Revision 1.7 by root, Fri Sep 8 17:34:02 2006 UTC vs.
Revision 1.57 by root, Mon May 28 21:21:40 2007 UTC