| 1 |
/*--------------------------------*-C-*---------------------------------* |
| 2 |
* File: rxvtutil.C |
| 3 |
*----------------------------------------------------------------------* |
| 4 |
* |
| 5 |
* All portions of code are copyright by their respective author/s. |
| 6 |
* Copyright (c) 2004-2006 Marc Lehmann <pcg@goof.com> |
| 7 |
* |
| 8 |
* This program is free software; you can redistribute it and/or modify |
| 9 |
* it under the terms of the GNU General Public License as published by |
| 10 |
* the Free Software Foundation; either version 2 of the License, or |
| 11 |
* (at your option) any later version. |
| 12 |
* |
| 13 |
* This program is distributed in the hope that it will be useful, |
| 14 |
* but WITHOUT ANY WARRANTY; without even the implied warranty of |
| 15 |
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
| 16 |
* GNU General Public License for more details. |
| 17 |
* |
| 18 |
* You should have received a copy of the GNU General Public License |
| 19 |
* along with this program; if not, write to the Free Software |
| 20 |
* Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. |
| 21 |
*----------------------------------------------------------------------*/ |
| 22 |
|
| 23 |
#include <cstdlib> |
| 24 |
#include <cstring> |
| 25 |
#include <inttypes.h> |
| 26 |
|
| 27 |
#include "rxvtutil.h" |
| 28 |
|
| 29 |
class byteorder byteorder; |
| 30 |
|
| 31 |
unsigned int byteorder::e; |
| 32 |
|
| 33 |
byteorder::byteorder () |
| 34 |
{ |
| 35 |
union { |
| 36 |
uint32_t u; |
| 37 |
uint8_t b[4]; |
| 38 |
} w; |
| 39 |
|
| 40 |
w.b[0] = 0x11; |
| 41 |
w.b[1] = 0x22; |
| 42 |
w.b[2] = 0x33; |
| 43 |
w.b[3] = 0x44; |
| 44 |
|
| 45 |
e = w.u; |
| 46 |
} |
| 47 |
|
| 48 |
#if !HAVE_GCC_BUILTINS |
| 49 |
int ctz (unsigned int x) CONST |
| 50 |
{ |
| 51 |
int r = 0; |
| 52 |
|
| 53 |
x &= -x; // this isolates the lowest bit |
| 54 |
|
| 55 |
if (x & 0xaaaaaaaa) r += 1; |
| 56 |
if (x & 0xcccccccc) r += 2; |
| 57 |
if (x & 0xf0f0f0f0) r += 4; |
| 58 |
if (x & 0xff00ff00) r += 8; |
| 59 |
if (x & 0xffff0000) r += 16; |
| 60 |
|
| 61 |
return r; |
| 62 |
} |
| 63 |
|
| 64 |
int popcount (unsigned int x) CONST |
| 65 |
{ |
| 66 |
x -= (x >> 1) & 0x55555555; |
| 67 |
x = ((x >> 2) & 0x33333333) + (x & 0x33333333); |
| 68 |
x = ((x >> 4) + x) & 0x0f0f0f0f; |
| 69 |
x *= 0x01010101; |
| 70 |
|
| 71 |
return x >> 24; |
| 72 |
} |
| 73 |
#endif |
| 74 |
|
| 75 |
void * |
| 76 |
zero_initialized::operator new (size_t s) |
| 77 |
{ |
| 78 |
void *p = malloc (s); |
| 79 |
|
| 80 |
memset (p, 0, s); |
| 81 |
return p; |
| 82 |
} |
| 83 |
|
| 84 |
void |
| 85 |
zero_initialized::operator delete (void *p, size_t s) |
| 86 |
{ |
| 87 |
free (p); |
| 88 |
} |
| 89 |
|
| 90 |
static void *temp_buf; |
| 91 |
static uint32_t temp_len; |
| 92 |
|
| 93 |
void * |
| 94 |
rxvt_temp_buf (int len) |
| 95 |
{ |
| 96 |
if (len > temp_len) |
| 97 |
{ |
| 98 |
free (temp_buf); |
| 99 |
temp_buf = malloc (len); |
| 100 |
temp_len = len; |
| 101 |
} |
| 102 |
|
| 103 |
return temp_buf; |
| 104 |
} |
| 105 |
|
| 106 |
|
