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 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
4 | * Copyright (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
5 | * |
5 | * |
6 | * Deliantra is free software: you can redistribute it and/or modify |
6 | * Deliantra is free software: you can redistribute it and/or modify |
7 | * it under the terms of the GNU General Public License as published by |
7 | * it under the terms of the GNU General Public License as published by |
8 | * the Free Software Foundation, either version 3 of the License, or |
8 | * the Free Software Foundation, either version 3 of the License, or |
9 | * (at your option) any later version. |
9 | * (at your option) any later version. |
… | |
… | |
28 | |
28 | |
29 | #if __GNUC__ >= 3 |
29 | #if __GNUC__ >= 3 |
30 | # define is_constant(c) __builtin_constant_p (c) |
30 | # define is_constant(c) __builtin_constant_p (c) |
31 | # define expect(expr,value) __builtin_expect ((expr),(value)) |
31 | # define expect(expr,value) __builtin_expect ((expr),(value)) |
32 | # define prefetch(addr,rw,locality) __builtin_prefetch (addr, rw, locality) |
32 | # define prefetch(addr,rw,locality) __builtin_prefetch (addr, rw, locality) |
|
|
33 | # define noinline __attribute__((__noinline__)) |
33 | #else |
34 | #else |
34 | # define is_constant(c) 0 |
35 | # define is_constant(c) 0 |
35 | # define expect(expr,value) (expr) |
36 | # define expect(expr,value) (expr) |
36 | # define prefetch(addr,rw,locality) |
37 | # define prefetch(addr,rw,locality) |
|
|
38 | # define noinline |
37 | #endif |
39 | #endif |
38 | |
40 | |
39 | #if __GNUC__ < 4 || (__GNUC__ == 4 || __GNUC_MINOR__ < 4) |
41 | #if __GNUC__ < 4 || (__GNUC__ == 4 || __GNUC_MINOR__ < 4) |
40 | # define decltype(x) typeof(x) |
42 | # define decltype(x) typeof(x) |
41 | #endif |
43 | #endif |
42 | |
44 | |
43 | // put into ifs if you are very sure that the expression |
45 | // put into ifs if you are very sure that the expression |
44 | // is mostly true or mosty false. note that these return |
46 | // is mostly true or mosty false. note that these return |
45 | // booleans, not the expression. |
47 | // booleans, not the expression. |
46 | #define expect_false(expr) expect ((expr) != 0, 0) |
48 | #define expect_false(expr) expect ((expr) ? 1 : 0, 0) |
47 | #define expect_true(expr) expect ((expr) != 0, 1) |
49 | #define expect_true(expr) expect ((expr) ? 1 : 0, 1) |
48 | |
50 | |
49 | #include <pthread.h> |
51 | #include <pthread.h> |
50 | |
52 | |
51 | #include <cstddef> |
53 | #include <cstddef> |
52 | #include <cmath> |
54 | #include <cmath> |
… | |
… | |
72 | #endif |
74 | #endif |
73 | |
75 | |
74 | // use C0X decltype for auto declarations until ISO C++ sanctifies them (if ever) |
76 | // use C0X decltype for auto declarations until ISO C++ sanctifies them (if ever) |
75 | #define auto(var,expr) decltype(expr) var = (expr) |
77 | #define auto(var,expr) decltype(expr) var = (expr) |
76 | |
78 | |
77 | // very ugly macro that basicaly declares and initialises a variable |
79 | // very ugly macro that basically declares and initialises a variable |
78 | // that is in scope for the next statement only |
80 | // that is in scope for the next statement only |
79 | // works only for stuff that can be assigned 0 and converts to false |
81 | // works only for stuff that can be assigned 0 and converts to false |
80 | // (note: works great for pointers) |
82 | // (note: works great for pointers) |
81 | // most ugly macro I ever wrote |
83 | // most ugly macro I ever wrote |
82 | #define statementvar(type, name, value) if (type name = 0) { } else if (((name) = (value)), 1) |
84 | #define statementvar(type, name, value) if (type name = 0) { } else if (((name) = (value)), 1) |
… | |
… | |
96 | // as a is often a constant while b is the variable. it is still a bug, though. |
98 | // as a is often a constant while b is the variable. it is still a bug, though. |
97 | template<typename T, typename U> static inline T min (T a, U b) { return (U)a < b ? (U)a : b; } |
99 | template<typename T, typename U> static inline T min (T a, U b) { return (U)a < b ? (U)a : b; } |
98 | template<typename T, typename U> static inline T max (T a, U b) { return (U)a > b ? (U)a : b; } |
100 | template<typename T, typename U> static inline T max (T a, U b) { return (U)a > b ? (U)a : b; } |
99 | template<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; } |
101 | template<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; } |
100 | |
102 | |
|
|
103 | template<typename T, typename U> static inline void min_it (T &v, U m) { v = min (v, (T)m); } |
|
|
104 | template<typename T, typename U> static inline void max_it (T &v, U m) { v = max (v, (T)m); } |
|
|
105 | template<typename T, typename U, typename V> static inline void clamp_it (T &v, U a, V b) { v = clamp (v, (T)a, (T)b); } |
|
|
106 | |
101 | template<typename T, typename U> static inline void swap (T& a, U& b) { T t=a; a=(T)b; b=(U)t; } |
107 | template<typename T, typename U> static inline void swap (T& a, U& b) { T t=a; a=(T)b; b=(U)t; } |
102 | |
108 | |
103 | template<typename T, typename U, typename V> static inline T min (T a, U b, V c) { return min (a, min (b, c)); } |
109 | template<typename T, typename U, typename V> static inline T min (T a, U b, V c) { return min (a, min (b, c)); } |
104 | template<typename T, typename U, typename V> static inline T max (T a, U b, V c) { return max (a, max (b, c)); } |
110 | template<typename T, typename U, typename V> static inline T max (T a, U b, V c) { return max (a, max (b, c)); } |
105 | |
111 | |
|
|
112 | // sign returns -1 or +1 |
|
|
113 | template<typename T> |
|
|
114 | static inline T sign (T v) { return v < 0 ? -1 : +1; } |
|
|
115 | // relies on 2c representation |
|
|
116 | template<> |
|
|
117 | inline sint8 sign (sint8 v) { return 1 - (sint8 (uint8 (v) >> 7) * 2); } |
|
|
118 | |
|
|
119 | // sign0 returns -1, 0 or +1 |
|
|
120 | template<typename T> |
|
|
121 | static inline T sign0 (T v) { return v ? sign (v) : 0; } |
|
|
122 | |
|
|
123 | // div* only work correctly for div > 0 |
|
|
124 | // div, with correct rounding (< 0.5 downwards, >=0.5 upwards) |
|
|
125 | template<typename T> static inline T div (T val, T div) |
|
|
126 | { |
|
|
127 | return expect_false (val < 0) ? - ((-val + (div - 1) / 2) / div) : (val + div / 2) / div; |
|
|
128 | } |
|
|
129 | // div, round-up |
|
|
130 | template<typename T> static inline T div_ru (T val, T div) |
|
|
131 | { |
|
|
132 | return expect_false (val < 0) ? - ((-val ) / div) : (val + div - 1) / div; |
|
|
133 | } |
|
|
134 | // div, round-down |
|
|
135 | template<typename T> static inline T div_rd (T val, T div) |
|
|
136 | { |
|
|
137 | return expect_false (val < 0) ? - ((-val + (div - 1) ) / div) : (val ) / div; |
|
|
138 | } |
|
|
139 | |
|
|
140 | // lerp* only work correctly for min_in < max_in |
|
|
141 | // Linear intERPolate, scales val from min_in..max_in to min_out..max_out |
106 | template<typename T> |
142 | template<typename T> |
107 | static inline T |
143 | static inline T |
108 | lerp (T val, T min_in, T max_in, T min_out, T max_out) |
144 | lerp (T val, T min_in, T max_in, T min_out, T max_out) |
109 | { |
145 | { |
110 | return (val - min_in) * (max_out - min_out) / (max_in - min_in) + min_out; |
146 | return min_out + div <T> ((val - min_in) * (max_out - min_out), max_in - min_in); |
|
|
147 | } |
|
|
148 | |
|
|
149 | // lerp, round-down |
|
|
150 | template<typename T> |
|
|
151 | static inline T |
|
|
152 | lerp_rd (T val, T min_in, T max_in, T min_out, T max_out) |
|
|
153 | { |
|
|
154 | return min_out + div_rd<T> ((val - min_in) * (max_out - min_out), max_in - min_in); |
|
|
155 | } |
|
|
156 | |
|
|
157 | // lerp, round-up |
|
|
158 | template<typename T> |
|
|
159 | static inline T |
|
|
160 | lerp_ru (T val, T min_in, T max_in, T min_out, T max_out) |
|
|
161 | { |
|
|
162 | return min_out + div_ru<T> ((val - min_in) * (max_out - min_out), max_in - min_in); |
111 | } |
163 | } |
112 | |
164 | |
113 | // lots of stuff taken from FXT |
165 | // lots of stuff taken from FXT |
114 | |
166 | |
115 | /* Rotate right. This is used in various places for checksumming */ |
167 | /* Rotate right. This is used in various places for checksumming */ |
… | |
… | |
351 | // P. L'Ecuyer, “Maximally Equidistributed Combined Tausworthe Generators”, Mathematics of Computation, 65, 213 (1996), 203–213. |
403 | // P. L'Ecuyer, “Maximally Equidistributed Combined Tausworthe Generators”, Mathematics of Computation, 65, 213 (1996), 203–213. |
352 | // http://www.iro.umontreal.ca/~lecuyer/myftp/papers/tausme.ps |
404 | // http://www.iro.umontreal.ca/~lecuyer/myftp/papers/tausme.ps |
353 | // http://www.iro.umontreal.ca/~lecuyer/myftp/papers/tausme2.ps |
405 | // http://www.iro.umontreal.ca/~lecuyer/myftp/papers/tausme2.ps |
354 | struct tausworthe_random_generator |
406 | struct tausworthe_random_generator |
355 | { |
407 | { |
356 | // generator |
|
|
357 | uint32_t state [4]; |
408 | uint32_t state [4]; |
358 | |
409 | |
359 | void operator =(const tausworthe_random_generator &src) |
410 | void operator =(const tausworthe_random_generator &src) |
360 | { |
411 | { |
361 | state [0] = src.state [0]; |
412 | state [0] = src.state [0]; |
… | |
… | |
364 | state [3] = src.state [3]; |
415 | state [3] = src.state [3]; |
365 | } |
416 | } |
366 | |
417 | |
367 | void seed (uint32_t seed); |
418 | void seed (uint32_t seed); |
368 | uint32_t next (); |
419 | uint32_t next (); |
|
|
420 | }; |
369 | |
421 | |
370 | // uniform distribution |
422 | // Xorshift RNGs, George Marsaglia |
|
|
423 | // http://www.jstatsoft.org/v08/i14/paper |
|
|
424 | // this one is about 40% faster than the tausworthe one above (i.e. not much), |
|
|
425 | // despite the inlining, and has the issue of only creating 2**32-1 numbers. |
|
|
426 | // see also http://www.iro.umontreal.ca/~lecuyer/myftp/papers/xorshift.pdf |
|
|
427 | struct xorshift_random_generator |
|
|
428 | { |
|
|
429 | uint32_t x, y; |
|
|
430 | |
|
|
431 | void operator =(const xorshift_random_generator &src) |
|
|
432 | { |
|
|
433 | x = src.x; |
|
|
434 | y = src.y; |
|
|
435 | } |
|
|
436 | |
|
|
437 | void seed (uint32_t seed) |
|
|
438 | { |
|
|
439 | x = seed; |
|
|
440 | y = seed * 69069U; |
|
|
441 | } |
|
|
442 | |
|
|
443 | uint32_t next () |
|
|
444 | { |
|
|
445 | uint32_t t = x ^ (x << 10); |
|
|
446 | x = y; |
|
|
447 | y = y ^ (y >> 13) ^ t ^ (t >> 10); |
|
|
448 | return y; |
|
|
449 | } |
|
|
450 | }; |
|
|
451 | |
|
|
452 | template<class generator> |
|
|
453 | struct random_number_generator : generator |
|
|
454 | { |
|
|
455 | // uniform distribution, 0 .. max (0, num - 1) |
371 | uint32_t operator ()(uint32_t num) |
456 | uint32_t operator ()(uint32_t num) |
372 | { |
457 | { |
373 | return is_constant (num) |
458 | return !is_constant (num) ? get_range (num) // non-constant |
374 | ? (next () * (uint64_t)num) >> 32U |
459 | : num & (num - 1) ? (this->next () * (uint64_t)num) >> 32U // constant, non-power-of-two |
375 | : get_range (num); |
460 | : this->next () & (num - 1); // constant, power-of-two |
376 | } |
461 | } |
377 | |
462 | |
378 | // return a number within (min .. max) |
463 | // return a number within (min .. max) |
379 | int operator () (int r_min, int r_max) |
464 | int operator () (int r_min, int r_max) |
380 | { |
465 | { |
… | |
… | |
391 | protected: |
476 | protected: |
392 | uint32_t get_range (uint32_t r_max); |
477 | uint32_t get_range (uint32_t r_max); |
393 | int get_range (int r_min, int r_max); |
478 | int get_range (int r_min, int r_max); |
394 | }; |
479 | }; |
395 | |
480 | |
396 | typedef tausworthe_random_generator rand_gen; |
481 | typedef random_number_generator<tausworthe_random_generator> rand_gen; |
397 | |
482 | |
398 | extern rand_gen rndm, rmg_rndm; |
483 | extern rand_gen rndm, rmg_rndm; |
399 | |
484 | |
400 | INTERFACE_CLASS (attachable) |
485 | INTERFACE_CLASS (attachable) |
401 | struct refcnt_base |
486 | struct refcnt_base |
… | |
… | |
470 | |
555 | |
471 | struct str_hash |
556 | struct str_hash |
472 | { |
557 | { |
473 | std::size_t operator ()(const char *s) const |
558 | std::size_t operator ()(const char *s) const |
474 | { |
559 | { |
475 | unsigned long hash = 0; |
560 | #if 0 |
|
|
561 | uint32_t hash = 0; |
476 | |
562 | |
477 | /* use the one-at-a-time hash function, which supposedly is |
563 | /* use the one-at-a-time hash function, which supposedly is |
478 | * better than the djb2-like one used by perl5.005, but |
564 | * better than the djb2-like one used by perl5.005, but |
479 | * certainly is better then the bug used here before. |
565 | * certainly is better then the bug used here before. |
480 | * see http://burtleburtle.net/bob/hash/doobs.html |
566 | * see http://burtleburtle.net/bob/hash/doobs.html |
… | |
… | |
487 | } |
573 | } |
488 | |
574 | |
489 | hash += hash << 3; |
575 | hash += hash << 3; |
490 | hash ^= hash >> 11; |
576 | hash ^= hash >> 11; |
491 | hash += hash << 15; |
577 | hash += hash << 15; |
|
|
578 | #else |
|
|
579 | // use FNV-1a hash (http://isthe.com/chongo/tech/comp/fnv/) |
|
|
580 | // it is about twice as fast as the one-at-a-time one, |
|
|
581 | // with good distribution. |
|
|
582 | // FNV-1a is faster on many cpus because the multiplication |
|
|
583 | // runs concurrent with the looping logic. |
|
|
584 | uint32_t hash = 2166136261; |
|
|
585 | |
|
|
586 | while (*s) |
|
|
587 | hash = (hash ^ *s++) * 16777619; |
|
|
588 | #endif |
492 | |
589 | |
493 | return hash; |
590 | return hash; |
494 | } |
591 | } |
495 | }; |
592 | }; |
496 | |
593 | |
… | |
… | |
591 | erase (&obj); |
688 | erase (&obj); |
592 | } |
689 | } |
593 | }; |
690 | }; |
594 | |
691 | |
595 | // basically does what strncpy should do, but appends "..." to strings exceeding length |
692 | // basically does what strncpy should do, but appends "..." to strings exceeding length |
|
|
693 | // returns the number of bytes actually used (including \0) |
596 | void assign (char *dst, const char *src, int maxlen); |
694 | int assign (char *dst, const char *src, int maxsize); |
597 | |
695 | |
598 | // type-safe version of assign |
696 | // type-safe version of assign |
599 | template<int N> |
697 | template<int N> |
600 | inline void assign (char (&dst)[N], const char *src) |
698 | inline int assign (char (&dst)[N], const char *src) |
601 | { |
699 | { |
602 | assign ((char *)&dst, src, N); |
700 | return assign ((char *)&dst, src, N); |
603 | } |
701 | } |
604 | |
702 | |
605 | typedef double tstamp; |
703 | typedef double tstamp; |
606 | |
704 | |
607 | // return current time as timestamp |
705 | // return current time as timestamp |
… | |
… | |
609 | |
707 | |
610 | int similar_direction (int a, int b); |
708 | int similar_direction (int a, int b); |
611 | |
709 | |
612 | // like sprintf, but returns a "static" buffer |
710 | // like sprintf, but returns a "static" buffer |
613 | const char *format (const char *format, ...); |
711 | const char *format (const char *format, ...); |
|
|
712 | |
|
|
713 | // safety-check player input which will become object->msg |
|
|
714 | bool msg_is_safe (const char *msg); |
614 | |
715 | |
615 | ///////////////////////////////////////////////////////////////////////////// |
716 | ///////////////////////////////////////////////////////////////////////////// |
616 | // threads, very very thin wrappers around pthreads |
717 | // threads, very very thin wrappers around pthreads |
617 | |
718 | |
618 | struct thread |
719 | struct thread |