Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
OpenHarmony
Third Party Harfbuzz
提交
e072c24e
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看板
提交
e072c24e
编写于
5月 18, 2009
作者:
B
Behdad Esfahbod
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
[HB] Implement backtrack matching
上级
02e1e5c6
变更
1
隐藏空白更改
内联
并排
Showing
1 changed file
with
45 addition
and
16 deletion
+45
-16
src/hb-ot-layout-gsubgpos-private.h
src/hb-ot-layout-gsubgpos-private.h
+45
-16
未找到文件。
src/hb-ot-layout-gsubgpos-private.h
浏览文件 @
e072c24e
...
...
@@ -71,19 +71,36 @@ static inline bool match_coverage (hb_codepoint_t glyph_id, const USHORT &value,
}
static
inline
bool
match_backtrack
(
LOOKUP_ARGS_DEF
,
unsigned
int
count
,
const
USHORT
backtrack
[],
match_func_t
match_func
,
char
*
match_data
)
{
unsigned
int
i
,
j
;
for
(
i
=
0
,
j
=
buffer
->
out_pos
-
1
;
i
<
count
;
i
++
,
j
--
)
{
while
(
!
_hb_ot_layout_check_glyph_property
(
layout
,
OUT_ITEM
(
j
),
lookup_flag
,
&
property
))
{
if
(
HB_UNLIKELY
(
j
+
1
==
count
-
i
))
return
false
;
j
--
;
}
if
(
HB_LIKELY
(
match_func
(
OUT_GLYPH
(
j
),
backtrack
[
i
],
match_data
)))
return
false
;
}
return
true
;
}
static
inline
bool
match_input
(
LOOKUP_ARGS_DEF
,
USHORT
inputC
ount
,
/* Including the first glyph (not matched) */
unsigned
int
c
ount
,
/* Including the first glyph (not matched) */
const
USHORT
input
[],
/* Array of input values--start with second glyph */
match_func_t
match_func
,
char
*
match_data
,
unsigned
int
*
context_length_out
)
{
unsigned
int
i
,
j
;
unsigned
int
count
=
inputCount
;
if
(
HB_UNLIKELY
(
buffer
->
in_pos
+
count
>
buffer
->
in_length
||
context_length
<
count
))
return
false
;
/* Not enough glyphs in input or context */
/* XXX context_length should also be checked when skipping glyphs, right?
* What does context_length really mean, anyway? */
...
...
@@ -116,12 +133,11 @@ struct LookupRecord {
ASSERT_SIZE
(
LookupRecord
,
4
);
static
inline
bool
apply_lookup
(
LOOKUP_ARGS_DEF
,
USHORT
inputC
ount
,
/* Including the first glyph */
USHORT
lookupCount
,
unsigned
int
c
ount
,
/* Including the first glyph */
unsigned
int
lookupCount
,
const
LookupRecord
lookupRecord
[],
/* Array of LookupRecords--in design order */
apply_lookup_func_t
apply_func
)
{
unsigned
int
count
=
inputCount
;
unsigned
int
record_count
=
lookupCount
;
const
LookupRecord
*
record
=
lookupRecord
;
...
...
@@ -165,12 +181,17 @@ struct ContextLookupContext {
};
static
inline
bool
context_lookup
(
LOOKUP_ARGS_DEF
,
USHORT
inputCount
,
/* Including the first glyph (not matched) */
unsigned
int
inputCount
,
/* Including the first glyph (not matched) */
const
USHORT
input
[],
/* Array of input values--start with second glyph */
USHORT
lookupCount
,
unsigned
int
lookupCount
,
const
LookupRecord
lookupRecord
[],
ContextLookupContext
&
context
)
{
/* First guess */
if
(
HB_UNLIKELY
(
buffer
->
in_pos
+
inputCount
>
buffer
->
in_length
||
context_length
<
inputCount
))
return
false
;
return
match_input
(
LOOKUP_ARGS
,
inputCount
,
input
,
context
.
funcs
.
match
,
context
.
match_data
,
...
...
@@ -370,17 +391,25 @@ struct ChainContextLookupContext {
};
static
inline
bool
chain_context_lookup
(
LOOKUP_ARGS_DEF
,
USHORT
backtrackCount
,
unsigned
int
backtrackCount
,
const
USHORT
backtrack
[],
USHORT
inputCount
,
/* Including the first glyph (not matched) */
unsigned
int
inputCount
,
/* Including the first glyph (not matched) */
const
USHORT
input
[],
/* Array of input values--start with second glyph */
USHORT
lookaheadCount
,
unsigned
int
lookaheadCount
,
const
USHORT
lookahead
[],
USHORT
lookupCount
,
unsigned
int
lookupCount
,
const
LookupRecord
lookupRecord
[],
ChainContextLookupContext
&
context
)
{
return
match_input
(
LOOKUP_ARGS
,
/* First guess */
if
(
HB_UNLIKELY
(
buffer
->
out_pos
<
backtrackCount
||
buffer
->
in_pos
+
inputCount
+
lookaheadCount
>
buffer
->
in_length
))
return
false
;
return
match_backtrack
(
LOOKUP_ARGS
,
backtrackCount
,
backtrack
,
context
.
funcs
.
match
,
context
.
match_data
[
0
])
&&
match_input
(
LOOKUP_ARGS
,
inputCount
,
input
,
context
.
funcs
.
match
,
context
.
match_data
[
1
],
&
context_length
)
&&
...
...
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录