Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
OpenHarmony
Third Party Harfbuzz
提交
308f4192
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看板
提交
308f4192
编写于
1月 03, 2018
作者:
B
Behdad Esfahbod
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
[use] Fix Brahmi Number Joiner 1107F
Fixes
https://github.com/harfbuzz/harfbuzz/pull/660
上级
7b837e20
变更
4
隐藏空白更改
内联
并排
Showing
4 changed file
with
11 addition
and
11 deletion
+11
-11
src/gen-indic-table.py
src/gen-indic-table.py
+3
-3
src/gen-use-table.py
src/gen-use-table.py
+3
-3
src/hb-ot-shape-complex-indic-table.cc
src/hb-ot-shape-complex-indic-table.cc
+2
-2
src/hb-ot-shape-complex-use-table.cc
src/hb-ot-shape-complex-use-table.cc
+3
-3
未找到文件。
src/gen-indic-table.py
浏览文件 @
308f4192
...
...
@@ -229,13 +229,13 @@ print " {"
pages
=
set
([
u
>>
page_bits
for
u
in
starts
+
ends
+
singles
.
keys
()])
for
p
in
sorted
(
pages
):
print
" case 0x%0Xu:"
%
p
for
u
,
d
in
singles
.
items
():
if
p
!=
u
>>
page_bits
:
continue
print
" if (unlikely (u == 0x%04Xu)) return _(%s,%s);"
%
(
u
,
short
[
0
][
d
[
0
]],
short
[
1
][
d
[
1
]])
for
(
start
,
end
)
in
zip
(
starts
,
ends
):
if
p
not
in
[
start
>>
page_bits
,
end
>>
page_bits
]:
continue
offset
=
"indic_offset_0x%04xu"
%
start
print
" if (hb_in_range<hb_codepoint_t> (u, 0x%04Xu, 0x%04Xu)) return indic_table[u - 0x%04Xu + %s];"
%
(
start
,
end
-
1
,
start
,
offset
)
for
u
,
d
in
singles
.
items
():
if
p
!=
u
>>
page_bits
:
continue
print
" if (unlikely (u == 0x%04Xu)) return _(%s,%s);"
%
(
u
,
short
[
0
][
d
[
0
]],
short
[
1
][
d
[
1
]])
print
" break;"
print
""
print
" default:"
...
...
src/gen-use-table.py
浏览文件 @
308f4192
...
...
@@ -462,13 +462,13 @@ print " {"
pages
=
set
([
u
>>
page_bits
for
u
in
starts
+
ends
+
singles
.
keys
()])
for
p
in
sorted
(
pages
):
print
" case 0x%0Xu:"
%
p
for
u
,
d
in
singles
.
items
():
if
p
!=
u
>>
page_bits
:
continue
print
" if (unlikely (u == 0x%04Xu)) return %s;"
%
(
u
,
d
[
0
])
for
(
start
,
end
)
in
zip
(
starts
,
ends
):
if
p
not
in
[
start
>>
page_bits
,
end
>>
page_bits
]:
continue
offset
=
"use_offset_0x%04xu"
%
start
print
" if (hb_in_range<hb_codepoint_t> (u, 0x%04Xu, 0x%04Xu)) return use_table[u - 0x%04Xu + %s];"
%
(
start
,
end
-
1
,
start
,
offset
)
for
u
,
d
in
singles
.
items
():
if
p
!=
u
>>
page_bits
:
continue
print
" if (unlikely (u == 0x%04Xu)) return %s;"
%
(
u
,
d
[
0
])
print
" break;"
print
""
print
" default:"
...
...
src/hb-ot-shape-complex-indic-table.cc
浏览文件 @
308f4192
...
...
@@ -399,10 +399,10 @@ hb_indic_get_categories (hb_codepoint_t u)
switch
(
u
>>
12
)
{
case
0x0u
:
if
(
unlikely
(
u
==
0x00A0u
))
return
_
(
CP
,
x
);
if
(
hb_in_range
<
hb_codepoint_t
>
(
u
,
0x0028u
,
0x003Fu
))
return
indic_table
[
u
-
0x0028u
+
indic_offset_0x0028u
];
if
(
hb_in_range
<
hb_codepoint_t
>
(
u
,
0x00B0u
,
0x00D7u
))
return
indic_table
[
u
-
0x00B0u
+
indic_offset_0x00b0u
];
if
(
hb_in_range
<
hb_codepoint_t
>
(
u
,
0x0900u
,
0x0DF7u
))
return
indic_table
[
u
-
0x0900u
+
indic_offset_0x0900u
];
if
(
unlikely
(
u
==
0x00A0u
))
return
_
(
CP
,
x
);
break
;
case
0x1u
:
...
...
@@ -412,9 +412,9 @@ hb_indic_get_categories (hb_codepoint_t u)
break
;
case
0x2u
:
if
(
unlikely
(
u
==
0x25CCu
))
return
_
(
CP
,
x
);
if
(
hb_in_range
<
hb_codepoint_t
>
(
u
,
0x2008u
,
0x2017u
))
return
indic_table
[
u
-
0x2008u
+
indic_offset_0x2008u
];
if
(
hb_in_range
<
hb_codepoint_t
>
(
u
,
0x2070u
,
0x2087u
))
return
indic_table
[
u
-
0x2070u
+
indic_offset_0x2070u
];
if
(
unlikely
(
u
==
0x25CCu
))
return
_
(
CP
,
x
);
break
;
case
0xAu
:
...
...
src/hb-ot-shape-complex-use-table.cc
浏览文件 @
308f4192
...
...
@@ -683,10 +683,10 @@ hb_use_get_categories (hb_codepoint_t u)
switch
(
u
>>
12
)
{
case
0x0u
:
if
(
unlikely
(
u
==
0x034Fu
))
return
CGJ
;
if
(
hb_in_range
<
hb_codepoint_t
>
(
u
,
0x0028u
,
0x003Fu
))
return
use_table
[
u
-
0x0028u
+
use_offset_0x0028u
];
if
(
hb_in_range
<
hb_codepoint_t
>
(
u
,
0x00A0u
,
0x00D7u
))
return
use_table
[
u
-
0x00A0u
+
use_offset_0x00a0u
];
if
(
hb_in_range
<
hb_codepoint_t
>
(
u
,
0x0900u
,
0x0DF7u
))
return
use_table
[
u
-
0x0900u
+
use_offset_0x0900u
];
if
(
unlikely
(
u
==
0x034Fu
))
return
CGJ
;
break
;
case
0x1u
:
...
...
@@ -699,10 +699,10 @@ hb_use_get_categories (hb_codepoint_t u)
break
;
case
0x2u
:
if
(
unlikely
(
u
==
0x25CCu
))
return
GB
;
if
(
hb_in_range
<
hb_codepoint_t
>
(
u
,
0x2008u
,
0x2017u
))
return
use_table
[
u
-
0x2008u
+
use_offset_0x2008u
];
if
(
hb_in_range
<
hb_codepoint_t
>
(
u
,
0x2060u
,
0x2087u
))
return
use_table
[
u
-
0x2060u
+
use_offset_0x2060u
];
if
(
hb_in_range
<
hb_codepoint_t
>
(
u
,
0x20F0u
,
0x20F7u
))
return
use_table
[
u
-
0x20F0u
+
use_offset_0x20f0u
];
if
(
unlikely
(
u
==
0x25CCu
))
return
GB
;
break
;
case
0xAu
:
...
...
@@ -719,6 +719,7 @@ hb_use_get_categories (hb_codepoint_t u)
break
;
case
0x11u
:
if
(
unlikely
(
u
==
0x1107Fu
))
return
HN
;
if
(
hb_in_range
<
hb_codepoint_t
>
(
u
,
0x11000u
,
0x110BFu
))
return
use_table
[
u
-
0x11000u
+
use_offset_0x11000u
];
if
(
hb_in_range
<
hb_codepoint_t
>
(
u
,
0x11100u
,
0x1123Fu
))
return
use_table
[
u
-
0x11100u
+
use_offset_0x11100u
];
if
(
hb_in_range
<
hb_codepoint_t
>
(
u
,
0x11280u
,
0x11377u
))
return
use_table
[
u
-
0x11280u
+
use_offset_0x11280u
];
...
...
@@ -727,7 +728,6 @@ hb_use_get_categories (hb_codepoint_t u)
if
(
hb_in_range
<
hb_codepoint_t
>
(
u
,
0x11A00u
,
0x11A9Fu
))
return
use_table
[
u
-
0x11A00u
+
use_offset_0x11a00u
];
if
(
hb_in_range
<
hb_codepoint_t
>
(
u
,
0x11C00u
,
0x11CB7u
))
return
use_table
[
u
-
0x11C00u
+
use_offset_0x11c00u
];
if
(
hb_in_range
<
hb_codepoint_t
>
(
u
,
0x11D00u
,
0x11D5Fu
))
return
use_table
[
u
-
0x11D00u
+
use_offset_0x11d00u
];
if
(
unlikely
(
u
==
0x1107Fu
))
return
HN
;
break
;
default:
...
...
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录