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.63 by root, Mon Aug 6 10:54:11 2007 UTC vs.
Revision 1.102 by root, Sun Nov 11 01:27:44 2012 UTC

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,2009,2010,2011,2012 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
5 * Copyright (©) 2002,2007 Mark Wedel & Crossfire Development Team
6 * Copyright (©) 1992,2007 Frank Tore Johansen
7 * 5 *
8 * Crossfire TRT is free software: you can redistribute it and/or modify 6 * 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 7 * the terms of the Affero GNU General Public License as published by the
10 * the Free Software Foundation, either version 3 of the License, or 8 * Free Software Foundation, either version 3 of the License, or (at your
11 * (at your option) any later version. 9 * option) any later version.
12 * 10 *
13 * This program is distributed in the hope that it will be useful, 11 * This program is distributed in the hope that it will be useful,
14 * but WITHOUT ANY WARRANTY; without even the implied warranty of 12 * but WITHOUT ANY WARRANTY; without even the implied warranty of
15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 13 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 * GNU General Public License for more details. 14 * GNU General Public License for more details.
17 * 15 *
18 * You should have received a copy of the GNU General Public License 16 * You should have received a copy of the Affero GNU General Public License
19 * along with this program. If not, see <http://www.gnu.org/licenses/>. 17 * and the GNU General Public License along with this program. If not, see
18 * <http://www.gnu.org/licenses/>.
20 * 19 *
21 * The authors can be reached via e-mail to <crossfire@schmorp.de> 20 * The authors can be reached via e-mail to <support@deliantra.net>
22 */ 21 */
23 22
24/* 23/*
25 * General convenience functions for crossfire. 24 * General convenience functions for deliantra.
26 */ 25 */
27 26
28#include <cstdlib> 27#include <cstdlib>
29#include <sys/types.h> 28#include <sys/types.h>
30#include <unistd.h> 29#include <unistd.h>
31#include <sys/time.h> 30#include <sys/time.h>
32#include <time.h> 31#include <time.h>
33#include <signal.h> 32#include <signal.h>
34 33
35#include <global.h> 34#include <global.h>
36#include <funcpoint.h>
37#include <material.h> 35#include <material.h>
36#include <object.h>
37
38#include <sys/time.h>
39#include <sys/resource.h>
38 40
39#include <glib.h> 41#include <glib.h>
40 42
41refcnt_base::refcnt_t refcnt_dummy; 43refcnt_base::refcnt_t refcnt_dummy;
44ssize_t slice_alloc;
42 45
43rand_gen rndm; 46#if !GCC_VERSION(3,4)
44 47int least_significant_bit (uint32_t x)
45void
46tausworthe_random_generator::seed (uint32_t seed)
47{ 48{
48 state [0] = seed * 69069U; if (state [0] < 2U) state [0] += 2U; 49 x &= -x; // this isolates the lowest bit
49 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;
51 state [3] = state [2] * 69069U; if (state [0] < 128) state [0] += 128U;
52 50
53 for (int i = 11; --i; ) 51 int r = 0;
54 operator ()();
55}
56 52
57uint32_t 53 if (x & 0xaaaaaaaa) r += 1;
58tausworthe_random_generator::next () 54 if (x & 0xcccccccc) r += 2;
59{ 55 if (x & 0xf0f0f0f0) r += 4;
60 state [0] = ((state [0] & 0xFFFFFFFEU) << 18U) ^ (((state [0] << 6U) ^ state [0]) >> 13U); 56 if (x & 0xff00ff00) r += 8;
61 state [1] = ((state [1] & 0xFFFFFFF8U) << 2U) ^ (((state [1] << 2U) ^ state [1]) >> 27U); 57 if (x & 0xffff0000) r += 16;
62 state [2] = ((state [2] & 0xFFFFFFF0U) << 7U) ^ (((state [2] << 13U) ^ state [2]) >> 21U);
63 state [3] = ((state [3] & 0xFFFFFF80U) << 13U) ^ (((state [3] << 3U) ^ state [3]) >> 12U);
64 58
65 return state [0] ^ state [1] ^ state [2] ^ state [3]; 59 return r;
66} 60}
61#endif
67 62
68uint32_t 63/******************************************************************************/
69tausworthe_random_generator::get_range (uint32_t num)
70{
71 return (next () * (uint64_t)num) >> 32U;
72}
73 64
74// return a number within (min .. max) 65/* Checks a player-provided string which will become the msg property of
75int 66 * an object for dangerous input.
76tausworthe_random_generator::get_range (int r_min, int r_max)
77{
78 return r_min + get_range (max (r_max - r_min + 1, 0));
79}
80
81/*
82 * 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
84 * difference becomes in the random numbers. IE, the effect is lessened
85 * on a 1-1000 roll, vs a 1-6 roll. This can be used by crafty programmers,
86 * to specifically disable luck in certain rolls, simply by making the
87 * numbers larger (ie, 1d1000 > 500 vs 1d6 > 3)
88 */ 67 */
89 68bool
90/* 69msg_is_safe (const char *msg)
91 * Roll a random number between min and max. Uses op to determine luck,
92 * and if goodbad is non-zero, luck increases the roll, if zero, it decreases.
93 * Generally, op should be the player/caster/hitter requesting the roll,
94 * not the recipient (ie, the poor slob getting hit). [garbled 20010916]
95 */
96int
97random_roll (int r_min, int r_max, const object *op, int goodbad)
98{ 70{
99 int base = r_max - r_min > 1 ? 20 : 50; /* d2 and d3 are corner cases */ 71 bool safe = true;
100 72
101 if (r_max < r_min) 73 /* Trying to cheat by getting data into the object */
102 { 74 if (!strncmp (msg, "endmsg", sizeof ("endmsg") - 1)
103 LOG (llevError | logBacktrace, "Calling random_roll with min=%d max=%d\n", r_min, r_max); 75 || strstr (msg, "\nendmsg"))
104 return r_min; 76 safe = false;
105 }
106 77
107 if (op->type == PLAYER) 78 /* Trying to make the object talk, and potentially access arbitrary code */
108 { 79 if (object::msg_has_dialogue (msg))
109 int luck = op->stats.luck; 80 safe = false;
110 81
111 if (rndm (base) < min (10, abs (luck)))
112 {
113 //TODO: take luck into account
114 }
115 }
116
117 return rndm (r_min, r_max);
118}
119
120/*
121 * This is a 64 bit version of random_roll above. This is needed
122 * for exp loss calculations for players changing religions.
123 */
124sint64
125random_roll64 (sint64 min, sint64 max, const object *op, int goodbad)
126{
127 sint64 omin = min;
128 sint64 diff = max - min + 1;
129 int base = diff > 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
137 /*
138 * Make a call to get two 32 bit unsigned random numbers, and just to
139 * a little bitshifting.
140 */
141 sint64 ran = (sint64) rndm.next () ^ ((sint64) rndm.next () << 31);
142
143 if (op->type != PLAYER)
144 return ((ran % diff) + min);
145
146 int luck = op->stats.luck;
147
148 if (rndm (base) < MIN (10, abs (luck)))
149 {
150 /* we have a winner */
151 ((luck > 0) ? (luck = 1) : (luck = -1));
152 diff -= luck;
153 if (diff < 1)
154 return (omin); /*check again */
155
156 ((goodbad) ? (min += luck) : (diff));
157
158 return (MAX (omin, MIN (max, (ran % diff) + min)));
159 }
160
161 return ran % diff + min;
162}
163
164/*
165 * 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.
167 * Generally, op should be the player/caster/hitter requesting the roll,
168 * not the recipient (ie, the poor slob getting hit).
169 * The args are num D size (ie 4d6) [garbled 20010916]
170 */
171int
172die_roll (int num, int size, const object *op, int goodbad)
173{
174 int min, luck, total, i, gotlucky;
175
176 int diff = size;
177 min = 1;
178 luck = total = gotlucky = 0;
179 int base = diff > 2 ? 20 : 50; /* d2 and d3 are corner cases */
180
181 if (size < 2 || diff < 1)
182 {
183 LOG (llevError, "Calling die_roll with num=%d size=%d\n", num, size);
184 return num; /* avoids a float exception */
185 }
186
187 if (op->type == PLAYER)
188 luck = op->stats.luck;
189
190 for (i = 0; i < num; i++)
191 {
192 if (rndm (base) < MIN (10, abs (luck)) && !gotlucky)
193 {
194 /* we have a winner */
195 gotlucky++;
196 ((luck > 0) ? (luck = 1) : (luck = -1));
197 diff -= luck;
198 if (diff < 1)
199 return (num); /*check again */
200 ((goodbad) ? (min += luck) : (diff));
201 total += MAX (1, MIN (size, rndm (diff) + min));
202 }
203 else
204 total += rndm (size) + 1;
205 }
206
207 return total;
208}
209
210/* convert materialname to materialtype_t */
211
212materialtype_t *
213name_to_material (const shstr &name)
214{
215 for (materialtype_t *mt = materialt; mt && mt->next; mt = mt->next)
216 if (name == mt->name)
217 return mt;
218
219 return 0; 82 return safe;
220}
221
222/* when doing transmutation of objects, we have to recheck the resistances,
223 * as some that did not apply previously, may apply now.
224 */
225
226void
227transmute_materialname (object *op, const object *change)
228{
229 materialtype_t *mt;
230 int j;
231
232 if (op->materialname == NULL)
233 return;
234
235 if (change->materialname != NULL && strcmp (op->materialname, change->materialname))
236 return;
237
238 if (!op->is_armor ())
239 return;
240
241 mt = name_to_material (op->materialname);
242 if (!mt)
243 {
244 LOG (llevError, "archetype '%s>%s' uses nonexistent material '%s'\n", &op->arch->archname, &op->name, &op->materialname);
245 return;
246 }
247
248 for (j = 0; j < NROFATTACKS; j++)
249 if (op->resist[j] == 0 && change->resist[j] != 0)
250 {
251 op->resist[j] += mt->mod[j];
252 if (op->resist[j] > 100)
253 op->resist[j] = 100;
254 if (op->resist[j] < -100)
255 op->resist[j] = -100;
256 }
257}
258
259/* set the materialname and type for an item */
260void
261set_materialname (object *op, int difficulty, materialtype_t *nmt)
262{
263 materialtype_t *mt, *lmt;
264
265 if (op->materialname != NULL)
266 return;
267
268 if (nmt == NULL)
269 {
270 lmt = NULL;
271
272 for (mt = materialt; mt && mt->next; mt = mt->next)
273 if (op->materials & mt->material && rndm (1, 100) <= mt->chance &&
274 difficulty >= mt->difficulty && (op->magic >= mt->magic || mt->magic == 0))
275 {
276 lmt = mt;
277 if (!(op->is_weapon () || op->is_armor ()))
278 break;
279 }
280 }
281 else
282 lmt = nmt;
283
284 if (lmt != NULL)
285 {
286 if (op->stats.dam && op->is_weapon ())
287 {
288 op->stats.dam += lmt->damage;
289 if (op->stats.dam < 1)
290 op->stats.dam = 1;
291 }
292
293 if (op->stats.sp && op->type == BOW)
294 op->stats.sp += lmt->sp;
295 if (op->stats.wc && op->is_weapon ())
296 op->stats.wc += lmt->wc;
297 if (op->is_armor ())
298 {
299 if (op->stats.ac)
300 op->stats.ac += lmt->ac;
301
302 for (int j = 0; j < NROFATTACKS; j++)
303 if (op->resist[j] != 0)
304 {
305 op->resist[j] += lmt->mod[j];
306 if (op->resist[j] > 100)
307 op->resist[j] = 100;
308 if (op->resist[j] < -100)
309 op->resist[j] = -100;
310 }
311 }
312
313 op->materialname = lmt->name;
314 /* dont make it unstackable if it doesn't need to be */
315 if (op->is_weapon () || op->is_armor ())
316 {
317 op->weight = (op->weight * lmt->weight) / 100;
318 op->value = (op->value * lmt->value) / 100;
319 }
320 }
321}
322
323/*
324 * Strip out the media tags from a String.
325 * Warning the input string will contain the result string
326 */
327void
328strip_media_tag (char *message)
329{
330 int in_tag = 0;
331 char *dest;
332 char *src;
333
334 src = dest = message;
335 while (*src != '\0')
336 {
337 if (*src == '[')
338 {
339 in_tag = 1;
340 }
341 else if (in_tag && (*src == ']'))
342 in_tag = 0;
343 else if (!in_tag)
344 {
345 *dest = *src;
346 dest++;
347 }
348 src++;
349 }
350 *dest = '\0';
351}
352
353const char *
354strrstr (const char *haystack, const char *needle)
355{
356 const char *lastneedle;
357
358 lastneedle = NULL;
359 while ((haystack = strstr (haystack, needle)) != NULL)
360 {
361 lastneedle = haystack;
362 haystack++;
363 }
364 return lastneedle;
365
366}
367
368#define EOL_SIZE (sizeof("\n")-1)
369void
370strip_endline (char *buf)
371{
372 if (strlen (buf) < sizeof ("\n"))
373 {
374 return;
375 }
376 if (!strcmp (buf + strlen (buf) - EOL_SIZE, "\n"))
377 buf[strlen (buf) - EOL_SIZE] = '\0';
378}
379
380/**
381 * Replace in string src all occurrences of key by replacement. The resulting
382 * string is put into result; at most resultsize characters (including the
383 * terminating null character) will be written to result.
384 */
385void
386replace (const char *src, const char *key, const char *replacement, char *result, size_t resultsize)
387{
388 size_t resultlen;
389 size_t keylen;
390
391 /* special case to prevent infinite loop if key==replacement=="" */
392 if (strcmp (key, replacement) == 0)
393 {
394 snprintf (result, resultsize, "%s", src);
395 return;
396 }
397
398 keylen = strlen (key);
399
400 resultlen = 0;
401 while (*src != '\0' && resultlen + 1 < resultsize)
402 {
403 if (strncmp (src, key, keylen) == 0)
404 {
405 snprintf (result + resultlen, resultsize - resultlen, "%s", replacement);
406 resultlen += strlen (result + resultlen);
407 src += keylen;
408 }
409 else
410 {
411 result[resultlen++] = *src++;
412 }
413 }
414 result[resultlen] = '\0';
415}
416
417/**
418 * Taking a string as an argument, mutate it into a string that looks like a list.
419 * 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.
421 * This function will also strip all trailing non alphanumeric characters.
422 * It does not insert an oxford comma.
423 */
424
425void
426make_list_like (char *input)
427{
428 char *p, tmp[MAX_BUF];
429 int i;
430
431 if (!input || strlen (input) > MAX_BUF - 5)
432 return;
433 /* bad stuff would happen if we continued here, the -5 is to make space for ' and ' */
434
435 strncpy (tmp, input, MAX_BUF - 5);
436 /*trim all trailing commas, spaces etc. */
437 for (i = strlen (tmp); !isalnum (tmp[i]) && i >= 0; i--)
438 tmp[i] = '\0';
439
440 strcat (tmp, ".");
441
442 p = strrchr (tmp, ',');
443 if (p)
444 {
445 *p = '\0';
446 strcpy (input, tmp);
447 p++;
448 strcat (input, " and");
449 strcat (input, p);
450 }
451 else
452 strcpy (input, tmp);
453
454 return;
455} 83}
456 84
457///////////////////////////////////////////////////////////////////////////// 85/////////////////////////////////////////////////////////////////////////////
458 86
459void 87void
460fork_abort (const char *msg) 88fork_abort (const char *msg)
461{ 89{
462 if (!fork ()) 90 if (!fork ())
463 { 91 {
92 signal (SIGINT , SIG_IGN);
93 signal (SIGTERM, SIG_IGN);
464 signal (SIGABRT, SIG_DFL); 94 signal (SIGABRT, SIG_IGN);
95
96 signal (SIGSEGV, SIG_DFL);
97 signal (SIGBUS , SIG_DFL);
98 signal (SIGILL , SIG_DFL);
99 signal (SIGTRAP, SIG_DFL);
100
465 // try to put corefiles into a subdirectory, if existing, to allow 101 // try to put corefiles into a subdirectory, if existing, to allow
466 // an administrator to reduce the I/O load. 102 // an administrator to reduce the I/O load.
467 chdir ("cores"); 103 chdir ("cores");
104
105 // try to detach us from as many external dependencies as possible
106 // as coredumping can take time by closing all fd's.
107 {
108 struct rlimit lim;
109
110 if (getrlimit (RLIMIT_NOFILE, &lim))
111 lim.rlim_cur = 1024;
112
113 for (int i = 0; i < lim.rlim_cur; ++i)
114 close (i);
115 }
116
117 {
118 sigset_t empty;
119 sigemptyset (&empty);
120 sigprocmask (SIG_SETMASK, &empty, 0);
121 }
122
123 // try to coredump with SIGTRAP
124 kill (getpid (), SIGTRAP);
468 abort (); 125 abort ();
469 } 126 }
470 127
471 LOG (llevError, "fork abort: %s\n", msg); 128 LOG (llevError, "fork abort: %s\n", msg);
472} 129}
473 130
131void *
474void *salloc_ (int n) throw (std::bad_alloc) 132salloc_ (int n) throw (std::bad_alloc)
475{ 133{
476#ifdef PREFER_MALLOC
477 void *ptr = malloc (n);
478#else
479 void *ptr = g_slice_alloc (n); 134 void *ptr = g_slice_alloc (n);
480#endif
481 135
482 if (!ptr) 136 if (!ptr)
483 throw std::bad_alloc (); 137 throw std::bad_alloc ();
484 138
139 slice_alloc += n;
485 return ptr; 140 return ptr;
486} 141}
487 142
143void *
488void *salloc_ (int n, void *src) throw (std::bad_alloc) 144salloc_ (int n, void *src) throw (std::bad_alloc)
489{ 145{
490 void *ptr = salloc_ (n); 146 void *ptr = salloc_ (n);
491 147
492 if (src) 148 if (src)
493 memcpy (ptr, src, n); 149 memcpy (ptr, src, n);
… …
495 memset (ptr, 0, n); 151 memset (ptr, 0, n);
496 152
497 return ptr; 153 return ptr;
498} 154}
499 155
156/******************************************************************************/
157
158#if DEBUG_SALLOC
159
160#define MAGIC 0xa1b2c35543deadLL
161
162void *
163g_slice_alloc (unsigned long size)
164{
165 unsigned long *p = (unsigned long *) (g_slice_alloc)(size + sizeof (unsigned long));
166 *p++ = size ^ MAGIC;
167 //fprintf (stderr, "g_slice_alloc %ld %p\n", size, p);//D
168 return (void *)p;
169}
170
171void *
172g_slice_alloc0 (unsigned long size)
173{
174 return memset (g_slice_alloc (size), 0, size);
175}
176
177void
178g_slice_free1 (unsigned long size, void *ptr)
179{
180 //fprintf (stderr, "g_slice_free %ld %p\n", size, ptr);//D
181 if (expect_true (ptr))
182 {
183 unsigned long *p = (unsigned long *)ptr;
184 unsigned long s = *--p ^ MAGIC;
185
186 if (size != (unsigned long)(*p ^ MAGIC))
187 {
188 LOG (logBacktrace | llevError, "slice free size (%lx) doesn't match alloc size (%lx)\n", size, s);
189 abort ();
190 }
191
192 *p = MAGIC;
193
194 (g_slice_free1)(s + sizeof (unsigned long), p);
195 }
196}
197
198#endif
199
200/******************************************************************************/
201
202refcnt_buf::refcnt_buf (size_t size)
203{
204 static uint32_t empty_buf [2] = { 0, 1 }; // 2 == never deallocated
205 data = (char *)empty_buf + overhead;
206 assert (overhead == sizeof (empty_buf));
207 inc ();
208}
209
210refcnt_buf::refcnt_buf (void *data, size_t size)
211{
212 _alloc (size);
213 memcpy (this->data, data, size);
214}
215
216refcnt_buf::~refcnt_buf ()
217{
218 dec ();
219}
220
221void
222refcnt_buf::_dealloc ()
223{
224 sfree<char> (data - overhead, size () + overhead);
225}
226
227refcnt_buf &
228refcnt_buf::operator =(const refcnt_buf &src)
229{
230 dec ();
231 data = src.data;
232 inc ();
233 return *this;
234}
235
236/******************************************************************************/
237
238int
500void assign (char *dst, const char *src, int maxlen) 239assign (char *dst, const char *src, int maxsize)
501{ 240{
502 if (!src) 241 if (!src)
503 src = ""; 242 src = "";
504 243
505 int len = strlen (src); 244 int len = strlen (src);
506 245
507 if (len >= maxlen - 1) 246 if (len >= maxsize)
508 { 247 {
509 if (maxlen <= 4) 248 if (maxsize <= 4)
510 { 249 {
511 memset (dst, '.', maxlen - 1); 250 memset (dst, '.', maxsize - 2);
512 dst [maxlen - 1] = 0; 251 dst [maxsize - 1] = 0;
513 } 252 }
514 else 253 else
515 { 254 {
516 memcpy (dst, src, maxlen - 4); 255 memcpy (dst, src, maxsize - 4);
517 memcpy (dst + maxlen - 4, "...", 4); 256 memcpy (dst + maxsize - 4, "...", 4);
518 } 257 }
258
259 len = maxsize;
519 } 260 }
520 else 261 else
521 memcpy (dst, src, len + 1); 262 memcpy (dst, src, ++len);
522}
523 263
524const std::string 264 return len;
265}
266
267char *
268vformat (const char *format, va_list ap)
269{
270 static dynbuf_text bufs[8];
271 static int bufidx;
272
273 dynbuf_text &buf = bufs [++bufidx & 7];
274
275 buf.clear ();
276 buf.vprintf (format, ap);
277 return buf;
278}
279
280char *
525format (const char *format, ...) 281format (const char *format, ...)
526{ 282{
527 int len;
528
529 {
530 char buf[128];
531
532 va_list ap; 283 va_list ap;
533 va_start (ap, format); 284 va_start (ap, format);
534 len = vsnprintf (buf, sizeof (buf), format, ap); 285 char *buf = vformat (format, ap);
535 va_end (ap); 286 va_end (ap);
536 287
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; 288 return buf;
557 }
558} 289}
559 290
560tstamp now () 291tstamp
292now ()
561{ 293{
562 struct timeval tv; 294 struct timeval tv;
563 295
564 gettimeofday (&tv, 0); 296 gettimeofday (&tv, 0);
565 return tstamp (tv.tv_sec) + tstamp (tv.tv_usec) * tstamp (1e-6); 297 return tstamp (tv.tv_sec) + tstamp (tv.tv_usec) * tstamp (1e-6);
… …
630 0xcdd70693UL, 0x54de5729UL, 0x23d967bfUL, 0xb3667a2eUL, 0xc4614ab8UL, 362 0xcdd70693UL, 0x54de5729UL, 0x23d967bfUL, 0xb3667a2eUL, 0xc4614ab8UL,
631 0x5d681b02UL, 0x2a6f2b94UL, 0xb40bbe37UL, 0xc30c8ea1UL, 0x5a05df1bUL, 363 0x5d681b02UL, 0x2a6f2b94UL, 0xb40bbe37UL, 0xc30c8ea1UL, 0x5a05df1bUL,
632 0x2d02ef8dL 364 0x2d02ef8dL
633}; 365};
634 366
635#if 0 367void
636void xyzzy (object_ptr &a, object_ptr &o) 368thread::start (void *(*start_routine)(void *), void *arg)
637{ 369{
638 asm volatile ("int3"); 370 pthread_attr_t attr;
639 a = o; 371
640 asm volatile ("int3"); 372 pthread_attr_init (&attr);
641} 373 pthread_attr_setdetachstate (&attr, PTHREAD_CREATE_DETACHED);
374 pthread_attr_setstacksize (&attr, PTHREAD_STACK_MIN < sizeof (long) * 4096
375 ? sizeof (long) * 4096 : PTHREAD_STACK_MIN);
376#ifdef PTHREAD_SCOPE_PROCESS
377 pthread_attr_setscope (&attr, PTHREAD_SCOPE_PROCESS);
642#endif 378#endif
643 379
380 sigset_t fullsigset, oldsigset;
381 sigfillset (&fullsigset);
382
383 pthread_sigmask (SIG_SETMASK, &fullsigset, &oldsigset);
384
385 if (pthread_create (&id, &attr, start_routine, arg))
386 cleanup ("unable to create a new thread");
387
388 pthread_sigmask (SIG_SETMASK, &oldsigset, 0);
389}
390

Diff Legend

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