Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
OpenHarmony
Third Party Harfbuzz
提交
14ebf8af
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看板
提交
14ebf8af
编写于
10月 07, 2018
作者:
B
Behdad Esfahbod
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
[buffer] Improve shift_forward()
"Improve" is a strong word in this case though, I understand.
上级
f62f6e90
变更
1
隐藏空白更改
内联
并排
Showing
1 changed file
with
13 addition
and
3 deletion
+13
-3
src/hb-buffer.cc
src/hb-buffer.cc
+13
-3
未找到文件。
src/hb-buffer.cc
浏览文件 @
14ebf8af
...
...
@@ -182,7 +182,11 @@ hb_buffer_t::shift_forward (unsigned int count)
if
(
idx
+
count
>
len
)
{
/* Under memory failure we might expose this area. At least
* clean it up. Oh well... */
* clean it up. Oh well...
*
* Ideally, we should at least set Default_Ignorable bits on
* these, as well as consistent cluster values. But the former
* is layering violation... */
memset
(
info
+
len
,
0
,
(
idx
+
count
-
len
)
*
sizeof
(
info
[
0
]));
}
len
+=
count
;
...
...
@@ -399,8 +403,14 @@ hb_buffer_t::move_to (unsigned int i)
unsigned
int
count
=
out_len
-
i
;
/* This will blow in our face if memory allocation fails later
* in this same lookup... */
if
(
unlikely
(
idx
<
count
&&
!
shift_forward
(
count
+
32
)))
return
false
;
* in this same lookup...
*
* We used to shift with extra 32 items, instead of the 0 below.
* But that would leave empty slots in the buffer in case of allocation
* failures. Setting to zero for now to avoid other problems (see
* comments in shift_forward(). This can cause O(N^2) behavior more
* severely than adding 32 empty slots can... */
if
(
unlikely
(
idx
<
count
&&
!
shift_forward
(
count
+
0
)))
return
false
;
assert
(
idx
>=
count
);
...
...
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录