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 | |
|
|
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 |
14 | |
34 | |
15 | extern class byteorder { |
35 | extern class byteorder { |
16 | static unsigned int e; // at least 32 bits |
36 | static unsigned int e; // at least 32 bits |
17 | public: |
37 | public: |
18 | byteorder (); |
38 | byteorder (); |
… | |
… | |
32 | 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; } |
33 | 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; } |
34 | |
54 | |
35 | 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; } |
36 | |
56 | |
|
|
57 | template<typename T> static inline T squared_diff (T a, T b) { return (a-b)*(a-b); } |
|
|
58 | |
37 | // linear interpolation |
59 | // linear interpolation |
38 | template<typename T, typename U, typename P> |
60 | template<typename T, typename U, typename P> |
39 | static inline |
61 | static inline |
40 | T lerp (T a, U b, P p) |
62 | T lerp (T a, U b, P p) |
41 | { |
63 | { |
42 | 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)); |
43 | } |
84 | } |
44 | |
85 | |
45 | // some bit functions, xft fuck me plenty |
86 | // some bit functions, xft fuck me plenty |
46 | #if HAVE_GCC_BUILTINS |
87 | #if HAVE_GCC_BUILTINS |
47 | static inline int ctz (unsigned int x) { return __builtin_ctz (x); } |
88 | static inline int ctz (unsigned int x) { return __builtin_ctz (x); } |
48 | static inline int popcount (unsigned int x) { return __builtin_popcount (x); } |
89 | static inline int popcount (unsigned int x) { return __builtin_popcount (x); } |
49 | #else |
90 | #else |
50 | // count trailing zero bits and count # of one bits |
91 | // count trailing zero bits and count # of one bits |
51 | int ctz (unsigned int x); |
92 | int ctz (unsigned int x) CONST; |
52 | int popcount (unsigned int x); |
93 | int popcount (unsigned int x) CONST; |
53 | #endif |
94 | #endif |
54 | |
95 | |
55 | // in range including end |
96 | // in range including end |
56 | #define IN_RANGE_INC(val,beg,end) \ |
97 | #define IN_RANGE_INC(val,beg,end) \ |
57 | ((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)) |
58 | |
99 | |
59 | // in range excluding end |
100 | // in range excluding end |
60 | #define IN_RANGE_EXC(val,beg,end) \ |
101 | #define IN_RANGE_EXC(val,beg,end) \ |
61 | ((unsigned int)(val) - (unsigned int)(beg) < (unsigned int)(end) - (unsigned int)(beg)) |
102 | ((unsigned int)(val) - (unsigned int)(beg) < (unsigned int)(end) - (unsigned int)(beg)) |
|
|
103 | |
|
|
104 | // for m >= -n, ensure remainder lies between 0..n-1 |
|
|
105 | #define MOD(m,n) (((m) + (n)) % (n)) |
62 | |
106 | |
63 | // makes dynamically allocated objects zero-initialised |
107 | // makes dynamically allocated objects zero-initialised |
64 | struct zero_initialized { |
108 | struct zero_initialized { |
65 | void *operator new (size_t s); |
109 | void *operator new (size_t s); |
66 | void operator delete (void *p, size_t s); |
110 | void operator delete (void *p, size_t s); |
67 | }; |
111 | }; |
68 | |
112 | |
69 | /* simplevec taken (and heavily modified), from: |
113 | /* simplevec taken (and heavily modified), from: |
70 | * |
114 | * |
71 | * MICO --- a free CORBA implementation |
115 | * MICO --- a free CORBA implementation |
72 | * Copyright (C) 1997-98 Kay Roemer & Arno Puder |
116 | * Copyright (C) 1997-98 Kay Roemer & Arno Puder |
73 | */ |
117 | */ |
74 | template<class T> |
118 | template<class T> |
75 | struct simplevec { |
119 | struct simplevec { |
… | |
… | |
321 | } |
365 | } |
322 | |
366 | |
323 | |
367 | |
324 | template<typename T> |
368 | template<typename T> |
325 | struct vector : simplevec<T> |
369 | struct vector : simplevec<T> |
326 | { }; |
370 | { |
|
|
371 | }; |
|
|
372 | |
|
|
373 | struct stringvec : simplevec<char *> |
|
|
374 | { |
|
|
375 | ~stringvec () |
|
|
376 | { |
|
|
377 | for (char **c = begin (); c != end (); c++) |
|
|
378 | free (*c); |
|
|
379 | } |
|
|
380 | }; |
327 | |
381 | |
328 | #if 0 |
382 | #if 0 |
329 | template<typename T> |
383 | template<typename T> |
330 | struct rxvt_vec : simplevec<void *> { |
384 | struct rxvt_vec : simplevec<void *> { |
331 | typedef T *iterator; |
385 | typedef T *iterator; |
… | |
… | |
339 | T &operator [] (int i) { return * (T *) (& ((* (simplevec<void *> *)this)[i])); } |
393 | T &operator [] (int i) { return * (T *) (& ((* (simplevec<void *> *)this)[i])); } |
340 | const T &operator [] (int i) const { return * (const T *) (& ((* (const simplevec<void *> *)this)[i])); } |
394 | const T &operator [] (int i) const { return * (const T *) (& ((* (const simplevec<void *> *)this)[i])); } |
341 | }; |
395 | }; |
342 | #endif |
396 | #endif |
343 | |
397 | |
344 | template <typename I, typename T> |
|
|
345 | I find (I first, I last, const T& value) |
|
|
346 | { |
|
|
347 | while (first != last && *first != value) |
|
|
348 | ++first; |
|
|
349 | |
|
|
350 | return first; |
|
|
351 | } |
|
|
352 | |
|
|
353 | template<typename T> |
398 | template<typename T> |
354 | struct auto_ptr { |
399 | struct auto_ptr { |
355 | T *p; |
400 | T *p; |
356 | |
401 | |
357 | auto_ptr () : p (0) { } |
402 | auto_ptr () : p (0) { } |
… | |
… | |
408 | } |
453 | } |
409 | }; |
454 | }; |
410 | |
455 | |
411 | typedef auto_ptr<char> auto_str; |
456 | typedef auto_ptr<char> auto_str; |
412 | |
457 | |
413 | struct stringvec : simplevec<char *> |
|
|
414 | { |
|
|
415 | ~stringvec () |
|
|
416 | { |
|
|
417 | for (char **c = begin (); c != end (); c++) |
|
|
418 | free (*c); |
|
|
419 | } |
|
|
420 | }; |
|
|
421 | |
|
|
422 | // return a very temporary (and never deallocated) buffer. keep small. |
|
|
423 | void *rxvt_temp_buf (int len); |
|
|
424 | |
|
|
425 | template<typename T> |
|
|
426 | inline T * |
|
|
427 | rxvt_temp_buf (int len) |
|
|
428 | { |
|
|
429 | return (T *)rxvt_temp_buf (len * sizeof (T)); |
|
|
430 | } |
|
|
431 | |
|
|
432 | #endif |
458 | #endif |
433 | |
459 | |