Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
OpenHarmony
Third Party Harfbuzz
提交
faf0f202
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看板
体验新版 GitCode,发现更多精彩内容 >>
提交
faf0f202
编写于
6月 09, 2012
作者:
B
Behdad Esfahbod
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
Add sanitize() logic for fast-paths
上级
4e766ff2
变更
2
隐藏空白更改
内联
并排
Showing
2 changed file
with
26 addition
and
9 deletion
+26
-9
src/hb-ot-layout-gpos-table.hh
src/hb-ot-layout-gpos-table.hh
+12
-3
src/hb-ot-layout-gsub-table.hh
src/hb-ot-layout-gsub-table.hh
+14
-6
未找到文件。
src/hb-ot-layout-gpos-table.hh
浏览文件 @
faf0f202
...
...
@@ -1308,12 +1308,18 @@ struct PosLookupSubTable
Extension
=
9
};
inline
bool
can_use_fast_path
(
unsigned
int
lookup_type
)
const
{
/* Fast path, for those that have coverage in the same place. */
return
likely
(
lookup_type
<
Context
)
||
(
hb_in_range
<
unsigned
int
>
(
lookup_type
,
Context
,
ChainContext
)
&&
hb_in_range
<
unsigned
int
>
(
u
.
header
.
sub_format
,
1
,
2
));
}
inline
bool
apply
(
hb_apply_context_t
*
c
,
unsigned
int
lookup_type
)
const
{
TRACE_APPLY
();
if
(
likely
(
lookup_type
<
Context
)
||
(
hb_in_range
<
unsigned
int
>
(
lookup_type
,
Context
,
ChainContext
)
&&
hb_in_range
<
unsigned
int
>
(
u
.
header
.
sub_format
,
1
,
2
)))
if
(
can_use_fast_path
(
lookup_type
))
{
/* Fast path, for most that have coverage in the same place. */
hb_codepoint_t
glyph_id
=
c
->
buffer
->
cur
().
codepoint
;
...
...
@@ -1336,6 +1342,9 @@ struct PosLookupSubTable
inline
bool
sanitize
(
hb_sanitize_context_t
*
c
,
unsigned
int
lookup_type
)
{
TRACE_SANITIZE
();
if
(
!
u
.
header
.
sub_format
.
sanitize
(
c
)
||
(
can_use_fast_path
(
lookup_type
))
&&
!
u
.
header
.
coverage
.
sanitize
(
c
,
this
))
return
TRACE_RETURN
(
false
);
switch
(
lookup_type
)
{
case
Single
:
return
TRACE_RETURN
(
u
.
single
.
sanitize
(
c
));
case
Pair
:
return
TRACE_RETURN
(
u
.
pair
.
sanitize
(
c
));
...
...
src/hb-ot-layout-gsub-table.hh
浏览文件 @
faf0f202
...
...
@@ -965,16 +965,21 @@ struct SubstLookupSubTable
}
}
inline
bool
can_use_fast_path
(
unsigned
int
lookup_type
)
const
{
/* Fast path, for those that have coverage in the same place.
* Note that ReverseChainSingle can also go through this but
* it's not worth the effort. */
return
likely
(
lookup_type
<
Context
)
||
(
hb_in_range
<
unsigned
int
>
(
lookup_type
,
Context
,
ChainContext
)
&&
hb_in_range
<
unsigned
int
>
(
u
.
header
.
sub_format
,
1
,
2
));
}
inline
bool
apply
(
hb_apply_context_t
*
c
,
unsigned
int
lookup_type
)
const
{
TRACE_APPLY
();
if
(
likely
(
lookup_type
<
Context
)
||
(
hb_in_range
<
unsigned
int
>
(
lookup_type
,
Context
,
ChainContext
)
&&
hb_in_range
<
unsigned
int
>
(
u
.
header
.
sub_format
,
1
,
2
)))
if
(
can_use_fast_path
(
lookup_type
))
{
/* Fast path, for most that have coverage in the same place.
* Note that ReverseChainSingle can also go through this but
* it's not worth the effort. */
hb_codepoint_t
glyph_id
=
c
->
buffer
->
cur
().
codepoint
;
unsigned
int
index
=
(
this
+
u
.
header
.
coverage
)
(
glyph_id
);
if
(
likely
(
index
==
NOT_COVERED
))
return
TRACE_RETURN
(
false
);
...
...
@@ -994,6 +999,9 @@ struct SubstLookupSubTable
inline
bool
sanitize
(
hb_sanitize_context_t
*
c
,
unsigned
int
lookup_type
)
{
TRACE_SANITIZE
();
if
(
!
u
.
header
.
sub_format
.
sanitize
(
c
)
||
(
can_use_fast_path
(
lookup_type
))
&&
!
u
.
header
.
coverage
.
sanitize
(
c
,
this
))
return
TRACE_RETURN
(
false
);
switch
(
lookup_type
)
{
case
Single
:
return
TRACE_RETURN
(
u
.
single
.
sanitize
(
c
));
case
Multiple
:
return
TRACE_RETURN
(
u
.
multiple
.
sanitize
(
c
));
...
...
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录