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