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