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

Comparing deliantra/server/common/utils.C (file contents):
Revision 1.3 by root, Sun Sep 3 00:18:40 2006 UTC vs.
Revision 1.87 by sf-marcmagus, Sun Oct 11 01:35:53 2009 UTC

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

Diff Legend

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

Comparing deliantra/server/common/utils.C (file contents): Revision 1.3 by root, Sun Sep 3 00:18:40 2006 UTC vs. Revision 1.87 by sf-marcmagus, Sun Oct 11 01:35:53 2009 UTC

Diff Legend

Comparing deliantra/server/common/utils.C (file contents):
Revision 1.3 by root, Sun Sep 3 00:18:40 2006 UTC vs.
Revision 1.87 by sf-marcmagus, Sun Oct 11 01:35:53 2009 UTC