Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
OpenHarmony
Third Party Harfbuzz
提交
f14c2b7a
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看板
提交
f14c2b7a
编写于
5月 18, 2009
作者:
B
Behdad Esfahbod
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
[HB] Further modularize Context matching
上级
13ed4405
变更
1
隐藏空白更改
内联
并排
Showing
1 changed file
with
63 addition
and
29 deletion
+63
-29
src/hb-ot-layout-gsubgpos-private.h
src/hb-ot-layout-gsubgpos-private.h
+63
-29
未找到文件。
src/hb-ot-layout-gsubgpos-private.h
浏览文件 @
f14c2b7a
...
...
@@ -55,6 +55,7 @@ struct ContextFuncs {
apply_lookup_func_t
apply
;
};
static
inline
bool
match_glyph
(
hb_codepoint_t
glyph_id
,
const
USHORT
&
value
,
char
*
data
)
{
return
glyph_id
==
value
;
}
...
...
@@ -69,30 +70,14 @@ static inline bool match_coverage (hb_codepoint_t glyph_id, const USHORT &value,
return
(
data
+
coverage
)
(
glyph_id
)
!=
NOT_COVERED
;
}
struct
LookupRecord
{
USHORT
sequenceIndex
;
/* Index into current glyph
* sequence--first glyph = 0 */
USHORT
lookupListIndex
;
/* Lookup to apply to that
* position--zero--based */
};
ASSERT_SIZE
(
LookupRecord
,
4
);
/* Contextual lookups */
struct
ContextLookupContext
{
ContextFuncs
funcs
;
char
*
match_data
;
};
static
inline
bool
context_lookup
(
LOOKUP_ARGS_DEF
,
USHORT
inputCount
,
/* Including the first glyph (not matched) */
const
USHORT
input
[],
/* Array of input values--start with second glyph */
USHORT
lookupCount
,
const
LookupRecord
lookupRecord
[],
/* Array of LookupRecords--in design order */
ContextLookupContext
&
context
)
{
static
inline
bool
match_input
(
LOOKUP_ARGS_DEF
,
USHORT
inputCount
,
/* 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
;
...
...
@@ -110,26 +95,47 @@ static inline bool context_lookup (LOOKUP_ARGS_DEF,
j
++
;
}
if
(
HB_LIKELY
(
context
.
funcs
.
match
(
IN_GLYPH
(
j
),
input
[
i
-
1
],
context
.
match_data
)))
if
(
HB_LIKELY
(
match_func
(
IN_GLYPH
(
j
),
input
[
i
-
1
],
match_data
)))
return
false
;
}
/* XXX right? or j - buffer_inpos? */
context_length
=
count
;
*
context_length_out
=
count
;
return
true
;
}
struct
LookupRecord
{
USHORT
sequenceIndex
;
/* Index into current glyph
* sequence--first glyph = 0 */
USHORT
lookupListIndex
;
/* Lookup to apply to that
* position--zero--based */
};
ASSERT_SIZE
(
LookupRecord
,
4
);
static
inline
bool
apply_lookup
(
LOOKUP_ARGS_DEF
,
USHORT
inputCount
,
/* Including the first glyph */
USHORT
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
;
/* XXX We have to jump non-matching glyphs when applying too, right? */
/* XXX We don't support lookupRecord arrays that are not increasing:
* Should be easy for in_place ones at least. */
unsigned
int
record_count
=
lookupCount
;
const
LookupRecord
*
record
=
lookupRecord
;
for
(
i
=
0
;
i
<
count
;)
for
(
unsigned
int
i
=
0
;
i
<
count
;)
{
if
(
record_count
&&
i
==
record
->
sequenceIndex
)
{
unsigned
int
old_pos
=
buffer
->
in_pos
;
/* Apply a lookup */
bool
done
=
context
.
funcs
.
apply
(
LOOKUP_ARGS
,
record
->
lookupListIndex
);
bool
done
=
apply_func
(
LOOKUP_ARGS
,
record
->
lookupListIndex
);
record
++
;
record_count
--
;
...
...
@@ -150,6 +156,34 @@ static inline bool context_lookup (LOOKUP_ARGS_DEF,
return
true
;
}
/* Contextual lookups */
struct
ContextLookupContext
{
ContextFuncs
funcs
;
char
*
match_data
;
};
static
inline
bool
context_lookup
(
LOOKUP_ARGS_DEF
,
USHORT
inputCount
,
/* Including the first glyph (not matched) */
const
USHORT
input
[],
/* Array of input values--start with second glyph */
USHORT
lookupCount
,
const
LookupRecord
lookupRecord
[],
/* Array of LookupRecords--in design order */
ContextLookupContext
&
context
)
{
unsigned
int
i
,
j
;
unsigned
int
count
=
inputCount
;
return
match_input
(
LOOKUP_ARGS
,
inputCount
,
input
,
context
.
funcs
.
match
,
context
.
match_data
,
&
context_length
)
&&
apply_lookup
(
LOOKUP_ARGS
,
inputCount
,
lookupCount
,
lookupRecord
,
context
.
funcs
.
apply
);
}
struct
Rule
{
friend
struct
RuleSet
;
...
...
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录