Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
OpenHarmony
Third Party Harfbuzz
提交
bde5e395
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看板
提交
bde5e395
编写于
9月 10, 2016
作者:
B
Behdad Esfahbod
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
Move add_lookups from map to map-builder
In prep for more changes.
上级
26648ceb
变更
2
隐藏空白更改
内联
并排
Showing
2 changed file
with
23 addition
and
21 deletion
+23
-21
src/hb-ot-map-private.hh
src/hb-ot-map-private.hh
+8
-7
src/hb-ot-map.cc
src/hb-ot-map.cc
+15
-14
未找到文件。
src/hb-ot-map-private.hh
浏览文件 @
bde5e395
...
...
@@ -139,12 +139,6 @@ struct hb_ot_map_t
private:
HB_INTERNAL
void
add_lookups
(
hb_face_t
*
face
,
unsigned
int
table_index
,
unsigned
int
feature_index
,
hb_mask_t
mask
,
bool
auto_zwj
);
hb_mask_t
global_mask
;
hb_prealloced_array_t
<
feature_map_t
,
8
>
features
;
...
...
@@ -182,7 +176,7 @@ struct hb_ot_map_builder_t
inline
void
add_gpos_pause
(
hb_ot_map_t
::
pause_func_t
pause_func
)
{
add_pause
(
1
,
pause_func
);
}
HB_INTERNAL
void
compile
(
struct
hb_ot_map_t
&
m
);
HB_INTERNAL
void
compile
(
hb_ot_map_t
&
m
);
inline
void
finish
(
void
)
{
feature_infos
.
finish
();
...
...
@@ -194,6 +188,13 @@ struct hb_ot_map_builder_t
private:
HB_INTERNAL
void
add_lookups
(
hb_ot_map_t
&
m
,
hb_face_t
*
face
,
unsigned
int
table_index
,
unsigned
int
feature_index
,
hb_mask_t
mask
,
bool
auto_zwj
);
struct
feature_info_t
{
hb_tag_t
tag
;
unsigned
int
seq
;
/* sequence#, used for stable sorting only */
...
...
src/hb-ot-map.cc
浏览文件 @
bde5e395
...
...
@@ -32,11 +32,12 @@
void
hb_ot_map_t
::
add_lookups
(
hb_face_t
*
face
,
unsigned
int
table_index
,
unsigned
int
feature_index
,
hb_mask_t
mask
,
bool
auto_zwj
)
hb_ot_map_builder_t
::
add_lookups
(
hb_ot_map_t
&
m
,
hb_face_t
*
face
,
unsigned
int
table_index
,
unsigned
int
feature_index
,
hb_mask_t
mask
,
bool
auto_zwj
)
{
unsigned
int
lookup_indices
[
32
];
unsigned
int
offset
,
len
;
...
...
@@ -57,7 +58,7 @@ hb_ot_map_t::add_lookups (hb_face_t *face,
{
if
(
lookup_indices
[
i
]
>=
table_lookup_count
)
continue
;
hb_ot_map_t
::
lookup_map_t
*
lookup
=
lookups
[
table_index
].
push
();
hb_ot_map_t
::
lookup_map_t
*
lookup
=
m
.
lookups
[
table_index
].
push
();
if
(
unlikely
(
!
lookup
))
return
;
lookup
->
mask
=
mask
;
...
...
@@ -268,17 +269,17 @@ hb_ot_map_builder_t::compile (hb_ot_map_t &m)
{
if
(
required_feature_index
[
table_index
]
!=
HB_OT_LAYOUT_NO_FEATURE_INDEX
&&
required_feature_stage
[
table_index
]
==
stage
)
m
.
add_lookups
(
face
,
table_index
,
required_feature_index
[
table_index
],
1
/* mask */
,
true
/* auto_zwj */
);
add_lookups
(
m
,
face
,
table_index
,
required_feature_index
[
table_index
],
1
/* mask */
,
true
/* auto_zwj */
);
for
(
unsigned
i
=
0
;
i
<
m
.
features
.
len
;
i
++
)
if
(
m
.
features
[
i
].
stage
[
table_index
]
==
stage
)
m
.
add_lookups
(
face
,
table_index
,
m
.
features
[
i
].
index
[
table_index
],
m
.
features
[
i
].
mask
,
m
.
features
[
i
].
auto_zwj
);
add_lookups
(
m
,
face
,
table_index
,
m
.
features
[
i
].
index
[
table_index
],
m
.
features
[
i
].
mask
,
m
.
features
[
i
].
auto_zwj
);
/* Sort lookups and merge duplicates */
if
(
last_num_lookups
<
m
.
lookups
[
table_index
].
len
)
...
...
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录