/usr/include/directfb/direct/util.h is in libdirectfb-dev 1.2.10.0-5.1.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 | /*
(c) Copyright 2001-2008 The world wide DirectFB Open Source Community (directfb.org)
(c) Copyright 2000-2004 Convergence (integrated media) GmbH
All rights reserved.
Written by Denis Oliver Kropp <dok@directfb.org>,
Andreas Hundt <andi@fischlustig.de>,
Sven Neumann <neo@directfb.org>,
Ville Syrjälä <syrjala@sci.fi> and
Claudio Ciccani <klan@users.sf.net>.
This library is free software; you can redistribute it and/or
modify it under the terms of the GNU Lesser General Public
License as published by the Free Software Foundation; either
version 2 of the License, or (at your option) any later version.
This library 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
Lesser General Public License for more details.
You should have received a copy of the GNU Lesser General Public
License along with this library; if not, write to the
Free Software Foundation, Inc., 59 Temple Place - Suite 330,
Boston, MA 02111-1307, USA.
*/
#ifndef __DIRECT__UTIL_H__
#define __DIRECT__UTIL_H__
#include <unistd.h>
#ifdef _POSIX_PRIORITY_SCHEDULING
#include <sched.h>
#endif
#include <pthread.h>
#include <direct/debug.h>
#include <direct/messages.h>
#ifndef MIN
#define MIN(a,b) ((a) < (b) ? (a) : (b))
#endif
#ifndef MAX
#define MAX(a,b) ((a) > (b) ? (a) : (b))
#endif
#ifndef SIGN
#define SIGN(x) (((x) < 0) ? -1 : (((x) > 0) ? 1 : 0))
#endif
#ifndef ABS
#define ABS(x) ((x) > 0 ? (x) : -(x))
#endif
#ifndef CLAMP
#define CLAMP(x,min,max) ((x) < (min) ? (min) : (x) > (max) ? (max) : (x))
#endif
#ifndef BSWAP16
#define BSWAP16(x) (((u16)(x)>>8) | ((u16)(x)<<8))
#endif
#ifndef BSWAP32
#define BSWAP32(x) ((((u32)(x)>>24) & 0x000000ff) | (((u32)(x)>> 8) & 0x0000ff00) | \
(((u32)(x)<< 8) & 0x00ff0000) | (((u32)(x)<<24) & 0xff000000))
#endif
#define D_FLAGS_SET(flags,f) do { (flags) |= (f); } while (0)
#define D_FLAGS_CLEAR(flags,f) do { (flags) &= ~(f); } while (0)
#define D_FLAGS_IS_SET(flags,f) (((flags) & (f)) != 0)
#define D_FLAGS_ARE_SET(flags,f) (((flags) & (f)) == (f))
#define D_FLAGS_ARE_IN(flags,f) (((flags) & ~(f)) == 0)
#define D_FLAGS_INVALID(flags,f) (((flags) & ~(f)) != 0)
#define D_FLAGS_ASSERT(flags,f) D_ASSERT( D_FLAGS_ARE_IN(flags,f) )
#define D_ARRAY_SIZE(array) ((int)(sizeof(array) / sizeof((array)[0])))
#if __GNUC__ >= 3
#define D_CONST_FUNC __attribute__((const))
#else
#define D_CONST_FUNC
#endif
#define D_BITn32(f) (((f) & 0x00000001) ? 0 : \
((f) & 0x00000002) ? 1 : \
((f) & 0x00000004) ? 2 : \
((f) & 0x00000008) ? 3 : \
((f) & 0x00000010) ? 4 : \
((f) & 0x00000020) ? 5 : \
((f) & 0x00000040) ? 6 : \
((f) & 0x00000080) ? 7 : \
((f) & 0x00000100) ? 8 : \
((f) & 0x00000200) ? 9 : \
((f) & 0x00000400) ? 10 : \
((f) & 0x00000800) ? 11 : \
((f) & 0x00001000) ? 12 : \
((f) & 0x00002000) ? 13 : \
((f) & 0x00004000) ? 14 : \
((f) & 0x00008000) ? 15 : \
((f) & 0x00010000) ? 16 : \
((f) & 0x00020000) ? 17 : \
((f) & 0x00040000) ? 18 : \
((f) & 0x00080000) ? 19 : \
((f) & 0x00100000) ? 20 : \
((f) & 0x00200000) ? 21 : \
((f) & 0x00400000) ? 22 : \
((f) & 0x00800000) ? 23 : \
((f) & 0x01000000) ? 24 : \
((f) & 0x02000000) ? 25 : \
((f) & 0x04000000) ? 26 : \
((f) & 0x08000000) ? 27 : \
((f) & 0x10000000) ? 28 : \
((f) & 0x20000000) ? 29 : \
((f) & 0x40000000) ? 30 : \
((f) & 0x80000000) ? 31 : -1)
/*
* portable sched_yield() implementation
*/
#ifdef _POSIX_PRIORITY_SCHEDULING
#define direct_sched_yield() sched_yield()
#else
#define direct_sched_yield() usleep(1)
#endif
/*
* translates errno to DirectResult
*/
DirectResult errno2result( int erno );
const char *DirectResultString( DirectResult result );
/*
* duplicates a file descriptor as needed to ensure it's not stdin, stdout, or stderr
*/
int direct_safe_dup( int fd );
int direct_try_open( const char *name1, const char *name2, int flags, bool error_msg );
void direct_trim( char **s );
/*
* Set a string with a maximum size including the zero termination.
*
* This acts like a strncpy(d,s,n), but always terminates the string like snprintf(d,n,"%s",s).
*
* Returns dest or NULL if n is zero.
*/
static __inline__ char *
direct_snputs( char *dest,
const char *src,
size_t n )
{
char *start = dest;
D_ASSERT( dest != NULL );
D_ASSERT( src != NULL );
if (!n)
return NULL;
for (; n>1 && *src; n--)
*dest++ = *src++;
*dest = 0;
return start;
}
/*
* Encode/Decode Base-64 strings.
*/
char *direct_base64_encode( const void *data, int size );
void *direct_base64_decode( const char *string, int *ret_size );
/*
* Compute MD5 sum (store 16-bytes long result in "dst").
*/
void direct_md5_sum( void *dst, const void *src, const int len );
/*
* Slow implementation, but quite fast if only low bits are set.
*/
static __inline__ int
direct_util_count_bits( unsigned int mask )
{
register int ret = 0;
while (mask) {
ret += mask & 1;
mask >>= 1;
}
return ret;
}
/*
* Generic alignment routine.
*/
static __inline__ int
direct_util_align( int value,
int alignment )
{
if (alignment > 1) {
int tail = value % alignment;
if (tail)
value += alignment - tail;
}
return value;
}
/*
* Utility function to initialize recursive mutexes.
*/
int direct_util_recursive_pthread_mutex_init( pthread_mutex_t *mutex );
/* floor and ceil implementation to get rid of libm */
/*
IEEE floor for computers that round to nearest or even.
'f' must be between -4194304 and 4194303.
This floor operation is done by "(iround(f + .5) + iround(f - .5)) >> 1",
but uses some IEEE specific tricks for better speed.
*/
static __inline__ int
D_IFLOOR(float f)
{
int ai, bi;
double af, bf;
af = (3 << 22) + 0.5 + (double)f;
bf = (3 << 22) + 0.5 - (double)f;
#if defined(__GNUC__) && defined(__i386__)
/*
GCC generates an extra fstp/fld without this.
*/
__asm__ __volatile__ ("fstps %0" : "=m" (ai) : "t" (af) : "st");
__asm__ __volatile__ ("fstps %0" : "=m" (bi) : "t" (bf) : "st");
#else
{
union { int i; float f; } u;
u.f = af; ai = u.i;
u.f = bf; bi = u.i;
}
#endif
return (ai - bi) >> 1;
}
/*
IEEE ceil for computers that round to nearest or even.
'f' must be between -4194304 and 4194303.
This ceil operation is done by "(iround(f + .5) + iround(f - .5) + 1) >> 1",
but uses some IEEE specific tricks for better speed.
*/
static __inline__ int
D_ICEIL(float f)
{
int ai, bi;
double af, bf;
af = (3 << 22) + 0.5 + (double)f;
bf = (3 << 22) + 0.5 - (double)f;
#if defined(__GNUC__) && defined(__i386__)
/*
GCC generates an extra fstp/fld without this.
*/
__asm__ __volatile__ ("fstps %0" : "=m" (ai) : "t" (af) : "st");
__asm__ __volatile__ ("fstps %0" : "=m" (bi) : "t" (bf) : "st");
#else
{
union { int i; float f; } u;
u.f = af; ai = u.i;
u.f = bf; bi = u.i;
}
#endif
return (ai - bi + 1) >> 1;
}
static __inline__ int
direct_log2( int val )
{
register int ret = 0;
while (val >> ++ret);
if ((1 << --ret) < val)
ret++;
return ret;
}
#endif
|