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

Diff Legend

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