Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
OpenHarmony
Third Party Harfbuzz
提交
0d1fdf93
T
Third Party Harfbuzz
项目概览
OpenHarmony
/
Third Party Harfbuzz
接近 2 年 前同步成功
通知
1
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看板
提交
0d1fdf93
编写于
1月 09, 2019
作者:
B
Behdad Esfahbod
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
Use hb_zip() some mooore
上级
af6c1902
变更
2
隐藏空白更改
内联
并排
Showing
2 changed file
with
21 addition
and
56 deletion
+21
-56
src/hb-ot-layout-gpos-table.hh
src/hb-ot-layout-gpos-table.hh
+4
-9
src/hb-ot-layout-gsub-table.hh
src/hb-ot-layout-gsub-table.hh
+17
-47
未找到文件。
src/hb-ot-layout-gpos-table.hh
浏览文件 @
0d1fdf93
...
@@ -722,15 +722,10 @@ struct PairPosFormat1
...
@@ -722,15 +722,10 @@ struct PairPosFormat1
{
{
bool
intersects
(
const
hb_set_t
*
glyphs
)
const
bool
intersects
(
const
hb_set_t
*
glyphs
)
const
{
{
unsigned
int
count
=
pairSet
.
len
;
for
(
auto
it
=
hb_zip
(
this
+
coverage
,
pairSet
);
it
;
++
it
)
for
(
/*TODO(C++11)auto*/
Coverage
::
iter_t
iter
=
(
this
+
coverage
).
iter
();
iter
;
iter
++
)
if
(
glyphs
->
has
(
it
->
first
))
{
if
((
this
+
it
->
second
).
intersects
(
glyphs
,
valueFormat
))
if
(
unlikely
(
iter
.
get_coverage
()
>=
count
))
return
true
;
break
;
/* Work around malicious fonts. https://github.com/harfbuzz/harfbuzz/issues/363 */
if
(
glyphs
->
has
(
iter
.
get_glyph
())
&&
(
this
+
pairSet
[
iter
.
get_coverage
()]).
intersects
(
glyphs
,
valueFormat
))
return
true
;
}
return
false
;
return
false
;
}
}
...
...
src/hb-ot-layout-gsub-table.hh
浏览文件 @
0d1fdf93
...
@@ -46,26 +46,16 @@ struct SingleSubstFormat1
...
@@ -46,26 +46,16 @@ struct SingleSubstFormat1
void
closure
(
hb_closure_context_t
*
c
)
const
void
closure
(
hb_closure_context_t
*
c
)
const
{
{
for
(
/*TODO(C++11)auto*/
Coverage
::
iter_t
iter
=
(
this
+
coverage
).
iter
();
iter
;
iter
++
)
for
(
auto
it
=
(
this
+
coverage
).
iter
();
it
;
++
it
)
{
if
(
c
->
glyphs
->
has
(
*
it
))
/* TODO Switch to range-based API to work around malicious fonts.
c
->
out
->
add
((
*
it
+
deltaGlyphID
)
&
0xFFFFu
);
* https://github.com/harfbuzz/harfbuzz/issues/363 */
hb_codepoint_t
glyph_id
=
iter
.
get_glyph
();
if
(
c
->
glyphs
->
has
(
glyph_id
))
c
->
out
->
add
((
glyph_id
+
deltaGlyphID
)
&
0xFFFFu
);
}
}
}
void
collect_glyphs
(
hb_collect_glyphs_context_t
*
c
)
const
void
collect_glyphs
(
hb_collect_glyphs_context_t
*
c
)
const
{
{
if
(
unlikely
(
!
(
this
+
coverage
).
add_coverage
(
c
->
input
)))
return
;
if
(
unlikely
(
!
(
this
+
coverage
).
add_coverage
(
c
->
input
)))
return
;
for
(
/*TODO(C++11)auto*/
Coverage
::
iter_t
iter
=
(
this
+
coverage
).
iter
();
iter
;
iter
++
)
for
(
auto
it
=
(
this
+
coverage
).
iter
();
it
;
++
it
)
{
c
->
output
->
add
((
*
it
+
deltaGlyphID
)
&
0xFFFFu
);
/* TODO Switch to range-based API to work around malicious fonts.
* https://github.com/harfbuzz/harfbuzz/issues/363 */
hb_codepoint_t
glyph_id
=
iter
.
get_glyph
();
c
->
output
->
add
((
glyph_id
+
deltaGlyphID
)
&
0xFFFFu
);
}
}
}
const
Coverage
&
get_coverage
()
const
{
return
this
+
coverage
;
}
const
Coverage
&
get_coverage
()
const
{
return
this
+
coverage
;
}
...
@@ -831,40 +821,25 @@ struct LigatureSubstFormat1
...
@@ -831,40 +821,25 @@ struct LigatureSubstFormat1
{
{
bool
intersects
(
const
hb_set_t
*
glyphs
)
const
bool
intersects
(
const
hb_set_t
*
glyphs
)
const
{
{
unsigned
int
count
=
ligatureSet
.
len
;
for
(
auto
it
=
hb_zip
(
this
+
coverage
,
ligatureSet
);
it
;
++
it
)
for
(
/*TODO(C++11)auto*/
Coverage
::
iter_t
iter
=
(
this
+
coverage
).
iter
();
iter
;
iter
++
)
if
(
glyphs
->
has
(
it
->
first
))
{
if
((
this
+
it
->
second
).
intersects
(
glyphs
))
if
(
unlikely
(
iter
.
get_coverage
()
>=
count
))
return
true
;
break
;
/* Work around malicious fonts. https://github.com/harfbuzz/harfbuzz/issues/363 */
if
(
glyphs
->
has
(
iter
.
get_glyph
())
&&
(
this
+
ligatureSet
[
iter
.
get_coverage
()]).
intersects
(
glyphs
))
return
true
;
}
return
false
;
return
false
;
}
}
void
closure
(
hb_closure_context_t
*
c
)
const
void
closure
(
hb_closure_context_t
*
c
)
const
{
{
unsigned
int
count
=
ligatureSet
.
len
;
for
(
auto
it
=
hb_zip
(
this
+
coverage
,
ligatureSet
);
it
;
++
it
)
for
(
/*TODO(C++11)auto*/
Coverage
::
iter_t
iter
=
(
this
+
coverage
).
iter
();
iter
;
iter
++
)
if
(
c
->
glyphs
->
has
(
it
->
first
))
{
(
this
+
it
->
second
).
closure
(
c
);
if
(
unlikely
(
iter
.
get_coverage
()
>=
count
))
break
;
/* Work around malicious fonts. https://github.com/harfbuzz/harfbuzz/issues/363 */
if
(
c
->
glyphs
->
has
(
iter
.
get_glyph
()))
(
this
+
ligatureSet
[
iter
.
get_coverage
()]).
closure
(
c
);
}
}
}
void
collect_glyphs
(
hb_collect_glyphs_context_t
*
c
)
const
void
collect_glyphs
(
hb_collect_glyphs_context_t
*
c
)
const
{
{
if
(
unlikely
(
!
(
this
+
coverage
).
add_coverage
(
c
->
input
)))
return
;
if
(
unlikely
(
!
(
this
+
coverage
).
add_coverage
(
c
->
input
)))
return
;
unsigned
int
count
=
ligatureSet
.
len
;
for
(
auto
it
=
hb_zip
(
this
+
coverage
,
ligatureSet
);
it
;
++
it
)
for
(
/*TODO(C++11)auto*/
Coverage
::
iter_t
iter
=
(
this
+
coverage
).
iter
();
iter
;
iter
++
)
(
this
+
it
->
second
).
collect_glyphs
(
c
);
{
if
(
unlikely
(
iter
.
get_coverage
()
>=
count
))
break
;
/* Work around malicious fonts. https://github.com/harfbuzz/harfbuzz/issues/363 */
(
this
+
ligatureSet
[
iter
.
get_coverage
()]).
collect_glyphs
(
c
);
}
}
}
const
Coverage
&
get_coverage
()
const
{
return
this
+
coverage
;
}
const
Coverage
&
get_coverage
()
const
{
return
this
+
coverage
;
}
...
@@ -1035,14 +1010,9 @@ struct ReverseChainSingleSubstFormat1
...
@@ -1035,14 +1010,9 @@ struct ReverseChainSingleSubstFormat1
return
;
return
;
const
ArrayOf
<
GlyphID
>
&
substitute
=
StructAfter
<
ArrayOf
<
GlyphID
>
>
(
lookahead
);
const
ArrayOf
<
GlyphID
>
&
substitute
=
StructAfter
<
ArrayOf
<
GlyphID
>
>
(
lookahead
);
count
=
substitute
.
len
;
for
(
auto
it
=
hb_zip
(
this
+
coverage
,
substitute
);
it
;
++
it
)
for
(
/*TODO(C++11)auto*/
Coverage
::
iter_t
iter
=
(
this
+
coverage
).
iter
();
iter
;
iter
++
)
if
(
c
->
glyphs
->
has
(
it
->
first
))
{
c
->
out
->
add
(
it
->
second
);
if
(
unlikely
(
iter
.
get_coverage
()
>=
count
))
break
;
/* Work around malicious fonts. https://github.com/harfbuzz/harfbuzz/issues/363 */
if
(
c
->
glyphs
->
has
(
iter
.
get_glyph
()))
c
->
out
->
add
(
substitute
[
iter
.
get_coverage
()]);
}
}
}
void
collect_glyphs
(
hb_collect_glyphs_context_t
*
c
)
const
void
collect_glyphs
(
hb_collect_glyphs_context_t
*
c
)
const
...
...
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录