ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/deliantra/server/include/util.h
(Generate patch)

Comparing deliantra/server/include/util.h (file contents):
Revision 1.48 by root, Mon Jun 4 12:19:08 2007 UTC vs.
Revision 1.81 by root, Fri Dec 26 10:36:42 2008 UTC

1/* 1/*
2 * This file is part of Crossfire TRT, the Multiplayer Online Role Playing Game. 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 * 5 *
6 * Crossfire TRT is free software; you can redistribute it and/or modify it 6 * Deliantra is free software: you can redistribute it and/or modify
7 * under the terms of the GNU General Public License as published by the Free 7 * it under the terms of the GNU General Public License as published by
8 * Software Foundation; either version 2 of the License, or (at your option) 8 * the Free Software Foundation, either version 3 of the License, or
9 * any later version. 9 * (at your option) any later version.
10 * 10 *
11 * This program is distributed in the hope that it will be useful, but 11 * This program is distributed in the hope that it will be useful,
12 * WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY 12 * but WITHOUT ANY WARRANTY; without even the implied warranty of
13 * or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License 13 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 * for more details. 14 * GNU General Public License for more details.
15 * 15 *
16 * You should have received a copy of the GNU General Public License along 16 * You should have received a copy of the GNU General Public License
17 * with Crossfire TRT; if not, write to the Free Software Foundation, Inc. 51 17 * along with this program. If not, see <http://www.gnu.org/licenses/>.
18 * Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
19 * 18 *
20 * The authors can be reached via e-mail to <crossfire@schmorp.de> 19 * The authors can be reached via e-mail to <support@deliantra.net>
21 */ 20 */
22 21
23#ifndef UTIL_H__ 22#ifndef UTIL_H__
24#define UTIL_H__ 23#define UTIL_H__
25 24
26//#define PREFER_MALLOC 25#define DEBUG_POISON 0x00 // poison memory before freeing it if != 0
26#define DEBUG_SALLOC 0 // add a debug wrapper around all sallocs
27#define PREFER_MALLOC 0 // use malloc and not the slice allocator
27 28
28#if __GNUC__ >= 3 29#if __GNUC__ >= 3
29# define is_constant(c) __builtin_constant_p (c) 30# define is_constant(c) __builtin_constant_p (c)
30# define expect(expr,value) __builtin_expect ((expr),(value)) 31# define expect(expr,value) __builtin_expect ((expr),(value))
31# define prefetch(addr,rw,locality) __builtin_prefetch (addr, rw, locality) 32# define prefetch(addr,rw,locality) __builtin_prefetch (addr, rw, locality)
… …
43// is mostly true or mosty false. note that these return 44// is mostly true or mosty false. note that these return
44// booleans, not the expression. 45// booleans, not the expression.
45#define expect_false(expr) expect ((expr) != 0, 0) 46#define expect_false(expr) expect ((expr) != 0, 0)
46#define expect_true(expr) expect ((expr) != 0, 1) 47#define expect_true(expr) expect ((expr) != 0, 1)
47 48
49#include <pthread.h>
50
48#include <cstddef> 51#include <cstddef>
49#include <cmath> 52#include <cmath>
50#include <new> 53#include <new>
51#include <vector> 54#include <vector>
52 55
53#include <glib.h> 56#include <glib.h>
54 57
55#include <shstr.h> 58#include <shstr.h>
56#include <traits.h> 59#include <traits.h>
57 60
61#if DEBUG_SALLOC
62# define g_slice_alloc0(s) debug_slice_alloc0(s)
63# define g_slice_alloc(s) debug_slice_alloc(s)
64# define g_slice_free1(s,p) debug_slice_free1(s,p)
65void *g_slice_alloc (unsigned long size);
66void *g_slice_alloc0 (unsigned long size);
67void g_slice_free1 (unsigned long size, void *ptr);
68#elif PREFER_MALLOC
69# define g_slice_alloc0(s) calloc (1, (s))
70# define g_slice_alloc(s) malloc ((s))
71# define g_slice_free1(s,p) free ((p))
72#endif
73
58// use a gcc extension for auto declarations until ISO C++ sanctifies them 74// use C0X decltype for auto declarations until ISO C++ sanctifies them (if ever)
59#define auto(var,expr) decltype(expr) var = (expr) 75#define auto(var,expr) decltype(expr) var = (expr)
60 76
61// very ugly macro that basicaly declares and initialises a variable 77// very ugly macro that basically declares and initialises a variable
62// that is in scope for the next statement only 78// that is in scope for the next statement only
63// works only for stuff that can be assigned 0 and converts to false 79// works only for stuff that can be assigned 0 and converts to false
64// (note: works great for pointers) 80// (note: works great for pointers)
65// most ugly macro I ever wrote 81// most ugly macro I ever wrote
66#define statementvar(type, name, value) if (type name = 0) { } else if (((name) = (value)), 1) 82#define statementvar(type, name, value) if (type name = 0) { } else if (((name) = (value)), 1)
… …
71 87
72// in range excluding end 88// in range excluding end
73#define IN_RANGE_EXC(val,beg,end) \ 89#define IN_RANGE_EXC(val,beg,end) \
74 ((unsigned int)(val) - (unsigned int)(beg) < (unsigned int)(end) - (unsigned int)(beg)) 90 ((unsigned int)(val) - (unsigned int)(beg) < (unsigned int)(end) - (unsigned int)(beg))
75 91
92void cleanup (const char *cause, bool make_core = false);
76void fork_abort (const char *msg); 93void fork_abort (const char *msg);
77 94
78// rationale for using (U) not (T) is to reduce signed/unsigned issues, 95// rationale for using (U) not (T) is to reduce signed/unsigned issues,
79// as a is often a constant while b is the variable. it is still a bug, though. 96// as a is often a constant while b is the variable. it is still a bug, though.
80template<typename T, typename U> static inline T min (T a, U b) { return (U)a < b ? (U)a : b; } 97template<typename T, typename U> static inline T min (T a, U b) { return (U)a < b ? (U)a : b; }
81template<typename T, typename U> static inline T max (T a, U b) { return (U)a > b ? (U)a : b; } 98template<typename T, typename U> static inline T max (T a, U b) { return (U)a > b ? (U)a : b; }
82template<typename T, typename U, typename V> static inline T clamp (T v, U a, V b) { return v < (T)a ? (T)a : v >(T)b ? (T)b : v; } 99template<typename T, typename U, typename V> static inline T clamp (T v, U a, V b) { return v < (T)a ? (T)a : v >(T)b ? (T)b : v; }
83 100
101template<typename T, typename U> static inline void min_it (T &v, U m) { v = min (v, (T)m); }
102template<typename T, typename U> static inline void max_it (T &v, U m) { v = max (v, (T)m); }
103template<typename T, typename U, typename V> static inline void clamp_it (T &v, U a, V b) { v = clamp (v, (T)a, (T)b); }
104
84template<typename T, typename U> static inline void swap (T& a, U& b) { T t=a; a=(T)b; b=(U)t; } 105template<typename T, typename U> static inline void swap (T& a, U& b) { T t=a; a=(T)b; b=(U)t; }
106
107template<typename T, typename U, typename V> static inline T min (T a, U b, V c) { return min (a, min (b, c)); }
108template<typename T, typename U, typename V> static inline T max (T a, U b, V c) { return max (a, max (b, c)); }
109
110// sign returns -1 or +1
111template<typename T>
112static inline T sign (T v) { return v < 0 ? -1 : +1; }
113// relies on 2c representation
114template<>
115inline sint8 sign (sint8 v) { return 1 - (sint8 (uint8 (v) >> 7) * 2); }
116
117// sign0 returns -1, 0 or +1
118template<typename T>
119static inline T sign0 (T v) { return v ? sign (v) : 0; }
120
121// div, with correct rounding (< 0.5 downwards, >=0.5 upwards)
122template<typename T> static inline T div (T val, T div) { return (val + div / 2) / div; }
123// div, round-up
124template<typename T> static inline T div_ru (T val, T div) { return (val + div - 1) / div; }
125// div, round-down
126template<typename T> static inline T div_rd (T val, T div) { return (val ) / div; }
85 127
86template<typename T> 128template<typename T>
87static inline T 129static inline T
88lerp (T val, T min_in, T max_in, T min_out, T max_out) 130lerp (T val, T min_in, T max_in, T min_out, T max_out)
89{ 131{
90 return (val - min_in) * (max_out - min_out) / (max_in - min_in) + min_out; 132 return min_out + div <T> ((val - min_in) * (max_out - min_out), max_in - min_in);
133}
134
135// lerp, round-down
136template<typename T>
137static inline T
138lerp_rd (T val, T min_in, T max_in, T min_out, T max_out)
139{
140 return min_out + div_rd<T> ((val - min_in) * (max_out - min_out), max_in - min_in);
141}
142
143// lerp, round-up
144template<typename T>
145static inline T
146lerp_ru (T val, T min_in, T max_in, T min_out, T max_out)
147{
148 return min_out + div_ru<T> ((val - min_in) * (max_out - min_out), max_in - min_in);
91} 149}
92 150
93// lots of stuff taken from FXT 151// lots of stuff taken from FXT
94 152
95/* Rotate right. This is used in various places for checksumming */ 153/* Rotate right. This is used in various places for checksumming */
… …
173absdir (int d) 231absdir (int d)
174{ 232{
175 return ((d - 1) & 7) + 1; 233 return ((d - 1) & 7) + 1;
176} 234}
177 235
236extern ssize_t slice_alloc; // statistics
237
238void *salloc_ (int n) throw (std::bad_alloc);
239void *salloc_ (int n, void *src) throw (std::bad_alloc);
240
241// strictly the same as g_slice_alloc, but never returns 0
242template<typename T>
243inline T *salloc (int n = 1) throw (std::bad_alloc) { return (T *)salloc_ (n * sizeof (T)); }
244
245// also copies src into the new area, like "memdup"
246// if src is 0, clears the memory
247template<typename T>
248inline T *salloc (int n, T *src) throw (std::bad_alloc) { return (T *)salloc_ (n * sizeof (T), (void *)src); }
249
250// clears the memory
251template<typename T>
252inline T *salloc0(int n = 1) throw (std::bad_alloc) { return (T *)salloc_ (n * sizeof (T), 0); }
253
254// for symmetry
255template<typename T>
256inline void sfree (T *ptr, int n = 1) throw ()
257{
258 if (expect_true (ptr))
259 {
260 slice_alloc -= n * sizeof (T);
261 if (DEBUG_POISON) memset (ptr, DEBUG_POISON, n * sizeof (T));
262 g_slice_free1 (n * sizeof (T), (void *)ptr);
263 assert (slice_alloc >= 0);//D
264 }
265}
266
267// nulls the pointer
268template<typename T>
269inline void sfree0 (T *&ptr, int n = 1) throw ()
270{
271 sfree<T> (ptr, n);
272 ptr = 0;
273}
274
178// makes dynamically allocated objects zero-initialised 275// makes dynamically allocated objects zero-initialised
179struct zero_initialised 276struct zero_initialised
180{ 277{
181 void *operator new (size_t s, void *p) 278 void *operator new (size_t s, void *p)
182 { 279 {
… …
184 return p; 281 return p;
185 } 282 }
186 283
187 void *operator new (size_t s) 284 void *operator new (size_t s)
188 { 285 {
189 return g_slice_alloc0 (s); 286 return salloc0<char> (s);
190 } 287 }
191 288
192 void *operator new[] (size_t s) 289 void *operator new[] (size_t s)
193 { 290 {
194 return g_slice_alloc0 (s); 291 return salloc0<char> (s);
195 } 292 }
196 293
197 void operator delete (void *p, size_t s) 294 void operator delete (void *p, size_t s)
198 { 295 {
199 g_slice_free1 (s, p); 296 sfree ((char *)p, s);
200 } 297 }
201 298
202 void operator delete[] (void *p, size_t s) 299 void operator delete[] (void *p, size_t s)
203 { 300 {
204 g_slice_free1 (s, p); 301 sfree ((char *)p, s);
205 } 302 }
206}; 303};
207 304
208void *salloc_ (int n) throw (std::bad_alloc); 305// makes dynamically allocated objects zero-initialised
209void *salloc_ (int n, void *src) throw (std::bad_alloc); 306struct slice_allocated
210
211// strictly the same as g_slice_alloc, but never returns 0
212template<typename T>
213inline T *salloc (int n = 1) throw (std::bad_alloc) { return (T *)salloc_ (n * sizeof (T)); }
214
215// also copies src into the new area, like "memdup"
216// if src is 0, clears the memory
217template<typename T>
218inline T *salloc (int n, T *src) throw (std::bad_alloc) { return (T *)salloc_ (n * sizeof (T), (void *)src); }
219
220// clears the memory
221template<typename T>
222inline T *salloc0(int n = 1) throw (std::bad_alloc) { return (T *)salloc_ (n * sizeof (T), 0); }
223
224// for symmetry
225template<typename T>
226inline void sfree (T *ptr, int n = 1) throw ()
227{ 307{
228#ifdef PREFER_MALLOC 308 void *operator new (size_t s, void *p)
229 free (ptr); 309 {
230#else 310 return p;
231 g_slice_free1 (n * sizeof (T), (void *)ptr); 311 }
232#endif 312
233} 313 void *operator new (size_t s)
314 {
315 return salloc<char> (s);
316 }
317
318 void *operator new[] (size_t s)
319 {
320 return salloc<char> (s);
321 }
322
323 void operator delete (void *p, size_t s)
324 {
325 sfree ((char *)p, s);
326 }
327
328 void operator delete[] (void *p, size_t s)
329 {
330 sfree ((char *)p, s);
331 }
332};
234 333
235// a STL-compatible allocator that uses g_slice 334// a STL-compatible allocator that uses g_slice
236// boy, this is verbose 335// boy, this is verbose
237template<typename Tp> 336template<typename Tp>
238struct slice_allocator 337struct slice_allocator
… …
250 { 349 {
251 typedef slice_allocator<U> other; 350 typedef slice_allocator<U> other;
252 }; 351 };
253 352
254 slice_allocator () throw () { } 353 slice_allocator () throw () { }
255 slice_allocator (const slice_allocator &o) throw () { } 354 slice_allocator (const slice_allocator &) throw () { }
256 template<typename Tp2> 355 template<typename Tp2>
257 slice_allocator (const slice_allocator<Tp2> &) throw () { } 356 slice_allocator (const slice_allocator<Tp2> &) throw () { }
258 357
259 ~slice_allocator () { } 358 ~slice_allocator () { }
260 359
… …
269 void deallocate (pointer p, size_type n) 368 void deallocate (pointer p, size_type n)
270 { 369 {
271 sfree<Tp> (p, n); 370 sfree<Tp> (p, n);
272 } 371 }
273 372
274 size_type max_size ()const throw () 373 size_type max_size () const throw ()
275 { 374 {
276 return size_t (-1) / sizeof (Tp); 375 return size_t (-1) / sizeof (Tp);
277 } 376 }
278 377
279 void construct (pointer p, const Tp &val) 378 void construct (pointer p, const Tp &val)
… …
304 } 403 }
305 404
306 void seed (uint32_t seed); 405 void seed (uint32_t seed);
307 uint32_t next (); 406 uint32_t next ();
308 407
309 // uniform distribution 408 // uniform distribution, 0 .. max (0, num - 1)
310 uint32_t operator ()(uint32_t num) 409 uint32_t operator ()(uint32_t num)
311 { 410 {
312 return is_constant (num) 411 return is_constant (num)
313 ? (next () * (uint64_t)num) >> 32U 412 ? (next () * (uint64_t)num) >> 32U
314 : get_range (num); 413 : get_range (num);
… …
332 int get_range (int r_min, int r_max); 431 int get_range (int r_min, int r_max);
333}; 432};
334 433
335typedef tausworthe_random_generator rand_gen; 434typedef tausworthe_random_generator rand_gen;
336 435
337extern rand_gen rndm; 436extern rand_gen rndm, rmg_rndm;
437
438INTERFACE_CLASS (attachable)
439struct refcnt_base
440{
441 typedef int refcnt_t;
442 mutable refcnt_t ACC (RW, refcnt);
443
444 MTH void refcnt_inc () const { ++refcnt; }
445 MTH void refcnt_dec () const { --refcnt; }
446
447 refcnt_base () : refcnt (0) { }
448};
449
450// to avoid branches with more advanced compilers
451extern refcnt_base::refcnt_t refcnt_dummy;
338 452
339template<class T> 453template<class T>
340struct refptr 454struct refptr
341{ 455{
456 // p if not null
457 refcnt_base::refcnt_t *refcnt_ref () { return p ? &p->refcnt : &refcnt_dummy; }
458
459 void refcnt_dec ()
460 {
461 if (!is_constant (p))
462 --*refcnt_ref ();
463 else if (p)
464 --p->refcnt;
465 }
466
467 void refcnt_inc ()
468 {
469 if (!is_constant (p))
470 ++*refcnt_ref ();
471 else if (p)
472 ++p->refcnt;
473 }
474
342 T *p; 475 T *p;
343 476
344 refptr () : p(0) { } 477 refptr () : p(0) { }
345 refptr (const refptr<T> &p) : p(p.p) { if (p) p->refcnt_inc (); } 478 refptr (const refptr<T> &p) : p(p.p) { refcnt_inc (); }
346 refptr (T *p) : p(p) { if (p) p->refcnt_inc (); } 479 refptr (T *p) : p(p) { refcnt_inc (); }
347 ~refptr () { if (p) p->refcnt_dec (); } 480 ~refptr () { refcnt_dec (); }
348 481
349 const refptr<T> &operator =(T *o) 482 const refptr<T> &operator =(T *o)
350 { 483 {
484 // if decrementing ever destroys we need to reverse the order here
351 if (p) p->refcnt_dec (); 485 refcnt_dec ();
352 p = o; 486 p = o;
353 if (p) p->refcnt_inc (); 487 refcnt_inc ();
354
355 return *this; 488 return *this;
356 } 489 }
357 490
358 const refptr<T> &operator =(const refptr<T> o) 491 const refptr<T> &operator =(const refptr<T> &o)
359 { 492 {
360 *this = o.p; 493 *this = o.p;
361 return *this; 494 return *this;
362 } 495 }
363 496
364 T &operator * () const { return *p; } 497 T &operator * () const { return *p; }
365 T *operator ->() const { return p; } 498 T *operator ->() const { return p; }
366 499
367 operator T *() const { return p; } 500 operator T *() const { return p; }
368}; 501};
369 502
370typedef refptr<maptile> maptile_ptr; 503typedef refptr<maptile> maptile_ptr;
… …
405 { 538 {
406 return !strcmp (a, b); 539 return !strcmp (a, b);
407 } 540 }
408}; 541};
409 542
543// Mostly the same as std::vector, but insert/erase can reorder
544// the elements, making append(=insert)/remove O(1) instead of O(n).
545//
546// NOTE: only some forms of erase are available
410template<class T> 547template<class T>
411struct unordered_vector : std::vector<T, slice_allocator<T> > 548struct unordered_vector : std::vector<T, slice_allocator<T> >
412{ 549{
413 typedef typename unordered_vector::iterator iterator; 550 typedef typename unordered_vector::iterator iterator;
414 551
… …
424 { 561 {
425 erase ((unsigned int )(i - this->begin ())); 562 erase ((unsigned int )(i - this->begin ()));
426 } 563 }
427}; 564};
428 565
429template<class T, int T::* index> 566// This container blends advantages of linked lists
567// (efficiency) with vectors (random access) by
568// by using an unordered vector and storing the vector
569// index inside the object.
570//
571// + memory-efficient on most 64 bit archs
572// + O(1) insert/remove
573// + free unique (but varying) id for inserted objects
574// + cache-friendly iteration
575// - only works for pointers to structs
576//
577// NOTE: only some forms of erase/insert are available
578typedef int object_vector_index;
579
580template<class T, object_vector_index T::*indexmember>
430struct object_vector : std::vector<T *, slice_allocator<T *> > 581struct object_vector : std::vector<T *, slice_allocator<T *> >
431{ 582{
432 typedef typename object_vector::iterator iterator; 583 typedef typename object_vector::iterator iterator;
433 584
434 bool contains (const T *obj) const 585 bool contains (const T *obj) const
435 { 586 {
436 return obj->*index; 587 return obj->*indexmember;
437 } 588 }
438 589
439 iterator find (const T *obj) 590 iterator find (const T *obj)
440 { 591 {
441 return obj->*index 592 return obj->*indexmember
442 ? this->begin () + obj->*index - 1 593 ? this->begin () + obj->*indexmember - 1
443 : this->end (); 594 : this->end ();
444 } 595 }
445 596
597 void push_back (T *obj)
598 {
599 std::vector<T *, slice_allocator<T *> >::push_back (obj);
600 obj->*indexmember = this->size ();
601 }
602
446 void insert (T *obj) 603 void insert (T *obj)
447 { 604 {
448 assert (!(obj->*index));
449 push_back (obj); 605 push_back (obj);
450 obj->*index = this->size ();
451 } 606 }
452 607
453 void insert (T &obj) 608 void insert (T &obj)
454 { 609 {
455 insert (&obj); 610 insert (&obj);
456 } 611 }
457 612
458 void erase (T *obj) 613 void erase (T *obj)
459 { 614 {
460 assert (obj->*index);
461 unsigned int pos = obj->*index; 615 unsigned int pos = obj->*indexmember;
462 obj->*index = 0; 616 obj->*indexmember = 0;
463 617
464 if (pos < this->size ()) 618 if (pos < this->size ())
465 { 619 {
466 (*this)[pos - 1] = (*this)[this->size () - 1]; 620 (*this)[pos - 1] = (*this)[this->size () - 1];
467 (*this)[pos - 1]->*index = pos; 621 (*this)[pos - 1]->*indexmember = pos;
468 } 622 }
469 623
470 this->pop_back (); 624 this->pop_back ();
471 } 625 }
472 626
473 void erase (T &obj) 627 void erase (T &obj)
474 { 628 {
475 errase (&obj); 629 erase (&obj);
476 } 630 }
477}; 631};
478 632
479// basically does what strncpy should do, but appends "..." to strings exceeding length 633// basically does what strncpy should do, but appends "..." to strings exceeding length
480void assign (char *dst, const char *src, int maxlen); 634void assign (char *dst, const char *src, int maxlen);
… …
486 assign ((char *)&dst, src, N); 640 assign ((char *)&dst, src, N);
487} 641}
488 642
489typedef double tstamp; 643typedef double tstamp;
490 644
491// return current time as timestampe 645// return current time as timestamp
492tstamp now (); 646tstamp now ();
493 647
494int similar_direction (int a, int b); 648int similar_direction (int a, int b);
495 649
496// like printf, but returns a std::string 650// like sprintf, but returns a "static" buffer
497const std::string format (const char *format, ...); 651const char *format (const char *format, ...);
498 652
653/////////////////////////////////////////////////////////////////////////////
654// threads, very very thin wrappers around pthreads
655
656struct thread
657{
658 pthread_t id;
659
660 void start (void *(*start_routine)(void *), void *arg = 0);
661
662 void cancel ()
663 {
664 pthread_cancel (id);
665 }
666
667 void *join ()
668 {
669 void *ret;
670
671 if (pthread_join (id, &ret))
672 cleanup ("pthread_join failed", 1);
673
674 return ret;
675 }
676};
677
678// note that mutexes are not classes
679typedef pthread_mutex_t smutex;
680
681#if __linux && defined (PTHREAD_ADAPTIVE_MUTEX_INITIALIZER_NP)
682 #define SMUTEX_INITIALISER PTHREAD_ADAPTIVE_MUTEX_INITIALIZER_NP
683#else
684 #define SMUTEX_INITIALISER PTHREAD_MUTEX_INITIALIZER
499#endif 685#endif
500 686
687#define SMUTEX(name) smutex name = SMUTEX_INITIALISER
688#define SMUTEX_LOCK(name) pthread_mutex_lock (&(name))
689#define SMUTEX_UNLOCK(name) pthread_mutex_unlock (&(name))
690
691typedef pthread_cond_t scond;
692
693#define SCOND(name) scond name = PTHREAD_COND_INITIALIZER
694#define SCOND_SIGNAL(name) pthread_cond_signal (&(name))
695#define SCOND_BROADCAST(name) pthread_cond_broadcast (&(name))
696#define SCOND_WAIT(name,mutex) pthread_cond_wait (&(name), &(mutex))
697
698#endif
699

Diff Legend

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