Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
OpenHarmony
Third Party Harfbuzz
提交
cf059ac6
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看板
提交
cf059ac6
编写于
5月 24, 2013
作者:
B
Behdad Esfahbod
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
[icu_le] Support non-BMP text
上级
a447c528
变更
1
隐藏空白更改
内联
并排
Showing
1 changed file
with
28 addition
and
7 deletion
+28
-7
src/hb-icu-le.cc
src/hb-icu-le.cc
+28
-7
未找到文件。
src/hb-icu-le.cc
浏览文件 @
cf059ac6
...
...
@@ -134,25 +134,46 @@ retry:
unsigned
int
scratch_size
;
char
*
scratch
=
(
char
*
)
buffer
->
get_scratch_buffer
(
&
scratch_size
);
LEUnicode
*
pchars
=
(
LEUnicode
*
)
scratch
;
unsigned
int
chars_len
=
0
;
for
(
unsigned
int
i
=
0
;
i
<
buffer
->
len
;
i
++
)
{
hb_codepoint_t
c
=
buffer
->
info
[
i
].
codepoint
;
if
(
likely
(
c
<
0x10000
))
pchars
[
chars_len
++
]
=
c
;
else
if
(
unlikely
(
c
>=
0x110000
))
pchars
[
chars_len
++
]
=
0xFFFD
;
else
{
pchars
[
chars_len
++
]
=
0xD800
+
((
c
-
0x10000
)
>>
10
);
pchars
[
chars_len
++
]
=
0xDC00
+
((
c
-
0x10000
)
&
((
1
<<
10
)
-
1
));
}
}
#define ALLOCATE_ARRAY(Type, name, len) \
Type *name = (Type *) scratch; \
scratch += (len) * sizeof ((name)[0]); \
scratch_size -= (len) * sizeof ((name)[0]);
ALLOCATE_ARRAY
(
LEUnicode
,
chars
,
buffer
->
len
);
ALLOCATE_ARRAY
(
unsigned
int
,
clusters
,
buffer
->
len
);
ALLOCATE_ARRAY
(
LEUnicode
,
chars
,
chars_
len
);
ALLOCATE_ARRAY
(
unsigned
int
,
clusters
,
chars_
len
);
/* XXX Use UTF-16 decoder! */
chars_len
=
0
;
for
(
unsigned
int
i
=
0
;
i
<
buffer
->
len
;
i
++
)
{
chars
[
i
]
=
buffer
->
info
[
i
].
codepoint
;
clusters
[
i
]
=
buffer
->
info
[
i
].
cluster
;
hb_codepoint_t
c
=
buffer
->
info
[
i
].
codepoint
;
if
(
likely
(
c
<
0x10000
))
clusters
[
chars_len
++
]
=
buffer
->
info
[
i
].
cluster
;
else
if
(
unlikely
(
c
>=
0x110000
))
clusters
[
chars_len
++
]
=
buffer
->
info
[
i
].
cluster
;
else
{
clusters
[
chars_len
++
]
=
buffer
->
info
[
i
].
cluster
;
clusters
[
chars_len
++
]
=
buffer
->
info
[
i
].
cluster
;
}
}
unsigned
int
glyph_count
=
le_layoutChars
(
le
,
chars
,
0
,
buffer
->
len
,
buffer
->
len
,
chars_
len
,
chars_
len
,
HB_DIRECTION_IS_BACKWARD
(
buffer
->
props
.
direction
),
0.
,
0.
,
&
status
);
...
...
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录