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

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

Diff Legend

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

Comparing deliantra/server/common/utils.C (file contents): Revision 1.1 by elmex, Sun Aug 13 17:16:01 2006 UTC vs. Revision 1.91 by root, Tue Oct 20 05:57:08 2009 UTC

Diff Legend

Comparing deliantra/server/common/utils.C (file contents):
Revision 1.1 by elmex, Sun Aug 13 17:16:01 2006 UTC vs.
Revision 1.91 by root, Tue Oct 20 05:57:08 2009 UTC