Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
OpenHarmony
Third Party Harfbuzz
提交
6b54c5d0
T
Third Party Harfbuzz
项目概览
OpenHarmony
/
Third Party Harfbuzz
1 年多 前同步成功
通知
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看板
提交
6b54c5d0
编写于
5月 18, 2009
作者:
B
Behdad Esfahbod
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
[HB] More reference cast simplification
上级
eb0dfc83
变更
3
隐藏空白更改
内联
并排
Showing
3 changed file
with
19 addition
and
19 deletion
+19
-19
src/hb-ot-layout-gsub-private.h
src/hb-ot-layout-gsub-private.h
+4
-4
src/hb-ot-layout-gsubgpos-private.h
src/hb-ot-layout-gsubgpos-private.h
+14
-14
src/hb-ot-layout-open-private.h
src/hb-ot-layout-open-private.h
+1
-1
未找到文件。
src/hb-ot-layout-gsub-private.h
浏览文件 @
6b54c5d0
...
...
@@ -551,10 +551,10 @@ struct ReverseChainSingleSubstFormat1 {
if
(
HB_LIKELY
(
index
==
NOT_COVERED
))
return
false
;
const
OffsetArrayOf
<
Coverage
>
&
lookahead
=
*
(
const
OffsetArrayOf
<
Coverage
>
*
)
((
const
char
*
)
&
backtrack
+
backtrack
.
get_size
());
const
ArrayOf
<
GlyphID
>
&
substitute
=
*
(
const
ArrayOf
<
GlyphID
>
*
)
((
const
char
*
)
&
lookahead
+
lookahead
.
get_size
());
const
OffsetArrayOf
<
Coverage
>
&
lookahead
=
(
const
OffsetArrayOf
<
Coverage
>&
)
*
((
const
char
*
)
&
backtrack
+
backtrack
.
get_size
());
const
ArrayOf
<
GlyphID
>
&
substitute
=
(
const
ArrayOf
<
GlyphID
>&
)
*
((
const
char
*
)
&
lookahead
+
lookahead
.
get_size
());
if
(
match_backtrack
(
APPLY_ARG
,
backtrack
.
len
,
(
USHORT
*
)
backtrack
.
array
,
...
...
src/hb-ot-layout-gsubgpos-private.h
浏览文件 @
6b54c5d0
...
...
@@ -61,12 +61,12 @@ static inline bool match_glyph (hb_codepoint_t glyph_id, const USHORT &value, ch
}
static
inline
bool
match_class
(
hb_codepoint_t
glyph_id
,
const
USHORT
&
value
,
char
*
data
)
{
const
ClassDef
&
class_def
=
*
(
const
ClassDef
*
)
data
;
const
ClassDef
&
class_def
=
(
const
ClassDef
&
)
*
data
;
return
class_def
.
get_class
(
glyph_id
)
==
value
;
}
static
inline
bool
match_coverage
(
hb_codepoint_t
glyph_id
,
const
USHORT
&
value
,
char
*
data
)
{
const
OffsetTo
<
Coverage
>
&
coverage
=
*
(
const
OffsetTo
<
Coverage
>
*
)
&
value
;
const
OffsetTo
<
Coverage
>
&
coverage
=
(
const
OffsetTo
<
Coverage
>&
)
value
;
return
(
data
+
coverage
)
(
glyph_id
)
!=
NOT_COVERED
;
}
...
...
@@ -457,12 +457,12 @@ struct ChainRule {
private:
inline
bool
apply
(
APPLY_ARG_DEF
,
ChainContextLookupContext
&
context
)
const
{
const
HeadlessArrayOf
<
USHORT
>
&
input
=
*
(
const
HeadlessArrayOf
<
USHORT
>
*
)
((
const
char
*
)
&
backtrack
+
backtrack
.
get_size
());
const
ArrayOf
<
USHORT
>
&
lookahead
=
*
(
const
ArrayOf
<
USHORT
>
*
)
((
const
char
*
)
&
input
+
input
.
get_size
());
const
ArrayOf
<
LookupRecord
>
&
lookup
=
*
(
const
ArrayOf
<
LookupRecord
>
*
)
((
const
char
*
)
&
lookahead
+
lookahead
.
get_size
());
const
HeadlessArrayOf
<
USHORT
>
&
input
=
(
const
HeadlessArrayOf
<
USHORT
>&
)
*
((
const
char
*
)
&
backtrack
+
backtrack
.
get_size
());
const
ArrayOf
<
USHORT
>
&
lookahead
=
(
const
ArrayOf
<
USHORT
>&
)
*
((
const
char
*
)
&
input
+
input
.
get_size
());
const
ArrayOf
<
LookupRecord
>
&
lookup
=
(
const
ArrayOf
<
LookupRecord
>&
)
*
((
const
char
*
)
&
lookahead
+
lookahead
.
get_size
());
return
chain_context_lookup
(
APPLY_ARG
,
backtrack
.
len
,
backtrack
.
array
,
input
.
len
,
input
.
array
+
1
,
...
...
@@ -602,17 +602,17 @@ struct ChainContextFormat3 {
inline
bool
apply
(
APPLY_ARG_DEF
,
apply_lookup_func_t
apply_func
)
const
{
const
OffsetArrayOf
<
Coverage
>
&
input
=
*
(
const
OffsetArrayOf
<
Coverage
>
*
)
((
const
char
*
)
&
backtrack
+
backtrack
.
get_size
());
const
OffsetArrayOf
<
Coverage
>
&
input
=
(
const
OffsetArrayOf
<
Coverage
>&
)
*
((
const
char
*
)
&
backtrack
+
backtrack
.
get_size
());
unsigned
int
index
=
(
this
+
input
[
0
])
(
IN_CURGLYPH
());
if
(
HB_LIKELY
(
index
==
NOT_COVERED
))
return
false
;
const
OffsetArrayOf
<
Coverage
>
&
lookahead
=
*
(
const
OffsetArrayOf
<
Coverage
>
*
)
((
const
char
*
)
&
input
+
input
.
get_size
());
const
ArrayOf
<
LookupRecord
>
&
lookup
=
*
(
const
ArrayOf
<
LookupRecord
>
*
)
((
const
char
*
)
&
lookahead
+
lookahead
.
get_size
());
const
OffsetArrayOf
<
Coverage
>
&
lookahead
=
(
const
OffsetArrayOf
<
Coverage
>&
)
*
((
const
char
*
)
&
input
+
input
.
get_size
());
const
ArrayOf
<
LookupRecord
>
&
lookup
=
(
const
ArrayOf
<
LookupRecord
>&
)
*
((
const
char
*
)
&
lookahead
+
lookahead
.
get_size
());
struct
ChainContextLookupContext
context
=
{
{
match_coverage
,
apply_func
},
{(
char
*
)
this
,
(
char
*
)
this
,
(
char
*
)
this
}
...
...
src/hb-ot-layout-open-private.h
浏览文件 @
6b54c5d0
...
...
@@ -300,7 +300,7 @@ struct OffsetTo : Offset {
inline
const
Type
&
operator
()
(
const
void
*
base
)
const
{
unsigned
int
offset
=
*
this
;
if
(
HB_UNLIKELY
(
!
offset
))
return
Null
(
Type
);
return
*
(
const
Type
*
)
((
const
char
*
)
base
+
offset
);
return
(
const
Type
&
)
*
((
const
char
*
)
base
+
offset
);
}
};
template
<
typename
Base
,
typename
Type
>
...
...
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录