… | |
… | |
11 | #define PP_STRINGIFY_(a) #a |
11 | #define PP_STRINGIFY_(a) #a |
12 | #define PP_STRINGIFY(a) PP_STRINGIFY_(a) |
12 | #define PP_STRINGIFY(a) PP_STRINGIFY_(a) |
13 | |
13 | |
14 | #define HAVE_GCC_BUILTINS (__GNUC__ >= 4 || (__GNUC__ == 3 && __GNUC_MINOR__ == 4)) |
14 | #define HAVE_GCC_BUILTINS (__GNUC__ >= 4 || (__GNUC__ == 3 && __GNUC_MINOR__ == 4)) |
15 | |
15 | |
16 | #ifndef __attribute__ |
|
|
17 | # if __GNUC__ |
16 | #if __GNUC__ >= 4 |
18 | # if (__GNUC__ == 2 && __GNUC_MINOR__ < 5) || (__GNUC__ < 2) |
17 | # define rxvt_attribute(x) __attribute__(x) |
19 | # define __attribute__(x) |
18 | # define expect(expr,value) __builtin_expect ((expr),(value)) |
20 | # endif |
19 | #else |
21 | # endif |
|
|
22 | # define __attribute__(x) |
20 | # define rxvt_attribute(x) |
|
|
21 | # define expect(expr,value) (expr) |
23 | #endif |
22 | #endif |
24 | |
23 | |
|
|
24 | // put into ifs if you are very sure that the expression |
|
|
25 | // is mostly true or mostly false. note that these return |
|
|
26 | // booleans, not the expression. |
|
|
27 | #define expect_false(expr) expect ((expr) != 0, 0) |
|
|
28 | #define expect_true(expr) expect ((expr) != 0, 1) |
|
|
29 | |
25 | #define NORETURN __attribute__ ((noreturn)) |
30 | #define NORETURN rxvt_attribute ((noreturn)) |
26 | #define UNUSED __attribute__ ((unused)) |
31 | #define UNUSED rxvt_attribute ((unused)) |
27 | #define CONST __attribute__ ((const)) |
32 | #define CONST rxvt_attribute ((const)) |
28 | |
33 | |
29 | // increases code size unless -fno-enforce-eh-specs |
34 | // increases code size unless -fno-enforce-eh-specs |
30 | #if __GNUC__ |
35 | #if __GNUC__ |
31 | # define NOTHROW |
36 | # define NOTHROW |
32 | # define THROW(x) |
37 | # define THROW(x) |
… | |
… | |
65 | T lerp (T a, U b, P p) |
70 | T lerp (T a, U b, P p) |
66 | { |
71 | { |
67 | return (long(a) * long(100 - p) + long(b) * long(p) + 50) / 100; |
72 | return (long(a) * long(100 - p) + long(b) * long(p) + 50) / 100; |
68 | } |
73 | } |
69 | |
74 | |
|
|
75 | template <typename I, typename T> |
|
|
76 | I find (I first, I last, const T& value) |
|
|
77 | { |
|
|
78 | while (first != last && *first != value) |
|
|
79 | ++first; |
|
|
80 | |
|
|
81 | return first; |
|
|
82 | } |
|
|
83 | |
|
|
84 | // return a very temporary (and never deallocated) buffer. keep small. |
|
|
85 | void *rxvt_temp_buf (int len); |
|
|
86 | |
|
|
87 | template<typename T> |
|
|
88 | static inline T * |
|
|
89 | rxvt_temp_buf (int len) |
|
|
90 | { |
|
|
91 | return (T *)rxvt_temp_buf (len * sizeof (T)); |
|
|
92 | } |
|
|
93 | |
70 | // some bit functions, xft fuck me plenty |
94 | // some bit functions, xft fuck me plenty |
71 | #if HAVE_GCC_BUILTINS |
95 | #if HAVE_GCC_BUILTINS |
|
|
96 | /* netbsd stupidly defines popcount itself and puts it into string.h */ |
72 | static inline int ctz (unsigned int x) CONST { return __builtin_ctz (x); } |
97 | static inline int rxvt_ctz (unsigned int x) { return __builtin_ctz (x); } |
73 | static inline int popcount (unsigned int x) CONST { return __builtin_popcount (x); } |
98 | static inline int rxvt_popcount (unsigned int x) { return __builtin_popcount (x); } |
74 | #else |
99 | #else |
75 | // count trailing zero bits and count # of one bits |
100 | // count trailing zero bits and count # of one bits |
76 | int ctz (unsigned int x) CONST; |
101 | int rxvt_ctz (unsigned int x) CONST; |
77 | int popcount (unsigned int x) CONST; |
102 | int rxvt_popcount (unsigned int x) CONST; |
78 | #endif |
103 | #endif |
79 | |
104 | |
80 | // in range including end |
105 | // in range including end |
81 | #define IN_RANGE_INC(val,beg,end) \ |
106 | #define IN_RANGE_INC(val,beg,end) \ |
82 | ((unsigned int)(val) - (unsigned int)(beg) <= (unsigned int)(end) - (unsigned int)(beg)) |
107 | ((unsigned int)(val) - (unsigned int)(beg) <= (unsigned int)(end) - (unsigned int)(beg)) |
83 | |
108 | |
84 | // in range excluding end |
109 | // in range excluding end |
85 | #define IN_RANGE_EXC(val,beg,end) \ |
110 | #define IN_RANGE_EXC(val,beg,end) \ |
86 | ((unsigned int)(val) - (unsigned int)(beg) < (unsigned int)(end) - (unsigned int)(beg)) |
111 | ((unsigned int)(val) - (unsigned int)(beg) < (unsigned int)(end) - (unsigned int)(beg)) |
87 | |
112 | |
|
|
113 | // for m >= -n, ensure remainder lies between 0..n-1 |
|
|
114 | #define MOD(m,n) (((m) + (n)) % (n)) |
|
|
115 | |
88 | // makes dynamically allocated objects zero-initialised |
116 | // makes dynamically allocated objects zero-initialised |
89 | struct zero_initialized { |
117 | struct zero_initialized |
|
|
118 | { |
90 | void *operator new (size_t s); |
119 | void *operator new (size_t s); |
91 | void operator delete (void *p, size_t s); |
120 | void operator delete (void *p, size_t s); |
92 | }; |
121 | }; |
93 | |
122 | |
94 | /* simplevec taken (and heavily modified), from: |
123 | /* simplevec taken (and heavily modified), from: |
95 | * |
124 | * |
96 | * MICO --- a free CORBA implementation |
125 | * MICO --- a free CORBA implementation |
97 | * Copyright (C) 1997-98 Kay Roemer & Arno Puder |
126 | * Copyright (C) 1997-98 Kay Roemer & Arno Puder |
98 | */ |
127 | */ |
99 | template<class T> |
128 | template<class T> |
100 | struct simplevec { |
129 | struct simplevec |
|
|
130 | { |
101 | typedef T* iterator; |
131 | typedef T* iterator; |
102 | typedef const T* const_iterator; |
132 | typedef const T* const_iterator; |
103 | typedef unsigned long size_type; |
133 | typedef unsigned long size_type; |
104 | |
134 | |
105 | private: |
135 | private: |
… | |
… | |
346 | } |
376 | } |
347 | |
377 | |
348 | |
378 | |
349 | template<typename T> |
379 | template<typename T> |
350 | struct vector : simplevec<T> |
380 | struct vector : simplevec<T> |
351 | { }; |
381 | { |
|
|
382 | }; |
|
|
383 | |
|
|
384 | struct stringvec : simplevec<char *> |
|
|
385 | { |
|
|
386 | ~stringvec () |
|
|
387 | { |
|
|
388 | for (char **c = begin (); c != end (); c++) |
|
|
389 | free (*c); |
|
|
390 | } |
|
|
391 | }; |
352 | |
392 | |
353 | #if 0 |
393 | #if 0 |
354 | template<typename T> |
394 | template<typename T> |
355 | struct rxvt_vec : simplevec<void *> { |
395 | struct rxvt_vec : simplevec<void *> |
|
|
396 | { |
356 | typedef T *iterator; |
397 | typedef T *iterator; |
357 | |
398 | |
358 | void push_back (T d) { simplevec<void *>::push_back ((void *)d); } |
399 | void push_back (T d) { simplevec<void *>::push_back ((void *)d); } |
359 | T pop_back () { return (T*)simplevec<void *>::pop_back (); } |
400 | T pop_back () { return (T*)simplevec<void *>::pop_back (); } |
360 | void erase (int i) { erase (begin () + i); } |
401 | void erase (int i) { erase (begin () + i); } |
… | |
… | |
364 | T &operator [] (int i) { return * (T *) (& ((* (simplevec<void *> *)this)[i])); } |
405 | 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])); } |
406 | const T &operator [] (int i) const { return * (const T *) (& ((* (const simplevec<void *> *)this)[i])); } |
366 | }; |
407 | }; |
367 | #endif |
408 | #endif |
368 | |
409 | |
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> |
410 | template<typename T> |
379 | struct auto_ptr { |
411 | struct auto_ptr |
|
|
412 | { |
380 | T *p; |
413 | T *p; |
381 | |
414 | |
382 | auto_ptr () : p (0) { } |
415 | auto_ptr () : p (0) { } |
383 | auto_ptr (T *a) : p (a) { } |
416 | auto_ptr (T *a) : p (a) { } |
384 | |
417 | |
… | |
… | |
433 | } |
466 | } |
434 | }; |
467 | }; |
435 | |
468 | |
436 | typedef auto_ptr<char> auto_str; |
469 | typedef auto_ptr<char> auto_str; |
437 | |
470 | |
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 |
471 | #endif |
458 | |
472 | |