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) |
15 | |
14 | #define HAVE_GCC_BUILTINS 0 |
16 | #if __GNUC__ >= 4 |
|
|
17 | # define rxvt_attribute(x) __attribute__(x) |
|
|
18 | #else |
|
|
19 | # define rxvt_attribute(x) |
|
|
20 | #endif |
|
|
21 | |
|
|
22 | #define NORETURN rxvt_attribute ((noreturn)) |
|
|
23 | #define UNUSED rxvt_attribute ((unused)) |
|
|
24 | #define CONST rxvt_attribute ((const)) |
|
|
25 | |
|
|
26 | // increases code size unless -fno-enforce-eh-specs |
|
|
27 | #if __GNUC__ |
|
|
28 | # define NOTHROW |
|
|
29 | # define THROW(x) |
|
|
30 | #else |
|
|
31 | # define NOTHROW throw() |
|
|
32 | # define THROW(x) throw x |
|
|
33 | #endif |
15 | |
34 | |
16 | extern class byteorder { |
35 | extern class byteorder { |
17 | static unsigned int e; // at least 32 bits |
36 | static unsigned int e; // at least 32 bits |
18 | public: |
37 | public: |
19 | byteorder (); |
38 | byteorder (); |
… | |
… | |
33 | 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; } |
34 | 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; } |
35 | |
54 | |
36 | 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; } |
37 | |
56 | |
|
|
57 | template<typename T> static inline T squared_diff (T a, T b) { return (a-b)*(a-b); } |
|
|
58 | |
38 | // linear interpolation |
59 | // linear interpolation |
39 | template<typename T, typename U, typename P> |
60 | template<typename T, typename U, typename P> |
40 | static inline |
61 | static inline |
41 | T lerp (T a, U b, P p) |
62 | T lerp (T a, U b, P p) |
42 | { |
63 | { |
43 | 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)); |
44 | } |
84 | } |
45 | |
85 | |
46 | // some bit functions, xft fuck me plenty |
86 | // some bit functions, xft fuck me plenty |
47 | #if HAVE_GCC_BUILTINS |
87 | #if HAVE_GCC_BUILTINS |
48 | static inline int ctz (unsigned int x) { return __builtin_ctz (x); } |
88 | static inline int ctz (unsigned int x) { return __builtin_ctz (x); } |
49 | static inline int popcount (unsigned int x) { return __builtin_popcount (x); } |
89 | static inline int popcount (unsigned int x) { return __builtin_popcount (x); } |
50 | #else |
90 | #else |
51 | // count trailing zero bits and count # of one bits |
91 | // count trailing zero bits and count # of one bits |
52 | int ctz (unsigned int x); |
92 | int ctz (unsigned int x) CONST; |
53 | int popcount (unsigned int x); |
93 | int popcount (unsigned int x) CONST; |
54 | #endif |
94 | #endif |
55 | |
95 | |
56 | // in range including end |
96 | // in range including end |
57 | #define IN_RANGE_INC(val,beg,end) \ |
97 | #define IN_RANGE_INC(val,beg,end) \ |
58 | ((unsigned int)(val) - (unsigned int)(beg) <= (unsigned int)(end) - (unsigned int)(beg)) |
98 | ((unsigned int)(val) - (unsigned int)(beg) <= (unsigned int)(end) - (unsigned int)(beg)) |
… | |
… | |
66 | void *operator new (size_t s); |
106 | void *operator new (size_t s); |
67 | void operator delete (void *p, size_t s); |
107 | void operator delete (void *p, size_t s); |
68 | }; |
108 | }; |
69 | |
109 | |
70 | /* simplevec taken (and heavily modified), from: |
110 | /* simplevec taken (and heavily modified), from: |
71 | * |
111 | * |
72 | * MICO --- a free CORBA implementation |
112 | * MICO --- a free CORBA implementation |
73 | * Copyright (C) 1997-98 Kay Roemer & Arno Puder |
113 | * Copyright (C) 1997-98 Kay Roemer & Arno Puder |
74 | */ |
114 | */ |
75 | template<class T> |
115 | template<class T> |
76 | struct simplevec { |
116 | struct simplevec { |
… | |
… | |
324 | |
364 | |
325 | template<typename T> |
365 | template<typename T> |
326 | struct vector : simplevec<T> |
366 | struct vector : simplevec<T> |
327 | { }; |
367 | { }; |
328 | |
368 | |
|
|
369 | struct stringvec : simplevec<char *> |
|
|
370 | { |
|
|
371 | ~stringvec () |
|
|
372 | { |
|
|
373 | for (char **c = begin (); c != end (); c++) |
|
|
374 | free (*c); |
|
|
375 | } |
|
|
376 | }; |
|
|
377 | |
329 | #if 0 |
378 | #if 0 |
330 | template<typename T> |
379 | template<typename T> |
331 | struct rxvt_vec : simplevec<void *> { |
380 | struct rxvt_vec : simplevec<void *> { |
332 | typedef T *iterator; |
381 | typedef T *iterator; |
333 | |
382 | |
… | |
… | |
338 | iterator begin () const { return (iterator)simplevec<void *>::begin (); } |
387 | iterator begin () const { return (iterator)simplevec<void *>::begin (); } |
339 | iterator end () const { return (iterator)simplevec<void *>::end (); } |
388 | iterator end () const { return (iterator)simplevec<void *>::end (); } |
340 | T &operator [] (int i) { return * (T *) (& ((* (simplevec<void *> *)this)[i])); } |
389 | T &operator [] (int i) { return * (T *) (& ((* (simplevec<void *> *)this)[i])); } |
341 | const T &operator [] (int i) const { return * (const T *) (& ((* (const simplevec<void *> *)this)[i])); } |
390 | const T &operator [] (int i) const { return * (const T *) (& ((* (const simplevec<void *> *)this)[i])); } |
342 | }; |
391 | }; |
343 | #endif |
|
|
344 | |
|
|
345 | template <typename I, typename T> |
|
|
346 | I find (I first, I last, const T& value) |
|
|
347 | { |
|
|
348 | while (first != last && *first != value) |
|
|
349 | ++first; |
|
|
350 | |
|
|
351 | return first; |
|
|
352 | } |
|
|
353 | |
392 | |
354 | template<typename T> |
393 | template<typename T> |
355 | struct auto_ptr { |
394 | struct auto_ptr { |
356 | T *p; |
395 | T *p; |
357 | |
396 | |
… | |
… | |
408 | return r; |
447 | return r; |
409 | } |
448 | } |
410 | }; |
449 | }; |
411 | |
450 | |
412 | typedef auto_ptr<char> auto_str; |
451 | typedef auto_ptr<char> auto_str; |
413 | |
|
|
414 | struct stringvec : simplevec<char *> |
|
|
415 | { |
|
|
416 | ~stringvec () |
|
|
417 | { |
|
|
418 | for (char **c = begin (); c != end (); c++) |
|
|
419 | free (*c); |
|
|
420 | } |
|
|
421 | }; |
|
|
422 | |
|
|
423 | // return a very temporary (and never deallocated) buffer. keep small. |
|
|
424 | void *rxvt_temp_buf (int len); |
|
|
425 | |
|
|
426 | template<typename T> |
|
|
427 | inline T * |
|
|
428 | rxvt_temp_buf (int len) |
|
|
429 | { |
|
|
430 | return (T *)rxvt_temp_buf (len * sizeof (T)); |
|
|
431 | } |
|
|
432 | |
|
|
433 | #endif |
452 | #endif |
434 | |
453 | |
|
|
454 | #endif |
|
|
455 | |