rxvt-unicode/src/rxvtutil.C

/*----------------------------------------------------------------------*
 * File:        rxvtutil.C
 *----------------------------------------------------------------------*
 *
 * All portions of code are copyright by their respective author/s.
 * Copyright (c) 2004-2006 Marc Lehmann <pcg@goof.com>
 *
 * This program is free software; you can redistribute it and/or modify
 * it under the terms of the GNU General Public License as published by
 * the Free Software Foundation; either version 2 of the License, or
 * (at your option) any later version.
 *
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with this program; if not, write to the Free Software
 * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
 *----------------------------------------------------------------------*/

#include <cstdlib>
#include <cstring>
#include <inttypes.h>

#include "rxvtutil.h"

class byteorder byteorder;

unsigned int byteorder::e;

byteorder::byteorder ()
{
  union {
    uint32_t u;
    uint8_t b[4];
  } w;

  w.b[0] = 0x11;
  w.b[1] = 0x22;
  w.b[2] = 0x33;
  w.b[3] = 0x44;

  e = w.u;
}

#if !HAVE_GCC_BUILTINS
int rxvt_ctz (unsigned int x) CONST
{
  int r = 0;

  x &= -x; // this isolates the lowest bit

  if (x & 0xaaaaaaaa) r +=  1;
  if (x & 0xcccccccc) r +=  2;
  if (x & 0xf0f0f0f0) r +=  4;
  if (x & 0xff00ff00) r +=  8;
  if (x & 0xffff0000) r += 16;

  return r;
}

int rxvt_popcount (unsigned int x) CONST
{
  x -=  (x >> 1) & 0x55555555;
  x  = ((x >> 2) & 0x33333333) + (x & 0x33333333);
  x  = ((x >> 4) + x) & 0x0f0f0f0f;
  x *= 0x01010101;

  return x >> 24;
}
#endif

void *
zero_initialized::operator new (size_t s)
{
  void *p = malloc (s);

  memset (p, 0, s);
  return p;
}

void
zero_initialized::operator delete (void *p, size_t s)
{
  free (p);
}

static void *temp_buf;
static uint32_t temp_len;

void *
rxvt_temp_buf (int len)
{
  if (len > temp_len)
    {
      temp_buf = realloc (temp_buf, len);
      temp_len = len;
    }

  return temp_buf;
}


Revision:	1.10
Committed:	Fri Sep 4 15:40:13 2009 UTC (17 years ago) by root
Content type:	text/plain
Branch:	MAIN
CVS Tags:	before_dynamic_fontidx, rel-9_10, dynamic_fontidx, rel-9_09, rel-9_07
Changes since 1.9:	+2 -2 lines
Log Message:	* empty log message *
#	User	Rev	Content
1	root	1.7	/----------------------------------------------------------------------
2	root	1.6	* 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	root	1.1	#include <cstdlib>
24			#include <cstring>
25			#include <inttypes.h>
26
27			#include "rxvtutil.h"
28
29			class byteorder byteorder;
30
31	root	1.2	unsigned int byteorder::e;
32
33	root	1.1	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	root	1.4	#if !HAVE_GCC_BUILTINS
49	root	1.10	int rxvt_ctz (unsigned int x) CONST
50	root	1.4	{
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	root	1.10	int rxvt_popcount (unsigned int x) CONST
65	root	1.4	{
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	root	1.2	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	root	1.3	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	ayin	1.9	{
98	ayin	1.8	temp_buf = realloc (temp_buf, len);
99	root	1.3	temp_len = len;
100			}
101	ayin	1.9
102	root	1.3	return temp_buf;
103			}
104	root	1.1
105