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 | #include <inttypes.h> |
|
|
7 | #include "ecb.h" |
6 | |
8 | |
7 | using namespace std; |
9 | using namespace std; |
8 | |
|
|
9 | #define PP_CONCAT_(a, b) a ## b |
|
|
10 | #define PP_CONCAT(a, b) PP_CONCAT_(a, b) |
|
|
11 | #define PP_STRINGIFY_(a) #a |
|
|
12 | #define PP_STRINGIFY(a) PP_STRINGIFY_(a) |
|
|
13 | |
|
|
14 | #define HAVE_GCC_BUILTINS (__GNUC__ >= 4 || (__GNUC__ == 3 && __GNUC_MINOR__ == 4)) |
|
|
15 | |
|
|
16 | #ifndef __attribute__ |
|
|
17 | # if __GNUC__ |
|
|
18 | # if (__GNUC__ == 2 && __GNUC_MINOR__ < 5) || (__GNUC__ < 2) |
|
|
19 | # define __attribute__(x) |
|
|
20 | # endif |
|
|
21 | # endif |
|
|
22 | # define __attribute__(x) |
|
|
23 | #endif |
|
|
24 | |
|
|
25 | #define NORETURN __attribute__ ((noreturn)) |
|
|
26 | #define UNUSED __attribute__ ((unused)) |
|
|
27 | #define CONST __attribute__ ((const)) |
|
|
28 | |
10 | |
29 | // increases code size unless -fno-enforce-eh-specs |
11 | // increases code size unless -fno-enforce-eh-specs |
30 | #if __GNUC__ |
12 | #if __GNUC__ |
31 | # define NOTHROW |
13 | # define NOTHROW |
32 | # define THROW(x) |
14 | # define THROW(x) |
33 | #else |
15 | #else |
34 | # define NOTHROW throw() |
16 | # define NOTHROW throw() |
35 | # define THROW(x) throw x |
17 | # define THROW(x) throw x |
36 | #endif |
18 | #endif |
37 | |
19 | |
38 | extern class byteorder { |
|
|
39 | static unsigned int e; // at least 32 bits |
|
|
40 | public: |
|
|
41 | byteorder (); |
|
|
42 | |
|
|
43 | static bool big_endian () { return e == 0x11223344; }; |
|
|
44 | static bool network () { return e == 0x11223344; }; |
|
|
45 | static bool little_endian () { return e == 0x44332211; }; |
|
|
46 | static bool vax () { return e == 0x44332211; }; |
|
|
47 | } byteorder; |
|
|
48 | |
|
|
49 | // various utility functions |
20 | // various utility functions |
50 | template<typename T, typename U> static inline T min (T a, U b) { return a < (T)b ? a : (T)b; } |
21 | template<typename T, typename U> static inline T min (T a, U b) { return a < (T)b ? a : (T)b; } |
51 | template<typename T, typename U> static inline void min_it (T &a, U b) { a = a < (T)b ? a : (T)b; } |
22 | template<typename T, typename U> static inline void min_it (T &a, U b) { a = a < (T)b ? a : (T)b; } |
52 | template<typename T, typename U> static inline T max (T a, U b) { return a > (T)b ? a : (T)b; } |
23 | template<typename T, typename U> static inline T max (T a, U b) { return a > (T)b ? a : (T)b; } |
53 | template<typename T, typename U> static inline void max_it (T &a, U b) { a = a > (T)b ? a : (T)b; } |
24 | template<typename T, typename U> static inline void max_it (T &a, U b) { a = a > (T)b ? a : (T)b; } |
… | |
… | |
65 | T lerp (T a, U b, P p) |
36 | T lerp (T a, U b, P p) |
66 | { |
37 | { |
67 | return (long(a) * long(100 - p) + long(b) * long(p) + 50) / 100; |
38 | return (long(a) * long(100 - p) + long(b) * long(p) + 50) / 100; |
68 | } |
39 | } |
69 | |
40 | |
70 | // some bit functions, xft fuck me plenty |
41 | template <typename I, typename T> |
71 | #if HAVE_GCC_BUILTINS |
42 | I find (I first, I last, const T& value) |
72 | static inline int ctz (unsigned int x) CONST { return __builtin_ctz (x); } |
43 | { |
73 | static inline int popcount (unsigned int x) CONST { return __builtin_popcount (x); } |
44 | while (first != last && *first != value) |
74 | #else |
45 | ++first; |
75 | // count trailing zero bits and count # of one bits |
46 | |
76 | int ctz (unsigned int x) CONST; |
47 | return first; |
77 | int popcount (unsigned int x) CONST; |
48 | } |
78 | #endif |
49 | |
|
|
50 | // return a very temporary (and never deallocated) buffer. keep small. |
|
|
51 | void *rxvt_temp_buf (int len); |
|
|
52 | |
|
|
53 | template<typename T> |
|
|
54 | static inline T * |
|
|
55 | rxvt_temp_buf (int len) |
|
|
56 | { |
|
|
57 | return (T *)rxvt_temp_buf (len * sizeof (T)); |
|
|
58 | } |
79 | |
59 | |
80 | // in range including end |
60 | // in range including end |
81 | #define IN_RANGE_INC(val,beg,end) \ |
61 | #define IN_RANGE_INC(val,beg,end) \ |
82 | ((unsigned int)(val) - (unsigned int)(beg) <= (unsigned int)(end) - (unsigned int)(beg)) |
62 | ((unsigned int)(val) - (unsigned int)(beg) <= (unsigned int)(end) - (unsigned int)(beg)) |
83 | |
63 | |
84 | // in range excluding end |
64 | // in range excluding end |
85 | #define IN_RANGE_EXC(val,beg,end) \ |
65 | #define IN_RANGE_EXC(val,beg,end) \ |
86 | ((unsigned int)(val) - (unsigned int)(beg) < (unsigned int)(end) - (unsigned int)(beg)) |
66 | ((unsigned int)(val) - (unsigned int)(beg) < (unsigned int)(end) - (unsigned int)(beg)) |
87 | |
67 | |
|
|
68 | // for m >= -n, ensure remainder lies between 0..n-1 |
|
|
69 | #define MOD(m,n) (((m) + (n)) % (n)) |
|
|
70 | |
88 | // makes dynamically allocated objects zero-initialised |
71 | // makes dynamically allocated objects zero-initialised |
89 | struct zero_initialized { |
72 | struct zero_initialized |
|
|
73 | { |
90 | void *operator new (size_t s); |
74 | void *operator new (size_t s); |
91 | void operator delete (void *p, size_t s); |
75 | void operator delete (void *p, size_t s); |
92 | }; |
76 | }; |
93 | |
77 | |
94 | /* simplevec taken (and heavily modified), from: |
78 | /* simplevec taken (and heavily modified), from: |
95 | * |
79 | * |
96 | * MICO --- a free CORBA implementation |
80 | * MICO --- a free CORBA implementation |
97 | * Copyright (C) 1997-98 Kay Roemer & Arno Puder |
81 | * Copyright (C) 1997-98 Kay Roemer & Arno Puder |
98 | */ |
82 | */ |
99 | template<class T> |
83 | template<class T> |
100 | struct simplevec { |
84 | struct simplevec |
|
|
85 | { |
101 | typedef T* iterator; |
86 | typedef T* iterator; |
102 | typedef const T* const_iterator; |
87 | typedef const T* const_iterator; |
103 | typedef unsigned long size_type; |
88 | typedef unsigned long size_type; |
104 | |
89 | |
105 | private: |
90 | private: |
… | |
… | |
346 | } |
331 | } |
347 | |
332 | |
348 | |
333 | |
349 | template<typename T> |
334 | template<typename T> |
350 | struct vector : simplevec<T> |
335 | struct vector : simplevec<T> |
351 | { }; |
336 | { |
|
|
337 | }; |
|
|
338 | |
|
|
339 | struct stringvec : simplevec<char *> |
|
|
340 | { |
|
|
341 | ~stringvec () |
|
|
342 | { |
|
|
343 | for (char **c = begin (); c != end (); c++) |
|
|
344 | free (*c); |
|
|
345 | } |
|
|
346 | }; |
352 | |
347 | |
353 | #if 0 |
348 | #if 0 |
354 | template<typename T> |
349 | template<typename T> |
355 | struct rxvt_vec : simplevec<void *> { |
350 | struct rxvt_vec : simplevec<void *> |
|
|
351 | { |
356 | typedef T *iterator; |
352 | typedef T *iterator; |
357 | |
353 | |
358 | void push_back (T d) { simplevec<void *>::push_back ((void *)d); } |
354 | void push_back (T d) { simplevec<void *>::push_back ((void *)d); } |
359 | T pop_back () { return (T*)simplevec<void *>::pop_back (); } |
355 | T pop_back () { return (T*)simplevec<void *>::pop_back (); } |
360 | void erase (int i) { erase (begin () + i); } |
356 | void erase (int i) { erase (begin () + i); } |
… | |
… | |
364 | T &operator [] (int i) { return * (T *) (& ((* (simplevec<void *> *)this)[i])); } |
360 | T &operator [] (int i) { return * (T *) (& ((* (simplevec<void *> *)this)[i])); } |
365 | const T &operator [] (int i) const { return * (const T *) (& ((* (const simplevec<void *> *)this)[i])); } |
361 | const T &operator [] (int i) const { return * (const T *) (& ((* (const simplevec<void *> *)this)[i])); } |
366 | }; |
362 | }; |
367 | #endif |
363 | #endif |
368 | |
364 | |
369 | template <typename I, typename T> |
|
|
370 | I find (I first, I last, const T& value) |
|
|
371 | { |
|
|
372 | while (first != last && *first != value) |
|
|
373 | ++first; |
|
|
374 | |
|
|
375 | return first; |
|
|
376 | } |
|
|
377 | |
|
|
378 | template<typename T> |
365 | template<typename T> |
379 | struct auto_ptr { |
366 | struct auto_ptr |
|
|
367 | { |
380 | T *p; |
368 | T *p; |
381 | |
369 | |
382 | auto_ptr () : p (0) { } |
370 | auto_ptr () : p (0) { } |
383 | auto_ptr (T *a) : p (a) { } |
371 | auto_ptr (T *a) : p (a) { } |
384 | |
372 | |
… | |
… | |
433 | } |
421 | } |
434 | }; |
422 | }; |
435 | |
423 | |
436 | typedef auto_ptr<char> auto_str; |
424 | typedef auto_ptr<char> auto_str; |
437 | |
425 | |
438 | struct stringvec : simplevec<char *> |
|
|
439 | { |
|
|
440 | ~stringvec () |
|
|
441 | { |
|
|
442 | for (char **c = begin (); c != end (); c++) |
|
|
443 | free (*c); |
|
|
444 | } |
|
|
445 | }; |
|
|
446 | |
|
|
447 | // return a very temporary (and never deallocated) buffer. keep small. |
|
|
448 | void *rxvt_temp_buf (int len); |
|
|
449 | |
|
|
450 | template<typename T> |
|
|
451 | static inline T * |
|
|
452 | rxvt_temp_buf (int len) |
|
|
453 | { |
|
|
454 | return (T *)rxvt_temp_buf (len * sizeof (T)); |
|
|
455 | } |
|
|
456 | |
|
|
457 | #endif |
426 | #endif |
458 | |
427 | |