Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
OpenHarmony
Third Party Harfbuzz
提交
ca5e5a49
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看板
提交
ca5e5a49
编写于
10月 29, 2018
作者:
B
Behdad Esfahbod
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
Port Coverage::Iter off hb_auto_t<>
上级
3a4e5dd4
变更
4
隐藏空白更改
内联
并排
Showing
4 changed file
with
19 addition
and
21 deletion
+19
-21
src/hb-ot-layout-common.hh
src/hb-ot-layout-common.hh
+1
-3
src/hb-ot-layout-gpos-table.hh
src/hb-ot-layout-gpos-table.hh
+1
-1
src/hb-ot-layout-gsub-table.hh
src/hb-ot-layout-gsub-table.hh
+13
-13
src/hb-ot-layout-gsubgpos.hh
src/hb-ot-layout-gsubgpos.hh
+4
-4
未找到文件。
src/hb-ot-layout-common.hh
浏览文件 @
ca5e5a49
...
...
@@ -1108,8 +1108,7 @@ struct Coverage
struct
Iter
{
Iter
(
void
)
:
format
(
0
),
u
()
{};
inline
void
init
(
const
Coverage
&
c_
)
inline
Iter
(
const
Coverage
&
c_
)
{
format
=
c_
.
u
.
format
;
switch
(
format
)
...
...
@@ -1119,7 +1118,6 @@ struct Coverage
default:
return
;
}
}
inline
void
fini
(
void
)
{}
inline
bool
more
(
void
)
{
switch
(
format
)
...
...
src/hb-ot-layout-gpos-table.hh
浏览文件 @
ca5e5a49
...
...
@@ -719,7 +719,7 @@ struct PairPosFormat1
inline
bool
intersects
(
const
hb_set_t
*
glyphs
)
const
{
unsigned
int
count
=
pairSet
.
len
;
for
(
hb_auto_t
<
Coverage
::
Iter
>
iter
(
this
+
coverage
);
iter
.
more
();
iter
.
next
())
for
(
Coverage
::
Iter
iter
(
this
+
coverage
);
iter
.
more
();
iter
.
next
())
{
if
(
unlikely
(
iter
.
get_coverage
()
>=
count
))
break
;
/* Work around malicious fonts. https://github.com/harfbuzz/harfbuzz/issues/363 */
...
...
src/hb-ot-layout-gsub-table.hh
浏览文件 @
ca5e5a49
...
...
@@ -48,7 +48,7 @@ struct SingleSubstFormat1
inline
void
closure
(
hb_closure_context_t
*
c
)
const
{
TRACE_CLOSURE
(
this
);
for
(
hb_auto_t
<
Coverage
::
Iter
>
iter
(
this
+
coverage
);
iter
.
more
();
iter
.
next
())
for
(
Coverage
::
Iter
iter
(
this
+
coverage
);
iter
.
more
();
iter
.
next
())
{
/* TODO Switch to range-based API to work around malicious fonts.
* https://github.com/harfbuzz/harfbuzz/issues/363 */
...
...
@@ -62,7 +62,7 @@ struct SingleSubstFormat1
{
TRACE_COLLECT_GLYPHS
(
this
);
if
(
unlikely
(
!
(
this
+
coverage
).
add_coverage
(
c
->
input
)))
return
;
for
(
hb_auto_t
<
Coverage
::
Iter
>
iter
(
this
+
coverage
);
iter
.
more
();
iter
.
next
())
for
(
Coverage
::
Iter
iter
(
this
+
coverage
);
iter
.
more
();
iter
.
next
())
{
/* TODO Switch to range-based API to work around malicious fonts.
* https://github.com/harfbuzz/harfbuzz/issues/363 */
...
...
@@ -113,7 +113,7 @@ struct SingleSubstFormat1
hb_vector_t
<
GlyphID
>
from
;
hb_vector_t
<
GlyphID
>
to
;
hb_codepoint_t
delta
=
deltaGlyphID
;
for
(
hb_auto_t
<
Coverage
::
Iter
>
iter
(
this
+
coverage
);
iter
.
more
();
iter
.
next
())
for
(
Coverage
::
Iter
iter
(
this
+
coverage
);
iter
.
more
();
iter
.
next
())
{
if
(
!
c
->
plan
->
glyphset
->
has
(
iter
.
get_glyph
()))
continue
;
...
...
@@ -157,7 +157,7 @@ struct SingleSubstFormat2
{
TRACE_CLOSURE
(
this
);
unsigned
int
count
=
substitute
.
len
;
for
(
hb_auto_t
<
Coverage
::
Iter
>
iter
(
this
+
coverage
);
iter
.
more
();
iter
.
next
())
for
(
Coverage
::
Iter
iter
(
this
+
coverage
);
iter
.
more
();
iter
.
next
())
{
if
(
unlikely
(
iter
.
get_coverage
()
>=
count
))
break
;
/* Work around malicious fonts. https://github.com/harfbuzz/harfbuzz/issues/363 */
...
...
@@ -171,7 +171,7 @@ struct SingleSubstFormat2
TRACE_COLLECT_GLYPHS
(
this
);
if
(
unlikely
(
!
(
this
+
coverage
).
add_coverage
(
c
->
input
)))
return
;
unsigned
int
count
=
substitute
.
len
;
for
(
hb_auto_t
<
Coverage
::
Iter
>
iter
(
this
+
coverage
);
iter
.
more
();
iter
.
next
())
for
(
Coverage
::
Iter
iter
(
this
+
coverage
);
iter
.
more
();
iter
.
next
())
{
if
(
unlikely
(
iter
.
get_coverage
()
>=
count
))
break
;
/* Work around malicious fonts. https://github.com/harfbuzz/harfbuzz/issues/363 */
...
...
@@ -218,7 +218,7 @@ struct SingleSubstFormat2
TRACE_SUBSET
(
this
);
hb_vector_t
<
GlyphID
>
from
;
hb_vector_t
<
GlyphID
>
to
;
for
(
hb_auto_t
<
Coverage
::
Iter
>
iter
(
this
+
coverage
);
iter
.
more
();
iter
.
next
())
for
(
Coverage
::
Iter
iter
(
this
+
coverage
);
iter
.
more
();
iter
.
next
())
{
if
(
!
c
->
plan
->
glyphset
->
has
(
iter
.
get_glyph
()))
continue
;
...
...
@@ -395,7 +395,7 @@ struct MultipleSubstFormat1
{
TRACE_CLOSURE
(
this
);
unsigned
int
count
=
sequence
.
len
;
for
(
hb_auto_t
<
Coverage
::
Iter
>
iter
(
this
+
coverage
);
iter
.
more
();
iter
.
next
())
for
(
Coverage
::
Iter
iter
(
this
+
coverage
);
iter
.
more
();
iter
.
next
())
{
if
(
unlikely
(
iter
.
get_coverage
()
>=
count
))
break
;
/* Work around malicious fonts. https://github.com/harfbuzz/harfbuzz/issues/363 */
...
...
@@ -585,7 +585,7 @@ struct AlternateSubstFormat1
{
TRACE_CLOSURE
(
this
);
unsigned
int
count
=
alternateSet
.
len
;
for
(
hb_auto_t
<
Coverage
::
Iter
>
iter
(
this
+
coverage
);
iter
.
more
();
iter
.
next
())
for
(
Coverage
::
Iter
iter
(
this
+
coverage
);
iter
.
more
();
iter
.
next
())
{
if
(
unlikely
(
iter
.
get_coverage
()
>=
count
))
break
;
/* Work around malicious fonts. https://github.com/harfbuzz/harfbuzz/issues/363 */
...
...
@@ -599,7 +599,7 @@ struct AlternateSubstFormat1
TRACE_COLLECT_GLYPHS
(
this
);
if
(
unlikely
(
!
(
this
+
coverage
).
add_coverage
(
c
->
input
)))
return
;
unsigned
int
count
=
alternateSet
.
len
;
for
(
hb_auto_t
<
Coverage
::
Iter
>
iter
(
this
+
coverage
);
iter
.
more
();
iter
.
next
())
for
(
Coverage
::
Iter
iter
(
this
+
coverage
);
iter
.
more
();
iter
.
next
())
{
if
(
unlikely
(
iter
.
get_coverage
()
>=
count
))
break
;
/* Work around malicious fonts. https://github.com/harfbuzz/harfbuzz/issues/363 */
...
...
@@ -906,7 +906,7 @@ struct LigatureSubstFormat1
inline
bool
intersects
(
const
hb_set_t
*
glyphs
)
const
{
unsigned
int
count
=
ligatureSet
.
len
;
for
(
hb_auto_t
<
Coverage
::
Iter
>
iter
(
this
+
coverage
);
iter
.
more
();
iter
.
next
())
for
(
Coverage
::
Iter
iter
(
this
+
coverage
);
iter
.
more
();
iter
.
next
())
{
if
(
unlikely
(
iter
.
get_coverage
()
>=
count
))
break
;
/* Work around malicious fonts. https://github.com/harfbuzz/harfbuzz/issues/363 */
...
...
@@ -921,7 +921,7 @@ struct LigatureSubstFormat1
{
TRACE_CLOSURE
(
this
);
unsigned
int
count
=
ligatureSet
.
len
;
for
(
hb_auto_t
<
Coverage
::
Iter
>
iter
(
this
+
coverage
);
iter
.
more
();
iter
.
next
())
for
(
Coverage
::
Iter
iter
(
this
+
coverage
);
iter
.
more
();
iter
.
next
())
{
if
(
unlikely
(
iter
.
get_coverage
()
>=
count
))
break
;
/* Work around malicious fonts. https://github.com/harfbuzz/harfbuzz/issues/363 */
...
...
@@ -935,7 +935,7 @@ struct LigatureSubstFormat1
TRACE_COLLECT_GLYPHS
(
this
);
if
(
unlikely
(
!
(
this
+
coverage
).
add_coverage
(
c
->
input
)))
return
;
unsigned
int
count
=
ligatureSet
.
len
;
for
(
hb_auto_t
<
Coverage
::
Iter
>
iter
(
this
+
coverage
);
iter
.
more
();
iter
.
next
())
for
(
Coverage
::
Iter
iter
(
this
+
coverage
);
iter
.
more
();
iter
.
next
())
{
if
(
unlikely
(
iter
.
get_coverage
()
>=
count
))
break
;
/* Work around malicious fonts. https://github.com/harfbuzz/harfbuzz/issues/363 */
...
...
@@ -1114,7 +1114,7 @@ struct ReverseChainSingleSubstFormat1
const
ArrayOf
<
GlyphID
>
&
substitute
=
StructAfter
<
ArrayOf
<
GlyphID
>
>
(
lookahead
);
count
=
substitute
.
len
;
for
(
hb_auto_t
<
Coverage
::
Iter
>
iter
(
this
+
coverage
);
iter
.
more
();
iter
.
next
())
for
(
Coverage
::
Iter
iter
(
this
+
coverage
);
iter
.
more
();
iter
.
next
())
{
if
(
unlikely
(
iter
.
get_coverage
()
>=
count
))
break
;
/* Work around malicious fonts. https://github.com/harfbuzz/harfbuzz/issues/363 */
...
...
src/hb-ot-layout-gsubgpos.hh
浏览文件 @
ca5e5a49
...
...
@@ -1441,7 +1441,7 @@ struct ContextFormat1
};
unsigned
int
count
=
ruleSet
.
len
;
for
(
hb_auto_t
<
Coverage
::
Iter
>
iter
(
this
+
coverage
);
iter
.
more
();
iter
.
next
())
for
(
Coverage
::
Iter
iter
(
this
+
coverage
);
iter
.
more
();
iter
.
next
())
{
if
(
unlikely
(
iter
.
get_coverage
()
>=
count
))
break
;
/* Work around malicious fonts. https://github.com/harfbuzz/harfbuzz/issues/363 */
...
...
@@ -1462,7 +1462,7 @@ struct ContextFormat1
};
unsigned
int
count
=
ruleSet
.
len
;
for
(
hb_auto_t
<
Coverage
::
Iter
>
iter
(
this
+
coverage
);
iter
.
more
();
iter
.
next
())
for
(
Coverage
::
Iter
iter
(
this
+
coverage
);
iter
.
more
();
iter
.
next
())
{
if
(
unlikely
(
iter
.
get_coverage
()
>=
count
))
break
;
/* Work around malicious fonts. https://github.com/harfbuzz/harfbuzz/issues/363 */
...
...
@@ -2105,7 +2105,7 @@ struct ChainContextFormat1
};
unsigned
int
count
=
ruleSet
.
len
;
for
(
hb_auto_t
<
Coverage
::
Iter
>
iter
(
this
+
coverage
);
iter
.
more
();
iter
.
next
())
for
(
Coverage
::
Iter
iter
(
this
+
coverage
);
iter
.
more
();
iter
.
next
())
{
if
(
unlikely
(
iter
.
get_coverage
()
>=
count
))
break
;
/* Work around malicious fonts. https://github.com/harfbuzz/harfbuzz/issues/363 */
...
...
@@ -2126,7 +2126,7 @@ struct ChainContextFormat1
};
unsigned
int
count
=
ruleSet
.
len
;
for
(
hb_auto_t
<
Coverage
::
Iter
>
iter
(
this
+
coverage
);
iter
.
more
();
iter
.
next
())
for
(
Coverage
::
Iter
iter
(
this
+
coverage
);
iter
.
more
();
iter
.
next
())
{
if
(
unlikely
(
iter
.
get_coverage
()
>=
count
))
break
;
/* Work around malicious fonts. https://github.com/harfbuzz/harfbuzz/issues/363 */
...
...
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录