… | |
… | |
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 | #if __GNUC__ >= 3 |
16 | #if __GNUC__ >= 4 |
17 | # define rxvt_attribute(x) __attribute__(x) |
17 | # define rxvt_attribute(x) __attribute__(x) |
|
|
18 | # define expect(expr,value) __builtin_expect ((expr),(value)) |
18 | #else |
19 | #else |
19 | # define rxvt_attribute(x) |
20 | # define rxvt_attribute(x) |
|
|
21 | # define expect(expr,value) (expr) |
20 | #endif |
22 | #endif |
|
|
23 | |
|
|
24 | // put into ifs if you are very sure that the expression |
|
|
25 | // is mostly true or mosty 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) |
21 | |
29 | |
22 | #define NORETURN rxvt_attribute ((noreturn)) |
30 | #define NORETURN rxvt_attribute ((noreturn)) |
23 | #define UNUSED rxvt_attribute ((unused)) |
31 | #define UNUSED rxvt_attribute ((unused)) |
24 | #define CONST rxvt_attribute ((const)) |
32 | #define CONST rxvt_attribute ((const)) |
25 | |
33 | |
… | |
… | |
60 | template<typename T, typename U, typename P> |
68 | template<typename T, typename U, typename P> |
61 | static inline |
69 | static inline |
62 | T lerp (T a, U b, P p) |
70 | T lerp (T a, U b, P p) |
63 | { |
71 | { |
64 | 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; |
|
|
73 | } |
|
|
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)); |
65 | } |
92 | } |
66 | |
93 | |
67 | // some bit functions, xft fuck me plenty |
94 | // some bit functions, xft fuck me plenty |
68 | #if HAVE_GCC_BUILTINS |
95 | #if HAVE_GCC_BUILTINS |
69 | static inline int ctz (unsigned int x) { return __builtin_ctz (x); } |
96 | static inline int ctz (unsigned int x) { return __builtin_ctz (x); } |
… | |
… | |
80 | |
107 | |
81 | // in range excluding end |
108 | // in range excluding end |
82 | #define IN_RANGE_EXC(val,beg,end) \ |
109 | #define IN_RANGE_EXC(val,beg,end) \ |
83 | ((unsigned int)(val) - (unsigned int)(beg) < (unsigned int)(end) - (unsigned int)(beg)) |
110 | ((unsigned int)(val) - (unsigned int)(beg) < (unsigned int)(end) - (unsigned int)(beg)) |
84 | |
111 | |
|
|
112 | // for m >= -n, ensure remainder lies between 0..n-1 |
|
|
113 | #define MOD(m,n) (((m) + (n)) % (n)) |
|
|
114 | |
85 | // makes dynamically allocated objects zero-initialised |
115 | // makes dynamically allocated objects zero-initialised |
86 | struct zero_initialized { |
116 | struct zero_initialized |
|
|
117 | { |
87 | void *operator new (size_t s); |
118 | void *operator new (size_t s); |
88 | void operator delete (void *p, size_t s); |
119 | void operator delete (void *p, size_t s); |
89 | }; |
120 | }; |
90 | |
121 | |
91 | /* simplevec taken (and heavily modified), from: |
122 | /* simplevec taken (and heavily modified), from: |
92 | * |
123 | * |
93 | * MICO --- a free CORBA implementation |
124 | * MICO --- a free CORBA implementation |
94 | * Copyright (C) 1997-98 Kay Roemer & Arno Puder |
125 | * Copyright (C) 1997-98 Kay Roemer & Arno Puder |
95 | */ |
126 | */ |
96 | template<class T> |
127 | template<class T> |
97 | struct simplevec { |
128 | struct simplevec |
|
|
129 | { |
98 | typedef T* iterator; |
130 | typedef T* iterator; |
99 | typedef const T* const_iterator; |
131 | typedef const T* const_iterator; |
100 | typedef unsigned long size_type; |
132 | typedef unsigned long size_type; |
101 | |
133 | |
102 | private: |
134 | private: |
… | |
… | |
343 | } |
375 | } |
344 | |
376 | |
345 | |
377 | |
346 | template<typename T> |
378 | template<typename T> |
347 | struct vector : simplevec<T> |
379 | struct vector : simplevec<T> |
348 | { }; |
380 | { |
|
|
381 | }; |
|
|
382 | |
|
|
383 | struct stringvec : simplevec<char *> |
|
|
384 | { |
|
|
385 | ~stringvec () |
|
|
386 | { |
|
|
387 | for (char **c = begin (); c != end (); c++) |
|
|
388 | free (*c); |
|
|
389 | } |
|
|
390 | }; |
349 | |
391 | |
350 | #if 0 |
392 | #if 0 |
351 | template<typename T> |
393 | template<typename T> |
352 | struct rxvt_vec : simplevec<void *> { |
394 | struct rxvt_vec : simplevec<void *> |
|
|
395 | { |
353 | typedef T *iterator; |
396 | typedef T *iterator; |
354 | |
397 | |
355 | void push_back (T d) { simplevec<void *>::push_back ((void *)d); } |
398 | void push_back (T d) { simplevec<void *>::push_back ((void *)d); } |
356 | T pop_back () { return (T*)simplevec<void *>::pop_back (); } |
399 | T pop_back () { return (T*)simplevec<void *>::pop_back (); } |
357 | void erase (int i) { erase (begin () + i); } |
400 | void erase (int i) { erase (begin () + i); } |
… | |
… | |
361 | T &operator [] (int i) { return * (T *) (& ((* (simplevec<void *> *)this)[i])); } |
404 | T &operator [] (int i) { return * (T *) (& ((* (simplevec<void *> *)this)[i])); } |
362 | const T &operator [] (int i) const { return * (const T *) (& ((* (const simplevec<void *> *)this)[i])); } |
405 | const T &operator [] (int i) const { return * (const T *) (& ((* (const simplevec<void *> *)this)[i])); } |
363 | }; |
406 | }; |
364 | #endif |
407 | #endif |
365 | |
408 | |
366 | template <typename I, typename T> |
|
|
367 | I find (I first, I last, const T& value) |
|
|
368 | { |
|
|
369 | while (first != last && *first != value) |
|
|
370 | ++first; |
|
|
371 | |
|
|
372 | return first; |
|
|
373 | } |
|
|
374 | |
|
|
375 | template<typename T> |
409 | template<typename T> |
376 | struct auto_ptr { |
410 | struct auto_ptr |
|
|
411 | { |
377 | T *p; |
412 | T *p; |
378 | |
413 | |
379 | auto_ptr () : p (0) { } |
414 | auto_ptr () : p (0) { } |
380 | auto_ptr (T *a) : p (a) { } |
415 | auto_ptr (T *a) : p (a) { } |
381 | |
416 | |
… | |
… | |
430 | } |
465 | } |
431 | }; |
466 | }; |
432 | |
467 | |
433 | typedef auto_ptr<char> auto_str; |
468 | typedef auto_ptr<char> auto_str; |
434 | |
469 | |
435 | struct stringvec : simplevec<char *> |
|
|
436 | { |
|
|
437 | ~stringvec () |
|
|
438 | { |
|
|
439 | for (char **c = begin (); c != end (); c++) |
|
|
440 | free (*c); |
|
|
441 | } |
|
|
442 | }; |
|
|
443 | |
|
|
444 | // return a very temporary (and never deallocated) buffer. keep small. |
|
|
445 | void *rxvt_temp_buf (int len); |
|
|
446 | |
|
|
447 | template<typename T> |
|
|
448 | static inline T * |
|
|
449 | rxvt_temp_buf (int len) |
|
|
450 | { |
|
|
451 | return (T *)rxvt_temp_buf (len * sizeof (T)); |
|
|
452 | } |
|
|
453 | |
|
|
454 | #endif |
470 | #endif |
455 | |
471 | |