| 1 | /* |
1 | /* |
| 2 | * This file is part of Crossfire TRT, the Roguelike Realtime MORPG. |
2 | * This file is part of Deliantra, the Roguelike Realtime MMORPG. |
| 3 | * |
3 | * |
| 4 | * Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Crossfire TRT team |
4 | * Copyright (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
| 5 | * Copyright (©) 2002,2007 Mark Wedel & Crossfire Development Team |
5 | * Copyright (©) 2002,2007 Mark Wedel & Crossfire Development Team |
| 6 | * Copyright (©) 1992,2007 Frank Tore Johansen |
6 | * Copyright (©) 1992,2007 Frank Tore Johansen |
| 7 | * |
7 | * |
| 8 | * Crossfire TRT is free software: you can redistribute it and/or modify |
8 | * Deliantra is free software: you can redistribute it and/or modify |
| 9 | * 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 |
| 10 | * the Free Software Foundation, either version 3 of the License, or |
10 | * the Free Software Foundation, either version 3 of the License, or |
| 11 | * (at your option) any later version. |
11 | * (at your 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, |
| … | |
… | |
| 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 GNU General Public License |
| 19 | * along with this program. If not, see <http://www.gnu.org/licenses/>. |
19 | * along with this program. If not, see <http://www.gnu.org/licenses/>. |
| 20 | * |
20 | * |
| 21 | * The authors can be reached via e-mail to <crossfire@schmorp.de> |
21 | * The authors can be reached via e-mail to <support@deliantra.net> |
| 22 | */ |
22 | */ |
| 23 | |
23 | |
| 24 | /* |
24 | /* |
| 25 | * General convenience functions for crossfire. |
25 | * General convenience functions for crossfire. |
| 26 | */ |
26 | */ |
| … | |
… | |
| 31 | #include <sys/time.h> |
31 | #include <sys/time.h> |
| 32 | #include <time.h> |
32 | #include <time.h> |
| 33 | #include <signal.h> |
33 | #include <signal.h> |
| 34 | |
34 | |
| 35 | #include <global.h> |
35 | #include <global.h> |
| 36 | #include <funcpoint.h> |
|
|
| 37 | #include <material.h> |
36 | #include <material.h> |
| 38 | |
37 | |
|
|
38 | #include <sys/time.h> |
|
|
39 | #include <sys/resource.h> |
|
|
40 | |
| 39 | #include <glib.h> |
41 | #include <glib.h> |
| 40 | |
42 | |
| 41 | refcnt_base::refcnt_t refcnt_dummy; |
43 | refcnt_base::refcnt_t refcnt_dummy; |
| 42 | |
44 | ssize_t slice_alloc; |
| 43 | rand_gen rndm; |
45 | rand_gen rndm, rmg_rndm; |
| 44 | |
46 | |
| 45 | void |
47 | void |
| 46 | tausworthe_random_generator::seed (uint32_t seed) |
48 | tausworthe_random_generator::seed (uint32_t seed) |
| 47 | { |
49 | { |
| 48 | state [0] = seed * 69069U; if (state [0] < 2U) state [0] += 2U; |
50 | state [0] = seed * 69069U; if (state [0] < 2U) state [0] += 2U; |
| 49 | state [1] = state [0] * 69069U; if (state [0] < 8U) state [0] += 8U; |
51 | state [1] = state [0] * 69069U; if (state [0] < 8U) state [0] += 8U; |
| 50 | state [2] = state [1] * 69069U; if (state [0] < 16U) state [0] += 16U; |
52 | state [2] = state [1] * 69069U; if (state [0] < 16U) state [0] += 16U; |
| 51 | state [3] = state [2] * 69069U; if (state [0] < 128) state [0] += 128U; |
53 | state [3] = state [2] * 69069U; if (state [0] < 128U) state [0] += 128U; |
| 52 | |
54 | |
| 53 | for (int i = 11; --i; ) |
55 | for (int i = 11; --i; ) |
| 54 | operator ()(); |
56 | next (); |
| 55 | } |
57 | } |
| 56 | |
58 | |
| 57 | uint32_t |
59 | uint32_t |
| 58 | tausworthe_random_generator::next () |
60 | tausworthe_random_generator::next () |
| 59 | { |
61 | { |
| … | |
… | |
| 63 | state [3] = ((state [3] & 0xFFFFFF80U) << 13U) ^ (((state [3] << 3U) ^ state [3]) >> 12U); |
65 | state [3] = ((state [3] & 0xFFFFFF80U) << 13U) ^ (((state [3] << 3U) ^ state [3]) >> 12U); |
| 64 | |
66 | |
| 65 | return state [0] ^ state [1] ^ state [2] ^ state [3]; |
67 | return state [0] ^ state [1] ^ state [2] ^ state [3]; |
| 66 | } |
68 | } |
| 67 | |
69 | |
|
|
70 | template<class generator> |
| 68 | uint32_t |
71 | uint32_t |
| 69 | tausworthe_random_generator::get_range (uint32_t num) |
72 | random_number_generator<generator>::get_range (uint32_t num) |
| 70 | { |
73 | { |
| 71 | return (next () * (uint64_t)num) >> 32U; |
74 | return (this->next () * (uint64_t)num) >> 32U; |
| 72 | } |
75 | } |
| 73 | |
76 | |
| 74 | // return a number within (min .. max) |
77 | // return a number within (min .. max) |
|
|
78 | template<class generator> |
| 75 | int |
79 | int |
| 76 | tausworthe_random_generator::get_range (int r_min, int r_max) |
80 | random_number_generator<generator>::get_range (int r_min, int r_max) |
| 77 | { |
81 | { |
| 78 | return r_min + get_range (max (r_max - r_min + 1, 0)); |
82 | return r_min + get_range (max (r_max - r_min + 1, 0)); |
| 79 | } |
83 | } |
|
|
84 | |
|
|
85 | template struct random_number_generator<tausworthe_random_generator>; |
|
|
86 | template struct random_number_generator<xorshift_random_generator>; |
| 80 | |
87 | |
| 81 | /* |
88 | /* |
| 82 | * The random functions here take luck into account when rolling random |
89 | * The random functions here take luck into account when rolling random |
| 83 | * dice or numbers. This function has less of an impact the larger the |
90 | * dice or numbers. This function has less of an impact the larger the |
| 84 | * difference becomes in the random numbers. IE, the effect is lessened |
91 | * difference becomes in the random numbers. IE, the effect is lessened |
| … | |
… | |
| 94 | * not the recipient (ie, the poor slob getting hit). [garbled 20010916] |
101 | * not the recipient (ie, the poor slob getting hit). [garbled 20010916] |
| 95 | */ |
102 | */ |
| 96 | int |
103 | int |
| 97 | random_roll (int r_min, int r_max, const object *op, int goodbad) |
104 | random_roll (int r_min, int r_max, const object *op, int goodbad) |
| 98 | { |
105 | { |
|
|
106 | r_max = max (r_min, r_max); |
|
|
107 | |
| 99 | int base = r_max - r_min > 1 ? 20 : 50; /* d2 and d3 are corner cases */ |
108 | int base = r_max - r_min > 1 ? 20 : 50; /* d2 and d3 are corner cases */ |
| 100 | |
|
|
| 101 | if (r_max < r_min) |
|
|
| 102 | { |
|
|
| 103 | LOG (llevError | logBacktrace, "Calling random_roll with min=%d max=%d\n", r_min, r_max); |
|
|
| 104 | return r_min; |
|
|
| 105 | } |
|
|
| 106 | |
109 | |
| 107 | if (op->type == PLAYER) |
110 | if (op->type == PLAYER) |
| 108 | { |
111 | { |
| 109 | int luck = op->stats.luck; |
112 | int luck = op->stats.luck; |
| 110 | |
113 | |
| … | |
… | |
| 120 | /* |
123 | /* |
| 121 | * This is a 64 bit version of random_roll above. This is needed |
124 | * This is a 64 bit version of random_roll above. This is needed |
| 122 | * for exp loss calculations for players changing religions. |
125 | * for exp loss calculations for players changing religions. |
| 123 | */ |
126 | */ |
| 124 | sint64 |
127 | sint64 |
| 125 | random_roll64 (sint64 min, sint64 max, const object *op, int goodbad) |
128 | random_roll64 (sint64 r_min, sint64 r_max, const object *op, int goodbad) |
| 126 | { |
129 | { |
| 127 | sint64 omin = min; |
130 | sint64 omin = r_min; |
| 128 | sint64 diff = max - min + 1; |
131 | sint64 range = max (0, r_max - r_min + 1); |
| 129 | int base = diff > 2 ? 20 : 50; /* d2 and d3 are corner cases */ |
132 | int base = range > 2 ? 20 : 50; /* d2 and d3 are corner cases */ |
| 130 | |
|
|
| 131 | if (diff < 0) |
|
|
| 132 | { |
|
|
| 133 | LOG (llevError | logBacktrace, "Calling random_roll64 with min=%" PRId64 " max=%" PRId64 "\n", min, max); |
|
|
| 134 | return (min); /* avoids a float exception */ |
|
|
| 135 | } |
|
|
| 136 | |
133 | |
| 137 | /* |
134 | /* |
| 138 | * Make a call to get two 32 bit unsigned random numbers, and just to |
135 | * Make a call to get two 32 bit unsigned random numbers, and just to |
| 139 | * a little bitshifting. |
136 | * a little bitshifting. |
| 140 | */ |
137 | */ |
| 141 | sint64 ran = (sint64) rndm.next () ^ ((sint64) rndm.next () << 31); |
138 | sint64 ran = (sint64) rndm.next () ^ ((sint64) rndm.next () << 31); |
| 142 | |
139 | |
| 143 | if (op->type != PLAYER) |
140 | if (op->type != PLAYER) |
| 144 | return ((ran % diff) + min); |
141 | return ((ran % range) + r_min); |
| 145 | |
142 | |
| 146 | int luck = op->stats.luck; |
143 | int luck = op->stats.luck; |
| 147 | |
144 | |
| 148 | if (rndm (base) < MIN (10, abs (luck))) |
145 | if (rndm (base) < min (10, abs (luck))) |
| 149 | { |
146 | { |
| 150 | /* we have a winner */ |
147 | /* we have a winner */ |
| 151 | ((luck > 0) ? (luck = 1) : (luck = -1)); |
148 | ((luck > 0) ? (luck = 1) : (luck = -1)); |
| 152 | diff -= luck; |
149 | range -= luck; |
| 153 | if (diff < 1) |
150 | if (range < 1) |
| 154 | return (omin); /*check again */ |
151 | return (omin); /*check again */ |
| 155 | |
152 | |
| 156 | ((goodbad) ? (min += luck) : (diff)); |
153 | ((goodbad) ? (r_min += luck) : (range)); |
| 157 | |
154 | |
| 158 | return (MAX (omin, MIN (max, (ran % diff) + min))); |
155 | return (max (omin, min (r_max, (ran % range) + r_min))); |
| 159 | } |
156 | } |
| 160 | |
157 | |
| 161 | return ran % diff + min; |
158 | return ran % range + r_min; |
| 162 | } |
159 | } |
| 163 | |
160 | |
| 164 | /* |
161 | /* |
| 165 | * Roll a number of dice (2d3, 4d6). Uses op to determine luck, |
162 | * 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. |
163 | * If goodbad is non-zero, luck increases the roll, if zero, it decreases. |
| … | |
… | |
| 208 | } |
205 | } |
| 209 | |
206 | |
| 210 | /* convert materialname to materialtype_t */ |
207 | /* convert materialname to materialtype_t */ |
| 211 | |
208 | |
| 212 | materialtype_t * |
209 | materialtype_t * |
| 213 | name_to_material (const shstr &name) |
210 | name_to_material (const shstr_cmp name) |
| 214 | { |
211 | { |
| 215 | for (materialtype_t *mt = materialt; mt && mt->next; mt = mt->next) |
212 | for (materialtype_t *mt = materialt; mt; mt = mt->next) |
| 216 | if (name == mt->name) |
213 | if (name == mt->name) |
| 217 | return mt; |
214 | return mt; |
| 218 | |
215 | |
| 219 | return 0; |
216 | return 0; |
| 220 | } |
217 | } |
| 221 | |
218 | |
| 222 | /* when doing transmutation of objects, we have to recheck the resistances, |
219 | /* when doing transmutation of objects, we have to recheck the resistances, |
| 223 | * as some that did not apply previously, may apply now. |
220 | * as some that did not apply previously, may apply now. |
| 224 | */ |
221 | */ |
| 225 | |
|
|
| 226 | void |
222 | void |
| 227 | transmute_materialname (object *op, const object *change) |
223 | transmute_materialname (object *op, const object *change) |
| 228 | { |
224 | { |
| 229 | materialtype_t *mt; |
225 | materialtype_t *mt; |
| 230 | int j; |
226 | int j; |
| 231 | |
227 | |
| 232 | if (op->materialname == NULL) |
228 | if (!op->materialname) |
| 233 | return; |
229 | return; |
| 234 | |
230 | |
| 235 | if (change->materialname != NULL && strcmp (op->materialname, change->materialname)) |
231 | if (change->materialname && strcmp (op->materialname, change->materialname)) |
| 236 | return; |
232 | return; |
| 237 | |
233 | |
| 238 | if (!op->is_armor ()) |
234 | if (!op->is_armor ()) |
| 239 | return; |
235 | return; |
| 240 | |
236 | |
| … | |
… | |
| 260 | void |
256 | void |
| 261 | set_materialname (object *op, int difficulty, materialtype_t *nmt) |
257 | set_materialname (object *op, int difficulty, materialtype_t *nmt) |
| 262 | { |
258 | { |
| 263 | materialtype_t *mt, *lmt; |
259 | materialtype_t *mt, *lmt; |
| 264 | |
260 | |
| 265 | if (op->materialname != NULL) |
261 | if (!op->materialname) |
| 266 | return; |
262 | return; |
| 267 | |
263 | |
| 268 | if (nmt == NULL) |
264 | if (nmt) |
|
|
265 | lmt = nmt; |
|
|
266 | else |
| 269 | { |
267 | { |
| 270 | lmt = NULL; |
268 | lmt = 0; |
| 271 | |
269 | |
| 272 | for (mt = materialt; mt && mt->next; mt = mt->next) |
270 | for (mt = materialt; mt; mt = mt->next) |
| 273 | if (op->materials & mt->material && rndm (1, 100) <= mt->chance && |
271 | if (op->materials & mt->material && rndm (1, 100) <= mt->chance && |
| 274 | difficulty >= mt->difficulty && (op->magic >= mt->magic || mt->magic == 0)) |
272 | difficulty >= mt->difficulty && (op->magic >= mt->magic || mt->magic == 0)) |
| 275 | { |
273 | { |
| 276 | lmt = mt; |
274 | lmt = mt; |
| 277 | if (!(op->is_weapon () || op->is_armor ())) |
275 | if (!(op->is_weapon () || op->is_armor ())) |
| 278 | break; |
276 | break; |
| 279 | } |
277 | } |
| 280 | } |
278 | } |
| 281 | else |
|
|
| 282 | lmt = nmt; |
|
|
| 283 | |
279 | |
| 284 | if (lmt != NULL) |
280 | if (lmt) |
| 285 | { |
281 | { |
| 286 | if (op->stats.dam && op->is_weapon ()) |
282 | if (op->stats.dam && op->is_weapon ()) |
| 287 | { |
283 | { |
| 288 | op->stats.dam += lmt->damage; |
284 | op->stats.dam += lmt->damage; |
| 289 | if (op->stats.dam < 1) |
285 | if (op->stats.dam < 1) |
| … | |
… | |
| 419 | * a 'list' for the purposes here, is a string of items, seperated by commas, except |
415 | * a 'list' for the purposes here, is a string of items, seperated by commas, except |
| 420 | * for the last entry, which has an 'and' before it, and a full stop (period) after it. |
416 | * for the last entry, which has an 'and' before it, and a full stop (period) after it. |
| 421 | * This function will also strip all trailing non alphanumeric characters. |
417 | * This function will also strip all trailing non alphanumeric characters. |
| 422 | * It does not insert an oxford comma. |
418 | * It does not insert an oxford comma. |
| 423 | */ |
419 | */ |
| 424 | |
|
|
| 425 | void |
420 | void |
| 426 | make_list_like (char *input) |
421 | make_list_like (char *input) |
| 427 | { |
422 | { |
| 428 | char *p, tmp[MAX_BUF]; |
423 | char *p, tmp[MAX_BUF]; |
| 429 | int i; |
424 | int i; |
| … | |
… | |
| 459 | void |
454 | void |
| 460 | fork_abort (const char *msg) |
455 | fork_abort (const char *msg) |
| 461 | { |
456 | { |
| 462 | if (!fork ()) |
457 | if (!fork ()) |
| 463 | { |
458 | { |
|
|
459 | signal (SIGINT , SIG_IGN); |
|
|
460 | signal (SIGTERM, SIG_IGN); |
| 464 | signal (SIGABRT, SIG_DFL); |
461 | signal (SIGABRT, SIG_IGN); |
|
|
462 | |
|
|
463 | signal (SIGSEGV, SIG_DFL); |
|
|
464 | signal (SIGBUS , SIG_DFL); |
|
|
465 | signal (SIGILL , SIG_DFL); |
|
|
466 | signal (SIGTRAP, SIG_DFL); |
|
|
467 | |
| 465 | // try to put corefiles into a subdirectory, if existing, to allow |
468 | // try to put corefiles into a subdirectory, if existing, to allow |
| 466 | // an administrator to reduce the I/O load. |
469 | // an administrator to reduce the I/O load. |
| 467 | chdir ("cores"); |
470 | chdir ("cores"); |
|
|
471 | |
|
|
472 | // try to detach us from as many external dependencies as possible |
|
|
473 | // as coredumping can take time by closing all fd's. |
|
|
474 | { |
|
|
475 | struct rlimit lim; |
|
|
476 | |
|
|
477 | if (getrlimit (RLIMIT_NOFILE, &lim)) |
|
|
478 | lim.rlim_cur = 1024; |
|
|
479 | |
|
|
480 | for (int i = 0; i < lim.rlim_cur; ++i) |
|
|
481 | close (i); |
|
|
482 | } |
|
|
483 | |
|
|
484 | { |
|
|
485 | sigset_t empty; |
|
|
486 | sigemptyset (&empty); |
|
|
487 | sigprocmask (SIG_SETMASK, &empty, 0); |
|
|
488 | } |
|
|
489 | |
|
|
490 | // try to coredump with SIGTRAP |
|
|
491 | kill (getpid (), SIGTRAP); |
| 468 | abort (); |
492 | abort (); |
| 469 | } |
493 | } |
| 470 | |
494 | |
| 471 | LOG (llevError, "fork abort: %s\n", msg); |
495 | LOG (llevError, "fork abort: %s\n", msg); |
| 472 | } |
496 | } |
| 473 | |
497 | |
| 474 | void *salloc_ (int n) throw (std::bad_alloc) |
498 | void *salloc_ (int n) throw (std::bad_alloc) |
| 475 | { |
499 | { |
| 476 | #ifdef PREFER_MALLOC |
|
|
| 477 | void *ptr = malloc (n); |
|
|
| 478 | #else |
|
|
| 479 | void *ptr = g_slice_alloc (n); |
500 | void *ptr = g_slice_alloc (n); |
| 480 | #endif |
|
|
| 481 | |
501 | |
| 482 | if (!ptr) |
502 | if (!ptr) |
| 483 | throw std::bad_alloc (); |
503 | throw std::bad_alloc (); |
| 484 | |
504 | |
|
|
505 | slice_alloc += n; |
| 485 | return ptr; |
506 | return ptr; |
| 486 | } |
507 | } |
| 487 | |
508 | |
| 488 | void *salloc_ (int n, void *src) throw (std::bad_alloc) |
509 | void *salloc_ (int n, void *src) throw (std::bad_alloc) |
| 489 | { |
510 | { |
| … | |
… | |
| 495 | memset (ptr, 0, n); |
516 | memset (ptr, 0, n); |
| 496 | |
517 | |
| 497 | return ptr; |
518 | return ptr; |
| 498 | } |
519 | } |
| 499 | |
520 | |
|
|
521 | /******************************************************************************/ |
|
|
522 | |
|
|
523 | #if DEBUG_SALLOC |
|
|
524 | |
|
|
525 | #define MAGIC 0xa1b2c35543deadLL |
|
|
526 | |
|
|
527 | void *g_slice_alloc (unsigned long size) |
|
|
528 | { |
|
|
529 | unsigned long *p = (unsigned long *) (g_slice_alloc)(size + sizeof (unsigned long)); |
|
|
530 | *p++ = size ^ MAGIC; |
|
|
531 | //fprintf (stderr, "g_slice_alloc %ld %p\n", size, p);//D |
|
|
532 | return (void *)p; |
|
|
533 | } |
|
|
534 | |
|
|
535 | void *g_slice_alloc0 (unsigned long size) |
|
|
536 | { |
|
|
537 | return memset (g_slice_alloc (size), 0, size); |
|
|
538 | } |
|
|
539 | |
|
|
540 | void g_slice_free1 (unsigned long size, void *ptr) |
|
|
541 | { |
|
|
542 | //fprintf (stderr, "g_slice_free %ld %p\n", size, ptr);//D |
|
|
543 | if (expect_true (ptr)) |
|
|
544 | { |
|
|
545 | unsigned long *p = (unsigned long *)ptr; |
|
|
546 | unsigned long s = *--p ^ MAGIC; |
|
|
547 | |
|
|
548 | if (size != (unsigned long)(*p ^ MAGIC)) |
|
|
549 | { |
|
|
550 | LOG (logBacktrace | llevError, "slice free size (%lx) doesn't match alloc size (%lx)\n", size, s); |
|
|
551 | abort (); |
|
|
552 | } |
|
|
553 | |
|
|
554 | *p = MAGIC; |
|
|
555 | |
|
|
556 | (g_slice_free1)(s + sizeof (unsigned long), p); |
|
|
557 | } |
|
|
558 | } |
|
|
559 | |
|
|
560 | #endif |
|
|
561 | |
|
|
562 | /******************************************************************************/ |
|
|
563 | |
| 500 | void assign (char *dst, const char *src, int maxlen) |
564 | void assign (char *dst, const char *src, int maxlen) |
| 501 | { |
565 | { |
| 502 | if (!src) |
566 | if (!src) |
| 503 | src = ""; |
567 | src = ""; |
| 504 | |
568 | |
| … | |
… | |
| 519 | } |
583 | } |
| 520 | else |
584 | else |
| 521 | memcpy (dst, src, len + 1); |
585 | memcpy (dst, src, len + 1); |
| 522 | } |
586 | } |
| 523 | |
587 | |
| 524 | const std::string |
588 | const char * |
| 525 | format (const char *format, ...) |
589 | format (const char *format, ...) |
| 526 | { |
590 | { |
| 527 | int len; |
591 | static dynbuf_text buf; |
| 528 | |
592 | |
| 529 | { |
593 | buf.clear (); |
| 530 | char buf[128]; |
|
|
| 531 | |
594 | |
| 532 | va_list ap; |
595 | va_list ap; |
| 533 | va_start (ap, format); |
596 | va_start (ap, format); |
| 534 | len = vsnprintf (buf, sizeof (buf), format, ap); |
597 | buf.vprintf (format, ap); |
| 535 | va_end (ap); |
598 | va_end (ap); |
| 536 | |
599 | |
| 537 | assert (len >= 0); // shield againstz broken vsnprintf's |
|
|
| 538 | |
|
|
| 539 | // was our static buffer short enough? |
|
|
| 540 | if (len < sizeof (buf)) |
|
|
| 541 | return std::string (buf, len); |
|
|
| 542 | } |
|
|
| 543 | |
|
|
| 544 | { |
|
|
| 545 | // longer, try harder |
|
|
| 546 | char *buf = salloc<char> (len + 1); |
|
|
| 547 | |
|
|
| 548 | va_list ap; |
|
|
| 549 | va_start (ap, format); |
|
|
| 550 | vsnprintf (buf, len + 1, format, ap); |
|
|
| 551 | va_end (ap); |
|
|
| 552 | |
|
|
| 553 | const std::string s (buf, len); |
|
|
| 554 | sfree<char> (buf, len + 1); |
|
|
| 555 | |
|
|
| 556 | return buf; |
600 | return buf; |
| 557 | } |
|
|
| 558 | } |
601 | } |
| 559 | |
602 | |
| 560 | tstamp now () |
603 | tstamp now () |
| 561 | { |
604 | { |
| 562 | struct timeval tv; |
605 | struct timeval tv; |
| … | |
… | |
| 630 | 0xcdd70693UL, 0x54de5729UL, 0x23d967bfUL, 0xb3667a2eUL, 0xc4614ab8UL, |
673 | 0xcdd70693UL, 0x54de5729UL, 0x23d967bfUL, 0xb3667a2eUL, 0xc4614ab8UL, |
| 631 | 0x5d681b02UL, 0x2a6f2b94UL, 0xb40bbe37UL, 0xc30c8ea1UL, 0x5a05df1bUL, |
674 | 0x5d681b02UL, 0x2a6f2b94UL, 0xb40bbe37UL, 0xc30c8ea1UL, 0x5a05df1bUL, |
| 632 | 0x2d02ef8dL |
675 | 0x2d02ef8dL |
| 633 | }; |
676 | }; |
| 634 | |
677 | |
| 635 | #if 0 |
678 | void thread::start (void *(*start_routine)(void *), void *arg) |
| 636 | void xyzzy (object_ptr &a, object_ptr &o) |
|
|
| 637 | { |
679 | { |
| 638 | asm volatile ("int3"); |
680 | pthread_attr_t attr; |
| 639 | a = o; |
681 | |
| 640 | asm volatile ("int3"); |
682 | pthread_attr_init (&attr); |
| 641 | } |
683 | pthread_attr_setdetachstate (&attr, PTHREAD_CREATE_DETACHED); |
|
|
684 | pthread_attr_setstacksize (&attr, PTHREAD_STACK_MIN < sizeof (long) * 4096 |
|
|
685 | ? sizeof (long) * 4096 : PTHREAD_STACK_MIN); |
|
|
686 | #ifdef PTHREAD_SCOPE_PROCESS |
|
|
687 | pthread_attr_setscope (&attr, PTHREAD_SCOPE_PROCESS); |
| 642 | #endif |
688 | #endif |
| 643 | |
689 | |
|
|
690 | sigset_t fullsigset, oldsigset; |
|
|
691 | sigfillset (&fullsigset); |
|
|
692 | |
|
|
693 | pthread_sigmask (SIG_SETMASK, &fullsigset, &oldsigset); |
|
|
694 | |
|
|
695 | if (pthread_create (&id, &attr, start_routine, arg)) |
|
|
696 | cleanup ("unable to create a new thread"); |
|
|
697 | |
|
|
698 | pthread_sigmask (SIG_SETMASK, &oldsigset, 0); |
|
|
699 | } |
|
|
700 | |
