Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
OpenHarmony
Third Party Harfbuzz
提交
998b0b68
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看板
提交
998b0b68
编写于
5月 02, 2019
作者:
B
Behdad Esfahbod
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
[serializer] Add copy() to (Unsized)ArrayOf
上级
88a41472
变更
2
隐藏空白更改
内联
并排
Showing
2 changed file
with
43 addition
and
2 deletion
+43
-2
src/hb-open-type.hh
src/hb-open-type.hh
+41
-0
src/hb-serialize.hh
src/hb-serialize.hh
+2
-2
未找到文件。
src/hb-open-type.hh
浏览文件 @
998b0b68
...
@@ -409,6 +409,36 @@ struct UnsizedArrayOf
...
@@ -409,6 +409,36 @@ struct UnsizedArrayOf
void
qsort
(
unsigned
int
len
,
unsigned
int
start
=
0
,
unsigned
int
end
=
(
unsigned
int
)
-
1
)
void
qsort
(
unsigned
int
len
,
unsigned
int
start
=
0
,
unsigned
int
end
=
(
unsigned
int
)
-
1
)
{
as_array
(
len
).
qsort
(
start
,
end
);
}
{
as_array
(
len
).
qsort
(
start
,
end
);
}
bool
serialize
(
hb_serialize_context_t
*
c
,
unsigned
int
items_len
)
{
TRACE_SERIALIZE
(
this
);
if
(
unlikely
(
!
c
->
extend
(
*
this
,
items_len
)))
return_trace
(
false
);
return_trace
(
true
);
}
template
<
typename
Iterator
,
hb_enable_if
(
hb_is_iterator_of
(
Iterator
,
const
Type
))>
bool
serialize
(
hb_serialize_context_t
*
c
,
Iterator
items
)
{
TRACE_SERIALIZE
(
this
);
unsigned
count
=
items
.
len
();
if
(
unlikely
(
!
serialize
(
c
,
count
)))
return_trace
(
false
);
/* TODO Umm. Just exhaust the iterator instead? Being extra
* cautious right now.. */
for
(
unsigned
i
=
0
;
i
<
count
;
i
++
,
items
++
)
arrayZ
[
i
]
=
*
items
;
return_trace
(
true
);
}
UnsizedArrayOf
*
copy
(
hb_serialize_context_t
*
c
,
unsigned
count
)
{
TRACE_SERIALIZE
(
this
);
auto
*
out
=
c
->
start_embed
(
*
this
);
if
(
unlikely
(
!
out
->
serialize
(
c
,
count
)))
return_trace
(
nullptr
);
for
(
unsigned
i
=
0
;
i
<
count
;
i
++
)
out
->
arrayZ
[
i
]
=
arrayZ
[
i
];
/* TODO: add version that calls c->copy() */
return_trace
(
out
);
}
bool
sanitize
(
hb_sanitize_context_t
*
c
,
unsigned
int
count
)
const
bool
sanitize
(
hb_sanitize_context_t
*
c
,
unsigned
int
count
)
const
{
{
TRACE_SANITIZE
(
this
);
TRACE_SANITIZE
(
this
);
...
@@ -580,6 +610,17 @@ struct ArrayOf
...
@@ -580,6 +610,17 @@ struct ArrayOf
return_trace
(
true
);
return_trace
(
true
);
}
}
ArrayOf
*
copy
(
hb_serialize_context_t
*
c
)
{
TRACE_SERIALIZE
(
this
);
auto
*
out
=
c
->
start_embed
(
*
this
);
unsigned
count
=
len
;
if
(
unlikely
(
!
out
->
serialize
(
c
,
count
)))
return_trace
(
nullptr
);
for
(
unsigned
i
=
0
;
i
<
count
;
i
++
)
out
->
arrayZ
[
i
]
=
arrayZ
[
i
];
/* TODO: add version that calls c->copy() */
return_trace
(
out
);
}
bool
sanitize
(
hb_sanitize_context_t
*
c
)
const
bool
sanitize
(
hb_sanitize_context_t
*
c
)
const
{
{
TRACE_SANITIZE
(
this
);
TRACE_SANITIZE
(
this
);
...
...
src/hb-serialize.hh
浏览文件 @
998b0b68
...
@@ -401,8 +401,8 @@ struct hb_serialize_context_t
...
@@ -401,8 +401,8 @@ struct hb_serialize_context_t
template
<
typename
Type
>
template
<
typename
Type
>
Type
*
extend_min
(
Type
&
obj
)
{
return
extend_size
(
obj
,
obj
.
min_size
);
}
Type
*
extend_min
(
Type
&
obj
)
{
return
extend_size
(
obj
,
obj
.
min_size
);
}
template
<
typename
Type
>
template
<
typename
Type
,
typename
...
Ts
>
Type
*
extend
(
Type
&
obj
)
{
return
extend_size
(
obj
,
obj
.
get_size
(
));
}
Type
*
extend
(
Type
&
obj
,
Ts
&&
...
ds
)
{
return
extend_size
(
obj
,
obj
.
get_size
(
hb_forward
<
Ts
>
(
ds
)...
));
}
/* Output routines. */
/* Output routines. */
hb_bytes_t
copy_bytes
()
const
hb_bytes_t
copy_bytes
()
const
...
...
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录