Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
OpenHarmony
Third Party Harfbuzz
提交
491d93bf
T
Third Party Harfbuzz
项目概览
OpenHarmony
/
Third Party Harfbuzz
12 个月 前同步成功
通知
0
Star
18
Fork
0
代码
文件
提交
分支
Tags
贡献者
分支图
Diff
Issue
0
列表
看板
标记
里程碑
合并请求
0
Wiki
0
Wiki
分析
仓库
DevOps
项目成员
Pages
T
Third Party Harfbuzz
项目概览
项目概览
详情
发布
仓库
仓库
文件
提交
分支
标签
贡献者
分支图
比较
Issue
0
Issue
0
列表
看板
标记
里程碑
合并请求
0
合并请求
0
Pages
分析
分析
仓库分析
DevOps
Wiki
0
Wiki
成员
成员
收起侧边栏
关闭侧边栏
动态
分支图
创建新Issue
提交
Issue看板
体验新版 GitCode,发现更多精彩内容 >>
提交
491d93bf
编写于
7月 10, 2018
作者:
B
Behdad Esfahbod
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
Move more stuff from hb-private.hh to hb-dsalgs.hh
上级
f4777656
变更
3
隐藏空白更改
内联
并排
Showing
3 changed file
with
240 addition
and
244 deletion
+240
-244
src/hb-debug.hh
src/hb-debug.hh
+1
-0
src/hb-dsalgs.hh
src/hb-dsalgs.hh
+237
-0
src/hb-private.hh
src/hb-private.hh
+2
-244
未找到文件。
src/hb-debug.hh
浏览文件 @
491d93bf
...
@@ -28,6 +28,7 @@
...
@@ -28,6 +28,7 @@
#define HB_DEBUG_HH
#define HB_DEBUG_HH
#include "hb-private.hh"
#include "hb-private.hh"
#include "hb-dsalgs.hh"
#ifndef HB_DEBUG
#ifndef HB_DEBUG
...
...
src/hb-dsalgs.hh
浏览文件 @
491d93bf
...
@@ -30,6 +30,243 @@
...
@@ -30,6 +30,243 @@
#include "hb-private.hh"
#include "hb-private.hh"
/* Void! For when we need a expression-type of void. */
typedef
const
struct
_hb_void_t
*
hb_void_t
;
#define HB_VOID ((const _hb_void_t *) nullptr)
/*
* Bithacks.
*/
/* Return the number of 1 bits in v. */
template
<
typename
T
>
static
inline
HB_CONST_FUNC
unsigned
int
hb_popcount
(
T
v
)
{
#if (__GNUC__ > 3 || (__GNUC__ == 3 && __GNUC_MINOR__ >= 4)) && defined(__OPTIMIZE__)
if
(
sizeof
(
T
)
<=
sizeof
(
unsigned
int
))
return
__builtin_popcount
(
v
);
if
(
sizeof
(
T
)
<=
sizeof
(
unsigned
long
))
return
__builtin_popcountl
(
v
);
if
(
sizeof
(
T
)
<=
sizeof
(
unsigned
long
long
))
return
__builtin_popcountll
(
v
);
#endif
if
(
sizeof
(
T
)
<=
4
)
{
/* "HACKMEM 169" */
uint32_t
y
;
y
=
(
v
>>
1
)
&
033333333333
;
y
=
v
-
y
-
((
y
>>
1
)
&
033333333333
);
return
(((
y
+
(
y
>>
3
))
&
030707070707
)
%
077
);
}
if
(
sizeof
(
T
)
==
8
)
{
unsigned
int
shift
=
32
;
return
hb_popcount
<
uint32_t
>
((
uint32_t
)
v
)
+
hb_popcount
((
uint32_t
)
(
v
>>
shift
));
}
if
(
sizeof
(
T
)
==
16
)
{
unsigned
int
shift
=
64
;
return
hb_popcount
<
uint64_t
>
((
uint64_t
)
v
)
+
hb_popcount
((
uint64_t
)
(
v
>>
shift
));
}
assert
(
0
);
return
0
;
/* Shut up stupid compiler. */
}
/* Returns the number of bits needed to store number */
template
<
typename
T
>
static
inline
HB_CONST_FUNC
unsigned
int
hb_bit_storage
(
T
v
)
{
if
(
unlikely
(
!
v
))
return
0
;
#if defined(__GNUC__) && (__GNUC__ >= 4) && defined(__OPTIMIZE__)
if
(
sizeof
(
T
)
<=
sizeof
(
unsigned
int
))
return
sizeof
(
unsigned
int
)
*
8
-
__builtin_clz
(
v
);
if
(
sizeof
(
T
)
<=
sizeof
(
unsigned
long
))
return
sizeof
(
unsigned
long
)
*
8
-
__builtin_clzl
(
v
);
if
(
sizeof
(
T
)
<=
sizeof
(
unsigned
long
long
))
return
sizeof
(
unsigned
long
long
)
*
8
-
__builtin_clzll
(
v
);
#endif
#if (defined(_MSC_VER) && _MSC_VER >= 1500) || defined(__MINGW32__)
if
(
sizeof
(
T
)
<=
sizeof
(
unsigned
int
))
{
unsigned
long
where
;
_BitScanReverse
(
&
where
,
v
);
return
1
+
where
;
}
# if _WIN64
if
(
sizeof
(
T
)
<=
8
)
{
unsigned
long
where
;
_BitScanReverse64
(
&
where
,
v
);
return
1
+
where
;
}
# endif
#endif
if
(
sizeof
(
T
)
<=
4
)
{
/* "bithacks" */
const
unsigned
int
b
[]
=
{
0x2
,
0xC
,
0xF0
,
0xFF00
,
0xFFFF0000
};
const
unsigned
int
S
[]
=
{
1
,
2
,
4
,
8
,
16
};
unsigned
int
r
=
0
;
for
(
int
i
=
4
;
i
>=
0
;
i
--
)
if
(
v
&
b
[
i
])
{
v
>>=
S
[
i
];
r
|=
S
[
i
];
}
return
r
+
1
;
}
if
(
sizeof
(
T
)
<=
8
)
{
/* "bithacks" */
const
uint64_t
b
[]
=
{
0x2ULL
,
0xCULL
,
0xF0ULL
,
0xFF00ULL
,
0xFFFF0000ULL
,
0xFFFFFFFF00000000ULL
};
const
unsigned
int
S
[]
=
{
1
,
2
,
4
,
8
,
16
,
32
};
unsigned
int
r
=
0
;
for
(
int
i
=
5
;
i
>=
0
;
i
--
)
if
(
v
&
b
[
i
])
{
v
>>=
S
[
i
];
r
|=
S
[
i
];
}
return
r
+
1
;
}
if
(
sizeof
(
T
)
==
16
)
{
unsigned
int
shift
=
64
;
return
(
v
>>
shift
)
?
hb_bit_storage
<
uint64_t
>
((
uint64_t
)
(
v
>>
shift
))
+
shift
:
hb_bit_storage
<
uint64_t
>
((
uint64_t
)
v
);
}
assert
(
0
);
return
0
;
/* Shut up stupid compiler. */
}
/* Returns the number of zero bits in the least significant side of v */
template
<
typename
T
>
static
inline
HB_CONST_FUNC
unsigned
int
hb_ctz
(
T
v
)
{
if
(
unlikely
(
!
v
))
return
0
;
#if defined(__GNUC__) && (__GNUC__ >= 4) && defined(__OPTIMIZE__)
if
(
sizeof
(
T
)
<=
sizeof
(
unsigned
int
))
return
__builtin_ctz
(
v
);
if
(
sizeof
(
T
)
<=
sizeof
(
unsigned
long
))
return
__builtin_ctzl
(
v
);
if
(
sizeof
(
T
)
<=
sizeof
(
unsigned
long
long
))
return
__builtin_ctzll
(
v
);
#endif
#if (defined(_MSC_VER) && _MSC_VER >= 1500) || defined(__MINGW32__)
if
(
sizeof
(
T
)
<=
sizeof
(
unsigned
int
))
{
unsigned
long
where
;
_BitScanForward
(
&
where
,
v
);
return
where
;
}
# if _WIN64
if
(
sizeof
(
T
)
<=
8
)
{
unsigned
long
where
;
_BitScanForward64
(
&
where
,
v
);
return
where
;
}
# endif
#endif
if
(
sizeof
(
T
)
<=
4
)
{
/* "bithacks" */
unsigned
int
c
=
32
;
v
&=
-
(
int32_t
)
v
;
if
(
v
)
c
--
;
if
(
v
&
0x0000FFFF
)
c
-=
16
;
if
(
v
&
0x00FF00FF
)
c
-=
8
;
if
(
v
&
0x0F0F0F0F
)
c
-=
4
;
if
(
v
&
0x33333333
)
c
-=
2
;
if
(
v
&
0x55555555
)
c
-=
1
;
return
c
;
}
if
(
sizeof
(
T
)
<=
8
)
{
/* "bithacks" */
unsigned
int
c
=
64
;
v
&=
-
(
int64_t
)
(
v
);
if
(
v
)
c
--
;
if
(
v
&
0x00000000FFFFFFFFULL
)
c
-=
32
;
if
(
v
&
0x0000FFFF0000FFFFULL
)
c
-=
16
;
if
(
v
&
0x00FF00FF00FF00FFULL
)
c
-=
8
;
if
(
v
&
0x0F0F0F0F0F0F0F0FULL
)
c
-=
4
;
if
(
v
&
0x3333333333333333ULL
)
c
-=
2
;
if
(
v
&
0x5555555555555555ULL
)
c
-=
1
;
return
c
;
}
if
(
sizeof
(
T
)
==
16
)
{
unsigned
int
shift
=
64
;
return
(
uint64_t
)
v
?
hb_bit_storage
<
uint64_t
>
((
uint64_t
)
v
)
:
hb_bit_storage
<
uint64_t
>
((
uint64_t
)
v
>>
shift
)
+
shift
;
}
assert
(
0
);
return
0
;
/* Shut up stupid compiler. */
}
/*
* Tiny stuff.
*/
#undef MIN
template
<
typename
Type
>
static
inline
Type
MIN
(
const
Type
&
a
,
const
Type
&
b
)
{
return
a
<
b
?
a
:
b
;
}
#undef MAX
template
<
typename
Type
>
static
inline
Type
MAX
(
const
Type
&
a
,
const
Type
&
b
)
{
return
a
>
b
?
a
:
b
;
}
static
inline
unsigned
int
DIV_CEIL
(
const
unsigned
int
a
,
unsigned
int
b
)
{
return
(
a
+
(
b
-
1
))
/
b
;
}
#undef ARRAY_LENGTH
template
<
typename
Type
,
unsigned
int
n
>
static
inline
unsigned
int
ARRAY_LENGTH
(
const
Type
(
&
)[
n
])
{
return
n
;
}
/* A const version, but does not detect erratically being called on pointers. */
#define ARRAY_LENGTH_CONST(__array) ((signed int) (sizeof (__array) / sizeof (__array[0])))
static
inline
bool
hb_unsigned_mul_overflows
(
unsigned
int
count
,
unsigned
int
size
)
{
return
(
size
>
0
)
&&
(
count
>=
((
unsigned
int
)
-
1
)
/
size
);
}
static
inline
unsigned
int
hb_ceil_to_4
(
unsigned
int
v
)
{
return
((
v
-
1
)
|
3
)
+
1
;
}
/*
* Sort and search.
*/
static
inline
void
*
static
inline
void
*
hb_bsearch_r
(
const
void
*
key
,
const
void
*
base
,
hb_bsearch_r
(
const
void
*
key
,
const
void
*
base
,
size_t
nmemb
,
size_t
size
,
size_t
nmemb
,
size_t
size
,
...
...
src/hb-private.hh
浏览文件 @
491d93bf
...
@@ -279,26 +279,6 @@ static int errno = 0; /* Use something better? */
...
@@ -279,26 +279,6 @@ static int errno = 0; /* Use something better? */
# undef HB_USE_ATEXIT
# undef HB_USE_ATEXIT
#endif
#endif
/* Basics */
#undef MIN
template
<
typename
Type
>
static
inline
Type
MIN
(
const
Type
&
a
,
const
Type
&
b
)
{
return
a
<
b
?
a
:
b
;
}
#undef MAX
template
<
typename
Type
>
static
inline
Type
MAX
(
const
Type
&
a
,
const
Type
&
b
)
{
return
a
>
b
?
a
:
b
;
}
static
inline
unsigned
int
DIV_CEIL
(
const
unsigned
int
a
,
unsigned
int
b
)
{
return
(
a
+
(
b
-
1
))
/
b
;
}
#undef ARRAY_LENGTH
template
<
typename
Type
,
unsigned
int
n
>
static
inline
unsigned
int
ARRAY_LENGTH
(
const
Type
(
&
)[
n
])
{
return
n
;
}
/* A const version, but does not detect erratically being called on pointers. */
#define ARRAY_LENGTH_CONST(__array) ((signed int) (sizeof (__array) / sizeof (__array[0])))
#define HB_STMT_START do
#define HB_STMT_START do
#define HB_STMT_END while (0)
#define HB_STMT_END while (0)
...
@@ -350,228 +330,6 @@ static_assert ((sizeof (hb_var_int_t) == 4), "");
...
@@ -350,228 +330,6 @@ static_assert ((sizeof (hb_var_int_t) == 4), "");
# define ASSERT_POD() _ASSERT_POD0 (__LINE__)
# define ASSERT_POD() _ASSERT_POD0 (__LINE__)
/* Tiny functions */
/*
* Void!
*/
typedef
const
struct
_hb_void_t
*
hb_void_t
;
#define HB_VOID ((const _hb_void_t *) nullptr)
/* Return the number of 1 bits in v. */
template
<
typename
T
>
static
inline
HB_CONST_FUNC
unsigned
int
hb_popcount
(
T
v
)
{
#if (__GNUC__ > 3 || (__GNUC__ == 3 && __GNUC_MINOR__ >= 4)) && defined(__OPTIMIZE__)
if
(
sizeof
(
T
)
<=
sizeof
(
unsigned
int
))
return
__builtin_popcount
(
v
);
if
(
sizeof
(
T
)
<=
sizeof
(
unsigned
long
))
return
__builtin_popcountl
(
v
);
if
(
sizeof
(
T
)
<=
sizeof
(
unsigned
long
long
))
return
__builtin_popcountll
(
v
);
#endif
if
(
sizeof
(
T
)
<=
4
)
{
/* "HACKMEM 169" */
uint32_t
y
;
y
=
(
v
>>
1
)
&
033333333333
;
y
=
v
-
y
-
((
y
>>
1
)
&
033333333333
);
return
(((
y
+
(
y
>>
3
))
&
030707070707
)
%
077
);
}
if
(
sizeof
(
T
)
==
8
)
{
unsigned
int
shift
=
32
;
return
hb_popcount
<
uint32_t
>
((
uint32_t
)
v
)
+
hb_popcount
((
uint32_t
)
(
v
>>
shift
));
}
if
(
sizeof
(
T
)
==
16
)
{
unsigned
int
shift
=
64
;
return
hb_popcount
<
uint64_t
>
((
uint64_t
)
v
)
+
hb_popcount
((
uint64_t
)
(
v
>>
shift
));
}
assert
(
0
);
return
0
;
/* Shut up stupid compiler. */
}
/* Returns the number of bits needed to store number */
template
<
typename
T
>
static
inline
HB_CONST_FUNC
unsigned
int
hb_bit_storage
(
T
v
)
{
if
(
unlikely
(
!
v
))
return
0
;
#if defined(__GNUC__) && (__GNUC__ >= 4) && defined(__OPTIMIZE__)
if
(
sizeof
(
T
)
<=
sizeof
(
unsigned
int
))
return
sizeof
(
unsigned
int
)
*
8
-
__builtin_clz
(
v
);
if
(
sizeof
(
T
)
<=
sizeof
(
unsigned
long
))
return
sizeof
(
unsigned
long
)
*
8
-
__builtin_clzl
(
v
);
if
(
sizeof
(
T
)
<=
sizeof
(
unsigned
long
long
))
return
sizeof
(
unsigned
long
long
)
*
8
-
__builtin_clzll
(
v
);
#endif
#if (defined(_MSC_VER) && _MSC_VER >= 1500) || defined(__MINGW32__)
if
(
sizeof
(
T
)
<=
sizeof
(
unsigned
int
))
{
unsigned
long
where
;
_BitScanReverse
(
&
where
,
v
);
return
1
+
where
;
}
# if _WIN64
if
(
sizeof
(
T
)
<=
8
)
{
unsigned
long
where
;
_BitScanReverse64
(
&
where
,
v
);
return
1
+
where
;
}
# endif
#endif
if
(
sizeof
(
T
)
<=
4
)
{
/* "bithacks" */
const
unsigned
int
b
[]
=
{
0x2
,
0xC
,
0xF0
,
0xFF00
,
0xFFFF0000
};
const
unsigned
int
S
[]
=
{
1
,
2
,
4
,
8
,
16
};
unsigned
int
r
=
0
;
for
(
int
i
=
4
;
i
>=
0
;
i
--
)
if
(
v
&
b
[
i
])
{
v
>>=
S
[
i
];
r
|=
S
[
i
];
}
return
r
+
1
;
}
if
(
sizeof
(
T
)
<=
8
)
{
/* "bithacks" */
const
uint64_t
b
[]
=
{
0x2ULL
,
0xCULL
,
0xF0ULL
,
0xFF00ULL
,
0xFFFF0000ULL
,
0xFFFFFFFF00000000ULL
};
const
unsigned
int
S
[]
=
{
1
,
2
,
4
,
8
,
16
,
32
};
unsigned
int
r
=
0
;
for
(
int
i
=
5
;
i
>=
0
;
i
--
)
if
(
v
&
b
[
i
])
{
v
>>=
S
[
i
];
r
|=
S
[
i
];
}
return
r
+
1
;
}
if
(
sizeof
(
T
)
==
16
)
{
unsigned
int
shift
=
64
;
return
(
v
>>
shift
)
?
hb_bit_storage
<
uint64_t
>
((
uint64_t
)
(
v
>>
shift
))
+
shift
:
hb_bit_storage
<
uint64_t
>
((
uint64_t
)
v
);
}
assert
(
0
);
return
0
;
/* Shut up stupid compiler. */
}
/* Returns the number of zero bits in the least significant side of v */
template
<
typename
T
>
static
inline
HB_CONST_FUNC
unsigned
int
hb_ctz
(
T
v
)
{
if
(
unlikely
(
!
v
))
return
0
;
#if defined(__GNUC__) && (__GNUC__ >= 4) && defined(__OPTIMIZE__)
if
(
sizeof
(
T
)
<=
sizeof
(
unsigned
int
))
return
__builtin_ctz
(
v
);
if
(
sizeof
(
T
)
<=
sizeof
(
unsigned
long
))
return
__builtin_ctzl
(
v
);
if
(
sizeof
(
T
)
<=
sizeof
(
unsigned
long
long
))
return
__builtin_ctzll
(
v
);
#endif
#if (defined(_MSC_VER) && _MSC_VER >= 1500) || defined(__MINGW32__)
if
(
sizeof
(
T
)
<=
sizeof
(
unsigned
int
))
{
unsigned
long
where
;
_BitScanForward
(
&
where
,
v
);
return
where
;
}
# if _WIN64
if
(
sizeof
(
T
)
<=
8
)
{
unsigned
long
where
;
_BitScanForward64
(
&
where
,
v
);
return
where
;
}
# endif
#endif
if
(
sizeof
(
T
)
<=
4
)
{
/* "bithacks" */
unsigned
int
c
=
32
;
v
&=
-
(
int32_t
)
v
;
if
(
v
)
c
--
;
if
(
v
&
0x0000FFFF
)
c
-=
16
;
if
(
v
&
0x00FF00FF
)
c
-=
8
;
if
(
v
&
0x0F0F0F0F
)
c
-=
4
;
if
(
v
&
0x33333333
)
c
-=
2
;
if
(
v
&
0x55555555
)
c
-=
1
;
return
c
;
}
if
(
sizeof
(
T
)
<=
8
)
{
/* "bithacks" */
unsigned
int
c
=
64
;
v
&=
-
(
int64_t
)
(
v
);
if
(
v
)
c
--
;
if
(
v
&
0x00000000FFFFFFFFULL
)
c
-=
32
;
if
(
v
&
0x0000FFFF0000FFFFULL
)
c
-=
16
;
if
(
v
&
0x00FF00FF00FF00FFULL
)
c
-=
8
;
if
(
v
&
0x0F0F0F0F0F0F0F0FULL
)
c
-=
4
;
if
(
v
&
0x3333333333333333ULL
)
c
-=
2
;
if
(
v
&
0x5555555555555555ULL
)
c
-=
1
;
return
c
;
}
if
(
sizeof
(
T
)
==
16
)
{
unsigned
int
shift
=
64
;
return
(
uint64_t
)
v
?
hb_bit_storage
<
uint64_t
>
((
uint64_t
)
v
)
:
hb_bit_storage
<
uint64_t
>
((
uint64_t
)
v
>>
shift
)
+
shift
;
}
assert
(
0
);
return
0
;
/* Shut up stupid compiler. */
}
static
inline
bool
hb_unsigned_mul_overflows
(
unsigned
int
count
,
unsigned
int
size
)
{
return
(
size
>
0
)
&&
(
count
>=
((
unsigned
int
)
-
1
)
/
size
);
}
static
inline
unsigned
int
hb_ceil_to_4
(
unsigned
int
v
)
{
return
((
v
-
1
)
|
3
)
+
1
;
}
static
inline
bool
hb_ispow2
(
unsigned
int
v
)
{
return
0
==
(
v
&
(
v
-
1
));
}
/*
*
* Utility types
*
*/
#define HB_DISALLOW_COPY_AND_ASSIGN(TypeName) \
#define HB_DISALLOW_COPY_AND_ASSIGN(TypeName) \
TypeName(const TypeName&); \
TypeName(const TypeName&); \
void operator=(const TypeName&)
void operator=(const TypeName&)
...
@@ -819,7 +577,7 @@ _hb_round (double x)
...
@@ -819,7 +577,7 @@ _hb_round (double x)
static
inline
int
static
inline
int
_hb_memalign
(
void
**
memptr
,
size_t
alignment
,
size_t
size
)
_hb_memalign
(
void
**
memptr
,
size_t
alignment
,
size_t
size
)
{
{
if
(
unlikely
(
!
hb_ispow2
(
alignment
)
||
if
(
unlikely
(
0
!=
(
alignment
&
(
alignment
-
1
)
)
||
!
alignment
||
!
alignment
||
0
!=
(
alignment
&
(
sizeof
(
void
*
)
-
1
))))
0
!=
(
alignment
&
(
sizeof
(
void
*
)
-
1
))))
return
EINVAL
;
return
EINVAL
;
...
@@ -842,10 +600,10 @@ _hb_memalign(void **memptr, size_t alignment, size_t size)
...
@@ -842,10 +600,10 @@ _hb_memalign(void **memptr, size_t alignment, size_t size)
/* Headers we include for everyone. Specifically ordered to resolve dependencies. */
/* Headers we include for everyone. Specifically ordered to resolve dependencies. */
#include "hb-debug.hh"
#include "hb-atomic-private.hh"
#include "hb-atomic-private.hh"
#include "hb-mutex-private.hh"
#include "hb-mutex-private.hh"
#include "hb-dsalgs.hh"
#include "hb-dsalgs.hh"
#include "hb-debug.hh"
#include "hb-object-private.hh"
#include "hb-object-private.hh"
#endif
/* HB_PRIVATE_HH */
#endif
/* HB_PRIVATE_HH */
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录