[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.63 by root, Mon Aug 6 10:54:11 2007 UTC

…		…
1	/*	1	/*
2	* static char *rcsid_utils_c =	2	* This file is part of Crossfire TRT, the Roguelike Realtime MORPG.
3	* "$Id: utils.C,v 1.1 2006/08/13 17:16:01 elmex 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
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 3 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, see <http://www.gnu.org/licenses/>.
24	Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.	20	*
25		21	* The authors can be reached via e-mail to <crossfire@schmorp.de>
26	The authors can be reached via e-mail at crossfire-devel@real-time.com
27	*/	22	*/
28		23
29	/*	24	/*
30	* General convenience functions for crossfire.	25	* General convenience functions for crossfire.
31	*/	26	*/
		27
		28	#include <cstdlib>
		29	#include <sys/types.h>
		30	#include <unistd.h>
		31	#include <sys/time.h>
		32	#include <time.h>
		33	#include <signal.h>
32		34
33	#include <global.h>	35	#include <global.h>
34	#include <funcpoint.h>	36	#include <funcpoint.h>
35	#include <material.h>	37	#include <material.h>
		38
		39	#include <glib.h>
		40
		41	refcnt_base::refcnt_t refcnt_dummy;
		42
		43	rand_gen rndm;
		44
		45	void
		46	tausworthe_random_generator::seed (uint32_t seed)
		47	{
		48	state [0] = seed * 69069U; if (state [0] < 2U) state [0] += 2U;
		49	state [1] = state [0] * 69069U; if (state [0] < 8U) state [0] += 8U;
		50	state [2] = state [1] * 69069U; if (state [0] < 16U) state [0] += 16U;
		51	state [3] = state [2] * 69069U; if (state [0] < 128) state [0] += 128U;
		52
		53	for (int i = 11; --i; )
		54	operator ()();
		55	}
		56
		57	uint32_t
		58	tausworthe_random_generator::next ()
		59	{
		60	state [0] = ((state [0] & 0xFFFFFFFEU) << 18U) ^ (((state [0] << 6U) ^ state [0]) >> 13U);
		61	state [1] = ((state [1] & 0xFFFFFFF8U) << 2U) ^ (((state [1] << 2U) ^ state [1]) >> 27U);
		62	state [2] = ((state [2] & 0xFFFFFFF0U) << 7U) ^ (((state [2] << 13U) ^ state [2]) >> 21U);
		63	state [3] = ((state [3] & 0xFFFFFF80U) << 13U) ^ (((state [3] << 3U) ^ state [3]) >> 12U);
		64
		65	return state [0] ^ state [1] ^ state [2] ^ state [3];
		66	}
		67
		68	uint32_t
		69	tausworthe_random_generator::get_range (uint32_t num)
		70	{
		71	return (next () * (uint64_t)num) >> 32U;
		72	}
		73
		74	// return a number within (min .. max)
		75	int
		76	tausworthe_random_generator::get_range (int r_min, int r_max)
		77	{
		78	return r_min + get_range (max (r_max - r_min + 1, 0));
		79	}
36		80
37	/*	81	/*
38	* The random functions here take luck into account when rolling random	82	* 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	83	* 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	84	* 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,	91	* 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.	92	* 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,	93	* Generally, op should be the player/caster/hitter requesting the roll,
50	* not the recipient (ie, the poor slob getting hit). [garbled 20010916]	94	* not the recipient (ie, the poor slob getting hit). [garbled 20010916]
51	*/	95	*/
52		96	int
53	int random_roll(int min, int max, const object *op, int goodbad) {	97	random_roll (int r_min, int r_max, const object *op, int goodbad)
54	int omin, diff, luck, base, ran;	98	{
		99	int base = r_max - r_min > 1 ? 20 : 50; /* d2 and d3 are corner cases */
55		100
56	omin = min;	101	if (r_max < r_min)
57	diff = max - min + 1;	102	{
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);	103	LOG (llevError \| logBacktrace, "Calling random_roll with min=%d max=%d\n", r_min, r_max);
62	return(min); /* avoids a float exception */	104	return r_min;
63	}	105	}
64		106
65	ran = RANDOM();
66
67	if (op->type != PLAYER)	107	if (op->type == PLAYER)
68	return((ran%diff)+min);	108	{
69
70	luck = op->stats.luck;	109	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		110
79	return(MAX(omin, MIN(max, (ran%diff)+min)));	111	if (rndm (base) < min (10, abs (luck)))
		112	{
		113	//TODO: take luck into account
		114	}
80	}	115	}
81	return((ran%diff)+min);	116
		117	return rndm (r_min, r_max);
82	}	118	}
83		119
84	/*	120	/*
85	* This is a 64 bit version of random_roll above. This is needed	121	* This is a 64 bit version of random_roll above. This is needed
86	* for exp loss calculations for players changing religions.	122	* for exp loss calculations for players changing religions.
87	*/	123	*/
88		124	sint64
89	sint64 random_roll64(sint64 min, sint64 max, const object *op, int goodbad) {	125	random_roll64 (sint64 min, sint64 max, const object *op, int goodbad)
90	sint64 omin, diff, luck, ran;	126	{
91	int base;
92
93	omin = min;	127	sint64 omin = min;
94	diff = max - min + 1;	128	sint64 diff = max - min + 1;
95	((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 */
96		130
97	if (max < 1 \|\| diff < 1) {	131	if (diff < 0)
98	#ifndef WIN32	132	{
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);	133	LOG (llevError \| logBacktrace, "Calling random_roll64 with min=%" PRId64 " max=%" PRId64 "\n", min, max);
102	#endif
103	return(min); /* avoids a float exception */	134	return (min); /* avoids a float exception */
104	}	135	}
105		136
106	/* Don't know of a portable call to get 64 bit random values.	137	/*
107	* So make a call to get two 32 bit random numbers, and just to	138	* 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	139	* a little bitshifting.
109	* 32 bit, so we don't get skewed results
110	*/	140	*/
111	ran = (RANDOM() & 0xffffffff) \| ((sint64)RANDOM() << 32);	141	sint64 ran = (sint64) rndm.next () ^ ((sint64) rndm.next () << 31);
112		142
113	if (op->type != PLAYER)	143	if (op->type != PLAYER)
114	return((ran%diff)+min);	144	return ((ran % diff) + min);
115		145
116	luck = op->stats.luck;	146	int luck = op->stats.luck;
		147
117	if (RANDOM()%base < MIN(10, abs(luck))) {	148	if (rndm (base) < MIN (10, abs (luck)))
		149	{
118	/* we have a winner */	150	/* we have a winner */
119	((luck > 0) ? (luck = 1) : (luck = -1));	151	((luck > 0) ? (luck = 1) : (luck = -1));
120	diff -= luck;	152	diff -= luck;
121	if (diff < 1)	153	if (diff < 1)
122	return(omin); /check again/	154	return (omin); /check again /
		155
123	((goodbad) ? (min += luck) : (diff));	156	((goodbad) ? (min += luck) : (diff));
124		157
125	return(MAX(omin, MIN(max, (ran%diff)+min)));	158	return (MAX (omin, MIN (max, (ran % diff) + min)));
126	}	159	}
		160
127	return((ran%diff)+min);	161	return ran % diff + min;
128	}	162	}
129		163
130	/*	164	/*
131	* 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,
132	* 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.
133	* Generally, op should be the player/caster/hitter requesting the roll,	167	* Generally, op should be the player/caster/hitter requesting the roll,
134	* not the recipient (ie, the poor slob getting hit).	168	* not the recipient (ie, the poor slob getting hit).
135	* The args are num D size (ie 4d6) [garbled 20010916]	169	* The args are num D size (ie 4d6) [garbled 20010916]
136	*/	170	*/
137		171	int
138	int die_roll(int num, int size, const object *op, int goodbad) {	172	die_roll (int num, int size, const object *op, int goodbad)
		173	{
139	int min, diff, luck, total, i, gotlucky, base, ran;	174	int min, luck, total, i, gotlucky;
140		175
141	diff = size;	176	int diff = size;
142	min = 1;	177	min = 1;
143	luck = total = gotlucky = 0;	178	luck = total = gotlucky = 0;
144	((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
145	if (size < 2 \|\| diff < 1) {	181	if (size < 2 \|\| diff < 1)
		182	{
146	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);
147	return(num); /* avoids a float exception */	184	return num; /* avoids a float exception */
148	}	185	}
149		186
150	if (op->type == PLAYER)	187	if (op->type == PLAYER)
151	luck = op->stats.luck;	188	luck = op->stats.luck;
152		189
153	for (i = 0; i < num; i++) {	190	for (i = 0; i < num; i++)
		191	{
154	if (RANDOM()%base < MIN(10, abs(luck)) && !gotlucky) {	192	if (rndm (base) < MIN (10, abs (luck)) && !gotlucky)
		193	{
155	/* we have a winner */	194	/* we have a winner */
156	gotlucky++;	195	gotlucky++;
157	((luck > 0) ? (luck = 1) : (luck = -1));	196	((luck > 0) ? (luck = 1) : (luck = -1));
158	diff -= luck;	197	diff -= luck;
159	if (diff < 1)	198	if (diff < 1)
160	return(num); /check again/	199	return (num); /check again /
161	((goodbad) ? (min += luck) : (diff));	200	((goodbad) ? (min += luck) : (diff));
162	ran = RANDOM();
163	total += MAX(1, MIN(size, (ran%diff)+min));	201	total += MAX (1, MIN (size, rndm (diff) + min));
164	} else {	202	}
165	total += RANDOM()%size+1;	203	else
166	}	204	total += rndm (size) + 1;
167	}
168	return(total);
169	}
170
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 */
190
191	void decay_objects(mapstruct *m)
192	{
193	int x, y, destroy;
194	object op, otmp;
195
196	if (m->unique)
197	return;
198
199	for (x=0; x < MAP_WIDTH(m); x++)
200	for (y=0; y < MAP_HEIGHT(m); y++)
201	for (op = get_map_ob(m, x, y); op; op = otmp) {
202	destroy = 0;
203	otmp = op->above;
204	if (QUERY_FLAG(op,FLAG_IS_FLOOR) && QUERY_FLAG(op, FLAG_UNIQUE))
205	break;
206	if (QUERY_FLAG(op, FLAG_IS_FLOOR) \|\|
207	QUERY_FLAG(op, FLAG_OBJ_ORIGINAL) \|\|
208	QUERY_FLAG(op, FLAG_OBJ_SAVE_ON_OVL) \|\|
209	QUERY_FLAG(op, FLAG_UNIQUE) \|\|
210	QUERY_FLAG(op, FLAG_OVERLAY_FLOOR) \|\|
211	QUERY_FLAG(op, FLAG_UNPAID) \|\| IS_LIVE(op))
212	continue;
213	/* otherwise, we decay and destroy */
214	if (IS_WEAPON(op)) {
215	op->stats.dam--;
216	if (op->stats.dam < 0)
217	destroy = 1;
218	} else if (IS_ARMOR(op)) {
219	op->stats.ac--;
220	if (op->stats.ac < 0)
221	destroy = 1;
222	} else if (op->type == FOOD) {
223	op->stats.food -= rndm(5,20);
224	if (op->stats.food < 0)
225	destroy = 1;
226	} else {
227	if (op->material & M_PAPER \|\| op->material & M_LEATHER \|\|
228	op->material & M_WOOD \|\| op->material & M_ORGANIC \|\|
229	op->material & M_CLOTH \|\| op->material & M_LIQUID)
230	destroy = 1;
231	if (op->material & M_IRON && rndm(1,5) == 1)
232	destroy = 1;
233	if (op->material & M_GLASS && rndm(1,2) == 1)
234	destroy = 1;
235	if ((op->material & M_STONE \|\| op->material & M_ADAMANT) &&
236	rndm(1,10) == 1)
237	destroy = 1;
238	if ((op->material & M_SOFT_METAL \|\| op->material & M_BONE) &&
239	rndm(1,3) == 1)
240	destroy = 1;
241	if (op->material & M_ICE && MAP_TEMP(m) > 32)
242	destroy = 1;
243	}
244	/* adjust overall chance below */
245	if (destroy && rndm(0, 1)) {
246	remove_ob(op);
247	free_object(op);
248	}
249	}	205	}
		206
		207	return total;
250	}	208	}
251		209
252	/* convert materialname to materialtype_t */	210	/* convert materialname to materialtype_t */
253		211
254	materialtype_t name_to_material(const char name)	212	materialtype_t *
		213	name_to_material (const shstr &name)
255	{	214	{
256	materialtype_t mt, nmt;	215	for (materialtype_t *mt = materialt; mt && mt->next; mt = mt->next)
257		216	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;	217	return mt;
		218
		219	return 0;
266	}	220	}
267		221
268	/* when doing transmutation of objects, we have to recheck the resistances,	222	/* when doing transmutation of objects, we have to recheck the resistances,
269	* as some that did not apply previously, may apply now.	223	* as some that did not apply previously, may apply now.
270	*/	224	*/
271		225
		226	void
272	void transmute_materialname(object op, const object change)	227	transmute_materialname (object op, const object change)
273	{	228	{
274	materialtype_t *mt;	229	materialtype_t *mt;
275	int j;	230	int j;
276		231
277	if (op->materialname == NULL)	232	if (op->materialname == NULL)
278	return;	233	return;
279		234
280	if (change->materialname != NULL &&	235	if (change->materialname != NULL && strcmp (op->materialname, change->materialname))
281	strcmp(op->materialname, change->materialname))	236	return;
282	return;
283		237
284	if (!IS_ARMOR(op))	238	if (!op->is_armor ())
285	return;	239	return;
286		240
287	mt = name_to_material(op->materialname);	241	mt = name_to_material (op->materialname);
288	if (!mt) {	242	if (!mt)
		243	{
289	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);
290	return;	245	return;
291	}	246	}
292		247
293	for (j=0; j < NROFATTACKS; j++)	248	for (j = 0; j < NROFATTACKS; j++)
294	if (op->resist[j] == 0 && change->resist[j] != 0) {	249	if (op->resist[j] == 0 && change->resist[j] != 0)
		250	{
295	op->resist[j] += mt->mod[j];	251	op->resist[j] += mt->mod[j];
296	if (op->resist[j] > 100)	252	if (op->resist[j] > 100)
297	op->resist[j] = 100;	253	op->resist[j] = 100;
298	if (op->resist[j] < -100)	254	if (op->resist[j] < -100)
299	op->resist[j] = -100;	255	op->resist[j] = -100;
300	}	256	}
301	}	257	}
302		258
303	/* set the materialname and type for an item */	259	/* set the materialname and type for an item */
		260	void
304	void set_materialname(object op, int difficulty, materialtype_t nmt)	261	set_materialname (object op, int difficulty, materialtype_t nmt)
305	{	262	{
306	materialtype_t mt, lmt;	263	materialtype_t mt, lmt;
307	int j;
308		264
309	if (op->materialname != NULL)	265	if (op->materialname != NULL)
310	return;	266	return;
311		267
312
313
314	if (nmt == NULL) {	268	if (nmt == NULL)
		269	{
315	lmt = NULL;	270	lmt = NULL;
316	#ifndef NEW_MATERIAL_CODE	271
317	for (mt = materialt; mt != NULL && mt->next != NULL; mt=mt->next) {	272	for (mt = materialt; mt && mt->next; mt = mt->next)
318	if (op->material & mt->material) {
319	lmt = mt;
320	break;
321	}
322	}
323
324	#else
325	for (mt = materialt; mt != NULL && mt->next != NULL; mt=mt->next) {
326	if (op->material & mt->material && rndm(1, 100) <= mt->chance &&	273	if (op->materials & mt->material && rndm (1, 100) <= mt->chance &&
327	difficulty >= mt->difficulty &&	274	difficulty >= mt->difficulty && (op->magic >= mt->magic \|\| mt->magic == 0))
328	(op->magic >= mt->magic \|\| mt->magic == 0)) {	275	{
329	lmt = mt;	276	lmt = mt;
330	if (!(IS_WEAPON(op) \|\| IS_ARMOR(op)))	277	if (!(op->is_weapon () \|\| op->is_armor ()))
331	break;	278	break;
		279	}
332	}	280	}
333	}	281	else
334	#endif
335	} else {
336	lmt = nmt;	282	lmt = nmt;
337	}
338		283
339	if (lmt != NULL) {	284	if (lmt != NULL)
340	#ifndef NEW_MATERIAL_CODE	285	{
341	op->materialname = add_string(lmt->name);	286	if (op->stats.dam && op->is_weapon ())
342	return;	287	{
343	#else
344
345	if (op->stats.dam && IS_WEAPON(op)) {
346	op->stats.dam += lmt->damage;	288	op->stats.dam += lmt->damage;
347	if (op->stats.dam < 1)	289	if (op->stats.dam < 1)
348	op->stats.dam = 1;	290	op->stats.dam = 1;
349	}	291	}
		292
350	if (op->stats.sp && op->type == BOW)	293	if (op->stats.sp && op->type == BOW)
351	op->stats.sp += lmt->sp;	294	op->stats.sp += lmt->sp;
352	if (op->stats.wc && IS_WEAPON(op))	295	if (op->stats.wc && op->is_weapon ())
353	op->stats.wc += lmt->wc;	296	op->stats.wc += lmt->wc;
354	if (IS_ARMOR(op)) {	297	if (op->is_armor ())
		298	{
355	if (op->stats.ac)	299	if (op->stats.ac)
356	op->stats.ac += lmt->ac;	300	op->stats.ac += lmt->ac;
		301
357	for (j=0; j < NROFATTACKS; j++)	302	for (int j = 0; j < NROFATTACKS; j++)
358	if (op->resist[j] != 0) {	303	if (op->resist[j] != 0)
		304	{
359	op->resist[j] += lmt->mod[j];	305	op->resist[j] += lmt->mod[j];
360	if (op->resist[j] > 100)	306	if (op->resist[j] > 100)
361	op->resist[j] = 100;	307	op->resist[j] = 100;
362	if (op->resist[j] < -100)	308	if (op->resist[j] < -100)
363	op->resist[j] = -100;	309	op->resist[j] = -100;
364	}	310	}
365	}	311	}
		312
366	op->materialname = add_string(lmt->name);	313	op->materialname = lmt->name;
367	/* dont make it unstackable if it doesn't need to be */	314	/* dont make it unstackable if it doesn't need to be */
368	if (IS_WEAPON(op) \|\| IS_ARMOR(op)) {	315	if (op->is_weapon () \|\| op->is_armor ())
		316	{
369	op->weight = (op->weight * lmt->weight)/100;	317	op->weight = (op->weight * lmt->weight) / 100;
370	op->value = (op->value * lmt->value)/100;	318	op->value = (op->value * lmt->value) / 100;
371	}	319	}
372	#endif
373	}	320	}
374	}	321	}
375		322
376	/*	323	/*
377	* Strip out the media tags from a String.	324	* Strip out the media tags from a String.
378	* Warning the input string will contain the result string	325	* Warning the input string will contain the result string
379	*/	326	*/
		327	void
380	void strip_media_tag(char *message){	328	strip_media_tag (char *message)
		329	{
381	int in_tag=0;	330	int in_tag = 0;
382	char* dest;	331	char *dest;
383	char* src;	332	char *src;
		333
384	src=dest=message;	334	src = dest = message;
385	while (*src!='\0'){	335	while (*src != '\0')
		336	{
386	if (*src=='['){	337	if (*src == '[')
		338	{
387	in_tag=1;	339	in_tag = 1;
		340	}
388	} else if (in_tag && (*src==']'))	341	else if (in_tag && (*src == ']'))
389	in_tag=0;	342	in_tag = 0;
390	else if (!in_tag){	343	else if (!in_tag)
		344	{
391	dest=src;	345	dest = src;
392	dest++;	346	dest++;
393	}	347	}
394	src++;	348	src++;
395	}	349	}
396	*dest='\0';	350	*dest = '\0';
397	}	351	}
398		352
		353	const char *
399	const char* strrstr(const char* haystack, const char* needle){	354	strrstr (const char haystack, const char needle)
		355	{
400	const char* lastneedle;	356	const char *lastneedle;
		357
401	lastneedle=NULL;	358	lastneedle = NULL;
402	while((haystack=strstr(haystack,needle))!=NULL){	359	while ((haystack = strstr (haystack, needle)) != NULL)
		360	{
403	lastneedle=haystack;	361	lastneedle = haystack;
404	haystack++;	362	haystack++;
405	}	363	}
406	return lastneedle;	364	return lastneedle;
407		365
408	}	366	}
		367
409	#define EOL_SIZE (sizeof("\n")-1)	368	#define EOL_SIZE (sizeof("\n")-1)
		369	void
410	void strip_endline(char* buf){	370	strip_endline (char *buf)
		371	{
411	if (strlen(buf)<sizeof("\n")){	372	if (strlen (buf) < sizeof ("\n"))
		373	{
412	return;	374	return;
413	}	375	}
414	if (!strcmp(buf+strlen(buf)-EOL_SIZE,"\n"))	376	if (!strcmp (buf + strlen (buf) - EOL_SIZE, "\n"))
415	buf[strlen(buf)-EOL_SIZE]='\0';	377	buf[strlen (buf) - EOL_SIZE] = '\0';
416	}	378	}
417		379
418	/**	380	/**
419	* Replace in string src all occurrences of key by replacement. The resulting	381	* Replace in string src all occurrences of key by replacement. The resulting
420	* string is put into result; at most resultsize characters (including the	382	* string is put into result; at most resultsize characters (including the
421	* terminating null character) will be written to result.	383	* terminating null character) will be written to result.
422	*/	384	*/
		385	void
423	void replace(const char src, const char key, const char replacement, char result, size_t resultsize)	386	replace (const char src, const char key, const char replacement, char result, size_t resultsize)
424	{	387	{
425	size_t resultlen;	388	size_t resultlen;
426	size_t keylen;	389	size_t keylen;
427		390
428	/* special case to prevent infinite loop if key==replacement=="" */	391	/* special case to prevent infinite loop if key==replacement=="" */
429	if(strcmp(key, replacement) == 0)	392	if (strcmp (key, replacement) == 0)
430	{	393	{
431	snprintf(result, resultsize, "%s", src);	394	snprintf (result, resultsize, "%s", src);
432	return;	395	return;
433	}	396	}
434		397
435	keylen = strlen(key);	398	keylen = strlen (key);
436		399
437	resultlen = 0;	400	resultlen = 0;
438	while(*src != '\0' && resultlen+1 < resultsize)	401	while (*src != '\0' && resultlen + 1 < resultsize)
439	{	402	{
440	if(strncmp(src, key, keylen) == 0)	403	if (strncmp (src, key, keylen) == 0)
441	{	404	{
442	snprintf(result+resultlen, resultsize-resultlen, "%s", replacement);	405	snprintf (result + resultlen, resultsize - resultlen, "%s", replacement);
443	resultlen += strlen(result+resultlen);	406	resultlen += strlen (result + resultlen);
444	src += keylen;	407	src += keylen;
445	}	408	}
446	else	409	else
447	{	410	{
448	result[resultlen++] = *src++;	411	result[resultlen++] = *src++;
449	}	412	}
450	}	413	}
451	result[resultlen] = '\0';	414	result[resultlen] = '\0';
452	}	415	}
453		416
454	/**	417	/**
455	* Taking a string as an argument, mutate it into a string that looks like a list.	418	* 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	419	* 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.	420	* 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.	421	* This function will also strip all trailing non alphanumeric characters.
459	* It does not insert an oxford comma.	422	* It does not insert an oxford comma.
460	*/	423	*/
461		424
		425	void
462	void make_list_like(char *input) {	426	make_list_like (char *input)
		427	{
463	char *p, tmp[MAX_BUF];	428	char *p, tmp[MAX_BUF];
464	int i;	429	int i;
		430
465	if (!input \|\| strlen(input) > MAX_BUF-5) return;	431	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;	432	return;
		433	/* bad stuff would happen if we continued here, the -5 is to make space for ' and ' */
		434
		435	strncpy (tmp, input, MAX_BUF - 5);
		436	/trim all trailing commas, spaces etc. /
		437	for (i = strlen (tmp); !isalnum (tmp[i]) && i >= 0; i--)
		438	tmp[i] = '\0';
		439
		440	strcat (tmp, ".");
		441
		442	p = strrchr (tmp, ',');
		443	if (p)
		444	{
		445	*p = '\0';
		446	strcpy (input, tmp);
		447	p++;
		448	strcat (input, " and");
		449	strcat (input, p);
		450	}
		451	else
		452	strcpy (input, tmp);
		453
		454	return;
484	}	455	}
		456
		457	/////////////////////////////////////////////////////////////////////////////
		458
		459	void
		460	fork_abort (const char *msg)
		461	{
		462	if (!fork ())
		463	{
		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");
		468	abort ();
		469	}
		470
		471	LOG (llevError, "fork abort: %s\n", msg);
		472	}
		473
		474	void *salloc_ (int n) throw (std::bad_alloc)
		475	{
		476	#ifdef PREFER_MALLOC
		477	void *ptr = malloc (n);
		478	#else
		479	void *ptr = g_slice_alloc (n);
		480	#endif
		481
		482	if (!ptr)
		483	throw std::bad_alloc ();
		484
		485	return ptr;
		486	}
		487
		488	void salloc_ (int n, void src) throw (std::bad_alloc)
		489	{
		490	void *ptr = salloc_ (n);
		491
		492	if (src)
		493	memcpy (ptr, src, n);
		494	else
		495	memset (ptr, 0, n);
		496
		497	return ptr;
		498	}
		499
		500	void assign (char dst, const char src, int maxlen)
		501	{
		502	if (!src)
		503	src = "";
		504
		505	int len = strlen (src);
		506
		507	if (len >= maxlen - 1)
		508	{
		509	if (maxlen <= 4)
		510	{
		511	memset (dst, '.', maxlen - 1);
		512	dst [maxlen - 1] = 0;
		513	}
		514	else
		515	{
		516	memcpy (dst, src, maxlen - 4);
		517	memcpy (dst + maxlen - 4, "...", 4);
		518	}
		519	}
		520	else
		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	}
		558	}
		559
		560	tstamp now ()
		561	{
		562	struct timeval tv;
		563
		564	gettimeofday (&tv, 0);
		565	return tstamp (tv.tv_sec) + tstamp (tv.tv_usec) * tstamp (1e-6);
		566	}
		567
		568	int
		569	similar_direction (int a, int b)
		570	{
		571	if (!a \|\| !b)
		572	return 0;
		573
		574	int diff = (b - a) & 7;
		575	return diff <= 1 \|\| diff >= 7;
		576	}
		577
		578	/* crc32 0xdebb20e3 table and supplementary functions. */
		579	extern const uint32_t crc_32_tab[256] =
		580	{
		581	0x00000000UL, 0x77073096UL, 0xee0e612cUL, 0x990951baUL, 0x076dc419UL,
		582	0x706af48fUL, 0xe963a535UL, 0x9e6495a3UL, 0x0edb8832UL, 0x79dcb8a4UL,
		583	0xe0d5e91eUL, 0x97d2d988UL, 0x09b64c2bUL, 0x7eb17cbdUL, 0xe7b82d07UL,
		584	0x90bf1d91UL, 0x1db71064UL, 0x6ab020f2UL, 0xf3b97148UL, 0x84be41deUL,
		585	0x1adad47dUL, 0x6ddde4ebUL, 0xf4d4b551UL, 0x83d385c7UL, 0x136c9856UL,
		586	0x646ba8c0UL, 0xfd62f97aUL, 0x8a65c9ecUL, 0x14015c4fUL, 0x63066cd9UL,
		587	0xfa0f3d63UL, 0x8d080df5UL, 0x3b6e20c8UL, 0x4c69105eUL, 0xd56041e4UL,
		588	0xa2677172UL, 0x3c03e4d1UL, 0x4b04d447UL, 0xd20d85fdUL, 0xa50ab56bUL,
		589	0x35b5a8faUL, 0x42b2986cUL, 0xdbbbc9d6UL, 0xacbcf940UL, 0x32d86ce3UL,
		590	0x45df5c75UL, 0xdcd60dcfUL, 0xabd13d59UL, 0x26d930acUL, 0x51de003aUL,
		591	0xc8d75180UL, 0xbfd06116UL, 0x21b4f4b5UL, 0x56b3c423UL, 0xcfba9599UL,
		592	0xb8bda50fUL, 0x2802b89eUL, 0x5f058808UL, 0xc60cd9b2UL, 0xb10be924UL,
		593	0x2f6f7c87UL, 0x58684c11UL, 0xc1611dabUL, 0xb6662d3dUL, 0x76dc4190UL,
		594	0x01db7106UL, 0x98d220bcUL, 0xefd5102aUL, 0x71b18589UL, 0x06b6b51fUL,
		595	0x9fbfe4a5UL, 0xe8b8d433UL, 0x7807c9a2UL, 0x0f00f934UL, 0x9609a88eUL,
		596	0xe10e9818UL, 0x7f6a0dbbUL, 0x086d3d2dUL, 0x91646c97UL, 0xe6635c01UL,
		597	0x6b6b51f4UL, 0x1c6c6162UL, 0x856530d8UL, 0xf262004eUL, 0x6c0695edUL,
		598	0x1b01a57bUL, 0x8208f4c1UL, 0xf50fc457UL, 0x65b0d9c6UL, 0x12b7e950UL,
		599	0x8bbeb8eaUL, 0xfcb9887cUL, 0x62dd1ddfUL, 0x15da2d49UL, 0x8cd37cf3UL,
		600	0xfbd44c65UL, 0x4db26158UL, 0x3ab551ceUL, 0xa3bc0074UL, 0xd4bb30e2UL,
		601	0x4adfa541UL, 0x3dd895d7UL, 0xa4d1c46dUL, 0xd3d6f4fbUL, 0x4369e96aUL,
		602	0x346ed9fcUL, 0xad678846UL, 0xda60b8d0UL, 0x44042d73UL, 0x33031de5UL,
		603	0xaa0a4c5fUL, 0xdd0d7cc9UL, 0x5005713cUL, 0x270241aaUL, 0xbe0b1010UL,
		604	0xc90c2086UL, 0x5768b525UL, 0x206f85b3UL, 0xb966d409UL, 0xce61e49fUL,
		605	0x5edef90eUL, 0x29d9c998UL, 0xb0d09822UL, 0xc7d7a8b4UL, 0x59b33d17UL,
		606	0x2eb40d81UL, 0xb7bd5c3bUL, 0xc0ba6cadUL, 0xedb88320UL, 0x9abfb3b6UL,
		607	0x03b6e20cUL, 0x74b1d29aUL, 0xead54739UL, 0x9dd277afUL, 0x04db2615UL,
		608	0x73dc1683UL, 0xe3630b12UL, 0x94643b84UL, 0x0d6d6a3eUL, 0x7a6a5aa8UL,
		609	0xe40ecf0bUL, 0x9309ff9dUL, 0x0a00ae27UL, 0x7d079eb1UL, 0xf00f9344UL,
		610	0x8708a3d2UL, 0x1e01f268UL, 0x6906c2feUL, 0xf762575dUL, 0x806567cbUL,
		611	0x196c3671UL, 0x6e6b06e7UL, 0xfed41b76UL, 0x89d32be0UL, 0x10da7a5aUL,
		612	0x67dd4accUL, 0xf9b9df6fUL, 0x8ebeeff9UL, 0x17b7be43UL, 0x60b08ed5UL,
		613	0xd6d6a3e8UL, 0xa1d1937eUL, 0x38d8c2c4UL, 0x4fdff252UL, 0xd1bb67f1UL,
		614	0xa6bc5767UL, 0x3fb506ddUL, 0x48b2364bUL, 0xd80d2bdaUL, 0xaf0a1b4cUL,
		615	0x36034af6UL, 0x41047a60UL, 0xdf60efc3UL, 0xa867df55UL, 0x316e8eefUL,
		616	0x4669be79UL, 0xcb61b38cUL, 0xbc66831aUL, 0x256fd2a0UL, 0x5268e236UL,
		617	0xcc0c7795UL, 0xbb0b4703UL, 0x220216b9UL, 0x5505262fUL, 0xc5ba3bbeUL,
		618	0xb2bd0b28UL, 0x2bb45a92UL, 0x5cb36a04UL, 0xc2d7ffa7UL, 0xb5d0cf31UL,
		619	0x2cd99e8bUL, 0x5bdeae1dUL, 0x9b64c2b0UL, 0xec63f226UL, 0x756aa39cUL,
		620	0x026d930aUL, 0x9c0906a9UL, 0xeb0e363fUL, 0x72076785UL, 0x05005713UL,
		621	0x95bf4a82UL, 0xe2b87a14UL, 0x7bb12baeUL, 0x0cb61b38UL, 0x92d28e9bUL,
		622	0xe5d5be0dUL, 0x7cdcefb7UL, 0x0bdbdf21UL, 0x86d3d2d4UL, 0xf1d4e242UL,
		623	0x68ddb3f8UL, 0x1fda836eUL, 0x81be16cdUL, 0xf6b9265bUL, 0x6fb077e1UL,
		624	0x18b74777UL, 0x88085ae6UL, 0xff0f6a70UL, 0x66063bcaUL, 0x11010b5cUL,
		625	0x8f659effUL, 0xf862ae69UL, 0x616bffd3UL, 0x166ccf45UL, 0xa00ae278UL,
		626	0xd70dd2eeUL, 0x4e048354UL, 0x3903b3c2UL, 0xa7672661UL, 0xd06016f7UL,
		627	0x4969474dUL, 0x3e6e77dbUL, 0xaed16a4aUL, 0xd9d65adcUL, 0x40df0b66UL,
		628	0x37d83bf0UL, 0xa9bcae53UL, 0xdebb9ec5UL, 0x47b2cf7fUL, 0x30b5ffe9UL,
		629	0xbdbdf21cUL, 0xcabac28aUL, 0x53b39330UL, 0x24b4a3a6UL, 0xbad03605UL,
		630	0xcdd70693UL, 0x54de5729UL, 0x23d967bfUL, 0xb3667a2eUL, 0xc4614ab8UL,
		631	0x5d681b02UL, 0x2a6f2b94UL, 0xb40bbe37UL, 0xc30c8ea1UL, 0x5a05df1bUL,
		632	0x2d02ef8dL
		633	};
		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
		643

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.63 by root, Mon Aug 6 10:54:11 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.63 by root, Mon Aug 6 10:54:11 2007 UTC