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

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

Diff Legend

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

Comparing deliantra/server/common/utils.C (file contents): Revision 1.4 by root, Mon Sep 4 11:07:59 2006 UTC vs. Revision 1.67 by root, Tue Oct 16 05:34:24 2007 UTC

Diff Legend

Comparing deliantra/server/common/utils.C (file contents):
Revision 1.4 by root, Mon Sep 4 11:07:59 2006 UTC vs.
Revision 1.67 by root, Tue Oct 16 05:34:24 2007 UTC