|
|
1 | /*----------------------------------------------------------------------* |
|
|
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 <schmorp@schmorp.de> |
|
|
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 | |
1 | #include <cstdlib> |
23 | #include <cstdlib> |
2 | #include <cstring> |
24 | #include <cstring> |
3 | #include <inttypes.h> |
|
|
4 | |
25 | |
5 | #include "rxvtutil.h" |
26 | #include "rxvtutil.h" |
6 | |
|
|
7 | class byteorder byteorder; |
|
|
8 | |
|
|
9 | unsigned int byteorder::e; |
|
|
10 | |
|
|
11 | byteorder::byteorder () |
|
|
12 | { |
|
|
13 | union { |
|
|
14 | uint32_t u; |
|
|
15 | uint8_t b[4]; |
|
|
16 | } w; |
|
|
17 | |
|
|
18 | w.b[0] = 0x11; |
|
|
19 | w.b[1] = 0x22; |
|
|
20 | w.b[2] = 0x33; |
|
|
21 | w.b[3] = 0x44; |
|
|
22 | |
|
|
23 | e = w.u; |
|
|
24 | } |
|
|
25 | |
|
|
26 | #if !HAVE_GCC_BUILTINS |
|
|
27 | int ctz (unsigned int x) |
|
|
28 | { |
|
|
29 | int r = 0; |
|
|
30 | |
|
|
31 | x &= -x; // this isolates the lowest bit |
|
|
32 | |
|
|
33 | if (x & 0xaaaaaaaa) r += 1; |
|
|
34 | if (x & 0xcccccccc) r += 2; |
|
|
35 | if (x & 0xf0f0f0f0) r += 4; |
|
|
36 | if (x & 0xff00ff00) r += 8; |
|
|
37 | if (x & 0xffff0000) r += 16; |
|
|
38 | |
|
|
39 | return r; |
|
|
40 | } |
|
|
41 | |
|
|
42 | int popcount (unsigned int x) |
|
|
43 | { |
|
|
44 | x -= (x >> 1) & 0x55555555; |
|
|
45 | x = ((x >> 2) & 0x33333333) + (x & 0x33333333); |
|
|
46 | x = ((x >> 4) + x) & 0x0f0f0f0f; |
|
|
47 | x *= 0x01010101; |
|
|
48 | |
|
|
49 | return x >> 24; |
|
|
50 | } |
|
|
51 | #endif |
|
|
52 | |
27 | |
53 | void * |
28 | void * |
54 | zero_initialized::operator new (size_t s) |
29 | zero_initialized::operator new (size_t s) |
55 | { |
30 | { |
56 | void *p = malloc (s); |
31 | void *p = malloc (s); |
… | |
… | |
70 | |
45 | |
71 | void * |
46 | void * |
72 | rxvt_temp_buf (int len) |
47 | rxvt_temp_buf (int len) |
73 | { |
48 | { |
74 | if (len > temp_len) |
49 | if (len > temp_len) |
75 | { |
50 | { |
76 | free (temp_buf); |
51 | free (temp_buf); |
77 | temp_buf = malloc (len); |
52 | temp_buf = malloc (len); |
78 | temp_len = len; |
53 | temp_len = len; |
79 | } |
54 | } |
80 | |
55 | |
81 | return temp_buf; |
56 | return temp_buf; |
82 | } |
57 | } |
83 | |
58 | |
84 | |
59 | |