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.52 by root, Fri Apr 27 14:41:37 2007 UTC vs.
Revision 1.91 by root, Tue Oct 20 05:57:08 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 (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team 4 * Copyright (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
5 * Copyright (C) 2002 Mark Wedel & Crossfire Development Team 5 * Copyright (©) 2002,2007 Mark Wedel & Crossfire Development Team
6 * Copyright (C) 1992 Frank Tore Johansen 6 * Copyright (©) 1992,2007 Frank Tore Johansen
7 * 7 *
8 * 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
9 * 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
10 * the Free Software Foundation; either version 2 of the License, or 10 * Free Software Foundation, either version 3 of the License, or (at your
11 * (at your option) any later version. 11 * option) any later version.
12 * 12 *
13 * 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,
14 * but WITHOUT ANY WARRANTY; without even the implied warranty of 14 * but WITHOUT ANY WARRANTY; without even the implied warranty of
15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 * GNU General Public License for more details. 16 * GNU General Public License for more details.
17 * 17 *
18 * 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
19 * 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
20 * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. 20 * <http://www.gnu.org/licenses/>.
21 * 21 *
22 * 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>
23 */ 23 */
24 24
25/* 25/*
26 * General convenience functions for crossfire. 26 * General convenience functions for crossfire.
27 */ 27 */
… …
32#include <sys/time.h> 32#include <sys/time.h>
33#include <time.h> 33#include <time.h>
34#include <signal.h> 34#include <signal.h>
35 35
36#include <global.h> 36#include <global.h>
37#include <funcpoint.h>
38#include <material.h> 37#include <material.h>
38#include <object.h>
39
40#include <sys/time.h>
41#include <sys/resource.h>
39 42
40#include <glib.h> 43#include <glib.h>
41 44
42rand_gen rndm; 45refcnt_base::refcnt_t refcnt_dummy;
46ssize_t slice_alloc;
47rand_gen rndm, rmg_rndm;
43 48
44void 49void
45tausworthe_random_generator::seed (uint32_t seed) 50tausworthe_random_generator::seed (uint32_t seed)
46{ 51{
47 state [0] = seed * 69069U; if (state [0] < 2U) state [0] += 2U; 52 state [0] = seed * 69069U; if (state [0] < 2U) state [0] += 2U;
48 state [1] = state [0] * 69069U; if (state [0] < 8U) state [0] += 8U; 53 state [1] = state [0] * 69069U; if (state [0] < 8U) state [0] += 8U;
49 state [2] = state [1] * 69069U; if (state [0] < 16U) state [0] += 16U; 54 state [2] = state [1] * 69069U; if (state [0] < 16U) state [0] += 16U;
50 state [3] = state [2] * 69069U; if (state [0] < 128) state [0] += 128U; 55 state [3] = state [2] * 69069U; if (state [0] < 128U) state [0] += 128U;
51 56
52 for (int i = 11; --i; ) 57 for (int i = 11; --i; )
53 operator ()(); 58 next ();
54} 59}
55 60
56uint32_t 61uint32_t
57tausworthe_random_generator::next () 62tausworthe_random_generator::next ()
58{ 63{
… …
62 state [3] = ((state [3] & 0xFFFFFF80U) << 13U) ^ (((state [3] << 3U) ^ state [3]) >> 12U); 67 state [3] = ((state [3] & 0xFFFFFF80U) << 13U) ^ (((state [3] << 3U) ^ state [3]) >> 12U);
63 68
64 return state [0] ^ state [1] ^ state [2] ^ state [3]; 69 return state [0] ^ state [1] ^ state [2] ^ state [3];
65} 70}
66 71
72template<class generator>
67uint32_t 73uint32_t
68tausworthe_random_generator::get_range (uint32_t num) 74random_number_generator<generator>::get_range (uint32_t num)
69{ 75{
70 return (next () * (uint64_t)num) >> 32U; 76 return (this->next () * (uint64_t)num) >> 32U;
71} 77}
72 78
73// return a number within (min .. max) 79// return a number within (min .. max)
80template<class generator>
74int 81int
75tausworthe_random_generator::get_range (int r_min, int r_max) 82random_number_generator<generator>::get_range (int r_min, int r_max)
76{ 83{
77 return r_min + get_range (max (r_max - r_min + 1, 0)); 84 return r_min + get_range (max (r_max - r_min + 1, 0));
78} 85}
86
87template struct random_number_generator<tausworthe_random_generator>;
88template struct random_number_generator<xorshift_random_generator>;
79 89
80/* 90/*
81 * The random functions here take luck into account when rolling random 91 * The random functions here take luck into account when rolling random
82 * 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
83 * difference becomes in the random numbers. IE, the effect is lessened 93 * difference becomes in the random numbers. IE, the effect is lessened
… …
93 * not the recipient (ie, the poor slob getting hit). [garbled 20010916] 103 * not the recipient (ie, the poor slob getting hit). [garbled 20010916]
94 */ 104 */
95int 105int
96random_roll (int r_min, int r_max, const object *op, int goodbad) 106random_roll (int r_min, int r_max, const object *op, int goodbad)
97{ 107{
108 r_max = max (r_min, r_max);
109
98 int base = r_max - r_min > 1 ? 20 : 50; /* d2 and d3 are corner cases */ 110 int base = r_max - r_min > 1 ? 20 : 50; /* d2 and d3 are corner cases */
99
100 if (r_max < 1 || r_max < r_min)
101 {
102 LOG (llevError, "Calling random_roll with min=%d max=%d\n", r_min, r_max);
103 return r_min;
104 }
105 111
106 if (op->type == PLAYER) 112 if (op->type == PLAYER)
107 { 113 {
108 int luck = op->stats.luck; 114 int luck = op->stats.luck;
109 115
… …
119/* 125/*
120 * 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
121 * for exp loss calculations for players changing religions. 127 * for exp loss calculations for players changing religions.
122 */ 128 */
123sint64 129sint64
124random_roll64 (sint64 min, sint64 max, const object *op, int goodbad) 130random_roll64 (sint64 r_min, sint64 r_max, const object *op, int goodbad)
125{ 131{
126 sint64 omin, diff, luck, ran; 132 sint64 omin = r_min;
127 int base; 133 sint64 range = max (0, r_max - r_min + 1);
128 134 int base = range > 2 ? 20 : 50; /* d2 and d3 are corner cases */
129 omin = min;
130 diff = max - min + 1;
131 ((diff > 2) ? (base = 20) : (base = 50)); /* d2 and d3 are corner cases */
132
133 if (max < 1 || diff < 1)
134 {
135 LOG (llevError, "Calling random_roll with min=%" PRId64 " max=%" PRId64 "\n", min, max);
136 return (min); /* avoids a float exception */
137 }
138 135
139 /* 136 /*
140 * Make a call to get two 32 bit unsigned random numbers, and just to 137 * Make a call to get two 32 bit unsigned random numbers, and just to
141 * a little bitshifting. 138 * a little bitshifting.
142 */ 139 */
143 ran = (sint64) rndm.next () ^ ((sint64) rndm.next () << 31); 140 sint64 ran = (sint64) rndm.next () ^ ((sint64) rndm.next () << 31);
144 141
145 if (op->type != PLAYER) 142 if (op->type != PLAYER)
146 return ((ran % diff) + min); 143 return ((ran % range) + r_min);
147 144
148 luck = op->stats.luck; 145 int luck = op->stats.luck;
146
149 if (rndm (base) < MIN (10, abs (luck))) 147 if (rndm (base) < min (10, abs (luck)))
150 { 148 {
151 /* we have a winner */ 149 /* we have a winner */
152 ((luck > 0) ? (luck = 1) : (luck = -1)); 150 ((luck > 0) ? (luck = 1) : (luck = -1));
153 diff -= luck; 151 range -= luck;
154 if (diff < 1) 152 if (range < 1)
155 return (omin); /*check again */ 153 return (omin); /*check again */
154
156 ((goodbad) ? (min += luck) : (diff)); 155 ((goodbad) ? (r_min += luck) : (range));
157 156
158 return (MAX (omin, MIN (max, (ran % diff) + min))); 157 return (max (omin, min (r_max, (ran % range) + r_min)));
159 } 158 }
160 159
161 return ((ran % diff) + min); 160 return ran % range + r_min;
162} 161}
163 162
164/* 163/*
165 * 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,
166 * 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.
167 * Generally, op should be the player/caster/hitter requesting the roll, 166 * Generally, op should be the player/caster/hitter requesting the roll,
168 * not the recipient (ie, the poor slob getting hit). 167 * not the recipient (ie, the poor slob getting hit).
169 * The args are num D size (ie 4d6) [garbled 20010916] 168 * The args are num D size (ie 4d6) [garbled 20010916]
170 */ 169 */
171
172int 170int
173die_roll (int num, int size, const object *op, int goodbad) 171die_roll (int num, int size, const object *op, int goodbad)
174{ 172{
175 int min, diff, luck, total, i, gotlucky, base; 173 int min, luck, total, i, gotlucky;
176 174
177 diff = size; 175 int diff = size;
178 min = 1; 176 min = 1;
179 luck = total = gotlucky = 0; 177 luck = total = gotlucky = 0;
180 ((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
181 if (size < 2 || diff < 1) 180 if (size < 2 || diff < 1)
182 { 181 {
183 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);
184 return (num); /* avoids a float exception */ 183 return num; /* avoids a float exception */
185 } 184 }
186 185
187 if (op->type == PLAYER) 186 if (op->type == PLAYER)
188 luck = op->stats.luck; 187 luck = op->stats.luck;
189 188
… …
205 } 204 }
206 205
207 return total; 206 return total;
208} 207}
209 208
210/* decay and destroy perishable items in a map */
211void
212maptile::decay_objects ()
213{
214 if (!spaces)
215 return;
216
217 for (mapspace *ms = spaces + size (); ms-- > spaces; )
218 for (object *above, *op = ms->bot; op; op = above)
219 {
220 above = op->above;
221
222 bool destroy = 0;
223
224 // do not decay anything above unique floor tiles (yet :)
225 if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE))
226 break;
227
228 if (QUERY_FLAG (op, FLAG_IS_FLOOR)
229 || QUERY_FLAG (op, FLAG_OBJ_ORIGINAL)
230 || QUERY_FLAG (op, FLAG_OBJ_SAVE_ON_OVL)
231 || QUERY_FLAG (op, FLAG_UNIQUE)
232 || QUERY_FLAG (op, FLAG_OVERLAY_FLOOR)
233 || QUERY_FLAG (op, FLAG_UNPAID)
234 || op->is_alive ())
235 ; // do not decay
236 else if (op->is_weapon ())
237 {
238 op->stats.dam--;
239 if (op->stats.dam < 0)
240 destroy = 1;
241 }
242 else if (op->is_armor ())
243 {
244 op->stats.ac--;
245 if (op->stats.ac < 0)
246 destroy = 1;
247 }
248 else if (op->type == FOOD)
249 {
250 op->stats.food -= rndm (5, 20);
251 if (op->stats.food < 0)
252 destroy = 1;
253 }
254 else
255 {
256 int mat = op->materials;
257
258 if (mat & M_PAPER
259 || mat & M_LEATHER
260 || mat & M_WOOD
261 || mat & M_ORGANIC
262 || mat & M_CLOTH
263 || mat & M_LIQUID
264 || (mat & M_IRON && rndm (1, 5) == 1)
265 || (mat & M_GLASS && rndm (1, 2) == 1)
266 || ((mat & M_STONE || mat & M_ADAMANT) && rndm (1, 10) == 1)
267 || ((mat & M_SOFT_METAL || mat & M_BONE) && rndm (1, 3) == 1)
268 || (mat & M_ICE && temp > 32))
269 destroy = 1;
270 }
271
272 /* adjust overall chance below */
273 if (destroy && rndm (0, 1))
274 op->destroy ();
275 }
276}
277
278/* convert materialname to materialtype_t */ 209/* convert materialname to materialtype_t */
279 210
280materialtype_t * 211materialtype_t *
281name_to_material (const shstr &name) 212name_to_material (const shstr_cmp name)
282{ 213{
283 for (materialtype_t *mt = materialt; mt && mt->next; mt = mt->next) 214 for (materialtype_t *mt = materialt; mt; mt = mt->next)
284 if (name == mt->name) 215 if (name == mt->name)
285 return mt; 216 return mt;
286 217
287 return materialt; 218 return 0;
288} 219}
289 220
290/* when doing transmutation of objects, we have to recheck the resistances, 221/* when doing transmutation of objects, we have to recheck the resistances,
291 * as some that did not apply previously, may apply now. 222 * as some that did not apply previously, may apply now.
292 */ 223 */
293
294void 224void
295transmute_materialname (object *op, const object *change) 225transmute_materialname (object *op, const object *change)
296{ 226{
297 materialtype_t *mt; 227 materialtype_t *mt;
298 int j; 228 int j;
299 229
300 if (op->materialname == NULL) 230 if (!op->materialname)
301 return; 231 return;
302 232
303 if (change->materialname != NULL && strcmp (op->materialname, change->materialname)) 233 if (op->materialname != change->materialname)
304 return; 234 return;
305 235
306 if (!op->is_armor ()) 236 if (!op->is_armor ())
307 return; 237 return;
308 238
309 mt = name_to_material (op->materialname); 239 mt = name_to_material (op->materialname);
310 if (!mt) 240 if (!mt)
311 { 241 {
312 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);
313 return; 243 return;
314 } 244 }
315 245
316 for (j = 0; j < NROFATTACKS; j++) 246 for (j = 0; j < NROFATTACKS; j++)
317 if (op->resist[j] == 0 && change->resist[j] != 0) 247 if (op->resist[j] == 0 && change->resist[j] != 0)
… …
328void 258void
329set_materialname (object *op, int difficulty, materialtype_t *nmt) 259set_materialname (object *op, int difficulty, materialtype_t *nmt)
330{ 260{
331 materialtype_t *mt, *lmt; 261 materialtype_t *mt, *lmt;
332 262
333#ifdef NEW_MATERIAL_CODE
334 int j;
335#endif
336
337 if (op->materialname != NULL) 263 if (!op->materialname)
338 return; 264 return;
339 265
340 266 if (nmt)
341 267 lmt = nmt;
342 if (nmt == NULL) 268 else
343 { 269 {
344 lmt = NULL; 270 lmt = 0;
345#ifndef NEW_MATERIAL_CODE 271
346 for (mt = materialt; mt && mt->next; mt = mt->next) 272 for (mt = materialt; mt; mt = mt->next)
347 { 273 if (op->materials & mt->material && rndm (1, 100) <= mt->chance &&
348 if (op->materials & mt->material) 274 difficulty >= mt->difficulty && (op->magic >= mt->magic || mt->magic == 0))
349 { 275 {
350 lmt = mt; 276 lmt = mt;
277 if (!(op->is_weapon () || op->is_armor ()))
351 break; 278 break;
352 } 279 }
353 }
354
355#else
356 for (mt = materialt; mt && mt->next; mt = mt->next)
357 {
358 if (op->materials & mt->material && rndm (1, 100) <= mt->chance &&
359 difficulty >= mt->difficulty && (op->magic >= mt->magic || mt->magic == 0))
360 {
361 lmt = mt;
362 if (!(op->is_weapon () || op->is_armor ()))
363 break;
364 }
365 }
366#endif
367 }
368 else
369 { 280 }
370 lmt = nmt; 281
282 if (lmt)
371 } 283 {
372
373 if (lmt != NULL)
374 {
375#ifndef NEW_MATERIAL_CODE
376 op->materialname = lmt->name;
377 return;
378#else
379
380 if (op->stats.dam && op->is_weapon ()) 284 if (op->stats.dam && op->is_weapon ())
381 { 285 {
382 op->stats.dam += lmt->damage; 286 op->stats.dam += lmt->damage;
383 if (op->stats.dam < 1) 287 if (op->stats.dam < 1)
384 op->stats.dam = 1; 288 op->stats.dam = 1;
… …
390 op->stats.wc += lmt->wc; 294 op->stats.wc += lmt->wc;
391 if (op->is_armor ()) 295 if (op->is_armor ())
392 { 296 {
393 if (op->stats.ac) 297 if (op->stats.ac)
394 op->stats.ac += lmt->ac; 298 op->stats.ac += lmt->ac;
299
395 for (j = 0; j < NROFATTACKS; j++) 300 for (int j = 0; j < NROFATTACKS; j++)
396 if (op->resist[j] != 0) 301 if (op->resist[j] != 0)
397 { 302 {
398 op->resist[j] += lmt->mod[j]; 303 op->resist[j] += lmt->mod[j];
399 if (op->resist[j] > 100) 304 if (op->resist[j] > 100)
400 op->resist[j] = 100; 305 op->resist[j] = 100;
401 if (op->resist[j] < -100) 306 if (op->resist[j] < -100)
402 op->resist[j] = -100; 307 op->resist[j] = -100;
403 } 308 }
404 } 309 }
310
405 op->materialname = lmt->name; 311 op->materialname = lmt->name;
406 /* dont make it unstackable if it doesn't need to be */ 312 /* dont make it unstackable if it doesn't need to be */
407 if (op->is_weapon () || op->is_armor ()) 313 if (op->is_weapon () || op->is_armor ())
408 { 314 {
409 op->weight = (op->weight * lmt->weight) / 100; 315 op->weight = (op->weight * lmt->weight) / 100;
410 op->value = (op->value * lmt->value) / 100; 316 op->value = (op->value * lmt->value) / 100;
411 } 317 }
412#endif
413 } 318 }
414} 319}
415 320
416/* 321/*
417 * Strip out the media tags from a String. 322 * Strip out the media tags from a String.
… …
505 } 410 }
506 } 411 }
507 result[resultlen] = '\0'; 412 result[resultlen] = '\0';
508} 413}
509 414
510/** 415/******************************************************************************/
511 * Taking a string as an argument, mutate it into a string that looks like a list.
512 * a 'list' for the purposes here, is a string of items, seperated by commas, except
513 * for the last entry, which has an 'and' before it, and a full stop (period) after it.
514 * This function will also strip all trailing non alphanumeric characters.
515 * It does not insert an oxford comma.
516 */
517 416
518void 417/* Checks a player-provided string which will become the msg property of
519make_list_like (char *input) 418 * an object for dangerous input.
419 */
420bool
421msg_is_safe (const char *msg)
520{ 422{
521 char *p, tmp[MAX_BUF]; 423 bool safe = true;
522 int i;
523 424
524 if (!input || strlen (input) > MAX_BUF - 5) 425 /* Trying to cheat by getting data into the object */
525 return; 426 if (!strncmp (msg, "endmsg", sizeof ("endmsg") - 1)
526 /* bad stuff would happen if we continued here, the -5 is to make space for ' and ' */ 427 || strstr (msg, "\nendmsg"))
428 safe = false;
527 429
528 strncpy (tmp, input, MAX_BUF - 5); 430 /* Trying to make the object talk, and potentially access arbitrary code */
529 /*trim all trailing commas, spaces etc. */ 431 if (object::msg_has_dialogue (msg))
530 for (i = strlen (tmp); !isalnum (tmp[i]) && i >= 0; i--) 432 safe = false;
531 tmp[i] = '\0';
532 433
533 strcat (tmp, ".");
534
535 p = strrchr (tmp, ',');
536 if (p)
537 {
538 *p = '\0';
539 strcpy (input, tmp);
540 p++;
541 strcat (input, " and");
542 strcat (input, p);
543 }
544 else
545 strcpy (input, tmp);
546
547 return; 434 return safe;
548} 435}
549 436
550///////////////////////////////////////////////////////////////////////////// 437/////////////////////////////////////////////////////////////////////////////
551 438
552void 439void
553fork_abort (const char *msg) 440fork_abort (const char *msg)
554{ 441{
555 if (!fork ()) 442 if (!fork ())
556 { 443 {
444 signal (SIGINT , SIG_IGN);
445 signal (SIGTERM, SIG_IGN);
557 signal (SIGABRT, SIG_DFL); 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
558 // try to put corefiles into a subdirectory, if existing, to allow 453 // try to put corefiles into a subdirectory, if existing, to allow
559 // an administrator to reduce the I/O load. 454 // an administrator to reduce the I/O load.
560 chdir ("cores"); 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);
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);
561 abort (); 477 abort ();
562 } 478 }
563 479
564 LOG (llevError, "fork abort: %s\n", msg); 480 LOG (llevError, "fork abort: %s\n", msg);
565} 481}
566 482
567void *salloc_ (int n) throw (std::bad_alloc) 483void *salloc_ (int n) throw (std::bad_alloc)
568{ 484{
569#ifdef PREFER_MALLOC
570 void *ptr = malloc (n);
571#else
572 void *ptr = g_slice_alloc (n); 485 void *ptr = g_slice_alloc (n);
573#endif
574 486
575 if (!ptr) 487 if (!ptr)
576 throw std::bad_alloc (); 488 throw std::bad_alloc ();
577 489
490 slice_alloc += n;
578 return ptr; 491 return ptr;
579} 492}
580 493
581void *salloc_ (int n, void *src) throw (std::bad_alloc) 494void *salloc_ (int n, void *src) throw (std::bad_alloc)
582{ 495{
… …
588 memset (ptr, 0, n); 501 memset (ptr, 0, n);
589 502
590 return ptr; 503 return ptr;
591} 504}
592 505
506/******************************************************************************/
507
508#if DEBUG_SALLOC
509
510#define MAGIC 0xa1b2c35543deadLL
511
512void *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
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
545#endif
546
547/******************************************************************************/
548
549int
593void assign (char *dst, const char *src, int maxlen) 550assign (char *dst, const char *src, int maxsize)
594{ 551{
595 if (!src) 552 if (!src)
596 src = ""; 553 src = "";
597 554
598 int len = strlen (src); 555 int len = strlen (src);
599 556
600 if (len >= maxlen - 1) 557 if (len >= maxsize)
601 { 558 {
602 if (maxlen <= 4) 559 if (maxsize <= 4)
603 { 560 {
604 memset (dst, '.', maxlen - 1); 561 memset (dst, '.', maxsize - 2);
605 dst [maxlen - 1] = 0; 562 dst [maxsize - 1] = 0;
606 } 563 }
607 else 564 else
608 { 565 {
609 memcpy (dst, src, maxlen - 4); 566 memcpy (dst, src, maxsize - 4);
610 memcpy (dst + maxlen - 4, "...", 4); 567 memcpy (dst + maxsize - 4, "...", 4);
611 } 568 }
569
570 len = maxsize;
612 } 571 }
613 else 572 else
614 memcpy (dst, src, len + 1); 573 memcpy (dst, src, ++len);
615}
616 574
617const std::string 575 return len;
576}
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 *
618format (const char *format, ...) 587format (const char *format, ...)
619{ 588{
620 int len;
621
622 {
623 char buf[128];
624
625 va_list ap; 589 va_list ap;
626 va_start (ap, format); 590 va_start (ap, format);
627 len = vsnprintf (buf, sizeof (buf), format, ap); 591 char *buf = vformat (format, ap);
628 va_end (ap); 592 va_end (ap);
629 593
630 assert (len >= 0); // shield againstz broken vsnprintf's
631
632 // was our static buffer short enough?
633 if (len < sizeof (buf))
634 return std::string (buf, len);
635 }
636
637 {
638 // longer, try harder
639 char *buf = salloc<char> (len + 1);
640
641 va_list ap;
642 va_start (ap, format);
643 vsnprintf (buf, len + 1, format, ap);
644 va_end (ap);
645
646 const std::string s (buf, len);
647 sfree<char> (buf, len + 1);
648
649 return buf; 594 return buf;
650 }
651} 595}
652 596
653tstamp now () 597tstamp now ()
654{ 598{
655 struct timeval tv; 599 struct timeval tv;
… …
723 0xcdd70693UL, 0x54de5729UL, 0x23d967bfUL, 0xb3667a2eUL, 0xc4614ab8UL, 667 0xcdd70693UL, 0x54de5729UL, 0x23d967bfUL, 0xb3667a2eUL, 0xc4614ab8UL,
724 0x5d681b02UL, 0x2a6f2b94UL, 0xb40bbe37UL, 0xc30c8ea1UL, 0x5a05df1bUL, 668 0x5d681b02UL, 0x2a6f2b94UL, 0xb40bbe37UL, 0xc30c8ea1UL, 0x5a05df1bUL,
725 0x2d02ef8dL 669 0x2d02ef8dL
726}; 670};
727 671
672void thread::start (void *(*start_routine)(void *), void *arg)
673{
674 pthread_attr_t attr;
728 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