Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
OpenHarmony
Third Party Harfbuzz
提交
e53d7714
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看板
提交
e53d7714
编写于
5月 21, 2010
作者:
B
Behdad Esfahbod
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
Speed up feature mask setting
Patch from Jonathan Kew.
上级
4fa67f34
变更
1
隐藏空白更改
内联
并排
Showing
1 changed file
with
25 addition
and
6 deletion
+25
-6
src/hb-ot-shape.cc
src/hb-ot-shape.cc
+25
-6
未找到文件。
src/hb-ot-shape.cc
浏览文件 @
e53d7714
...
...
@@ -122,6 +122,7 @@ setup_lookups (hb_face_t *face,
buffer
->
info
[
i
].
mask
=
1
;
unsigned
int
last_bit_used
=
1
;
unsigned
int
global_values
=
0
;
for
(
i
=
0
;
i
<
num_features
;
i
++
)
{
unsigned
int
bits_needed
=
_hb_bit_storage
(
features
[
i
].
value
);
...
...
@@ -136,15 +137,33 @@ setup_lookups (hb_face_t *face,
&
feature_index
))
add_feature
(
face
,
table_tag
,
feature_index
,
mask
,
lookups
,
num_lookups
,
room_lookups
);
/* Turn mask on in the buffer, the über-slow way! */
unsigned
int
count
=
buffer
->
len
;
for
(
unsigned
int
j
=
0
;
j
<
count
;
j
++
)
{
unsigned
int
cluster
=
buffer
->
info
[
j
].
cluster
;
if
(
features
[
i
].
start
<=
cluster
&&
cluster
<
features
[
i
].
end
)
buffer
->
info
[
j
].
mask
|=
value
;
if
(
features
[
i
].
start
==
0
&&
features
[
i
].
end
==
(
unsigned
int
)
-
1
)
global_values
|=
value
;
else
{
unsigned
int
start
=
features
[
i
].
start
,
end
=
features
[
i
].
end
;
unsigned
int
a
=
0
,
b
=
buffer
->
len
;
while
(
a
<
b
)
{
unsigned
int
h
=
a
+
((
b
-
a
)
/
2
);
if
(
buffer
->
info
[
h
].
cluster
<
start
)
a
=
h
+
1
;
else
b
=
h
;
}
unsigned
int
count
=
buffer
->
len
;
for
(
unsigned
int
j
=
a
;
j
<
count
&&
buffer
->
info
[
j
].
cluster
<
end
;
j
++
)
buffer
->
info
[
j
].
mask
|=
value
;
}
}
if
(
global_values
)
{
unsigned
int
count
=
buffer
->
len
;
for
(
unsigned
int
j
=
0
;
j
<
count
;
j
++
)
buffer
->
info
[
j
].
mask
|=
global_values
;
}
qsort
(
lookups
,
*
num_lookups
,
sizeof
(
lookups
[
0
]),
cmp_lookups
);
if
(
*
num_lookups
)
...
...
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录