Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
OpenHarmony
Third Party Harfbuzz
提交
969afd70
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看板
提交
969afd70
编写于
5月 18, 2009
作者:
B
Behdad Esfahbod
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
[GSUB] Implement ReverseChainSingleSubst
GSUB is done!
上级
4acaffd7
变更
2
隐藏空白更改
内联
并排
Showing
2 changed file
with
54 addition
and
44 deletion
+54
-44
src/hb-ot-layout-gsub-private.h
src/hb-ot-layout-gsub-private.h
+41
-14
src/hb-ot-layout-gsubgpos-private.h
src/hb-ot-layout-gsubgpos-private.h
+13
-30
未找到文件。
src/hb-ot-layout-gsub-private.h
浏览文件 @
969afd70
...
...
@@ -540,29 +540,56 @@ ASSERT_SIZE (ExtensionSubst, 2);
struct
ReverseChainSingleSubstFormat1
{
/* TODO */
friend
struct
ReverseChainSingleSubst
;
private:
inline
bool
substitute
(
LOOKUP_ARGS_DEF
)
const
{
if
(
HB_UNLIKELY
(
context_length
!=
NO_CONTEXT
))
return
false
;
/* No chaining to this type */
unsigned
int
index
=
(
this
+
coverage
)
(
IN_CURGLYPH
());
if
(
HB_LIKELY
(
index
==
NOT_COVERED
))
return
false
;
const
OffsetArrayOf
<
Coverage
>
&
lookahead
=
*
(
const
OffsetArrayOf
<
Coverage
>
*
)
((
const
char
*
)
&
backtrack
+
backtrack
.
get_size
());
const
ArrayOf
<
GlyphID
>
&
substitute
=
*
(
const
ArrayOf
<
GlyphID
>
*
)
((
const
char
*
)
&
lookahead
+
lookahead
.
get_size
());
if
(
match_backtrack
(
LOOKUP_ARGS
,
backtrack
.
len
,
(
USHORT
*
)
backtrack
.
array
,
match_coverage
,
(
char
*
)
this
)
&&
match_lookahead
(
LOOKUP_ARGS
,
lookahead
.
len
,
(
USHORT
*
)
lookahead
.
array
,
match_coverage
,
(
char
*
)
this
,
1
))
{
IN_CURGLYPH
()
=
substitute
[
index
];
buffer
->
in_pos
--
;
/* Reverse! */
return
true
;
}
return
false
;
}
private:
USHORT
format
;
/* Format identifier--format = 1 */
Offset
coverage
;
/* Offset to Coverage table -- from
* beginning of Substitution table */
USHORT
backtrackGlyphCount
;
/* Number of glyphs in the backtracking
* sequence */
Offset
backtrackCoverage
[];
/* Array of offsets to
coverage tables
Offset
To
<
Coverage
>
coverage
;
/* Offset to Coverage table--from
* beginning of table */
OffsetArrayOf
<
Coverage
>
backtrack
;
/* Array of
coverage tables
* in backtracking sequence, in glyph
* sequence order */
USHORT
lookaheadGlyphCount
;
/* Number of glyphs in lookahead
* sequence */
Offset
lookaheadCoverage
[];
/* Array of offsets to coverage tables
* in lookahead sequence, in glyph
OffsetArrayOf
<
Coverage
>
lookaheadX
;
/* Array of coverage tables
* in lookahead sequence, in glyph
* sequence order */
USHORT
glyphCount
;
/* Number of GlyphIDs in the Substitute
* array */
GlyphID
substituteGlyphs
[];
/* Array of substitute
* GlyphIDs--ordered by Coverage Index */
ArrayOf
<
GlyphID
>
substituteX
;
/* Array of substitute
* GlyphIDs--ordered by Coverage Index */
};
ASSERT_SIZE
(
ReverseChainSingleSubstFormat1
,
10
);
...
...
src/hb-ot-layout-gsubgpos-private.h
浏览文件 @
969afd70
...
...
@@ -221,11 +221,6 @@ static inline bool context_lookup (LOOKUP_ARGS_DEF,
const
LookupRecord
lookupRecord
[],
ContextLookupContext
&
context
)
{
/* First guess */
if
(
HB_UNLIKELY
(
buffer
->
in_pos
+
inputCount
>
buffer
->
in_length
||
inputCount
>
context_length
))
return
false
;
return
match_input
(
LOOKUP_ARGS
,
inputCount
,
input
,
context
.
funcs
.
match
,
context
.
match_data
,
...
...
@@ -246,10 +241,8 @@ struct Rule {
((
const
char
*
)
input
+
sizeof
(
input
[
0
])
*
(
inputCount
?
inputCount
-
1
:
0
));
return
context_lookup
(
LOOKUP_ARGS
,
inputCount
,
input
,
lookupCount
,
lookupRecord
,
inputCount
,
input
,
lookupCount
,
lookupRecord
,
context
);
}
...
...
@@ -374,10 +367,8 @@ struct ContextFormat3 {
(
char
*
)
this
};
return
context_lookup
(
LOOKUP_ARGS
,
glyphCount
,
(
const
USHORT
*
)
(
coverage
+
1
),
lookupCount
,
lookupRecord
,
glyphCount
,
(
const
USHORT
*
)
(
coverage
+
1
),
lookupCount
,
lookupRecord
,
context
);
}
...
...
@@ -473,14 +464,10 @@ struct ChainRule {
const
ArrayOf
<
LookupRecord
>
&
lookup
=
*
(
const
ArrayOf
<
LookupRecord
>
*
)
((
const
char
*
)
&
lookahead
+
lookahead
.
get_size
());
return
chain_context_lookup
(
LOOKUP_ARGS
,
backtrack
.
len
,
backtrack
.
array
,
input
.
len
,
input
.
array
+
1
,
lookahead
.
len
,
lookahead
.
array
,
lookup
.
len
,
lookup
.
array
,
backtrack
.
len
,
backtrack
.
array
,
input
.
len
,
input
.
array
+
1
,
lookahead
.
len
,
lookahead
.
array
,
lookup
.
len
,
lookup
.
array
,
context
);
return
false
;
}
...
...
@@ -623,7 +610,7 @@ struct ChainContextFormat3 {
return
false
;
const
OffsetArrayOf
<
Coverage
>
&
lookahead
=
*
(
const
OffsetArrayOf
<
Coverage
>
*
)
((
const
char
*
)
&
input
+
input
.
get_size
());
((
const
char
*
)
&
input
+
input
.
get_size
());
const
ArrayOf
<
LookupRecord
>
&
lookup
=
*
(
const
ArrayOf
<
LookupRecord
>
*
)
((
const
char
*
)
&
lookahead
+
lookahead
.
get_size
());
struct
ChainContextLookupContext
context
=
{
...
...
@@ -631,14 +618,10 @@ struct ChainContextFormat3 {
{(
char
*
)
this
,
(
char
*
)
this
,
(
char
*
)
this
}
};
return
chain_context_lookup
(
LOOKUP_ARGS
,
backtrack
.
len
,
(
USHORT
*
)
backtrack
.
array
,
input
.
len
,
(
USHORT
*
)
input
.
array
,
lookahead
.
len
,
(
USHORT
*
)
lookahead
.
array
,
lookup
.
len
,
lookup
.
array
,
backtrack
.
len
,
(
USHORT
*
)
backtrack
.
array
,
input
.
len
,
(
USHORT
*
)
input
.
array
,
lookahead
.
len
,
(
USHORT
*
)
lookahead
.
array
,
lookup
.
len
,
lookup
.
array
,
context
);
return
false
;
}
...
...
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录