[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.78 by root, Fri May 16 17:09:38 2008 UTC

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

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.78 by root, Fri May 16 17:09:38 2008 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.78 by root, Fri May 16 17:09:38 2008 UTC