1 | #ifndef RXVT_UTIL_H |
1 | #ifndef RXVT_UTIL_H |
2 | #define RXVT_UTIL_H |
2 | #define RXVT_UTIL_H |
3 | |
3 | |
4 | #include <cstdlib> |
4 | #include <cstdlib> |
5 | #include <cstring> |
5 | #include <cstring> |
|
|
6 | |
|
|
7 | using namespace std; |
6 | |
8 | |
7 | #define PP_CONCAT_(a, b) a ## b |
9 | #define PP_CONCAT_(a, b) a ## b |
8 | #define PP_CONCAT(a, b) PP_CONCAT_(a, b) |
10 | #define PP_CONCAT(a, b) PP_CONCAT_(a, b) |
9 | #define PP_STRINGIFY_(a) #a |
11 | #define PP_STRINGIFY_(a) #a |
10 | #define PP_STRINGIFY(a) PP_STRINGIFY_(a) |
12 | #define PP_STRINGIFY(a) PP_STRINGIFY_(a) |
11 | |
13 | |
12 | // actually, some gcc-3.x versions work, too |
14 | #define HAVE_GCC_BUILTINS (__GNUC__ >= 4 || (__GNUC__ == 3 && __GNUC_MINOR__ == 4)) |
13 | #define HAVE_GCC_BUILTINS (__GNUC__ >= 4) |
|
|
14 | |
15 | |
15 | #ifndef __attribute__ |
|
|
16 | # if __GNUC__ |
16 | #if __GNUC__ >= 4 |
17 | # if (__GNUC__ == 2 && __GNUC_MINOR__ < 5) || (__GNUC__ < 2) |
17 | # define rxvt_attribute(x) __attribute__(x) |
18 | # define __attribute__(x) |
18 | #else |
19 | # endif |
|
|
20 | # endif |
|
|
21 | # define __attribute__(x) |
19 | # define rxvt_attribute(x) |
22 | #endif |
20 | #endif |
23 | |
21 | |
24 | #define NORETURN __attribute__ ((noreturn)) |
22 | #define NORETURN rxvt_attribute ((noreturn)) |
25 | #define UNUSED __attribute__ ((unused)) |
23 | #define UNUSED rxvt_attribute ((unused)) |
26 | #define CONST __attribute__ ((const)) |
24 | #define CONST rxvt_attribute ((const)) |
27 | |
25 | |
28 | // increases code size unless -fno-enforce-eh-specs |
26 | // increases code size unless -fno-enforce-eh-specs |
29 | #if __GNUC__ |
27 | #if __GNUC__ |
30 | # define NOTHROW |
28 | # define NOTHROW |
31 | # define THROW(x) |
29 | # define THROW(x) |
… | |
… | |
54 | template<typename T, typename U, typename V> static inline T clamp (T v, U a, V b) { return v < (T)a ? a : v >(T)b ? b : v; } |
52 | template<typename T, typename U, typename V> static inline T clamp (T v, U a, V b) { return v < (T)a ? a : v >(T)b ? b : v; } |
55 | template<typename T, typename U, typename V> static inline void clamp_it (T &v, U a, V b) { v = v < (T)a ? a : v >(T)b ? b : v; } |
53 | template<typename T, typename U, typename V> static inline void clamp_it (T &v, U a, V b) { v = v < (T)a ? a : v >(T)b ? b : v; } |
56 | |
54 | |
57 | template<typename T, typename U> static inline void swap (T& a, U& b) { T t=a; a=(T)b; b=(U)t; } |
55 | template<typename T, typename U> static inline void swap (T& a, U& b) { T t=a; a=(T)b; b=(U)t; } |
58 | |
56 | |
|
|
57 | template<typename T> static inline T squared_diff (T a, T b) { return (a-b)*(a-b); } |
|
|
58 | |
59 | // linear interpolation |
59 | // linear interpolation |
60 | template<typename T, typename U, typename P> |
60 | template<typename T, typename U, typename P> |
61 | static inline |
61 | static inline |
62 | T lerp (T a, U b, P p) |
62 | T lerp (T a, U b, P p) |
63 | { |
63 | { |
64 | return (int(a) * int(p) + int(b) * int(100 - p)) / 100; |
64 | return (long(a) * long(100 - p) + long(b) * long(p) + 50) / 100; |
|
|
65 | } |
|
|
66 | |
|
|
67 | template <typename I, typename T> |
|
|
68 | I find (I first, I last, const T& value) |
|
|
69 | { |
|
|
70 | while (first != last && *first != value) |
|
|
71 | ++first; |
|
|
72 | |
|
|
73 | return first; |
|
|
74 | } |
|
|
75 | |
|
|
76 | // return a very temporary (and never deallocated) buffer. keep small. |
|
|
77 | void *rxvt_temp_buf (int len); |
|
|
78 | |
|
|
79 | template<typename T> |
|
|
80 | static inline T * |
|
|
81 | rxvt_temp_buf (int len) |
|
|
82 | { |
|
|
83 | return (T *)rxvt_temp_buf (len * sizeof (T)); |
65 | } |
84 | } |
66 | |
85 | |
67 | // some bit functions, xft fuck me plenty |
86 | // some bit functions, xft fuck me plenty |
68 | #if HAVE_GCC_BUILTINS |
87 | #if HAVE_GCC_BUILTINS |
69 | static inline int ctz (unsigned int x) CONST { return __builtin_ctz (x); } |
88 | static inline int ctz (unsigned int x) { return __builtin_ctz (x); } |
70 | static inline int popcount (unsigned int x) CONST { return __builtin_popcount (x); } |
89 | static inline int popcount (unsigned int x) { return __builtin_popcount (x); } |
71 | #else |
90 | #else |
72 | // count trailing zero bits and count # of one bits |
91 | // count trailing zero bits and count # of one bits |
73 | int ctz (unsigned int x) CONST; |
92 | int ctz (unsigned int x) CONST; |
74 | int popcount (unsigned int x) CONST; |
93 | int popcount (unsigned int x) CONST; |
75 | #endif |
94 | #endif |
… | |
… | |
87 | void *operator new (size_t s); |
106 | void *operator new (size_t s); |
88 | void operator delete (void *p, size_t s); |
107 | void operator delete (void *p, size_t s); |
89 | }; |
108 | }; |
90 | |
109 | |
91 | /* simplevec taken (and heavily modified), from: |
110 | /* simplevec taken (and heavily modified), from: |
92 | * |
111 | * |
93 | * MICO --- a free CORBA implementation |
112 | * MICO --- a free CORBA implementation |
94 | * Copyright (C) 1997-98 Kay Roemer & Arno Puder |
113 | * Copyright (C) 1997-98 Kay Roemer & Arno Puder |
95 | */ |
114 | */ |
96 | template<class T> |
115 | template<class T> |
97 | struct simplevec { |
116 | struct simplevec { |
… | |
… | |
343 | } |
362 | } |
344 | |
363 | |
345 | |
364 | |
346 | template<typename T> |
365 | template<typename T> |
347 | struct vector : simplevec<T> |
366 | struct vector : simplevec<T> |
348 | { }; |
367 | { |
|
|
368 | }; |
|
|
369 | |
|
|
370 | struct stringvec : simplevec<char *> |
|
|
371 | { |
|
|
372 | ~stringvec () |
|
|
373 | { |
|
|
374 | for (char **c = begin (); c != end (); c++) |
|
|
375 | free (*c); |
|
|
376 | } |
|
|
377 | }; |
349 | |
378 | |
350 | #if 0 |
379 | #if 0 |
351 | template<typename T> |
380 | template<typename T> |
352 | struct rxvt_vec : simplevec<void *> { |
381 | struct rxvt_vec : simplevec<void *> { |
353 | typedef T *iterator; |
382 | typedef T *iterator; |
… | |
… | |
361 | T &operator [] (int i) { return * (T *) (& ((* (simplevec<void *> *)this)[i])); } |
390 | T &operator [] (int i) { return * (T *) (& ((* (simplevec<void *> *)this)[i])); } |
362 | const T &operator [] (int i) const { return * (const T *) (& ((* (const simplevec<void *> *)this)[i])); } |
391 | const T &operator [] (int i) const { return * (const T *) (& ((* (const simplevec<void *> *)this)[i])); } |
363 | }; |
392 | }; |
364 | #endif |
393 | #endif |
365 | |
394 | |
366 | template <typename I, typename T> |
|
|
367 | I find (I first, I last, const T& value) |
|
|
368 | { |
|
|
369 | while (first != last && *first != value) |
|
|
370 | ++first; |
|
|
371 | |
|
|
372 | return first; |
|
|
373 | } |
|
|
374 | |
|
|
375 | template<typename T> |
395 | template<typename T> |
376 | struct auto_ptr { |
396 | struct auto_ptr { |
377 | T *p; |
397 | T *p; |
378 | |
398 | |
379 | auto_ptr () : p (0) { } |
399 | auto_ptr () : p (0) { } |
… | |
… | |
430 | } |
450 | } |
431 | }; |
451 | }; |
432 | |
452 | |
433 | typedef auto_ptr<char> auto_str; |
453 | typedef auto_ptr<char> auto_str; |
434 | |
454 | |
435 | struct stringvec : simplevec<char *> |
|
|
436 | { |
|
|
437 | ~stringvec () |
|
|
438 | { |
|
|
439 | for (char **c = begin (); c != end (); c++) |
|
|
440 | free (*c); |
|
|
441 | } |
|
|
442 | }; |
|
|
443 | |
|
|
444 | // return a very temporary (and never deallocated) buffer. keep small. |
|
|
445 | void *rxvt_temp_buf (int len); |
|
|
446 | |
|
|
447 | template<typename T> |
|
|
448 | static inline T * |
|
|
449 | rxvt_temp_buf (int len) |
|
|
450 | { |
|
|
451 | return (T *)rxvt_temp_buf (len * sizeof (T)); |
|
|
452 | } |
|
|
453 | |
|
|
454 | #endif |
455 | #endif |
455 | |
456 | |