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

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

Diff Legend

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

Comparing deliantra/server/common/utils.C (file contents): Revision 1.2 by root, Tue Aug 29 08:01:36 2006 UTC vs. Revision 1.84 by root, Tue Dec 30 07:24:16 2008 UTC

Diff Legend

Comparing deliantra/server/common/utils.C (file contents):
Revision 1.2 by root, Tue Aug 29 08:01:36 2006 UTC vs.
Revision 1.84 by root, Tue Dec 30 07:24:16 2008 UTC