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.75 by root, Tue Apr 15 03:16:02 2008 UTC vs.
Revision 1.99 by root, Tue Jan 3 11:23:41 2012 UTC

1/* 1/*
2 * This file is part of Deliantra, the Roguelike Realtime MMORPG. 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 (©) 2005,2006,2007,2008,2009,2010,2011 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 * Deliantra 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 <support@deliantra.net> 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;
42ssize_t slice_alloc; 44ssize_t slice_alloc;
43rand_gen rndm;
44 45
45void 46#if !GCC_VERSION(3,4)
46tausworthe_random_generator::seed (uint32_t seed) 47int least_significant_bit (uint32_t x)
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] < 128U) 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 */
225void
226transmute_materialname (object *op, const object *change)
227{
228 materialtype_t *mt;
229 int j;
230
231 if (op->materialname == NULL)
232 return;
233
234 if (change->materialname != NULL && strcmp (op->materialname, change->materialname))
235 return;
236
237 if (!op->is_armor ())
238 return;
239
240 mt = name_to_material (op->materialname);
241 if (!mt)
242 {
243 LOG (llevError, "archetype '%s>%s' uses nonexistent material '%s'\n", &op->arch->archname, &op->name, &op->materialname);
244 return;
245 }
246
247 for (j = 0; j < NROFATTACKS; j++)
248 if (op->resist[j] == 0 && change->resist[j] != 0)
249 {
250 op->resist[j] += mt->mod[j];
251 if (op->resist[j] > 100)
252 op->resist[j] = 100;
253 if (op->resist[j] < -100)
254 op->resist[j] = -100;
255 }
256}
257
258/* set the materialname and type for an item */
259void
260set_materialname (object *op, int difficulty, materialtype_t *nmt)
261{
262 materialtype_t *mt, *lmt;
263
264 if (op->materialname != NULL)
265 return;
266
267 if (nmt == NULL)
268 {
269 lmt = NULL;
270
271 for (mt = materialt; mt && mt->next; mt = mt->next)
272 if (op->materials & mt->material && rndm (1, 100) <= mt->chance &&
273 difficulty >= mt->difficulty && (op->magic >= mt->magic || mt->magic == 0))
274 {
275 lmt = mt;
276 if (!(op->is_weapon () || op->is_armor ()))
277 break;
278 }
279 }
280 else
281 lmt = nmt;
282
283 if (lmt != NULL)
284 {
285 if (op->stats.dam && op->is_weapon ())
286 {
287 op->stats.dam += lmt->damage;
288 if (op->stats.dam < 1)
289 op->stats.dam = 1;
290 }
291
292 if (op->stats.sp && op->type == BOW)
293 op->stats.sp += lmt->sp;
294 if (op->stats.wc && op->is_weapon ())
295 op->stats.wc += lmt->wc;
296 if (op->is_armor ())
297 {
298 if (op->stats.ac)
299 op->stats.ac += lmt->ac;
300
301 for (int j = 0; j < NROFATTACKS; j++)
302 if (op->resist[j] != 0)
303 {
304 op->resist[j] += lmt->mod[j];
305 if (op->resist[j] > 100)
306 op->resist[j] = 100;
307 if (op->resist[j] < -100)
308 op->resist[j] = -100;
309 }
310 }
311
312 op->materialname = lmt->name;
313 /* dont make it unstackable if it doesn't need to be */
314 if (op->is_weapon () || op->is_armor ())
315 {
316 op->weight = (op->weight * lmt->weight) / 100;
317 op->value = (op->value * lmt->value) / 100;
318 }
319 }
320}
321
322/*
323 * Strip out the media tags from a String.
324 * Warning the input string will contain the result string
325 */
326void
327strip_media_tag (char *message)
328{
329 int in_tag = 0;
330 char *dest;
331 char *src;
332
333 src = dest = message;
334 while (*src != '\0')
335 {
336 if (*src == '[')
337 {
338 in_tag = 1;
339 }
340 else if (in_tag && (*src == ']'))
341 in_tag = 0;
342 else if (!in_tag)
343 {
344 *dest = *src;
345 dest++;
346 }
347 src++;
348 }
349 *dest = '\0';
350}
351
352const char *
353strrstr (const char *haystack, const char *needle)
354{
355 const char *lastneedle;
356
357 lastneedle = NULL;
358 while ((haystack = strstr (haystack, needle)) != NULL)
359 {
360 lastneedle = haystack;
361 haystack++;
362 }
363 return lastneedle;
364
365}
366
367#define EOL_SIZE (sizeof("\n")-1)
368void
369strip_endline (char *buf)
370{
371 if (strlen (buf) < sizeof ("\n"))
372 {
373 return;
374 }
375 if (!strcmp (buf + strlen (buf) - EOL_SIZE, "\n"))
376 buf[strlen (buf) - EOL_SIZE] = '\0';
377}
378
379/**
380 * Replace in string src all occurrences of key by replacement. The resulting
381 * string is put into result; at most resultsize characters (including the
382 * terminating null character) will be written to result.
383 */
384void
385replace (const char *src, const char *key, const char *replacement, char *result, size_t resultsize)
386{
387 size_t resultlen;
388 size_t keylen;
389
390 /* special case to prevent infinite loop if key==replacement=="" */
391 if (strcmp (key, replacement) == 0)
392 {
393 snprintf (result, resultsize, "%s", src);
394 return;
395 }
396
397 keylen = strlen (key);
398
399 resultlen = 0;
400 while (*src != '\0' && resultlen + 1 < resultsize)
401 {
402 if (strncmp (src, key, keylen) == 0)
403 {
404 snprintf (result + resultlen, resultsize - resultlen, "%s", replacement);
405 resultlen += strlen (result + resultlen);
406 src += keylen;
407 }
408 else
409 {
410 result[resultlen++] = *src++;
411 }
412 }
413 result[resultlen] = '\0';
414}
415
416/**
417 * Taking a string as an argument, mutate it into a string that looks like a list.
418 * a 'list' for the purposes here, is a string of items, seperated by commas, except
419 * for the last entry, which has an 'and' before it, and a full stop (period) after it.
420 * This function will also strip all trailing non alphanumeric characters.
421 * It does not insert an oxford comma.
422 */
423void
424make_list_like (char *input)
425{
426 char *p, tmp[MAX_BUF];
427 int i;
428
429 if (!input || strlen (input) > MAX_BUF - 5)
430 return;
431 /* bad stuff would happen if we continued here, the -5 is to make space for ' and ' */
432
433 strncpy (tmp, input, MAX_BUF - 5);
434 /*trim all trailing commas, spaces etc. */
435 for (i = strlen (tmp); !isalnum (tmp[i]) && i >= 0; i--)
436 tmp[i] = '\0';
437
438 strcat (tmp, ".");
439
440 p = strrchr (tmp, ',');
441 if (p)
442 {
443 *p = '\0';
444 strcpy (input, tmp);
445 p++;
446 strcat (input, " and");
447 strcat (input, p);
448 }
449 else
450 strcpy (input, tmp);
451
452 return;
453} 83}
454 84
455///////////////////////////////////////////////////////////////////////////// 85/////////////////////////////////////////////////////////////////////////////
456 86
457void 87void
458fork_abort (const char *msg) 88fork_abort (const char *msg)
459{ 89{
460 if (!fork ()) 90 if (!fork ())
461 { 91 {
92 signal (SIGINT , SIG_IGN);
93 signal (SIGTERM, SIG_IGN);
462 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
463 // try to put corefiles into a subdirectory, if existing, to allow 101 // try to put corefiles into a subdirectory, if existing, to allow
464 // an administrator to reduce the I/O load. 102 // an administrator to reduce the I/O load.
465 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);
466 abort (); 125 abort ();
467 } 126 }
468 127
469 LOG (llevError, "fork abort: %s\n", msg); 128 LOG (llevError, "fork abort: %s\n", msg);
470} 129}
471 130
131void *
472void *salloc_ (int n) throw (std::bad_alloc) 132salloc_ (int n) throw (std::bad_alloc)
473{ 133{
474 void *ptr = g_slice_alloc (n); 134 void *ptr = g_slice_alloc (n);
475 135
476 if (!ptr) 136 if (!ptr)
477 throw std::bad_alloc (); 137 throw std::bad_alloc ();
478 138
479 slice_alloc += n; 139 slice_alloc += n;
480 return ptr; 140 return ptr;
481} 141}
482 142
143void *
483void *salloc_ (int n, void *src) throw (std::bad_alloc) 144salloc_ (int n, void *src) throw (std::bad_alloc)
484{ 145{
485 void *ptr = salloc_ (n); 146 void *ptr = salloc_ (n);
486 147
487 if (src) 148 if (src)
488 memcpy (ptr, src, n); 149 memcpy (ptr, src, n);
… …
496 157
497#if DEBUG_SALLOC 158#if DEBUG_SALLOC
498 159
499#define MAGIC 0xa1b2c35543deadLL 160#define MAGIC 0xa1b2c35543deadLL
500 161
162void *
501void *g_slice_alloc (unsigned long size) 163g_slice_alloc (unsigned long size)
502{ 164{
503 unsigned long *p = (unsigned long *) (g_slice_alloc)(size + sizeof (unsigned long)); 165 unsigned long *p = (unsigned long *) (g_slice_alloc)(size + sizeof (unsigned long));
504 *p++ = size ^ MAGIC; 166 *p++ = size ^ MAGIC;
505 //fprintf (stderr, "g_slice_alloc %ld %p\n", size, p);//D 167 //fprintf (stderr, "g_slice_alloc %ld %p\n", size, p);//D
506 return (void *)p; 168 return (void *)p;
507} 169}
508 170
171void *
509void *g_slice_alloc0 (unsigned long size) 172g_slice_alloc0 (unsigned long size)
510{ 173{
511 return memset (g_slice_alloc (size), 0, size); 174 return memset (g_slice_alloc (size), 0, size);
512} 175}
513 176
177void
514void g_slice_free1 (unsigned long size, void *ptr) 178g_slice_free1 (unsigned long size, void *ptr)
515{ 179{
516 //fprintf (stderr, "g_slice_free %ld %p\n", size, ptr);//D 180 //fprintf (stderr, "g_slice_free %ld %p\n", size, ptr);//D
517 if (expect_true (ptr)) 181 if (expect_true (ptr))
518 { 182 {
519 unsigned long *p = (unsigned long *)ptr; 183 unsigned long *p = (unsigned long *)ptr;
… …
533 197
534#endif 198#endif
535 199
536/******************************************************************************/ 200/******************************************************************************/
537 201
202refcnt_buf::refcnt_buf (size_t size)
203{
204 _alloc (size);
205}
206
207refcnt_buf::refcnt_buf (void *data, size_t size)
208{
209 _alloc (size);
210 memcpy (this->data, data, size);
211}
212
213refcnt_buf::~refcnt_buf ()
214{
215 dec ();
216}
217
218refcnt_buf &
219refcnt_buf::operator =(const refcnt_buf &src)
220{
221 dec ();
222 data = src.data;
223 ++_refcnt ();
224 return *this;
225}
226
227/******************************************************************************/
228
229int
538void assign (char *dst, const char *src, int maxlen) 230assign (char *dst, const char *src, int maxsize)
539{ 231{
540 if (!src) 232 if (!src)
541 src = ""; 233 src = "";
542 234
543 int len = strlen (src); 235 int len = strlen (src);
544 236
545 if (len >= maxlen - 1) 237 if (len >= maxsize)
546 { 238 {
547 if (maxlen <= 4) 239 if (maxsize <= 4)
548 { 240 {
549 memset (dst, '.', maxlen - 1); 241 memset (dst, '.', maxsize - 2);
550 dst [maxlen - 1] = 0; 242 dst [maxsize - 1] = 0;
551 } 243 }
552 else 244 else
553 { 245 {
554 memcpy (dst, src, maxlen - 4); 246 memcpy (dst, src, maxsize - 4);
555 memcpy (dst + maxlen - 4, "...", 4); 247 memcpy (dst + maxsize - 4, "...", 4);
556 } 248 }
249
250 len = maxsize;
557 } 251 }
558 else 252 else
559 memcpy (dst, src, len + 1); 253 memcpy (dst, src, ++len);
560}
561 254
562const char * 255 return len;
256}
257
258char *
259vformat (const char *format, va_list ap)
260{
261 static dynbuf_text bufs[8];
262 static int bufidx;
263
264 dynbuf_text &buf = bufs [++bufidx & 7];
265
266 buf.clear ();
267 buf.vprintf (format, ap);
268 return buf;
269}
270
271char *
563format (const char *format, ...) 272format (const char *format, ...)
564{ 273{
565 static dynbuf_text buf;
566
567 buf.clear ();
568
569 va_list ap; 274 va_list ap;
570 va_start (ap, format); 275 va_start (ap, format);
571 buf.vprintf (format, ap); 276 char *buf = vformat (format, ap);
572 va_end (ap); 277 va_end (ap);
573 278
574 return buf; 279 return buf;
575} 280}
576 281
577tstamp now () 282tstamp
283now ()
578{ 284{
579 struct timeval tv; 285 struct timeval tv;
580 286
581 gettimeofday (&tv, 0); 287 gettimeofday (&tv, 0);
582 return tstamp (tv.tv_sec) + tstamp (tv.tv_usec) * tstamp (1e-6); 288 return tstamp (tv.tv_sec) + tstamp (tv.tv_usec) * tstamp (1e-6);
… …
647 0xcdd70693UL, 0x54de5729UL, 0x23d967bfUL, 0xb3667a2eUL, 0xc4614ab8UL, 353 0xcdd70693UL, 0x54de5729UL, 0x23d967bfUL, 0xb3667a2eUL, 0xc4614ab8UL,
648 0x5d681b02UL, 0x2a6f2b94UL, 0xb40bbe37UL, 0xc30c8ea1UL, 0x5a05df1bUL, 354 0x5d681b02UL, 0x2a6f2b94UL, 0xb40bbe37UL, 0xc30c8ea1UL, 0x5a05df1bUL,
649 0x2d02ef8dL 355 0x2d02ef8dL
650}; 356};
651 357
358void
652void thread::start (void *(*start_routine)(void *), void *arg) 359thread::start (void *(*start_routine)(void *), void *arg)
653{ 360{
654 pthread_attr_t attr; 361 pthread_attr_t attr;
655 362
656 pthread_attr_init (&attr); 363 pthread_attr_init (&attr);
657 pthread_attr_setdetachstate (&attr, PTHREAD_CREATE_DETACHED); 364 pthread_attr_setdetachstate (&attr, PTHREAD_CREATE_DETACHED);

Diff Legend

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