Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
OpenHarmony
Third Party Harfbuzz
提交
f1aaa2a4
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看板
提交
f1aaa2a4
编写于
4月 23, 2010
作者:
B
Behdad Esfahbod
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
Add TODO
上级
33d4d432
变更
5
隐藏空白更改
内联
并排
Showing
5 changed file
with
10 addition
and
9 deletion
+10
-9
src/hb-ft.c
src/hb-ft.c
+0
-2
src/hb-ft.h
src/hb-ft.h
+1
-0
src/hb-open-file-private.hh
src/hb-open-file-private.hh
+1
-1
src/hb-open-type-private.hh
src/hb-open-type-private.hh
+2
-0
src/hb-ot-layout-common-private.hh
src/hb-ot-layout-common-private.hh
+6
-6
未找到文件。
src/hb-ft.c
浏览文件 @
f1aaa2a4
...
@@ -177,7 +177,6 @@ hb_ft_face_create (FT_Face ft_face,
...
@@ -177,7 +177,6 @@ hb_ft_face_create (FT_Face ft_face,
{
{
hb_face_t
*
face
;
hb_face_t
*
face
;
/* TODO: Handle NULL ft_face (in other places too) */
if
(
ft_face
->
stream
->
read
==
NULL
)
{
if
(
ft_face
->
stream
->
read
==
NULL
)
{
hb_blob_t
*
blob
;
hb_blob_t
*
blob
;
...
@@ -204,7 +203,6 @@ hb_ft_face_finalize (FT_Face ft_face)
...
@@ -204,7 +203,6 @@ hb_ft_face_finalize (FT_Face ft_face)
hb_face_t
*
hb_face_t
*
hb_ft_face_create_cached
(
FT_Face
ft_face
)
hb_ft_face_create_cached
(
FT_Face
ft_face
)
{
{
/* TODO: Not thread-safe */
if
(
HB_UNLIKELY
(
!
ft_face
->
generic
.
data
||
ft_face
->
generic
.
finalizer
!=
(
FT_Generic_Finalizer
)
hb_ft_face_finalize
))
if
(
HB_UNLIKELY
(
!
ft_face
->
generic
.
data
||
ft_face
->
generic
.
finalizer
!=
(
FT_Generic_Finalizer
)
hb_ft_face_finalize
))
{
{
if
(
ft_face
->
generic
.
finalizer
)
if
(
ft_face
->
generic
.
finalizer
)
...
...
src/hb-ft.h
浏览文件 @
f1aaa2a4
...
@@ -43,6 +43,7 @@ hb_face_t *
...
@@ -43,6 +43,7 @@ hb_face_t *
hb_ft_face_create
(
FT_Face
ft_face
,
hb_ft_face_create
(
FT_Face
ft_face
,
hb_destroy_func_t
destroy
);
hb_destroy_func_t
destroy
);
/* Note: This function is not thread-safe */
hb_face_t
*
hb_face_t
*
hb_ft_face_create_cached
(
FT_Face
ft_face
);
hb_ft_face_create_cached
(
FT_Face
ft_face
);
...
...
src/hb-open-file-private.hh
浏览文件 @
f1aaa2a4
...
@@ -84,7 +84,7 @@ typedef struct OffsetTable
...
@@ -84,7 +84,7 @@ typedef struct OffsetTable
{
{
Tag
t
;
Tag
t
;
t
.
set
(
tag
);
t
.
set
(
tag
);
/
/ TODO: bsearch (need to sort in sanitize)
/
* TODO: bsearch (need to sort in sanitize) */
unsigned
int
count
=
numTables
;
unsigned
int
count
=
numTables
;
for
(
unsigned
int
i
=
0
;
i
<
count
;
i
++
)
for
(
unsigned
int
i
=
0
;
i
<
count
;
i
++
)
{
{
...
...
src/hb-open-type-private.hh
浏览文件 @
f1aaa2a4
...
@@ -366,6 +366,8 @@ struct Sanitizer
...
@@ -366,6 +366,8 @@ struct Sanitizer
template
<
typename
Type
,
int
Bytes
>
class
BEInt
;
template
<
typename
Type
,
int
Bytes
>
class
BEInt
;
/* LONGTERMTODO: On machines allowing unaligned access, we can make the
* following tighter by using byteswap instructions on ints directly. */
template
<
typename
Type
>
template
<
typename
Type
>
class
BEInt
<
Type
,
2
>
class
BEInt
<
Type
,
2
>
{
{
...
...
src/hb-ot-layout-common-private.hh
浏览文件 @
f1aaa2a4
...
@@ -87,7 +87,7 @@ struct RecordArrayOf : ArrayOf<Record<Type> > {
...
@@ -87,7 +87,7 @@ struct RecordArrayOf : ArrayOf<Record<Type> > {
{
{
Tag
t
;
Tag
t
;
t
.
set
(
tag
);
t
.
set
(
tag
);
/
/ TODO: bsearch (need to sort in sanitize)
/
* TODO: bsearch (need to sort in sanitize) */
const
Record
<
Type
>
*
a
=
this
->
array
();
const
Record
<
Type
>
*
a
=
this
->
array
();
unsigned
int
count
=
this
->
len
;
unsigned
int
count
=
this
->
len
;
for
(
unsigned
int
i
=
0
;
i
<
count
;
i
++
)
for
(
unsigned
int
i
=
0
;
i
<
count
;
i
++
)
...
@@ -235,8 +235,8 @@ struct Feature
...
@@ -235,8 +235,8 @@ struct Feature
return
SANITIZE_SELF
()
&&
SANITIZE
(
lookupIndex
);
return
SANITIZE_SELF
()
&&
SANITIZE
(
lookupIndex
);
}
}
/* TODO: implement get_feature_parameters() */
/*
LONGTERM
TODO: implement get_feature_parameters() */
/* TODO: implement FeatureSize and other special features? */
/*
LONGTERM
TODO: implement FeatureSize and other special features? */
Offset
featureParams
;
/* Offset to Feature Parameters table (if one
Offset
featureParams
;
/* Offset to Feature Parameters table (if one
* has been defined for the feature), relative
* has been defined for the feature), relative
* to the beginning of the Feature Table; = Null
* to the beginning of the Feature Table; = Null
...
@@ -321,7 +321,7 @@ struct CoverageFormat1
...
@@ -321,7 +321,7 @@ struct CoverageFormat1
return
NOT_COVERED
;
return
NOT_COVERED
;
GlyphID
gid
;
GlyphID
gid
;
gid
.
set
(
glyph_id
);
gid
.
set
(
glyph_id
);
/
/ TODO: bsearch (need to sort in sanitize)
/
* TODO: bsearch (need to sort in sanitize) */
unsigned
int
num_glyphs
=
glyphArray
.
len
;
unsigned
int
num_glyphs
=
glyphArray
.
len
;
for
(
unsigned
int
i
=
0
;
i
<
num_glyphs
;
i
++
)
for
(
unsigned
int
i
=
0
;
i
<
num_glyphs
;
i
++
)
if
(
gid
==
glyphArray
[
i
])
if
(
gid
==
glyphArray
[
i
])
...
@@ -377,7 +377,7 @@ struct CoverageFormat2
...
@@ -377,7 +377,7 @@ struct CoverageFormat2
private:
private:
inline
unsigned
int
get_coverage
(
hb_codepoint_t
glyph_id
)
const
inline
unsigned
int
get_coverage
(
hb_codepoint_t
glyph_id
)
const
{
{
/
/ TODO: bsearch (need to sort in sanitize)
/
* TODO: bsearch (need to sort in sanitize) */
unsigned
int
count
=
rangeRecord
.
len
;
unsigned
int
count
=
rangeRecord
.
len
;
for
(
unsigned
int
i
=
0
;
i
<
count
;
i
++
)
for
(
unsigned
int
i
=
0
;
i
<
count
;
i
++
)
{
{
...
@@ -497,7 +497,7 @@ struct ClassDefFormat2
...
@@ -497,7 +497,7 @@ struct ClassDefFormat2
private:
private:
inline
hb_ot_layout_class_t
get_class
(
hb_codepoint_t
glyph_id
)
const
inline
hb_ot_layout_class_t
get_class
(
hb_codepoint_t
glyph_id
)
const
{
{
/
/ TODO: bsearch (need to sort in sanitize)
/
* TODO: bsearch (need to sort in sanitize) */
unsigned
int
count
=
rangeRecord
.
len
;
unsigned
int
count
=
rangeRecord
.
len
;
for
(
unsigned
int
i
=
0
;
i
<
count
;
i
++
)
for
(
unsigned
int
i
=
0
;
i
<
count
;
i
++
)
{
{
...
...
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录