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.49 by root, Sat Apr 21 22:57:15 2007 UTC vs.
Revision 1.80 by root, Wed Sep 10 18:18:10 2008 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
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 2 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,
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 GNU General Public License
19 * along with this program; if not, write to the Free Software 19 * along with this program. If not, see <http://www.gnu.org/licenses/>.
20 * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
21 * 20 *
22 * The authors can be reached via e-mail at <crossfire@schmorp.de> 21 * The authors can be reached via e-mail to <support@deliantra.net>
23 */ 22 */
24 23
25/* 24/*
26 * General convenience functions for crossfire. 25 * General convenience functions for crossfire.
27 */ 26 */
… …
32#include <sys/time.h> 31#include <sys/time.h>
33#include <time.h> 32#include <time.h>
34#include <signal.h> 33#include <signal.h>
35 34
36#include <global.h> 35#include <global.h>
37#include <funcpoint.h>
38#include <material.h> 36#include <material.h>
39 37
38#include <sys/time.h>
39#include <sys/resource.h>
40
40#include <glib.h> 41#include <glib.h>
41 42
42rand_gen rndm; 43refcnt_base::refcnt_t refcnt_dummy;
44ssize_t slice_alloc;
45rand_gen rndm, rmg_rndm;
43 46
44void 47void
45tausworthe_random_generator::seed (uint32_t seed) 48tausworthe_random_generator::seed (uint32_t seed)
46{ 49{
47 state [0] = seed * 69069U; if (state [0] < 2U) state [0] += 2U; 50 state [0] = seed * 69069U; if (state [0] < 2U) state [0] += 2U;
48 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;
49 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;
50 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;
51 54
52 for (int i = 11; --i; ) 55 for (int i = 11; --i; )
53 operator ()(); 56 operator ()();
54} 57}
55 58
… …
63 66
64 return state [0] ^ state [1] ^ state [2] ^ state [3]; 67 return state [0] ^ state [1] ^ state [2] ^ state [3];
65} 68}
66 69
67uint32_t 70uint32_t
68tausworthe_random_generator::get_range (uint32_t r_max) 71tausworthe_random_generator::get_range (uint32_t num)
69{ 72{
70 return (next () * (uint64_t)r_max) >> 32U; 73 return (next () * (uint64_t)num) >> 32U;
71} 74}
72 75
73// return a number within (min .. max) 76// return a number within (min .. max)
74int 77int
75tausworthe_random_generator::get_range (int r_min, int r_max) 78tausworthe_random_generator::get_range (int r_min, int r_max)
76{ 79{
77 return r_min + get_range (max (r_max - r_min + 1, 1)); 80 return r_min + get_range (max (r_max - r_min + 1, 0));
78} 81}
79 82
80/* 83/*
81 * The random functions here take luck into account when rolling random 84 * 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 85 * dice or numbers. This function has less of an impact the larger the
… …
93 * not the recipient (ie, the poor slob getting hit). [garbled 20010916] 96 * not the recipient (ie, the poor slob getting hit). [garbled 20010916]
94 */ 97 */
95int 98int
96random_roll (int r_min, int r_max, const object *op, int goodbad) 99random_roll (int r_min, int r_max, const object *op, int goodbad)
97{ 100{
101 r_max = max (r_min, r_max);
102
98 int base = r_max - r_min > 1 ? 20 : 50; /* d2 and d3 are corner cases */ 103 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 104
106 if (op->type == PLAYER) 105 if (op->type == PLAYER)
107 { 106 {
108 int luck = op->stats.luck; 107 int luck = op->stats.luck;
109 108
… …
119/* 118/*
120 * This is a 64 bit version of random_roll above. This is needed 119 * This is a 64 bit version of random_roll above. This is needed
121 * for exp loss calculations for players changing religions. 120 * for exp loss calculations for players changing religions.
122 */ 121 */
123sint64 122sint64
124random_roll64 (sint64 min, sint64 max, const object *op, int goodbad) 123random_roll64 (sint64 r_min, sint64 r_max, const object *op, int goodbad)
125{ 124{
126 sint64 omin, diff, luck, ran; 125 sint64 omin = r_min;
127 int base; 126 sint64 range = max (0, r_max - r_min + 1);
128 127 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 128
139 /* 129 /*
140 * Make a call to get two 32 bit unsigned random numbers, and just to 130 * Make a call to get two 32 bit unsigned random numbers, and just to
141 * a little bitshifting. 131 * a little bitshifting.
142 */ 132 */
143 ran = (sint64) rndm.next () ^ ((sint64) rndm.next () << 31); 133 sint64 ran = (sint64) rndm.next () ^ ((sint64) rndm.next () << 31);
144 134
145 if (op->type != PLAYER) 135 if (op->type != PLAYER)
146 return ((ran % diff) + min); 136 return ((ran % range) + r_min);
147 137
148 luck = op->stats.luck; 138 int luck = op->stats.luck;
139
149 if (rndm (base) < MIN (10, abs (luck))) 140 if (rndm (base) < min (10, abs (luck)))
150 { 141 {
151 /* we have a winner */ 142 /* we have a winner */
152 ((luck > 0) ? (luck = 1) : (luck = -1)); 143 ((luck > 0) ? (luck = 1) : (luck = -1));
153 diff -= luck; 144 range -= luck;
154 if (diff < 1) 145 if (range < 1)
155 return (omin); /*check again */ 146 return (omin); /*check again */
147
156 ((goodbad) ? (min += luck) : (diff)); 148 ((goodbad) ? (r_min += luck) : (range));
157 149
158 return (MAX (omin, MIN (max, (ran % diff) + min))); 150 return (max (omin, min (r_max, (ran % range) + r_min)));
159 } 151 }
160 152
161 return ((ran % diff) + min); 153 return ran % range + r_min;
162} 154}
163 155
164/* 156/*
165 * Roll a number of dice (2d3, 4d6). Uses op to determine luck, 157 * 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. 158 * 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, 159 * Generally, op should be the player/caster/hitter requesting the roll,
168 * not the recipient (ie, the poor slob getting hit). 160 * not the recipient (ie, the poor slob getting hit).
169 * The args are num D size (ie 4d6) [garbled 20010916] 161 * The args are num D size (ie 4d6) [garbled 20010916]
170 */ 162 */
171
172int 163int
173die_roll (int num, int size, const object *op, int goodbad) 164die_roll (int num, int size, const object *op, int goodbad)
174{ 165{
175 int min, diff, luck, total, i, gotlucky, base; 166 int min, luck, total, i, gotlucky;
176 167
177 diff = size; 168 int diff = size;
178 min = 1; 169 min = 1;
179 luck = total = gotlucky = 0; 170 luck = total = gotlucky = 0;
180 ((diff > 2) ? (base = 20) : (base = 50)); /* d2 and d3 are corner cases */ 171 int base = diff > 2 ? 20 : 50; /* d2 and d3 are corner cases */
172
181 if (size < 2 || diff < 1) 173 if (size < 2 || diff < 1)
182 { 174 {
183 LOG (llevError, "Calling die_roll with num=%d size=%d\n", num, size); 175 LOG (llevError, "Calling die_roll with num=%d size=%d\n", num, size);
184 return (num); /* avoids a float exception */ 176 return num; /* avoids a float exception */
185 } 177 }
186 178
187 if (op->type == PLAYER) 179 if (op->type == PLAYER)
188 luck = op->stats.luck; 180 luck = op->stats.luck;
189 181
… …
205 } 197 }
206 198
207 return total; 199 return total;
208} 200}
209 201
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 */ 202/* convert materialname to materialtype_t */
279 203
280materialtype_t * 204materialtype_t *
281name_to_material (const shstr &name) 205name_to_material (const shstr &name)
282{ 206{
283 for (materialtype_t *mt = materialt; mt && mt->next; mt = mt->next) 207 for (materialtype_t *mt = materialt; mt && mt->next; mt = mt->next)
284 if (name == mt->name) 208 if (name == mt->name)
285 return mt; 209 return mt;
286 210
287 return materialt; 211 return 0;
288} 212}
289 213
290/* when doing transmutation of objects, we have to recheck the resistances, 214/* when doing transmutation of objects, we have to recheck the resistances,
291 * as some that did not apply previously, may apply now. 215 * as some that did not apply previously, may apply now.
292 */ 216 */
293
294void 217void
295transmute_materialname (object *op, const object *change) 218transmute_materialname (object *op, const object *change)
296{ 219{
297 materialtype_t *mt; 220 materialtype_t *mt;
298 int j; 221 int j;
… …
307 return; 230 return;
308 231
309 mt = name_to_material (op->materialname); 232 mt = name_to_material (op->materialname);
310 if (!mt) 233 if (!mt)
311 { 234 {
312 LOG (llevError, "archetype '%s>%s' uses nonexistent material '%s'\n", &op->arch->name, &op->name, &op->materialname); 235 LOG (llevError, "archetype '%s>%s' uses nonexistent material '%s'\n", &op->arch->archname, &op->name, &op->materialname);
313 return; 236 return;
314 } 237 }
315 238
316 for (j = 0; j < NROFATTACKS; j++) 239 for (j = 0; j < NROFATTACKS; j++)
317 if (op->resist[j] == 0 && change->resist[j] != 0) 240 if (op->resist[j] == 0 && change->resist[j] != 0)
… …
328void 251void
329set_materialname (object *op, int difficulty, materialtype_t *nmt) 252set_materialname (object *op, int difficulty, materialtype_t *nmt)
330{ 253{
331 materialtype_t *mt, *lmt; 254 materialtype_t *mt, *lmt;
332 255
333#ifdef NEW_MATERIAL_CODE
334 int j;
335#endif
336
337 if (op->materialname != NULL) 256 if (op->materialname != NULL)
338 return; 257 return;
339 258
340
341
342 if (nmt == NULL) 259 if (nmt == NULL)
343 { 260 {
344 lmt = NULL; 261 lmt = NULL;
345#ifndef NEW_MATERIAL_CODE 262
346 for (mt = materialt; mt && mt->next; mt = mt->next) 263 for (mt = materialt; mt && mt->next; mt = mt->next)
347 { 264 if (op->materials & mt->material && rndm (1, 100) <= mt->chance &&
348 if (op->materials & mt->material) 265 difficulty >= mt->difficulty && (op->magic >= mt->magic || mt->magic == 0))
349 { 266 {
350 lmt = mt; 267 lmt = mt;
268 if (!(op->is_weapon () || op->is_armor ()))
351 break; 269 break;
352 } 270 }
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 } 271 }
368 else 272 else
369 {
370 lmt = nmt; 273 lmt = nmt;
371 }
372 274
373 if (lmt != NULL) 275 if (lmt != NULL)
374 { 276 {
375#ifndef NEW_MATERIAL_CODE
376 op->materialname = lmt->name;
377 return;
378#else
379
380 if (op->stats.dam && op->is_weapon ()) 277 if (op->stats.dam && op->is_weapon ())
381 { 278 {
382 op->stats.dam += lmt->damage; 279 op->stats.dam += lmt->damage;
383 if (op->stats.dam < 1) 280 if (op->stats.dam < 1)
384 op->stats.dam = 1; 281 op->stats.dam = 1;
… …
390 op->stats.wc += lmt->wc; 287 op->stats.wc += lmt->wc;
391 if (op->is_armor ()) 288 if (op->is_armor ())
392 { 289 {
393 if (op->stats.ac) 290 if (op->stats.ac)
394 op->stats.ac += lmt->ac; 291 op->stats.ac += lmt->ac;
292
395 for (j = 0; j < NROFATTACKS; j++) 293 for (int j = 0; j < NROFATTACKS; j++)
396 if (op->resist[j] != 0) 294 if (op->resist[j] != 0)
397 { 295 {
398 op->resist[j] += lmt->mod[j]; 296 op->resist[j] += lmt->mod[j];
399 if (op->resist[j] > 100) 297 if (op->resist[j] > 100)
400 op->resist[j] = 100; 298 op->resist[j] = 100;
401 if (op->resist[j] < -100) 299 if (op->resist[j] < -100)
402 op->resist[j] = -100; 300 op->resist[j] = -100;
403 } 301 }
404 } 302 }
303
405 op->materialname = lmt->name; 304 op->materialname = lmt->name;
406 /* dont make it unstackable if it doesn't need to be */ 305 /* dont make it unstackable if it doesn't need to be */
407 if (op->is_weapon () || op->is_armor ()) 306 if (op->is_weapon () || op->is_armor ())
408 { 307 {
409 op->weight = (op->weight * lmt->weight) / 100; 308 op->weight = (op->weight * lmt->weight) / 100;
410 op->value = (op->value * lmt->value) / 100; 309 op->value = (op->value * lmt->value) / 100;
411 } 310 }
412#endif
413 } 311 }
414} 312}
415 313
416/* 314/*
417 * Strip out the media tags from a String. 315 * Strip out the media tags from a String.
… …
512 * a 'list' for the purposes here, is a string of items, seperated by commas, except 410 * 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. 411 * 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. 412 * This function will also strip all trailing non alphanumeric characters.
515 * It does not insert an oxford comma. 413 * It does not insert an oxford comma.
516 */ 414 */
517
518void 415void
519make_list_like (char *input) 416make_list_like (char *input)
520{ 417{
521 char *p, tmp[MAX_BUF]; 418 char *p, tmp[MAX_BUF];
522 int i; 419 int i;
… …
552void 449void
553fork_abort (const char *msg) 450fork_abort (const char *msg)
554{ 451{
555 if (!fork ()) 452 if (!fork ())
556 { 453 {
454 signal (SIGINT , SIG_IGN);
455 signal (SIGTERM, SIG_IGN);
557 signal (SIGABRT, SIG_DFL); 456 signal (SIGABRT, SIG_IGN);
457
458 // try to put corefiles into a subdirectory, if existing, to allow
459 // an administrator to reduce the I/O load.
460 chdir ("cores");
461
462 // try to detach us from as many external dependencies as possible
463 // as coredumping can take time by closing all fd's.
464 {
465 struct rlimit lim;
466
467 if (getrlimit (RLIMIT_NOFILE, &lim))
468 lim.rlim_cur = 1024;
469
470 for (int i = 0; i < lim.rlim_cur; ++i)
471 close (i);
472 }
473
558 abort (); 474 abort ();
559 } 475 }
560 476
561 LOG (llevError, "fork abort: %s\n", msg); 477 LOG (llevError, "fork abort: %s\n", msg);
562} 478}
563 479
564void *salloc_ (int n) throw (std::bad_alloc) 480void *salloc_ (int n) throw (std::bad_alloc)
565{ 481{
566#ifdef PREFER_MALLOC
567 void *ptr = malloc (n);
568#else
569 void *ptr = g_slice_alloc (n); 482 void *ptr = g_slice_alloc (n);
570#endif
571 483
572 if (!ptr) 484 if (!ptr)
573 throw std::bad_alloc (); 485 throw std::bad_alloc ();
574 486
487 slice_alloc += n;
575 return ptr; 488 return ptr;
576} 489}
577 490
578void *salloc_ (int n, void *src) throw (std::bad_alloc) 491void *salloc_ (int n, void *src) throw (std::bad_alloc)
579{ 492{
… …
585 memset (ptr, 0, n); 498 memset (ptr, 0, n);
586 499
587 return ptr; 500 return ptr;
588} 501}
589 502
503/******************************************************************************/
504
505#if DEBUG_SALLOC
506
507#define MAGIC 0xa1b2c35543deadLL
508
509void *g_slice_alloc (unsigned long size)
510{
511 unsigned long *p = (unsigned long *) (g_slice_alloc)(size + sizeof (unsigned long));
512 *p++ = size ^ MAGIC;
513 //fprintf (stderr, "g_slice_alloc %ld %p\n", size, p);//D
514 return (void *)p;
515}
516
517void *g_slice_alloc0 (unsigned long size)
518{
519 return memset (g_slice_alloc (size), 0, size);
520}
521
522void g_slice_free1 (unsigned long size, void *ptr)
523{
524 //fprintf (stderr, "g_slice_free %ld %p\n", size, ptr);//D
525 if (expect_true (ptr))
526 {
527 unsigned long *p = (unsigned long *)ptr;
528 unsigned long s = *--p ^ MAGIC;
529
530 if (size != (unsigned long)(*p ^ MAGIC))
531 {
532 LOG (logBacktrace | llevError, "slice free size (%lx) doesn't match alloc size (%lx)\n", size, s);
533 abort ();
534 }
535
536 *p = MAGIC;
537
538 (g_slice_free1)(s + sizeof (unsigned long), p);
539 }
540}
541
542#endif
543
544/******************************************************************************/
545
590void assign (char *dst, const char *src, int maxlen) 546void assign (char *dst, const char *src, int maxlen)
591{ 547{
592 if (!src) 548 if (!src)
593 src = ""; 549 src = "";
594 550
… …
607 memcpy (dst + maxlen - 4, "...", 4); 563 memcpy (dst + maxlen - 4, "...", 4);
608 } 564 }
609 } 565 }
610 else 566 else
611 memcpy (dst, src, len + 1); 567 memcpy (dst, src, len + 1);
568}
569
570const char *
571format (const char *format, ...)
572{
573 static dynbuf_text buf;
574
575 buf.clear ();
576
577 va_list ap;
578 va_start (ap, format);
579 buf.vprintf (format, ap);
580 va_end (ap);
581
582 return buf;
612} 583}
613 584
614tstamp now () 585tstamp now ()
615{ 586{
616 struct timeval tv; 587 struct timeval tv;
… …
684 0xcdd70693UL, 0x54de5729UL, 0x23d967bfUL, 0xb3667a2eUL, 0xc4614ab8UL, 655 0xcdd70693UL, 0x54de5729UL, 0x23d967bfUL, 0xb3667a2eUL, 0xc4614ab8UL,
685 0x5d681b02UL, 0x2a6f2b94UL, 0xb40bbe37UL, 0xc30c8ea1UL, 0x5a05df1bUL, 656 0x5d681b02UL, 0x2a6f2b94UL, 0xb40bbe37UL, 0xc30c8ea1UL, 0x5a05df1bUL,
686 0x2d02ef8dL 657 0x2d02ef8dL
687}; 658};
688 659
660void thread::start (void *(*start_routine)(void *), void *arg)
661{
662 pthread_attr_t attr;
689 663
664 pthread_attr_init (&attr);
665 pthread_attr_setdetachstate (&attr, PTHREAD_CREATE_DETACHED);
666 pthread_attr_setstacksize (&attr, PTHREAD_STACK_MIN < sizeof (long) * 4096
667 ? sizeof (long) * 4096 : PTHREAD_STACK_MIN);
668#ifdef PTHREAD_SCOPE_PROCESS
669 pthread_attr_setscope (&attr, PTHREAD_SCOPE_PROCESS);
670#endif
671
672 sigset_t fullsigset, oldsigset;
673 sigfillset (&fullsigset);
674
675 pthread_sigmask (SIG_SETMASK, &fullsigset, &oldsigset);
676
677 if (pthread_create (&id, &attr, start_routine, arg))
678 cleanup ("unable to create a new thread");
679
680 pthread_sigmask (SIG_SETMASK, &oldsigset, 0);
681}
682

Diff Legend

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