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

Comparing deliantra/server/common/utils.C (file contents):
Revision 1.1 by elmex, Sun Aug 13 17:16:01 2006 UTC vs.
Revision 1.56 by root, Thu May 17 21:32:08 2007 UTC

…		…
1	/*	1	/*
2	* static char *rcsid_utils_c =
3	* "$Id: utils.C,v 1.1 2006/08/13 17:16:01 elmex Exp $";
4	*/
5
6	/*
7	CrossFire, A Multiplayer game for X-windows	2	* CrossFire, A Multiplayer game
8		3	*
		4	* Copyright (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team
9	Copyright (C) 2002 Mark Wedel & Crossfire Development Team	5	* Copyright (C) 2002 Mark Wedel & Crossfire Development Team
10	Copyright (C) 1992 Frank Tore Johansen	6	* Copyright (C) 1992 Frank Tore Johansen
11		7	*
12	This program is free software; you can redistribute it and/or modify	8	* This program is free software; you can redistribute it and/or modify
13	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
14	the Free Software Foundation; either version 2 of the License, or	10	* the Free Software Foundation; either version 2 of the License, or
15	(at your option) any later version.	11	* (at your option) 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,
18	but WITHOUT ANY WARRANTY; without even the implied warranty of	14	* but WITHOUT ANY WARRANTY; without even the implied warranty of
19	MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the	15	* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
20	GNU General Public License for more details.	16	* GNU General Public License 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
23	along with this program; if not, write to the Free Software	19	* along with this program; if not, write to the Free Software
24	Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.	20	* Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, 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 at <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>
		39
		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	}
36		79
37	/*	80	/*
38	* The random functions here take luck into account when rolling random	81	* The random functions here take luck into account when rolling random
39	* 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
40	* difference becomes in the random numbers. IE, the effect is lessened	83	* difference becomes in the random numbers. IE, the effect is lessened
47	* 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,
48	* 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.
49	* Generally, op should be the player/caster/hitter requesting the roll,	92	* Generally, op should be the player/caster/hitter requesting the roll,
50	* not the recipient (ie, the poor slob getting hit). [garbled 20010916]	93	* not the recipient (ie, the poor slob getting hit). [garbled 20010916]
51	*/	94	*/
52		95	int
53	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)
54	int omin, diff, luck, base, ran;	97	{
		98	int base = r_max - r_min > 1 ? 20 : 50; /* d2 and d3 are corner cases */
55		99
56	omin = min;	100	if (r_max < r_min)
57	diff = max - min + 1;	101	{
58	((diff > 2) ? (base = 20) : (base = 50)); /* d2 and d3 are corner cases */
59
60	if (max < 1 \|\| diff < 1) {
61	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);
62	return(min); /* avoids a float exception */	103	return r_min;
63	}	104	}
64		105
65	ran = RANDOM();
66
67	if (op->type != PLAYER)	106	if (op->type == PLAYER)
68	return((ran%diff)+min);	107	{
69
70	luck = op->stats.luck;	108	int luck = op->stats.luck;
71	if (RANDOM()%base < MIN(10, abs(luck))) {
72	/* we have a winner */
73	((luck > 0) ? (luck = 1) : (luck = -1));
74	diff -= luck;
75	if (diff < 1)
76	return(omin); /check again/
77	((goodbad) ? (min += luck) : (diff));
78		109
79	return(MAX(omin, MIN(max, (ran%diff)+min)));	110	if (rndm (base) < min (10, abs (luck)))
		111	{
		112	//TODO: take luck into account
		113	}
80	}	114	}
81	return((ran%diff)+min);	115
		116	return rndm (r_min, r_max);
82	}	117	}
83		118
84	/*	119	/*
85	* 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
86	* for exp loss calculations for players changing religions.	121	* for exp loss calculations for players changing religions.
87	*/	122	*/
88		123	sint64
89	sint64 random_roll64(sint64 min, sint64 max, const object *op, int goodbad) {	124	random_roll64 (sint64 min, sint64 max, const object *op, int goodbad)
90	sint64 omin, diff, luck, ran;	125	{
91	int base;
92
93	omin = min;	126	sint64 omin = min;
94	diff = max - min + 1;	127	sint64 diff = max - min + 1;
95	((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 */
96		129
97	if (max < 1 \|\| diff < 1) {	130	if (diff < 0)
98	#ifndef WIN32	131	{
99	LOG(llevError, "Calling random_roll with min=%lld max=%lld\n", min, max);
100	#else
101	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);
102	#endif
103	return(min); /* avoids a float exception */	133	return (min); /* avoids a float exception */
104	}	134	}
105		135
106	/* Don't know of a portable call to get 64 bit random values.	136	/*
107	* 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
108	* a little byteshifting. Do make sure the first one is only	138	* a little bitshifting.
109	* 32 bit, so we don't get skewed results
110	*/	139	*/
111	ran = (RANDOM() & 0xffffffff) \| ((sint64)RANDOM() << 32);	140	sint64 ran = (sint64) rndm.next () ^ ((sint64) rndm.next () << 31);
112		141
113	if (op->type != PLAYER)	142	if (op->type != PLAYER)
114	return((ran%diff)+min);	143	return ((ran % diff) + min);
115		144
116	luck = op->stats.luck;	145	int luck = op->stats.luck;
		146
117	if (RANDOM()%base < MIN(10, abs(luck))) {	147	if (rndm (base) < MIN (10, abs (luck)))
		148	{
118	/* we have a winner */	149	/* we have a winner */
119	((luck > 0) ? (luck = 1) : (luck = -1));	150	((luck > 0) ? (luck = 1) : (luck = -1));
120	diff -= luck;	151	diff -= luck;
121	if (diff < 1)	152	if (diff < 1)
122	return(omin); /check again/	153	return (omin); /check again /
		154
123	((goodbad) ? (min += luck) : (diff));	155	((goodbad) ? (min += luck) : (diff));
124		156
125	return(MAX(omin, MIN(max, (ran%diff)+min)));	157	return (MAX (omin, MIN (max, (ran % diff) + min)));
126	}	158	}
		159
127	return((ran%diff)+min);	160	return ran % diff + min;
128	}	161	}
129		162
130	/*	163	/*
131	* 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,
132	* 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.
133	* Generally, op should be the player/caster/hitter requesting the roll,	166	* Generally, op should be the player/caster/hitter requesting the roll,
134	* not the recipient (ie, the poor slob getting hit).	167	* not the recipient (ie, the poor slob getting hit).
135	* The args are num D size (ie 4d6) [garbled 20010916]	168	* The args are num D size (ie 4d6) [garbled 20010916]
136	*/	169	*/
137		170	int
138	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	{
139	int min, diff, luck, total, i, gotlucky, base, ran;	173	int min, luck, total, i, gotlucky;
140		174
141	diff = size;	175	int diff = size;
142	min = 1;	176	min = 1;
143	luck = total = gotlucky = 0;	177	luck = total = gotlucky = 0;
144	((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
145	if (size < 2 \|\| diff < 1) {	180	if (size < 2 \|\| diff < 1)
		181	{
146	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);
147	return(num); /* avoids a float exception */	183	return num; /* avoids a float exception */
148	}	184	}
149		185
150	if (op->type == PLAYER)	186	if (op->type == PLAYER)
151	luck = op->stats.luck;	187	luck = op->stats.luck;
152		188
153	for (i = 0; i < num; i++) {	189	for (i = 0; i < num; i++)
		190	{
154	if (RANDOM()%base < MIN(10, abs(luck)) && !gotlucky) {	191	if (rndm (base) < MIN (10, abs (luck)) && !gotlucky)
		192	{
155	/* we have a winner */	193	/* we have a winner */
156	gotlucky++;	194	gotlucky++;
157	((luck > 0) ? (luck = 1) : (luck = -1));	195	((luck > 0) ? (luck = 1) : (luck = -1));
158	diff -= luck;	196	diff -= luck;
159	if (diff < 1)	197	if (diff < 1)
160	return(num); /check again/	198	return (num); /check again /
161	((goodbad) ? (min += luck) : (diff));	199	((goodbad) ? (min += luck) : (diff));
162	ran = RANDOM();
163	total += MAX(1, MIN(size, (ran%diff)+min));	200	total += MAX (1, MIN (size, rndm (diff) + min));
164	} else {	201	}
165	total += RANDOM()%size+1;	202	else
166	}	203	total += rndm (size) + 1;
167	}	204	}
		205
168	return(total);	206	return total;
169	}	207	}
170		208
171	/*
172	* Another convenience function. Returns a number between min and max.
173	* It is suggested one use these functions rather than RANDOM()%, as it
174	* would appear that a number of off-by-one-errors exist due to improper
175	* use of %. This should also prevent SIGFPE.
176	*/
177
178	int rndm(int min, int max)
179	{
180	int diff;
181
182	diff = max - min + 1;
183	if (max < 1 \|\| diff < 1)
184	return(min);
185
186	return(RANDOM()%diff+min);
187	}
188
189	/* decay and destroy persihable items in a map */	209	/* decay and destroy perishable items in a map */
190		210	void
191	void decay_objects(mapstruct *m)	211	maptile::decay_objects ()
192	{	212	{
193	int x, y, destroy;	213	if (!spaces)
194	object op, otmp;	214	return;
195		215
196	if (m->unique)	216	for (mapspace *ms = spaces + size (); ms-- > spaces; )
197	return;	217	for (object above, op = ms->bot; op; op = above)
		218	{
		219	above = op->above;
198		220
199	for (x=0; x < MAP_WIDTH(m); x++)	221	bool destroy = 0;
200	for (y=0; y < MAP_HEIGHT(m); y++)	222
201	for (op = get_map_ob(m, x, y); op; op = otmp) {	223	// do not decay anything above unique floor tiles (yet :)
202	destroy = 0;
203	otmp = op->above;
204	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))
205	break;	225	break;
		226
206	if (QUERY_FLAG(op, FLAG_IS_FLOOR) \|\|	227	if (QUERY_FLAG (op, FLAG_IS_FLOOR)
207	QUERY_FLAG(op, FLAG_OBJ_ORIGINAL) \|\|	228	\|\| QUERY_FLAG (op, FLAG_OBJ_ORIGINAL)
208	QUERY_FLAG(op, FLAG_OBJ_SAVE_ON_OVL) \|\|	229	\|\| QUERY_FLAG (op, FLAG_OBJ_SAVE_ON_OVL)
209	QUERY_FLAG(op, FLAG_UNIQUE) \|\|	230	\|\| QUERY_FLAG (op, FLAG_UNIQUE)
210	QUERY_FLAG(op, FLAG_OVERLAY_FLOOR) \|\|	231	\|\| QUERY_FLAG (op, FLAG_OVERLAY_FLOOR)
211	QUERY_FLAG(op, FLAG_UNPAID) \|\| IS_LIVE(op))	232	\|\| QUERY_FLAG (op, FLAG_UNPAID)
212	continue;	233	\|\| op->is_alive ())
213	/* otherwise, we decay and destroy */	234	; // do not decay
214	if (IS_WEAPON(op)) {	235	else if (op->is_weapon ())
		236	{
215	op->stats.dam--;	237	op->stats.dam--;
216	if (op->stats.dam < 0)	238	if (op->stats.dam < 0)
217	destroy = 1;	239	destroy = 1;
218	} else if (IS_ARMOR(op)) {	240	}
		241	else if (op->is_armor ())
		242	{
219	op->stats.ac--;	243	op->stats.ac--;
220	if (op->stats.ac < 0)	244	if (op->stats.ac < 0)
221	destroy = 1;	245	destroy = 1;
		246	}
222	} else if (op->type == FOOD) {	247	else if (op->type == FOOD)
		248	{
223	op->stats.food -= rndm(5,20);	249	op->stats.food -= rndm (5, 20);
224	if (op->stats.food < 0)	250	if (op->stats.food < 0)
225	destroy = 1;	251	destroy = 1;
226	} else {	252	}
227	if (op->material & M_PAPER \|\| op->material & M_LEATHER \|\|	253	else
228	op->material & M_WOOD \|\| op->material & M_ORGANIC \|\|	254	{
229	op->material & M_CLOTH \|\| op->material & M_LIQUID)	255	int mat = op->materials;
230	destroy = 1;	256
231	if (op->material & M_IRON && rndm(1,5) == 1)	257	if (mat & M_PAPER
232	destroy = 1;	258	\|\| mat & M_LEATHER
233	if (op->material & M_GLASS && rndm(1,2) == 1)	259	\|\| mat & M_WOOD
234	destroy = 1;	260	\|\| mat & M_ORGANIC
235	if ((op->material & M_STONE \|\| op->material & M_ADAMANT) &&	261	\|\| mat & M_CLOTH
236	rndm(1,10) == 1)	262	\|\| mat & M_LIQUID
237	destroy = 1;	263	\|\| (mat & M_IRON && rndm (1, 5) == 1)
238	if ((op->material & M_SOFT_METAL \|\| op->material & M_BONE) &&	264	\|\| (mat & M_GLASS && rndm (1, 2) == 1)
239	rndm(1,3) == 1)	265	\|\| ((mat & M_STONE \|\| mat & M_ADAMANT) && rndm (1, 10) == 1)
240	destroy = 1;	266	\|\| ((mat & M_SOFT_METAL \|\| mat & M_BONE) && rndm (1, 3) == 1)
241	if (op->material & M_ICE && MAP_TEMP(m) > 32)	267	\|\| (mat & M_ICE && temp > 32))
242	destroy = 1;	268	destroy = 1;
243	}	269	}
		270
244	/* adjust overall chance below */	271	/* adjust overall chance below */
245	if (destroy && rndm(0, 1)) {	272	if (destroy && rndm (0, 1))
246	remove_ob(op);	273	op->destroy ();
247	free_object(op);
248	}
249	}	274	}
250	}	275	}
251		276
252	/* convert materialname to materialtype_t */	277	/* convert materialname to materialtype_t */
253		278
254	materialtype_t name_to_material(const char name)	279	materialtype_t *
		280	name_to_material (const shstr &name)
255	{	281	{
256	materialtype_t mt, nmt;	282	for (materialtype_t *mt = materialt; mt && mt->next; mt = mt->next)
257		283	if (name == mt->name)
258	mt = NULL;
259	for (nmt = materialt; nmt != NULL && nmt->next != NULL; nmt=nmt->next) {
260	if (strcmp(name, nmt->name) == 0) {
261	mt = nmt;
262	break;
263	}
264	}
265	return mt;	284	return mt;
		285
		286	return materialt;
266	}	287	}
267		288
268	/* when doing transmutation of objects, we have to recheck the resistances,	289	/* when doing transmutation of objects, we have to recheck the resistances,
269	* as some that did not apply previously, may apply now.	290	* as some that did not apply previously, may apply now.
270	*/	291	*/
271		292
		293	void
272	void transmute_materialname(object op, const object change)	294	transmute_materialname (object op, const object change)
273	{	295	{
274	materialtype_t *mt;	296	materialtype_t *mt;
275	int j;	297	int j;
276		298
277	if (op->materialname == NULL)	299	if (op->materialname == NULL)
278	return;	300	return;
279		301
280	if (change->materialname != NULL &&	302	if (change->materialname != NULL && strcmp (op->materialname, change->materialname))
281	strcmp(op->materialname, change->materialname))	303	return;
282	return;
283		304
284	if (!IS_ARMOR(op))	305	if (!op->is_armor ())
285	return;	306	return;
286		307
287	mt = name_to_material(op->materialname);	308	mt = name_to_material (op->materialname);
288	if (!mt) {	309	if (!mt)
		310	{
289	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);
290	return;	312	return;
291	}	313	}
292		314
293	for (j=0; j < NROFATTACKS; j++)	315	for (j = 0; j < NROFATTACKS; j++)
294	if (op->resist[j] == 0 && change->resist[j] != 0) {	316	if (op->resist[j] == 0 && change->resist[j] != 0)
		317	{
295	op->resist[j] += mt->mod[j];	318	op->resist[j] += mt->mod[j];
296	if (op->resist[j] > 100)	319	if (op->resist[j] > 100)
297	op->resist[j] = 100;	320	op->resist[j] = 100;
298	if (op->resist[j] < -100)	321	if (op->resist[j] < -100)
299	op->resist[j] = -100;	322	op->resist[j] = -100;
300	}	323	}
301	}	324	}
302		325
303	/* set the materialname and type for an item */	326	/* set the materialname and type for an item */
		327	void
304	void set_materialname(object op, int difficulty, materialtype_t nmt)	328	set_materialname (object op, int difficulty, materialtype_t nmt)
305	{	329	{
306	materialtype_t mt, lmt;	330	materialtype_t mt, lmt;
		331
		332	#ifdef NEW_MATERIAL_CODE
307	int j;	333	int j;
		334	#endif
308		335
309	if (op->materialname != NULL)	336	if (op->materialname != NULL)
310	return;	337	return;
311		338
312		339
313		340
314	if (nmt == NULL) {	341	if (nmt == NULL)
		342	{
315	lmt = NULL;	343	lmt = NULL;
316	#ifndef NEW_MATERIAL_CODE	344	#ifndef NEW_MATERIAL_CODE
317	for (mt = materialt; mt != NULL && mt->next != NULL; mt=mt->next) {	345	for (mt = materialt; mt && mt->next; mt = mt->next)
		346	{
318	if (op->material & mt->material) {	347	if (op->materials & mt->material)
319	lmt = mt;	348	{
320	break;	349	lmt = mt;
321	}	350	break;
322	}	351	}
		352	}
323		353
324	#else	354	#else
325	for (mt = materialt; mt != NULL && mt->next != NULL; mt=mt->next) {	355	for (mt = materialt; mt && mt->next; mt = mt->next)
		356	{
326	if (op->material & mt->material && rndm(1, 100) <= mt->chance &&	357	if (op->materials & mt->material && rndm (1, 100) <= mt->chance &&
327	difficulty >= mt->difficulty &&	358	difficulty >= mt->difficulty && (op->magic >= mt->magic \|\| mt->magic == 0))
328	(op->magic >= mt->magic \|\| mt->magic == 0)) {	359	{
329	lmt = mt;	360	lmt = mt;
330	if (!(IS_WEAPON(op) \|\| IS_ARMOR(op)))	361	if (!(op->is_weapon () \|\| op->is_armor ()))
331	break;	362	break;
332	}	363	}
333	}	364	}
334	#endif	365	#endif
335	} else {	366	}
336	lmt = nmt;	367	else
337	}	368	{
		369	lmt = nmt;
		370	}
338		371
339	if (lmt != NULL) {	372	if (lmt != NULL)
		373	{
340	#ifndef NEW_MATERIAL_CODE	374	#ifndef NEW_MATERIAL_CODE
341	op->materialname = add_string(lmt->name);	375	op->materialname = lmt->name;
342	return;	376	return;
343	#else	377	#else
344		378
345	if (op->stats.dam && IS_WEAPON(op)) {	379	if (op->stats.dam && op->is_weapon ())
		380	{
346	op->stats.dam += lmt->damage;	381	op->stats.dam += lmt->damage;
347	if (op->stats.dam < 1)	382	if (op->stats.dam < 1)
348	op->stats.dam = 1;	383	op->stats.dam = 1;
349	}	384	}
		385
350	if (op->stats.sp && op->type == BOW)	386	if (op->stats.sp && op->type == BOW)
351	op->stats.sp += lmt->sp;	387	op->stats.sp += lmt->sp;
352	if (op->stats.wc && IS_WEAPON(op))	388	if (op->stats.wc && op->is_weapon ())
353	op->stats.wc += lmt->wc;	389	op->stats.wc += lmt->wc;
354	if (IS_ARMOR(op)) {	390	if (op->is_armor ())
		391	{
355	if (op->stats.ac)	392	if (op->stats.ac)
356	op->stats.ac += lmt->ac;	393	op->stats.ac += lmt->ac;
357	for (j=0; j < NROFATTACKS; j++)	394	for (j = 0; j < NROFATTACKS; j++)
358	if (op->resist[j] != 0) {	395	if (op->resist[j] != 0)
		396	{
359	op->resist[j] += lmt->mod[j];	397	op->resist[j] += lmt->mod[j];
360	if (op->resist[j] > 100)	398	if (op->resist[j] > 100)
361	op->resist[j] = 100;	399	op->resist[j] = 100;
362	if (op->resist[j] < -100)	400	if (op->resist[j] < -100)
363	op->resist[j] = -100;	401	op->resist[j] = -100;
364	}	402	}
365	}	403	}
366	op->materialname = add_string(lmt->name);	404	op->materialname = lmt->name;
367	/* dont make it unstackable if it doesn't need to be */	405	/* dont make it unstackable if it doesn't need to be */
368	if (IS_WEAPON(op) \|\| IS_ARMOR(op)) {	406	if (op->is_weapon () \|\| op->is_armor ())
		407	{
369	op->weight = (op->weight * lmt->weight)/100;	408	op->weight = (op->weight * lmt->weight) / 100;
370	op->value = (op->value * lmt->value)/100;	409	op->value = (op->value * lmt->value) / 100;
371	}	410	}
372	#endif	411	#endif
373	}	412	}
374	}	413	}
375		414
376	/*	415	/*
377	* Strip out the media tags from a String.	416	* Strip out the media tags from a String.
378	* Warning the input string will contain the result string	417	* Warning the input string will contain the result string
379	*/	418	*/
		419	void
380	void strip_media_tag(char *message){	420	strip_media_tag (char *message)
		421	{
381	int in_tag=0;	422	int in_tag = 0;
382	char* dest;	423	char *dest;
383	char* src;	424	char *src;
		425
384	src=dest=message;	426	src = dest = message;
385	while (*src!='\0'){	427	while (*src != '\0')
		428	{
386	if (*src=='['){	429	if (*src == '[')
		430	{
387	in_tag=1;	431	in_tag = 1;
		432	}
388	} else if (in_tag && (*src==']'))	433	else if (in_tag && (*src == ']'))
389	in_tag=0;	434	in_tag = 0;
390	else if (!in_tag){	435	else if (!in_tag)
		436	{
391	dest=src;	437	dest = src;
392	dest++;	438	dest++;
393	}	439	}
394	src++;	440	src++;
395	}	441	}
396	*dest='\0';	442	*dest = '\0';
397	}	443	}
398		444
		445	const char *
399	const char* strrstr(const char* haystack, const char* needle){	446	strrstr (const char haystack, const char needle)
		447	{
400	const char* lastneedle;	448	const char *lastneedle;
		449
401	lastneedle=NULL;	450	lastneedle = NULL;
402	while((haystack=strstr(haystack,needle))!=NULL){	451	while ((haystack = strstr (haystack, needle)) != NULL)
		452	{
403	lastneedle=haystack;	453	lastneedle = haystack;
404	haystack++;	454	haystack++;
405	}	455	}
406	return lastneedle;	456	return lastneedle;
407		457
408	}	458	}
		459
409	#define EOL_SIZE (sizeof("\n")-1)	460	#define EOL_SIZE (sizeof("\n")-1)
		461	void
410	void strip_endline(char* buf){	462	strip_endline (char *buf)
		463	{
411	if (strlen(buf)<sizeof("\n")){	464	if (strlen (buf) < sizeof ("\n"))
		465	{
412	return;	466	return;
413	}	467	}
414	if (!strcmp(buf+strlen(buf)-EOL_SIZE,"\n"))	468	if (!strcmp (buf + strlen (buf) - EOL_SIZE, "\n"))
415	buf[strlen(buf)-EOL_SIZE]='\0';	469	buf[strlen (buf) - EOL_SIZE] = '\0';
416	}	470	}
417		471
418	/**	472	/**
419	* 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
420	* string is put into result; at most resultsize characters (including the	474	* string is put into result; at most resultsize characters (including the
421	* terminating null character) will be written to result.	475	* terminating null character) will be written to result.
422	*/	476	*/
		477	void
423	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)
424	{	479	{
425	size_t resultlen;	480	size_t resultlen;
426	size_t keylen;	481	size_t keylen;
427		482
428	/* special case to prevent infinite loop if key==replacement=="" */	483	/* special case to prevent infinite loop if key==replacement=="" */
429	if(strcmp(key, replacement) == 0)	484	if (strcmp (key, replacement) == 0)
430	{	485	{
431	snprintf(result, resultsize, "%s", src);	486	snprintf (result, resultsize, "%s", src);
432	return;	487	return;
433	}	488	}
434		489
435	keylen = strlen(key);	490	keylen = strlen (key);
436		491
437	resultlen = 0;	492	resultlen = 0;
438	while(*src != '\0' && resultlen+1 < resultsize)	493	while (*src != '\0' && resultlen + 1 < resultsize)
439	{	494	{
440	if(strncmp(src, key, keylen) == 0)	495	if (strncmp (src, key, keylen) == 0)
441	{	496	{
442	snprintf(result+resultlen, resultsize-resultlen, "%s", replacement);	497	snprintf (result + resultlen, resultsize - resultlen, "%s", replacement);
443	resultlen += strlen(result+resultlen);	498	resultlen += strlen (result + resultlen);
444	src += keylen;	499	src += keylen;
445	}	500	}
446	else	501	else
447	{	502	{
448	result[resultlen++] = *src++;	503	result[resultlen++] = *src++;
449	}	504	}
450	}	505	}
451	result[resultlen] = '\0';	506	result[resultlen] = '\0';
452	}	507	}
453		508
454	/**	509	/**
455	* 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.
456	* 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
457	* 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.
458	* This function will also strip all trailing non alphanumeric characters.	513	* This function will also strip all trailing non alphanumeric characters.
459	* It does not insert an oxford comma.	514	* It does not insert an oxford comma.
460	*/	515	*/
461		516
		517	void
462	void make_list_like(char *input) {	518	make_list_like (char *input)
		519	{
463	char *p, tmp[MAX_BUF];	520	char *p, tmp[MAX_BUF];
464	int i;	521	int i;
		522
465	if (!input \|\| strlen(input) > MAX_BUF-5) return;	523	if (!input \|\| strlen (input) > MAX_BUF - 5)
466	/* bad stuff would happen if we continued here, the -5 is to make space for ' and ' */
467
468	strncpy(tmp, input, MAX_BUF-5);
469	/trim all trailing commas, spaces etc./
470	for (i=strlen(tmp); !isalnum(tmp[i]) && i >= 0; i--)
471	tmp[i]='\0';
472	strcat(tmp, ".");
473
474	p=strrchr(tmp, ',');
475	if (p) {
476	*p='\0';
477	strcpy(input, tmp);
478	p++;
479	strcat(input, " and");
480	strcat(input, p);
481	}
482	else strcpy(input, tmp);
483	return;	524	return;
		525	/* bad stuff would happen if we continued here, the -5 is to make space for ' and ' */
		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;
484	}	547	}
		548
		549	/////////////////////////////////////////////////////////////////////////////
		550
		551	void
		552	fork_abort (const char *msg)
		553	{
		554	if (!fork ())
		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	}
		562
		563	LOG (llevError, "fork abort: %s\n", msg);
		564	}
		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.1 by elmex, Sun Aug 13 17:16:01 2006 UTC vs. Revision 1.56 by root, Thu May 17 21:32:08 2007 UTC

Diff Legend

Comparing deliantra/server/common/utils.C (file contents):
Revision 1.1 by elmex, Sun Aug 13 17:16:01 2006 UTC vs.
Revision 1.56 by root, Thu May 17 21:32:08 2007 UTC