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

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

Diff Legend

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

Comparing deliantra/server/common/utils.C (file contents): Revision 1.4 by root, Mon Sep 4 11:07:59 2006 UTC vs. Revision 1.79 by root, Sat Aug 30 05:19:03 2008 UTC

Diff Legend

Comparing deliantra/server/common/utils.C (file contents):
Revision 1.4 by root, Mon Sep 4 11:07:59 2006 UTC vs.
Revision 1.79 by root, Sat Aug 30 05:19:03 2008 UTC