Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
OpenHarmony
Third Party Harfbuzz
提交
e72e041c
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看板
提交
e72e041c
编写于
11月 07, 2018
作者:
B
Behdad Esfahbod
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
[kerx] Rename
上级
241ba7da
变更
1
隐藏空白更改
内联
并排
Showing
1 changed file
with
11 addition
and
11 deletion
+11
-11
src/hb-aat-layout-kerx-table.hh
src/hb-aat-layout-kerx-table.hh
+11
-11
未找到文件。
src/hb-aat-layout-kerx-table.hh
浏览文件 @
e72e041c
...
...
@@ -789,7 +789,7 @@ struct KerxSubTableHeader
DEFINE_SIZE_STATIC
(
12
);
};
struct
KerxTable
struct
Kerx
Sub
Table
{
friend
struct
kerx
;
...
...
@@ -848,17 +848,17 @@ struct kerx
inline
void
apply
(
hb_aat_apply_context_t
*
c
)
const
{
c
->
set_lookup_index
(
0
);
const
Kerx
Table
*
table
=
&
firstTable
;
const
Kerx
SubTable
*
st
=
&
firstTable
;
unsigned
int
count
=
tableCount
;
for
(
unsigned
int
i
=
0
;
i
<
count
;
i
++
)
{
bool
reverse
;
if
(
HB_DIRECTION_IS_VERTICAL
(
c
->
buffer
->
props
.
direction
)
!=
bool
(
table
->
u
.
header
.
coverage
&
table
->
u
.
header
.
Vertical
))
bool
(
st
->
u
.
header
.
coverage
&
st
->
u
.
header
.
Vertical
))
goto
skip
;
reverse
=
bool
(
table
->
u
.
header
.
coverage
&
table
->
u
.
header
.
Backwards
)
!=
reverse
=
bool
(
st
->
u
.
header
.
coverage
&
st
->
u
.
header
.
Backwards
)
!=
HB_DIRECTION_IS_BACKWARD
(
c
->
buffer
->
props
.
direction
);
if
(
!
c
->
buffer
->
message
(
c
->
font
,
"start kerx subtable %d"
,
c
->
lookup_index
))
...
...
@@ -867,13 +867,13 @@ struct kerx
if
(
reverse
)
c
->
buffer
->
reverse
();
c
->
sanitizer
.
set_object
(
*
table
);
c
->
sanitizer
.
set_object
(
*
st
);
/* XXX Reverse-kern is not working yet...
* hb_kern_machine_t would need to know that it's reverse-kerning.
* Or better yet, make it work in reverse as well, so we don't have
* to reverse and reverse back? */
table
->
dispatch
(
c
);
st
->
dispatch
(
c
);
if
(
reverse
)
c
->
buffer
->
reverse
();
...
...
@@ -881,7 +881,7 @@ struct kerx
(
void
)
c
->
buffer
->
message
(
c
->
font
,
"end kerx subtable %d"
,
c
->
lookup_index
);
skip:
table
=
&
StructAfter
<
KerxTable
>
(
*
table
);
st
=
&
StructAfter
<
KerxSubTable
>
(
*
st
);
c
->
set_lookup_index
(
c
->
lookup_index
+
1
);
}
}
...
...
@@ -893,13 +893,13 @@ struct kerx
!
tableCount
.
sanitize
(
c
))
return_trace
(
false
);
const
Kerx
Table
*
table
=
&
firstTable
;
const
Kerx
SubTable
*
st
=
&
firstTable
;
unsigned
int
count
=
tableCount
;
for
(
unsigned
int
i
=
0
;
i
<
count
;
i
++
)
{
if
(
!
table
->
sanitize
(
c
))
if
(
!
st
->
sanitize
(
c
))
return_trace
(
false
);
table
=
&
StructAfter
<
KerxTable
>
(
*
table
);
st
=
&
StructAfter
<
KerxSubTable
>
(
*
st
);
}
return_trace
(
true
);
...
...
@@ -911,7 +911,7 @@ struct kerx
HBUINT16
unused
;
/* Set to 0. */
HBUINT32
tableCount
;
/* The number of subtables included in the extended kerning
* table. */
KerxTable
firstTable
;
/* Subtables. */
Kerx
Sub
Table
firstTable
;
/* Subtables. */
/*subtableGlyphCoverageArray*/
/* Only if version >= 3. We don't use. */
public:
...
...
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录