ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/deliantra/server/common/utils.C
(Generate patch)

Comparing deliantra/server/common/utils.C (file contents):
Revision 1.17 by root, Fri Nov 17 19:40:53 2006 UTC vs.
Revision 1.92 by root, Tue Nov 3 23:18:23 2009 UTC

1/* 1/*
2 CrossFire, A Multiplayer game for X-windows 2 * This file is part of Deliantra, the Roguelike Realtime MMORPG.
3 3 *
4 * Copyright (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
4 Copyright (C) 2002 Mark Wedel & Crossfire Development Team 5 * Copyright (©) 2002,2007 Mark Wedel & Crossfire Development Team
5 Copyright (C) 1992 Frank Tore Johansen 6 * Copyright (©) 1992,2007 Frank Tore Johansen
6 7 *
7 This program is free software; you can redistribute it and/or modify 8 * Deliantra is free software: you can redistribute it and/or modify it under
8 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
9 the Free Software Foundation; either version 2 of the License, or 10 * Free Software Foundation, either version 3 of the License, or (at your
10 (at your option) any later version. 11 * option) any later version.
11 12 *
12 This program is distributed in the hope that it will be useful, 13 * This program is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of 14 * but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details. 16 * GNU General Public License for more details.
16 17 *
17 You should have received a copy of the GNU General Public License 18 * You should have received a copy of the Affero GNU General Public License
18 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
19 Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. 20 * <http://www.gnu.org/licenses/>.
20 21 *
21 The authors can be reached via e-mail at <crossfire@schmorp.de> 22 * The authors can be reached via e-mail to <support@deliantra.net>
22*/ 23 */
23 24
24/* 25/*
25 * General convenience functions for crossfire. 26 * General convenience functions for deliantra.
26 */ 27 */
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>
27 35
28#include <global.h> 36#include <global.h>
29#include <funcpoint.h>
30#include <material.h> 37#include <material.h>
38#include <object.h>
39
40#include <sys/time.h>
41#include <sys/resource.h>
31 42
32#include <glib.h> 43#include <glib.h>
44
45refcnt_base::refcnt_t refcnt_dummy;
46ssize_t slice_alloc;
47rand_gen rndm, rmg_rndm;
48
49void
50tausworthe_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
61uint32_t
62tausworthe_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
72template<class generator>
73uint32_t
74random_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)
80template<class generator>
81int
82random_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
87template struct random_number_generator<tausworthe_random_generator>;
88template struct random_number_generator<xorshift_random_generator>;
33 89
34/* 90/*
35 * The random functions here take luck into account when rolling random 91 * The random functions here take luck into account when rolling random
36 * 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
37 * difference becomes in the random numbers. IE, the effect is lessened 93 * difference becomes in the random numbers. IE, the effect is lessened
… …
44 * 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,
45 * 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.
46 * Generally, op should be the player/caster/hitter requesting the roll, 102 * Generally, op should be the player/caster/hitter requesting the roll,
47 * not the recipient (ie, the poor slob getting hit). [garbled 20010916] 103 * not the recipient (ie, the poor slob getting hit). [garbled 20010916]
48 */ 104 */
49
50int 105int
51random_roll (int min, int max, const object *op, int goodbad) 106random_roll (int r_min, int r_max, const object *op, int goodbad)
52{ 107{
53 int omin, diff, luck, base, ran; 108 r_max = max (r_min, r_max);
54 109
55 omin = min; 110 int base = r_max - r_min > 1 ? 20 : 50; /* d2 and d3 are corner cases */
56 diff = max - min + 1;
57 ((diff > 2) ? (base = 20) : (base = 50)); /* d2 and d3 are corner cases */
58 111
59 if (max < 1 || diff < 1)
60 {
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))) 115
116 if (rndm (base) < min (10, abs (luck)))
117 {
118 //TODO: take luck into account
119 }
72 { 120 }
73 /* we have a winner */
74 ((luck > 0) ? (luck = 1) : (luck = -1));
75 diff -= luck;
76 if (diff < 1)
77 return (omin); /*check again */
78 ((goodbad) ? (min += luck) : (diff));
79 121
80 return (MAX (omin, MIN (max, (ran % diff) + min))); 122 return rndm (r_min, r_max);
81 }
82 return ((ran % diff) + min);
83} 123}
84 124
85/* 125/*
86 * 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
87 * for exp loss calculations for players changing religions. 127 * for exp loss calculations for players changing religions.
88 */ 128 */
89
90sint64 129sint64
91random_roll64 (sint64 min, sint64 max, const object *op, int goodbad) 130random_roll64 (sint64 r_min, sint64 r_max, const object *op, int goodbad)
92{ 131{
93 sint64 omin, diff, luck, ran; 132 sint64 omin = r_min;
94 int base; 133 sint64 range = max (0, r_max - r_min + 1);
134 int base = range > 2 ? 20 : 50; /* d2 and d3 are corner cases */
95 135
96 omin = min; 136 /*
97 diff = max - min + 1;
98 ((diff > 2) ? (base = 20) : (base = 50)); /* d2 and d3 are corner cases */
99
100 if (max < 1 || diff < 1)
101 {
102#ifndef WIN32
103 LOG (llevError, "Calling random_roll with min=%lld max=%lld\n", min, max);
104#else
105 LOG (llevError, "Calling random_roll with min=%I64d max=%I64d\n", min, max);
106#endif
107 return (min); /* avoids a float exception */
108 }
109
110 /* Don't know of a portable call to get 64 bit random values.
111 * 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
112 * a little byteshifting. Do make sure the first one is only 138 * a little bitshifting.
113 * 32 bit, so we don't get skewed results
114 */ 139 */
115 ran = (RANDOM () & 0xffffffff) | ((sint64) RANDOM () << 32); 140 sint64 ran = (sint64) rndm.next () ^ ((sint64) rndm.next () << 31);
116 141
117 if (op->type != PLAYER) 142 if (op->type != PLAYER)
118 return ((ran % diff) + min); 143 return ((ran % range) + r_min);
119 144
120 luck = op->stats.luck; 145 int luck = op->stats.luck;
146
121 if (RANDOM () % base < MIN (10, abs (luck))) 147 if (rndm (base) < min (10, abs (luck)))
122 { 148 {
123 /* we have a winner */ 149 /* we have a winner */
124 ((luck > 0) ? (luck = 1) : (luck = -1)); 150 ((luck > 0) ? (luck = 1) : (luck = -1));
125 diff -= luck; 151 range -= luck;
126 if (diff < 1) 152 if (range < 1)
127 return (omin); /*check again */ 153 return (omin); /*check again */
154
128 ((goodbad) ? (min += luck) : (diff)); 155 ((goodbad) ? (r_min += luck) : (range));
129 156
130 return (MAX (omin, MIN (max, (ran % diff) + min))); 157 return (max (omin, min (r_max, (ran % range) + r_min)));
131 } 158 }
132 return ((ran % diff) + min); 159
160 return ran % range + r_min;
133} 161}
134 162
135/* 163/*
136 * 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,
137 * 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.
138 * Generally, op should be the player/caster/hitter requesting the roll, 166 * Generally, op should be the player/caster/hitter requesting the roll,
139 * not the recipient (ie, the poor slob getting hit). 167 * not the recipient (ie, the poor slob getting hit).
140 * The args are num D size (ie 4d6) [garbled 20010916] 168 * The args are num D size (ie 4d6) [garbled 20010916]
141 */ 169 */
142
143int 170int
144die_roll (int num, int size, const object *op, int goodbad) 171die_roll (int num, int size, const object *op, int goodbad)
145{ 172{
146 int min, diff, luck, total, i, gotlucky, base, ran; 173 int min, luck, total, i, gotlucky;
147 174
148 diff = size; 175 int diff = size;
149 min = 1; 176 min = 1;
150 luck = total = gotlucky = 0; 177 luck = total = gotlucky = 0;
151 ((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
152 if (size < 2 || diff < 1) 180 if (size < 2 || diff < 1)
153 { 181 {
154 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);
155 return (num); /* avoids a float exception */ 183 return num; /* avoids a float exception */
156 } 184 }
157 185
158 if (op->type == PLAYER) 186 if (op->type == PLAYER)
159 luck = op->stats.luck; 187 luck = op->stats.luck;
160 188
161 for (i = 0; i < num; i++) 189 for (i = 0; i < num; i++)
162 { 190 {
163 if (RANDOM () % base < MIN (10, abs (luck)) && !gotlucky) 191 if (rndm (base) < MIN (10, abs (luck)) && !gotlucky)
164 { 192 {
165 /* we have a winner */ 193 /* we have a winner */
166 gotlucky++; 194 gotlucky++;
167 ((luck > 0) ? (luck = 1) : (luck = -1)); 195 ((luck > 0) ? (luck = 1) : (luck = -1));
168 diff -= luck; 196 diff -= luck;
169 if (diff < 1) 197 if (diff < 1)
170 return (num); /*check again */ 198 return (num); /*check again */
171 ((goodbad) ? (min += luck) : (diff)); 199 ((goodbad) ? (min += luck) : (diff));
172 ran = RANDOM ();
173 total += MAX (1, MIN (size, (ran % diff) + min)); 200 total += MAX (1, MIN (size, rndm (diff) + min));
174 } 201 }
175 else 202 else
176 {
177 total += RANDOM () % size + 1; 203 total += rndm (size) + 1;
178 }
179 } 204 }
205
180 return (total); 206 return total;
181}
182
183/*
184 * Another convenience function. Returns a number between min and max.
185 * It is suggested one use these functions rather than RANDOM()%, as it
186 * would appear that a number of off-by-one-errors exist due to improper
187 * use of %. This should also prevent SIGFPE.
188 */
189
190int
191rndm (int min, int max)
192{
193 int diff;
194
195 diff = max - min + 1;
196 if (max < 1 || diff < 1)
197 return (min);
198
199 return (RANDOM () % diff + min);
200}
201
202/* decay and destroy persihable items in a map */
203
204void
205decay_objects (maptile *m)
206{
207 int x, y, destroy;
208 object *op, *otmp;
209
210 if (m->unique)
211 return;
212
213 for (x = 0; x < MAP_WIDTH (m); x++)
214 for (y = 0; y < MAP_HEIGHT (m); y++)
215 for (op = get_map_ob (m, x, y); op; op = otmp)
216 {
217 destroy = 0;
218 otmp = op->above;
219 if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE))
220 break;
221 if (QUERY_FLAG (op, FLAG_IS_FLOOR) ||
222 QUERY_FLAG (op, FLAG_OBJ_ORIGINAL) ||
223 QUERY_FLAG (op, FLAG_OBJ_SAVE_ON_OVL) ||
224 QUERY_FLAG (op, FLAG_UNIQUE) || QUERY_FLAG (op, FLAG_OVERLAY_FLOOR) || QUERY_FLAG (op, FLAG_UNPAID) || IS_LIVE (op))
225 continue;
226 /* otherwise, we decay and destroy */
227 if (IS_WEAPON (op))
228 {
229 op->stats.dam--;
230 if (op->stats.dam < 0)
231 destroy = 1;
232 }
233 else if (IS_ARMOR (op))
234 {
235 op->stats.ac--;
236 if (op->stats.ac < 0)
237 destroy = 1;
238 }
239 else if (op->type == FOOD)
240 {
241 op->stats.food -= rndm (5, 20);
242 if (op->stats.food < 0)
243 destroy = 1;
244 }
245 else
246 {
247 if (op->material & M_PAPER || op->material & M_LEATHER ||
248 op->material & M_WOOD || op->material & M_ORGANIC || op->material & M_CLOTH || op->material & M_LIQUID)
249 destroy = 1;
250 if (op->material & M_IRON && rndm (1, 5) == 1)
251 destroy = 1;
252 if (op->material & M_GLASS && rndm (1, 2) == 1)
253 destroy = 1;
254 if ((op->material & M_STONE || op->material & M_ADAMANT) && rndm (1, 10) == 1)
255 destroy = 1;
256 if ((op->material & M_SOFT_METAL || op->material & M_BONE) && rndm (1, 3) == 1)
257 destroy = 1;
258 if (op->material & M_ICE && MAP_TEMP (m) > 32)
259 destroy = 1;
260 }
261 /* adjust overall chance below */
262 if (destroy && rndm (0, 1))
263 {
264 remove_ob (op);
265 free_object (op);
266 }
267 }
268} 207}
269 208
270/* convert materialname to materialtype_t */ 209/* convert materialname to materialtype_t */
271 210
272materialtype_t * 211materialtype_t *
273name_to_material (const char *name) 212name_to_material (const shstr_cmp name)
274{ 213{
275 materialtype_t *mt, *nmt; 214 for (materialtype_t *mt = materialt; mt; mt = mt->next)
215 if (name == mt->name)
216 return mt;
276 217
277 mt = NULL;
278 for (nmt = materialt; nmt != NULL && nmt->next != NULL; nmt = nmt->next)
279 {
280 if (strcmp (name, nmt->name) == 0)
281 {
282 mt = nmt;
283 break;
284 }
285 }
286 return mt; 218 return 0;
287} 219}
288 220
289/* when doing transmutation of objects, we have to recheck the resistances, 221/* when doing transmutation of objects, we have to recheck the resistances,
290 * as some that did not apply previously, may apply now. 222 * as some that did not apply previously, may apply now.
291 */ 223 */
292
293void 224void
294transmute_materialname (object *op, const object *change) 225transmute_materialname (object *op, const object *change)
295{ 226{
296 materialtype_t *mt; 227 materialtype_t *mt;
297 int j; 228 int j;
298 229
299 if (op->materialname == NULL) 230 if (!op->materialname)
300 return; 231 return;
301 232
302 if (change->materialname != NULL && strcmp (op->materialname, change->materialname)) 233 if (op->materialname != change->materialname)
303 return; 234 return;
304 235
305 if (!IS_ARMOR (op)) 236 if (!op->is_armor ())
306 return; 237 return;
307 238
308 mt = name_to_material (op->materialname); 239 mt = name_to_material (op->materialname);
309 if (!mt) 240 if (!mt)
310 { 241 {
311 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);
312 return; 243 return;
313 } 244 }
314 245
315 for (j = 0; j < NROFATTACKS; j++) 246 for (j = 0; j < NROFATTACKS; j++)
316 if (op->resist[j] == 0 && change->resist[j] != 0) 247 if (op->resist[j] == 0 && change->resist[j] != 0)
… …
327void 258void
328set_materialname (object *op, int difficulty, materialtype_t *nmt) 259set_materialname (object *op, int difficulty, materialtype_t *nmt)
329{ 260{
330 materialtype_t *mt, *lmt; 261 materialtype_t *mt, *lmt;
331 262
332#ifdef NEW_MATERIAL_CODE
333 int j;
334#endif
335
336 if (op->materialname != NULL) 263 if (!op->materialname)
337 return; 264 return;
338 265
339 266 if (nmt)
340 267 lmt = nmt;
341 if (nmt == NULL) 268 else
342 { 269 {
343 lmt = NULL; 270 lmt = 0;
344#ifndef NEW_MATERIAL_CODE 271
345 for (mt = materialt; mt != NULL && mt->next != NULL; mt = mt->next) 272 for (mt = materialt; mt; mt = mt->next)
346 { 273 if (op->materials & mt->material && rndm (1, 100) <= mt->chance &&
347 if (op->material & mt->material) 274 difficulty >= mt->difficulty && (op->magic >= mt->magic || mt->magic == 0))
348 { 275 {
349 lmt = mt; 276 lmt = mt;
277 if (!(op->is_weapon () || op->is_armor ()))
350 break; 278 break;
351 } 279 }
352 }
353
354#else
355 for (mt = materialt; mt != NULL && mt->next != NULL; mt = mt->next)
356 {
357 if (op->material & mt->material && rndm (1, 100) <= mt->chance &&
358 difficulty >= mt->difficulty && (op->magic >= mt->magic || mt->magic == 0))
359 {
360 lmt = mt;
361 if (!(IS_WEAPON (op) || IS_ARMOR (op)))
362 break;
363 }
364 }
365#endif
366 }
367 else
368 { 280 }
369 lmt = nmt; 281
282 if (lmt)
370 } 283 {
371 284 if (op->stats.dam && op->is_weapon ())
372 if (lmt != NULL)
373 {
374#ifndef NEW_MATERIAL_CODE
375 op->materialname = lmt->name;
376 return;
377#else
378
379 if (op->stats.dam && IS_WEAPON (op))
380 { 285 {
381 op->stats.dam += lmt->damage; 286 op->stats.dam += lmt->damage;
382 if (op->stats.dam < 1) 287 if (op->stats.dam < 1)
383 op->stats.dam = 1; 288 op->stats.dam = 1;
384 } 289 }
290
385 if (op->stats.sp && op->type == BOW) 291 if (op->stats.sp && op->type == BOW)
386 op->stats.sp += lmt->sp; 292 op->stats.sp += lmt->sp;
387 if (op->stats.wc && IS_WEAPON (op)) 293 if (op->stats.wc && op->is_weapon ())
388 op->stats.wc += lmt->wc; 294 op->stats.wc += lmt->wc;
389 if (IS_ARMOR (op)) 295 if (op->is_armor ())
390 { 296 {
391 if (op->stats.ac) 297 if (op->stats.ac)
392 op->stats.ac += lmt->ac; 298 op->stats.ac += lmt->ac;
299
393 for (j = 0; j < NROFATTACKS; j++) 300 for (int j = 0; j < NROFATTACKS; j++)
394 if (op->resist[j] != 0) 301 if (op->resist[j] != 0)
395 { 302 {
396 op->resist[j] += lmt->mod[j]; 303 op->resist[j] += lmt->mod[j];
397 if (op->resist[j] > 100) 304 if (op->resist[j] > 100)
398 op->resist[j] = 100; 305 op->resist[j] = 100;
399 if (op->resist[j] < -100) 306 if (op->resist[j] < -100)
400 op->resist[j] = -100; 307 op->resist[j] = -100;
401 } 308 }
402 } 309 }
310
403 op->materialname = add_string (lmt->name); 311 op->materialname = lmt->name;
404 /* dont make it unstackable if it doesn't need to be */ 312 /* dont make it unstackable if it doesn't need to be */
405 if (IS_WEAPON (op) || IS_ARMOR (op)) 313 if (op->is_weapon () || op->is_armor ())
406 { 314 {
407 op->weight = (op->weight * lmt->weight) / 100; 315 op->weight = (op->weight * lmt->weight) / 100;
408 op->value = (op->value * lmt->value) / 100; 316 op->value = (op->value * lmt->value) / 100;
409 } 317 }
410#endif
411 } 318 }
412} 319}
413 320
414/* 321/*
415 * Strip out the media tags from a String. 322 * Strip out the media tags from a String.
… …
503 } 410 }
504 } 411 }
505 result[resultlen] = '\0'; 412 result[resultlen] = '\0';
506} 413}
507 414
508/** 415/******************************************************************************/
509 * Taking a string as an argument, mutate it into a string that looks like a list. 416
510 * a 'list' for the purposes here, is a string of items, seperated by commas, except 417/* Checks a player-provided string which will become the msg property of
511 * for the last entry, which has an 'and' before it, and a full stop (period) after it. 418 * an object for dangerous input.
512 * This function will also strip all trailing non alphanumeric characters.
513 * It does not insert an oxford comma.
514 */ 419 */
420bool
421msg_is_safe (const char *msg)
422{
423 bool safe = true;
424
425 /* Trying to cheat by getting data into the object */
426 if (!strncmp (msg, "endmsg", sizeof ("endmsg") - 1)
427 || strstr (msg, "\nendmsg"))
428 safe = false;
429
430 /* Trying to make the object talk, and potentially access arbitrary code */
431 if (object::msg_has_dialogue (msg))
432 safe = false;
433
434 return safe;
435}
436
437/////////////////////////////////////////////////////////////////////////////
515 438
516void 439void
517make_list_like (char *input) 440fork_abort (const char *msg)
518{ 441{
519 char *p, tmp[MAX_BUF]; 442 if (!fork ())
520 int i; 443 {
444 signal (SIGINT , SIG_IGN);
445 signal (SIGTERM, SIG_IGN);
446 signal (SIGABRT, SIG_IGN);
521 447
522 if (!input || strlen (input) > MAX_BUF - 5) 448 signal (SIGSEGV, SIG_DFL);
523 return; 449 signal (SIGBUS , SIG_DFL);
524 /* bad stuff would happen if we continued here, the -5 is to make space for ' and ' */ 450 signal (SIGILL , SIG_DFL);
451 signal (SIGTRAP, SIG_DFL);
525 452
526 strncpy (tmp, input, MAX_BUF - 5); 453 // try to put corefiles into a subdirectory, if existing, to allow
527 /*trim all trailing commas, spaces etc. */ 454 // an administrator to reduce the I/O load.
528 for (i = strlen (tmp); !isalnum (tmp[i]) && i >= 0; i--) 455 chdir ("cores");
529 tmp[i] = '\0';
530 456
531 strcat (tmp, "."); 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;
532 461
533 p = strrchr (tmp, ','); 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);
467 }
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
483void *salloc_ (int n) throw (std::bad_alloc)
484{
485 void *ptr = g_slice_alloc (n);
486
534 if (p) 487 if (!ptr)
535 { 488 throw std::bad_alloc ();
536 *p = '\0'; 489
537 strcpy (input, tmp); 490 slice_alloc += n;
538 p++; 491 return ptr;
539 strcat (input, " and"); 492}
540 strcat (input, p); 493
541 } 494void *salloc_ (int n, void *src) throw (std::bad_alloc)
495{
496 void *ptr = salloc_ (n);
497
498 if (src)
499 memcpy (ptr, src, n);
542 else 500 else
543 strcpy (input, tmp); 501 memset (ptr, 0, n);
544 502
545 return; 503 return ptr;
546} 504}
547 505
548///////////////////////////////////////////////////////////////////////////// 506/******************************************************************************/
549 507
550#if 0 508#if DEBUG_SALLOC
551refcounted *refcounted::rc_first;
552 509
553refcounted::refcounted () 510#define MAGIC 0xa1b2c35543deadLL
554{
555 refcnt = 0;
556 rc_next = rc_first;
557 rc_first = this;
558}
559 511
560refcounted::~refcounted () 512void *g_slice_alloc (unsigned long size)
561{ 513{
562 assert (!rc_next); 514 unsigned long *p = (unsigned long *) (g_slice_alloc)(size + sizeof (unsigned long));
563 assert (!refcnt); 515 *p++ = size ^ MAGIC;
516 //fprintf (stderr, "g_slice_alloc %ld %p\n", size, p);//D
517 return (void *)p;
564} 518}
519
520void *g_slice_alloc0 (unsigned long size)
521{
522 return memset (g_slice_alloc (size), 0, size);
523}
524
525void 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
565#endif 545#endif
566 546
567void *alloc (int s) throw (std::bad_alloc) 547/******************************************************************************/
568{
569 void *p = g_slice_alloc (s);
570 548
571 if (!p) 549int
572 throw std::bad_alloc ();
573
574 return p;
575}
576
577void assign (char *dst, const char *src, int maxlen) 550assign (char *dst, const char *src, int maxsize)
578{ 551{
579 if (!src) 552 if (!src)
580 src = ""; 553 src = "";
581 554
582 int len = strlen (src); 555 int len = strlen (src);
583 556
584 if (len >= maxlen - 1) 557 if (len >= maxsize)
585 { 558 {
586 if (maxlen <= 4) 559 if (maxsize <= 4)
587 { 560 {
588 memset (dst, '.', maxlen - 1); 561 memset (dst, '.', maxsize - 2);
589 dst [maxlen - 1] = 0; 562 dst [maxsize - 1] = 0;
590 } 563 }
591 else 564 else
592 { 565 {
593 memcpy (dst, src, maxlen - 4); 566 memcpy (dst, src, maxsize - 4);
594 memcpy (dst + maxlen - 4, "...", 4); 567 memcpy (dst + maxsize - 4, "...", 4);
595 } 568 }
569
570 len = maxsize;
596 } 571 }
597 else 572 else
598 memcpy (dst, src, len + 1); 573 memcpy (dst, src, ++len);
599}
600 574
575 return len;
576}
601 577
578char *
579vformat (const char *format, va_list ap)
580{
581 static dynbuf_text buf; buf.clear ();
582 buf.vprintf (format, ap);
583 return buf;
584}
585
586char *
587format (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
597tstamp 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
605int
606similar_direction (int a, int b)
607{
608 if (!a || !b)
609 return 0;
610
611 int diff = (b - a) & 7;
612 return diff <= 1 || diff >= 7;
613}
614
615/* crc32 0xdebb20e3 table and supplementary functions. */
616extern 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
672void 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