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

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

Diff Legend

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

Comparing deliantra/server/common/utils.C (file contents): Revision 1.3 by root, Sun Sep 3 00:18:40 2006 UTC vs. Revision 1.80 by root, Wed Sep 10 18:18:10 2008 UTC

Diff Legend

Comparing deliantra/server/common/utils.C (file contents):
Revision 1.3 by root, Sun Sep 3 00:18:40 2006 UTC vs.
Revision 1.80 by root, Wed Sep 10 18:18:10 2008 UTC