Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
OpenHarmony
Third Party Harfbuzz
提交
3ab7d264
T
Third Party Harfbuzz
项目概览
OpenHarmony
/
Third Party Harfbuzz
12 个月 前同步成功
通知
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,发现更多精彩内容 >>
提交
3ab7d264
编写于
2月 14, 2018
作者:
G
Garret Rieger
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
[subset] Fix memory leak in hb-ot-{maxp,os2}. Plus some formatting.
上级
66e282df
变更
2
隐藏空白更改
内联
并排
Showing
2 changed file
with
17 addition
and
13 deletion
+17
-13
src/hb-ot-maxp-table.hh
src/hb-ot-maxp-table.hh
+4
-2
src/hb-ot-os2-table.hh
src/hb-ot-os2-table.hh
+13
-11
未找到文件。
src/hb-ot-maxp-table.hh
浏览文件 @
3ab7d264
...
...
@@ -64,7 +64,7 @@ struct maxp
inline
bool
subset
(
hb_subset_plan_t
*
plan
)
const
{
hb_blob_t
*
maxp_blob
=
OT
::
Sanitizer
<
OT
::
maxp
>
().
sanitize
(
hb_face_reference_table
(
plan
->
source
,
HB_OT_TAG_maxp
));
// TODO hb_blob_copy_writable_or_fail
// TODO
(grieger):
hb_blob_copy_writable_or_fail
hb_blob_t
*
maxp_prime_blob
=
hb_blob_create_sub_blob
(
maxp_blob
,
0
,
-
1
);
hb_blob_destroy
(
maxp_blob
);
...
...
@@ -76,7 +76,9 @@ struct maxp
maxp_prime
->
set_num_glyphs
(
plan
->
gids_to_retain_sorted
.
len
);
return
hb_subset_plan_add_table
(
plan
,
HB_OT_TAG_maxp
,
maxp_prime_blob
);
bool
result
=
hb_subset_plan_add_table
(
plan
,
HB_OT_TAG_maxp
,
maxp_prime_blob
);
hb_blob_destroy
(
maxp_prime_blob
);
return
result
;
}
/* We only implement version 0.5 as none of the extra fields in version 1.0 are useful. */
...
...
src/hb-ot-os2-table.hh
浏览文件 @
3ab7d264
...
...
@@ -53,6 +53,7 @@ struct os2
{
hb_blob_t
*
os2_blob
=
OT
::
Sanitizer
<
OT
::
os2
>
().
sanitize
(
hb_face_reference_table
(
plan
->
source
,
HB_OT_TAG_os2
));
hb_blob_t
*
os2_prime_blob
=
hb_blob_create_sub_blob
(
os2_blob
,
0
,
-
1
);
// TODO(grieger): move to hb_blob_copy_writable_or_fail
hb_blob_destroy
(
os2_blob
);
OT
::
os2
*
os2_prime
=
(
OT
::
os2
*
)
hb_blob_get_data_writable
(
os2_prime_blob
,
nullptr
);
...
...
@@ -62,27 +63,28 @@ struct os2
}
uint16_t
min_cp
,
max_cp
;
find_min_and_max_codepoint
(
plan
,
&
min_cp
,
&
max_cp
);
find_min_and_max_codepoint
(
plan
->
codepoints
,
&
min_cp
,
&
max_cp
);
os2_prime
->
usFirstCharIndex
.
set
(
min_cp
);
os2_prime
->
usLastCharIndex
.
set
(
max_cp
);
return
hb_subset_plan_add_table
(
plan
,
HB_OT_TAG_os2
,
os2_prime_blob
);
bool
result
=
hb_subset_plan_add_table
(
plan
,
HB_OT_TAG_os2
,
os2_prime_blob
);
hb_blob_destroy
(
os2_prime_blob
);
return
result
;
}
static
inline
void
find_min_and_max_codepoint
(
hb_subset_plan_t
*
plan
,
uint16_t
*
min_cp
,
/* OUT */
uint16_t
*
max_cp
/* OUT */
)
static
inline
void
find_min_and_max_codepoint
(
const
hb_prealloced_array_t
<
hb_codepoint_t
>
&
codepoints
,
uint16_t
*
min_cp
,
/* OUT */
uint16_t
*
max_cp
/* OUT */
)
{
hb_codepoint_t
min
=
-
1
,
max
=
0
;
for
(
int
i
=
0
;
i
<
plan
->
codepoints
.
len
;
i
++
)
{
hb_codepoint_t
cp
=
plan
->
codepoints
[
i
];
if
(
cp
<
min
)
{
for
(
int
i
=
0
;
i
<
codepoints
.
len
;
i
++
)
{
hb_codepoint_t
cp
=
codepoints
[
i
];
if
(
cp
<
min
)
min
=
cp
;
}
if
(
cp
>
max
)
{
if
(
cp
>
max
)
max
=
cp
;
}
}
if
(
min
>
0xFFFF
)
...
...
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录