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

Comparing deliantra/server/common/utils.C (file contents):
Revision 1.35 by root, Mon Jan 1 13:31:46 2007 UTC vs.
Revision 1.86 by root, Mon Jan 12 03:40:21 2009 UTC

…		…
1	/*	1	/*
2	CrossFire, A Multiplayer game for X-windows	2	* This file is part of Deliantra, the Roguelike Realtime MMORPG.
3		3	*
		4	* Copyright (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
4	Copyright (C) 2002 Mark Wedel & Crossfire Development Team	5	* Copyright (©) 2002,2007 Mark Wedel & Crossfire Development Team
5	Copyright (C) 1992 Frank Tore Johansen	6	* Copyright (©) 1992,2007 Frank Tore Johansen
6		7	*
7	This program is free software; you can redistribute it and/or modify	8	* Deliantra is free software: you can redistribute it and/or modify
8	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
9	the Free Software Foundation; either version 2 of the License, or	10	* the Free Software Foundation, either version 3 of the License, or
10	(at your option) any later version.	11	* (at your option) any later version.
11		12	*
12	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,
13	but WITHOUT ANY WARRANTY; without even the implied warranty of	14	* but WITHOUT ANY WARRANTY; without even the implied warranty of
14	MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the	15	* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15	GNU General Public License for more details.	16	* GNU General Public License for more details.
16		17	*
17	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
18	along with this program; if not, write to the Free Software	19	* along with this program. If not, see <http://www.gnu.org/licenses/>.
19	Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.	20	*
20		21	* The authors can be reached via e-mail to <support@deliantra.net>
21	The authors can be reached via e-mail at <crossfire@schmorp.de>
22	*/	22	*/
23		23
24	/*	24	/*
25	* General convenience functions for crossfire.	25	* General convenience functions for crossfire.
26	*/	26	*/
27		27
28	#include <global.h>	28	#include <cstdlib>
		29	#include <sys/types.h>
29	#include <funcpoint.h>	30	#include <unistd.h>
30	#include <material.h>
31
32	#include <sys/time.h>	31	#include <sys/time.h>
33	#include <time.h>	32	#include <time.h>
		33	#include <signal.h>
		34
		35	#include <global.h>
		36	#include <material.h>
		37
		38	#include <sys/time.h>
		39	#include <sys/resource.h>
		40
34	#include <glib.h>	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	next ();
		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	template<class generator>
		71	uint32_t
		72	random_number_generator<generator>::get_range (uint32_t num)
		73	{
		74	return (this->next () * (uint64_t)num) >> 32U;
		75	}
		76
		77	// return a number within (min .. max)
		78	template<class generator>
		79	int
		80	random_number_generator<generator>::get_range (int r_min, int r_max)
		81	{
		82	return r_min + get_range (max (r_max - r_min + 1, 0));
		83	}
		84
		85	template struct random_number_generator<tausworthe_random_generator>;
		86	template struct random_number_generator<xorshift_random_generator>;
35		87
36	/*	88	/*
37	* The random functions here take luck into account when rolling random	89	* The random functions here take luck into account when rolling random
38	* dice or numbers. This function has less of an impact the larger the	90	* dice or numbers. This function has less of an impact the larger the
39	* difference becomes in the random numbers. IE, the effect is lessened	91	* difference becomes in the random numbers. IE, the effect is lessened
46	* Roll a random number between min and max. Uses op to determine luck,	98	* Roll a random number between min and max. Uses op to determine luck,
47	* and if goodbad is non-zero, luck increases the roll, if zero, it decreases.	99	* and if goodbad is non-zero, luck increases the roll, if zero, it decreases.
48	* Generally, op should be the player/caster/hitter requesting the roll,	100	* Generally, op should be the player/caster/hitter requesting the roll,
49	* not the recipient (ie, the poor slob getting hit). [garbled 20010916]	101	* not the recipient (ie, the poor slob getting hit). [garbled 20010916]
50	*/	102	*/
51
52	int	103	int
53	random_roll (int min, int max, const object *op, int goodbad)	104	random_roll (int r_min, int r_max, const object *op, int goodbad)
54	{	105	{
55	int omin, diff, luck, base, ran;	106	r_max = max (r_min, r_max);
56		107
57	omin = min;	108	int base = r_max - r_min > 1 ? 20 : 50; /* d2 and d3 are corner cases */
58	diff = max - min + 1;
59	((diff > 2) ? (base = 20) : (base = 50)); /* d2 and d3 are corner cases */
60		109
61	if (max < 1 \|\| diff < 1)
62	{
63	LOG (llevError, "Calling random_roll with min=%d max=%d\n", min, max);
64	return (min); /* avoids a float exception */
65	}
66
67	ran = RANDOM ();
68
69	if (op->type != PLAYER)	110	if (op->type == PLAYER)
70	return ((ran % diff) + min);	111	{
71
72	luck = op->stats.luck;	112	int luck = op->stats.luck;
73	if (RANDOM () % base < MIN (10, abs (luck)))	113
		114	if (rndm (base) < min (10, abs (luck)))
		115	{
		116	//TODO: take luck into account
		117	}
74	{	118	}
75	/* we have a winner */
76	((luck > 0) ? (luck = 1) : (luck = -1));
77	diff -= luck;
78	if (diff < 1)
79	return (omin); /check again /
80	((goodbad) ? (min += luck) : (diff));
81		119
82	return (MAX (omin, MIN (max, (ran % diff) + min)));	120	return rndm (r_min, r_max);
83	}
84	return ((ran % diff) + min);
85	}	121	}
86		122
87	/*	123	/*
88	* This is a 64 bit version of random_roll above. This is needed	124	* This is a 64 bit version of random_roll above. This is needed
89	* for exp loss calculations for players changing religions.	125	* for exp loss calculations for players changing religions.
90	*/	126	*/
91
92	sint64	127	sint64
93	random_roll64 (sint64 min, sint64 max, const object *op, int goodbad)	128	random_roll64 (sint64 r_min, sint64 r_max, const object *op, int goodbad)
94	{	129	{
95	sint64 omin, diff, luck, ran;	130	sint64 omin = r_min;
96	int base;	131	sint64 range = max (0, r_max - r_min + 1);
		132	int base = range > 2 ? 20 : 50; /* d2 and d3 are corner cases */
97		133
98	omin = min;	134	/*
99	diff = max - min + 1;
100	((diff > 2) ? (base = 20) : (base = 50)); /* d2 and d3 are corner cases */
101
102	if (max < 1 \|\| diff < 1)
103	{
104	LOG (llevError, "Calling random_roll with min=%" PRId64 " max=%" PRId64 "\n", min, max);
105	return (min); /* avoids a float exception */
106	}
107
108	/* Don't know of a portable call to get 64 bit random values.
109	* So make a call to get two 32 bit random numbers, and just to	135	* 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	136	* a little bitshifting.
111	* 32 bit, so we don't get skewed results
112	*/	137	*/
113	ran = (RANDOM () & 0xffffffff) \| ((sint64) RANDOM () << 32);	138	sint64 ran = (sint64) rndm.next () ^ ((sint64) rndm.next () << 31);
114		139
115	if (op->type != PLAYER)	140	if (op->type != PLAYER)
116	return ((ran % diff) + min);	141	return ((ran % range) + r_min);
117		142
118	luck = op->stats.luck;	143	int luck = op->stats.luck;
		144
119	if (RANDOM () % base < MIN (10, abs (luck)))	145	if (rndm (base) < min (10, abs (luck)))
120	{	146	{
121	/* we have a winner */	147	/* we have a winner */
122	((luck > 0) ? (luck = 1) : (luck = -1));	148	((luck > 0) ? (luck = 1) : (luck = -1));
123	diff -= luck;	149	range -= luck;
124	if (diff < 1)	150	if (range < 1)
125	return (omin); /check again /	151	return (omin); /check again /
		152
126	((goodbad) ? (min += luck) : (diff));	153	((goodbad) ? (r_min += luck) : (range));
127		154
128	return (MAX (omin, MIN (max, (ran % diff) + min)));	155	return (max (omin, min (r_max, (ran % range) + r_min)));
129	}	156	}
130	return ((ran % diff) + min);	157
		158	return ran % range + r_min;
131	}	159	}
132		160
133	/*	161	/*
134	* Roll a number of dice (2d3, 4d6). Uses op to determine luck,	162	* Roll a number of dice (2d3, 4d6). Uses op to determine luck,
135	* If goodbad is non-zero, luck increases the roll, if zero, it decreases.	163	* If goodbad is non-zero, luck increases the roll, if zero, it decreases.
136	* Generally, op should be the player/caster/hitter requesting the roll,	164	* Generally, op should be the player/caster/hitter requesting the roll,
137	* not the recipient (ie, the poor slob getting hit).	165	* not the recipient (ie, the poor slob getting hit).
138	* The args are num D size (ie 4d6) [garbled 20010916]	166	* The args are num D size (ie 4d6) [garbled 20010916]
139	*/	167	*/
140
141	int	168	int
142	die_roll (int num, int size, const object *op, int goodbad)	169	die_roll (int num, int size, const object *op, int goodbad)
143	{	170	{
144	int min, diff, luck, total, i, gotlucky, base, ran;	171	int min, luck, total, i, gotlucky;
145		172
146	diff = size;	173	int diff = size;
147	min = 1;	174	min = 1;
148	luck = total = gotlucky = 0;	175	luck = total = gotlucky = 0;
149	((diff > 2) ? (base = 20) : (base = 50)); /* d2 and d3 are corner cases */	176	int base = diff > 2 ? 20 : 50; /* d2 and d3 are corner cases */
		177
150	if (size < 2 \|\| diff < 1)	178	if (size < 2 \|\| diff < 1)
151	{	179	{
152	LOG (llevError, "Calling die_roll with num=%d size=%d\n", num, size);	180	LOG (llevError, "Calling die_roll with num=%d size=%d\n", num, size);
153	return (num); /* avoids a float exception */	181	return num; /* avoids a float exception */
154	}	182	}
155		183
156	if (op->type == PLAYER)	184	if (op->type == PLAYER)
157	luck = op->stats.luck;	185	luck = op->stats.luck;
158		186
159	for (i = 0; i < num; i++)	187	for (i = 0; i < num; i++)
160	{	188	{
161	if (RANDOM () % base < MIN (10, abs (luck)) && !gotlucky)	189	if (rndm (base) < MIN (10, abs (luck)) && !gotlucky)
162	{	190	{
163	/* we have a winner */	191	/* we have a winner */
164	gotlucky++;	192	gotlucky++;
165	((luck > 0) ? (luck = 1) : (luck = -1));	193	((luck > 0) ? (luck = 1) : (luck = -1));
166	diff -= luck;	194	diff -= luck;
167	if (diff < 1)	195	if (diff < 1)
168	return (num); /check again /	196	return (num); /check again /
169	((goodbad) ? (min += luck) : (diff));	197	((goodbad) ? (min += luck) : (diff));
170	ran = RANDOM ();
171	total += MAX (1, MIN (size, (ran % diff) + min));	198	total += MAX (1, MIN (size, rndm (diff) + min));
172	}	199	}
173	else	200	else
174	{
175	total += RANDOM () % size + 1;	201	total += rndm (size) + 1;
176	}
177	}	202	}
		203
178	return (total);	204	return total;
179	}
180
181	/*
182	* Another convenience function. Returns a number between min and max.
183	* It is suggested one use these functions rather than RANDOM()%, as it
184	* would appear that a number of off-by-one-errors exist due to improper
185	* use of %. This should also prevent SIGFPE.
186	*/
187
188	int
189	rndm (int min, int max)
190	{
191	int diff;
192
193	diff = max - min + 1;
194	if (max < 1 \|\| diff < 1)
195	return (min);
196
197	return (RANDOM () % diff + min);
198	}
199
200	/* decay and destroy perishable items in a map */
201	void
202	maptile::decay_objects ()
203	{
204	if (!spaces)
205	return;
206
207	for (mapspace *ms = spaces + size (); ms-- > spaces; )
208	for (object above, op = ms->bot; op; op = above)
209	{
210	above = op->above;
211
212	bool destroy = 0;
213
214	// do not decay anything above unique floor tiles (yet :)
215	if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE))
216	break;
217
218	if (QUERY_FLAG (op, FLAG_IS_FLOOR)
219	\|\| QUERY_FLAG (op, FLAG_OBJ_ORIGINAL)
220	\|\| QUERY_FLAG (op, FLAG_OBJ_SAVE_ON_OVL)
221	\|\| QUERY_FLAG (op, FLAG_UNIQUE)
222	\|\| QUERY_FLAG (op, FLAG_OVERLAY_FLOOR)
223	\|\| QUERY_FLAG (op, FLAG_UNPAID)
224	\|\| op->is_alive ())
225	; // do not decay
226	else if (op->is_weapon ())
227	{
228	op->stats.dam--;
229	if (op->stats.dam < 0)
230	destroy = 1;
231	}
232	else if (op->is_armor ())
233	{
234	op->stats.ac--;
235	if (op->stats.ac < 0)
236	destroy = 1;
237	}
238	else if (op->type == FOOD)
239	{
240	op->stats.food -= rndm (5, 20);
241	if (op->stats.food < 0)
242	destroy = 1;
243	}
244	else
245	{
246	int mat = op->material;
247
248	if (mat & M_PAPER
249	\|\| mat & M_LEATHER
250	\|\| mat & M_WOOD
251	\|\| mat & M_ORGANIC
252	\|\| mat & M_CLOTH
253	\|\| mat & M_LIQUID
254	\|\| (mat & M_IRON && rndm (1, 5) == 1)
255	\|\| (mat & M_GLASS && rndm (1, 2) == 1)
256	\|\| ((mat & M_STONE \|\| mat & M_ADAMANT) && rndm (1, 10) == 1)
257	\|\| ((mat & M_SOFT_METAL \|\| mat & M_BONE) && rndm (1, 3) == 1)
258	\|\| (mat & M_ICE && temp > 32))
259	destroy = 1;
260	}
261
262	/* adjust overall chance below */
263	if (destroy && rndm (0, 1))
264	op->destroy ();
265	}
266	}	205	}
267		206
268	/* convert materialname to materialtype_t */	207	/* convert materialname to materialtype_t */
269		208
270	materialtype_t *	209	materialtype_t *
271	name_to_material (const char *name)	210	name_to_material (const shstr_cmp name)
272	{	211	{
273	materialtype_t mt, nmt;	212	for (materialtype_t *mt = materialt; mt; mt = mt->next)
		213	if (name == mt->name)
		214	return mt;
274		215
275	mt = NULL;
276	for (nmt = materialt; nmt != NULL && nmt->next != NULL; nmt = nmt->next)
277	{
278	if (strcmp (name, nmt->name) == 0)
279	{
280	mt = nmt;
281	break;
282	}
283	}
284	return mt;	216	return 0;
285	}	217	}
286		218
287	/* when doing transmutation of objects, we have to recheck the resistances,	219	/* when doing transmutation of objects, we have to recheck the resistances,
288	* as some that did not apply previously, may apply now.	220	* as some that did not apply previously, may apply now.
289	*/	221	*/
290
291	void	222	void
292	transmute_materialname (object op, const object change)	223	transmute_materialname (object op, const object change)
293	{	224	{
294	materialtype_t *mt;	225	materialtype_t *mt;
295	int j;	226	int j;
296		227
297	if (op->materialname == NULL)	228	if (!op->materialname)
298	return;	229	return;
299		230
300	if (change->materialname != NULL && strcmp (op->materialname, change->materialname))	231	if (op->materialname != change->materialname)
301	return;	232	return;
302		233
303	if (!op->is_armor ())	234	if (!op->is_armor ())
304	return;	235	return;
305		236
306	mt = name_to_material (op->materialname);	237	mt = name_to_material (op->materialname);
307	if (!mt)	238	if (!mt)
308	{	239	{
309	LOG (llevError, "archetype '%s>%s' uses nonexistent material '%s'\n", &op->arch->name, &op->name, &op->materialname);	240	LOG (llevError, "archetype '%s>%s' uses nonexistent material '%s'\n", &op->arch->archname, &op->name, &op->materialname);
310	return;	241	return;
311	}	242	}
312		243
313	for (j = 0; j < NROFATTACKS; j++)	244	for (j = 0; j < NROFATTACKS; j++)
314	if (op->resist[j] == 0 && change->resist[j] != 0)	245	if (op->resist[j] == 0 && change->resist[j] != 0)
…		…
325	void	256	void
326	set_materialname (object op, int difficulty, materialtype_t nmt)	257	set_materialname (object op, int difficulty, materialtype_t nmt)
327	{	258	{
328	materialtype_t mt, lmt;	259	materialtype_t mt, lmt;
329		260
330	#ifdef NEW_MATERIAL_CODE
331	int j;
332	#endif
333
334	if (op->materialname != NULL)	261	if (!op->materialname)
335	return;	262	return;
336		263
337		264	if (nmt)
338		265	lmt = nmt;
339	if (nmt == NULL)	266	else
340	{	267	{
341	lmt = NULL;	268	lmt = 0;
342	#ifndef NEW_MATERIAL_CODE	269
343	for (mt = materialt; mt != NULL && mt->next != NULL; mt = mt->next)	270	for (mt = materialt; mt; mt = mt->next)
344	{	271	if (op->materials & mt->material && rndm (1, 100) <= mt->chance &&
345	if (op->material & mt->material)	272	difficulty >= mt->difficulty && (op->magic >= mt->magic \|\| mt->magic == 0))
346	{	273	{
347	lmt = mt;	274	lmt = mt;
		275	if (!(op->is_weapon () \|\| op->is_armor ()))
348	break;	276	break;
349	}	277	}
350	}
351
352	#else
353	for (mt = materialt; mt != NULL && mt->next != NULL; mt = mt->next)
354	{
355	if (op->material & mt->material && rndm (1, 100) <= mt->chance &&
356	difficulty >= mt->difficulty && (op->magic >= mt->magic \|\| mt->magic == 0))
357	{
358	lmt = mt;
359	if (!(op->is_weapon () \|\| op->is_armor ()))
360	break;
361	}
362	}
363	#endif
364	}
365	else
366	{	278	}
367	lmt = nmt;	279
		280	if (lmt)
368	}	281	{
369
370	if (lmt != NULL)
371	{
372	#ifndef NEW_MATERIAL_CODE
373	op->materialname = lmt->name;
374	return;
375	#else
376
377	if (op->stats.dam && op->is_weapon ())	282	if (op->stats.dam && op->is_weapon ())
378	{	283	{
379	op->stats.dam += lmt->damage;	284	op->stats.dam += lmt->damage;
380	if (op->stats.dam < 1)	285	if (op->stats.dam < 1)
381	op->stats.dam = 1;	286	op->stats.dam = 1;
382	}	287	}
		288
383	if (op->stats.sp && op->type == BOW)	289	if (op->stats.sp && op->type == BOW)
384	op->stats.sp += lmt->sp;	290	op->stats.sp += lmt->sp;
385	if (op->stats.wc && op->is_weapon ())	291	if (op->stats.wc && op->is_weapon ())
386	op->stats.wc += lmt->wc;	292	op->stats.wc += lmt->wc;
387	if (op->is_armor ())	293	if (op->is_armor ())
388	{	294	{
389	if (op->stats.ac)	295	if (op->stats.ac)
390	op->stats.ac += lmt->ac;	296	op->stats.ac += lmt->ac;
		297
391	for (j = 0; j < NROFATTACKS; j++)	298	for (int j = 0; j < NROFATTACKS; j++)
392	if (op->resist[j] != 0)	299	if (op->resist[j] != 0)
393	{	300	{
394	op->resist[j] += lmt->mod[j];	301	op->resist[j] += lmt->mod[j];
395	if (op->resist[j] > 100)	302	if (op->resist[j] > 100)
396	op->resist[j] = 100;	303	op->resist[j] = 100;
397	if (op->resist[j] < -100)	304	if (op->resist[j] < -100)
398	op->resist[j] = -100;	305	op->resist[j] = -100;
399	}	306	}
400	}	307	}
		308
401	op->materialname = add_string (lmt->name);	309	op->materialname = lmt->name;
402	/* dont make it unstackable if it doesn't need to be */	310	/* dont make it unstackable if it doesn't need to be */
403	if (op->is_weapon () \|\| op->is_armor ())	311	if (op->is_weapon () \|\| op->is_armor ())
404	{	312	{
405	op->weight = (op->weight * lmt->weight) / 100;	313	op->weight = (op->weight * lmt->weight) / 100;
406	op->value = (op->value * lmt->value) / 100;	314	op->value = (op->value * lmt->value) / 100;
407	}	315	}
408	#endif
409	}	316	}
410	}	317	}
411		318
412	/*	319	/*
413	* Strip out the media tags from a String.	320	* Strip out the media tags from a String.
…		…
508	* a 'list' for the purposes here, is a string of items, seperated by commas, except	415	* a 'list' for the purposes here, is a string of items, seperated by commas, except
509	* for the last entry, which has an 'and' before it, and a full stop (period) after it.	416	* for the last entry, which has an 'and' before it, and a full stop (period) after it.
510	* This function will also strip all trailing non alphanumeric characters.	417	* This function will also strip all trailing non alphanumeric characters.
511	* It does not insert an oxford comma.	418	* It does not insert an oxford comma.
512	*/	419	*/
513
514	void	420	void
515	make_list_like (char *input)	421	make_list_like (char *input)
516	{	422	{
517	char *p, tmp[MAX_BUF];	423	char *p, tmp[MAX_BUF];
518	int i;	424	int i;
…		…
543	return;	449	return;
544	}	450	}
545		451
546	/////////////////////////////////////////////////////////////////////////////	452	/////////////////////////////////////////////////////////////////////////////
547		453
		454	void
		455	fork_abort (const char *msg)
		456	{
		457	if (!fork ())
		458	{
		459	signal (SIGINT , SIG_IGN);
		460	signal (SIGTERM, SIG_IGN);
		461	signal (SIGABRT, SIG_IGN);
		462
		463	signal (SIGSEGV, SIG_DFL);
		464	signal (SIGBUS , SIG_DFL);
		465	signal (SIGILL , SIG_DFL);
		466	signal (SIGTRAP, SIG_DFL);
		467
		468	// try to put corefiles into a subdirectory, if existing, to allow
		469	// an administrator to reduce the I/O load.
		470	chdir ("cores");
		471
		472	// try to detach us from as many external dependencies as possible
		473	// as coredumping can take time by closing all fd's.
		474	{
		475	struct rlimit lim;
		476
		477	if (getrlimit (RLIMIT_NOFILE, &lim))
		478	lim.rlim_cur = 1024;
		479
		480	for (int i = 0; i < lim.rlim_cur; ++i)
		481	close (i);
		482	}
		483
		484	{
		485	sigset_t empty;
		486	sigemptyset (&empty);
		487	sigprocmask (SIG_SETMASK, &empty, 0);
		488	}
		489
		490	// try to coredump with SIGTRAP
		491	kill (getpid (), SIGTRAP);
		492	abort ();
		493	}
		494
		495	LOG (llevError, "fork abort: %s\n", msg);
		496	}
		497
548	void *salloc_ (int n) throw (std::bad_alloc)	498	void *salloc_ (int n) throw (std::bad_alloc)
549	{	499	{
550	void *ptr = g_slice_alloc (n);	500	void *ptr = g_slice_alloc (n);
551		501
552	if (!ptr)	502	if (!ptr)
553	throw std::bad_alloc ();	503	throw std::bad_alloc ();
554		504
		505	slice_alloc += n;
555	return ptr;	506	return ptr;
556	}	507	}
557		508
558	void salloc_ (int n, void src) throw (std::bad_alloc)	509	void salloc_ (int n, void src) throw (std::bad_alloc)
559	{	510	{
…		…
565	memset (ptr, 0, n);	516	memset (ptr, 0, n);
566		517
567	return ptr;	518	return ptr;
568	}	519	}
569		520
		521	/******************************************************************************/
		522
		523	#if DEBUG_SALLOC
		524
		525	#define MAGIC 0xa1b2c35543deadLL
		526
		527	void *g_slice_alloc (unsigned long size)
		528	{
		529	unsigned long p = (unsigned long ) (g_slice_alloc)(size + sizeof (unsigned long));
		530	*p++ = size ^ MAGIC;
		531	//fprintf (stderr, "g_slice_alloc %ld %p\n", size, p);//D
		532	return (void *)p;
		533	}
		534
		535	void *g_slice_alloc0 (unsigned long size)
		536	{
		537	return memset (g_slice_alloc (size), 0, size);
		538	}
		539
		540	void g_slice_free1 (unsigned long size, void *ptr)
		541	{
		542	//fprintf (stderr, "g_slice_free %ld %p\n", size, ptr);//D
		543	if (expect_true (ptr))
		544	{
		545	unsigned long p = (unsigned long )ptr;
		546	unsigned long s = *--p ^ MAGIC;
		547
		548	if (size != (unsigned long)(*p ^ MAGIC))
		549	{
		550	LOG (logBacktrace \| llevError, "slice free size (%lx) doesn't match alloc size (%lx)\n", size, s);
		551	abort ();
		552	}
		553
		554	*p = MAGIC;
		555
		556	(g_slice_free1)(s + sizeof (unsigned long), p);
		557	}
		558	}
		559
		560	#endif
		561
		562	/******************************************************************************/
		563
		564	int
570	void assign (char dst, const char src, int maxlen)	565	assign (char dst, const char src, int maxsize)
571	{	566	{
572	if (!src)	567	if (!src)
573	src = "";	568	src = "";
574		569
575	int len = strlen (src);	570	int len = strlen (src);
576		571
577	if (len >= maxlen - 1)	572	if (len >= maxsize)
578	{	573	{
579	if (maxlen <= 4)	574	if (maxsize <= 4)
580	{	575	{
581	memset (dst, '.', maxlen - 1);	576	memset (dst, '.', maxsize - 2);
582	dst [maxlen - 1] = 0;	577	dst [maxsize - 1] = 0;
583	}	578	}
584	else	579	else
585	{	580	{
586	memcpy (dst, src, maxlen - 4);	581	memcpy (dst, src, maxsize - 4);
587	memcpy (dst + maxlen - 4, "...", 4);	582	memcpy (dst + maxsize - 4, "...", 4);
588	}	583	}
		584
		585	len = maxsize;
589	}	586	}
590	else	587	else
591	memcpy (dst, src, len + 1);	588	memcpy (dst, src, ++len);
		589
		590	return len;
		591	}
		592
		593	const char *
		594	format (const char *format, ...)
		595	{
		596	static dynbuf_text buf;
		597
		598	buf.clear ();
		599
		600	va_list ap;
		601	va_start (ap, format);
		602	buf.vprintf (format, ap);
		603	va_end (ap);
		604
		605	return buf;
592	}	606	}
593		607
594	tstamp now ()	608	tstamp now ()
595	{	609	{
596	struct timeval tv;	610	struct timeval tv;
…		…
607		621
608	int diff = (b - a) & 7;	622	int diff = (b - a) & 7;
609	return diff <= 1 \|\| diff >= 7;	623	return diff <= 1 \|\| diff >= 7;
610	}	624	}
611		625
		626	/* crc32 0xdebb20e3 table and supplementary functions. */
		627	extern const uint32_t crc_32_tab[256] =
		628	{
		629	0x00000000UL, 0x77073096UL, 0xee0e612cUL, 0x990951baUL, 0x076dc419UL,
		630	0x706af48fUL, 0xe963a535UL, 0x9e6495a3UL, 0x0edb8832UL, 0x79dcb8a4UL,
		631	0xe0d5e91eUL, 0x97d2d988UL, 0x09b64c2bUL, 0x7eb17cbdUL, 0xe7b82d07UL,
		632	0x90bf1d91UL, 0x1db71064UL, 0x6ab020f2UL, 0xf3b97148UL, 0x84be41deUL,
		633	0x1adad47dUL, 0x6ddde4ebUL, 0xf4d4b551UL, 0x83d385c7UL, 0x136c9856UL,
		634	0x646ba8c0UL, 0xfd62f97aUL, 0x8a65c9ecUL, 0x14015c4fUL, 0x63066cd9UL,
		635	0xfa0f3d63UL, 0x8d080df5UL, 0x3b6e20c8UL, 0x4c69105eUL, 0xd56041e4UL,
		636	0xa2677172UL, 0x3c03e4d1UL, 0x4b04d447UL, 0xd20d85fdUL, 0xa50ab56bUL,
		637	0x35b5a8faUL, 0x42b2986cUL, 0xdbbbc9d6UL, 0xacbcf940UL, 0x32d86ce3UL,
		638	0x45df5c75UL, 0xdcd60dcfUL, 0xabd13d59UL, 0x26d930acUL, 0x51de003aUL,
		639	0xc8d75180UL, 0xbfd06116UL, 0x21b4f4b5UL, 0x56b3c423UL, 0xcfba9599UL,
		640	0xb8bda50fUL, 0x2802b89eUL, 0x5f058808UL, 0xc60cd9b2UL, 0xb10be924UL,
		641	0x2f6f7c87UL, 0x58684c11UL, 0xc1611dabUL, 0xb6662d3dUL, 0x76dc4190UL,
		642	0x01db7106UL, 0x98d220bcUL, 0xefd5102aUL, 0x71b18589UL, 0x06b6b51fUL,
		643	0x9fbfe4a5UL, 0xe8b8d433UL, 0x7807c9a2UL, 0x0f00f934UL, 0x9609a88eUL,
		644	0xe10e9818UL, 0x7f6a0dbbUL, 0x086d3d2dUL, 0x91646c97UL, 0xe6635c01UL,
		645	0x6b6b51f4UL, 0x1c6c6162UL, 0x856530d8UL, 0xf262004eUL, 0x6c0695edUL,
		646	0x1b01a57bUL, 0x8208f4c1UL, 0xf50fc457UL, 0x65b0d9c6UL, 0x12b7e950UL,
		647	0x8bbeb8eaUL, 0xfcb9887cUL, 0x62dd1ddfUL, 0x15da2d49UL, 0x8cd37cf3UL,
		648	0xfbd44c65UL, 0x4db26158UL, 0x3ab551ceUL, 0xa3bc0074UL, 0xd4bb30e2UL,
		649	0x4adfa541UL, 0x3dd895d7UL, 0xa4d1c46dUL, 0xd3d6f4fbUL, 0x4369e96aUL,
		650	0x346ed9fcUL, 0xad678846UL, 0xda60b8d0UL, 0x44042d73UL, 0x33031de5UL,
		651	0xaa0a4c5fUL, 0xdd0d7cc9UL, 0x5005713cUL, 0x270241aaUL, 0xbe0b1010UL,
		652	0xc90c2086UL, 0x5768b525UL, 0x206f85b3UL, 0xb966d409UL, 0xce61e49fUL,
		653	0x5edef90eUL, 0x29d9c998UL, 0xb0d09822UL, 0xc7d7a8b4UL, 0x59b33d17UL,
		654	0x2eb40d81UL, 0xb7bd5c3bUL, 0xc0ba6cadUL, 0xedb88320UL, 0x9abfb3b6UL,
		655	0x03b6e20cUL, 0x74b1d29aUL, 0xead54739UL, 0x9dd277afUL, 0x04db2615UL,
		656	0x73dc1683UL, 0xe3630b12UL, 0x94643b84UL, 0x0d6d6a3eUL, 0x7a6a5aa8UL,
		657	0xe40ecf0bUL, 0x9309ff9dUL, 0x0a00ae27UL, 0x7d079eb1UL, 0xf00f9344UL,
		658	0x8708a3d2UL, 0x1e01f268UL, 0x6906c2feUL, 0xf762575dUL, 0x806567cbUL,
		659	0x196c3671UL, 0x6e6b06e7UL, 0xfed41b76UL, 0x89d32be0UL, 0x10da7a5aUL,
		660	0x67dd4accUL, 0xf9b9df6fUL, 0x8ebeeff9UL, 0x17b7be43UL, 0x60b08ed5UL,
		661	0xd6d6a3e8UL, 0xa1d1937eUL, 0x38d8c2c4UL, 0x4fdff252UL, 0xd1bb67f1UL,
		662	0xa6bc5767UL, 0x3fb506ddUL, 0x48b2364bUL, 0xd80d2bdaUL, 0xaf0a1b4cUL,
		663	0x36034af6UL, 0x41047a60UL, 0xdf60efc3UL, 0xa867df55UL, 0x316e8eefUL,
		664	0x4669be79UL, 0xcb61b38cUL, 0xbc66831aUL, 0x256fd2a0UL, 0x5268e236UL,
		665	0xcc0c7795UL, 0xbb0b4703UL, 0x220216b9UL, 0x5505262fUL, 0xc5ba3bbeUL,
		666	0xb2bd0b28UL, 0x2bb45a92UL, 0x5cb36a04UL, 0xc2d7ffa7UL, 0xb5d0cf31UL,
		667	0x2cd99e8bUL, 0x5bdeae1dUL, 0x9b64c2b0UL, 0xec63f226UL, 0x756aa39cUL,
		668	0x026d930aUL, 0x9c0906a9UL, 0xeb0e363fUL, 0x72076785UL, 0x05005713UL,
		669	0x95bf4a82UL, 0xe2b87a14UL, 0x7bb12baeUL, 0x0cb61b38UL, 0x92d28e9bUL,
		670	0xe5d5be0dUL, 0x7cdcefb7UL, 0x0bdbdf21UL, 0x86d3d2d4UL, 0xf1d4e242UL,
		671	0x68ddb3f8UL, 0x1fda836eUL, 0x81be16cdUL, 0xf6b9265bUL, 0x6fb077e1UL,
		672	0x18b74777UL, 0x88085ae6UL, 0xff0f6a70UL, 0x66063bcaUL, 0x11010b5cUL,
		673	0x8f659effUL, 0xf862ae69UL, 0x616bffd3UL, 0x166ccf45UL, 0xa00ae278UL,
		674	0xd70dd2eeUL, 0x4e048354UL, 0x3903b3c2UL, 0xa7672661UL, 0xd06016f7UL,
		675	0x4969474dUL, 0x3e6e77dbUL, 0xaed16a4aUL, 0xd9d65adcUL, 0x40df0b66UL,
		676	0x37d83bf0UL, 0xa9bcae53UL, 0xdebb9ec5UL, 0x47b2cf7fUL, 0x30b5ffe9UL,
		677	0xbdbdf21cUL, 0xcabac28aUL, 0x53b39330UL, 0x24b4a3a6UL, 0xbad03605UL,
		678	0xcdd70693UL, 0x54de5729UL, 0x23d967bfUL, 0xb3667a2eUL, 0xc4614ab8UL,
		679	0x5d681b02UL, 0x2a6f2b94UL, 0xb40bbe37UL, 0xc30c8ea1UL, 0x5a05df1bUL,
		680	0x2d02ef8dL
		681	};
		682
		683	void thread::start (void (start_routine)(void ), void arg)
		684	{
		685	pthread_attr_t attr;
		686
		687	pthread_attr_init (&attr);
		688	pthread_attr_setdetachstate (&attr, PTHREAD_CREATE_DETACHED);
		689	pthread_attr_setstacksize (&attr, PTHREAD_STACK_MIN < sizeof (long) * 4096
		690	? sizeof (long) * 4096 : PTHREAD_STACK_MIN);
		691	#ifdef PTHREAD_SCOPE_PROCESS
		692	pthread_attr_setscope (&attr, PTHREAD_SCOPE_PROCESS);
		693	#endif
		694
		695	sigset_t fullsigset, oldsigset;
		696	sigfillset (&fullsigset);
		697
		698	pthread_sigmask (SIG_SETMASK, &fullsigset, &oldsigset);
		699
		700	if (pthread_create (&id, &attr, start_routine, arg))
		701	cleanup ("unable to create a new thread");
		702
		703	pthread_sigmask (SIG_SETMASK, &oldsigset, 0);
		704	}
		705

Diff Legend

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

Comparing deliantra/server/common/utils.C (file contents): Revision 1.35 by root, Mon Jan 1 13:31:46 2007 UTC vs. Revision 1.86 by root, Mon Jan 12 03:40:21 2009 UTC

Diff Legend

Comparing deliantra/server/common/utils.C (file contents):
Revision 1.35 by root, Mon Jan 1 13:31:46 2007 UTC vs.
Revision 1.86 by root, Mon Jan 12 03:40:21 2009 UTC