Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
OpenHarmony
Third Party Harfbuzz
提交
7cda6fa2
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看板
提交
7cda6fa2
编写于
7月 29, 2009
作者:
B
Behdad Esfahbod
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
[HB] Rename internal vars
上级
b196e6f2
变更
1
隐藏空白更改
内联
并排
Showing
1 changed file
with
28 addition
and
28 deletion
+28
-28
src/hb-ot-layout-gsubgpos-private.h
src/hb-ot-layout-gsubgpos-private.h
+28
-28
未找到文件。
src/hb-ot-layout-gsubgpos-private.h
浏览文件 @
7cda6fa2
...
...
@@ -232,16 +232,16 @@ static inline bool context_lookup (APPLY_ARG_DEF,
const
USHORT
input
[],
/* Array of input values--start with second glyph */
unsigned
int
lookupCount
,
const
LookupRecord
lookupRecord
[],
ContextLookupContext
&
context
)
ContextLookupContext
&
lookup_
context
)
{
return
match_input
(
APPLY_ARG
,
inputCount
,
input
,
context
.
funcs
.
match
,
context
.
match_data
,
lookup_context
.
funcs
.
match
,
lookup_
context
.
match_data
,
&
context_length
)
&&
apply_lookup
(
APPLY_ARG
,
inputCount
,
lookupCount
,
lookupRecord
,
context
.
funcs
.
apply
);
lookup_
context
.
funcs
.
apply
);
}
struct
Rule
...
...
@@ -249,7 +249,7 @@ struct Rule
friend
struct
RuleSet
;
private:
inline
bool
apply
(
APPLY_ARG_DEF
,
ContextLookupContext
&
context
)
const
inline
bool
apply
(
APPLY_ARG_DEF
,
ContextLookupContext
&
lookup_
context
)
const
{
const
LookupRecord
*
lookupRecord
=
(
const
LookupRecord
*
)
((
const
char
*
)
input
+
...
...
@@ -257,7 +257,7 @@ struct Rule
return
context_lookup
(
APPLY_ARG
,
inputCount
,
input
,
lookupCount
,
lookupRecord
,
context
);
lookup_
context
);
}
private:
...
...
@@ -274,12 +274,12 @@ ASSERT_SIZE (Rule, 4);
struct
RuleSet
{
inline
bool
apply
(
APPLY_ARG_DEF
,
ContextLookupContext
&
context
)
const
inline
bool
apply
(
APPLY_ARG_DEF
,
ContextLookupContext
&
lookup_
context
)
const
{
unsigned
int
num_rules
=
rule
.
len
;
for
(
unsigned
int
i
=
0
;
i
<
num_rules
;
i
++
)
{
if
((
this
+
rule
[
i
]).
apply
(
APPLY_ARG
,
context
))
if
((
this
+
rule
[
i
]).
apply
(
APPLY_ARG
,
lookup_
context
))
return
true
;
}
...
...
@@ -305,11 +305,11 @@ struct ContextFormat1
return
false
;
const
RuleSet
&
rule_set
=
this
+
ruleSet
[
index
];
struct
ContextLookupContext
context
=
{
struct
ContextLookupContext
lookup_
context
=
{
{
match_glyph
,
apply_func
},
NULL
};
return
rule_set
.
apply
(
APPLY_ARG
,
context
);
return
rule_set
.
apply
(
APPLY_ARG
,
lookup_
context
);
}
private:
...
...
@@ -341,11 +341,11 @@ struct ContextFormat2
/* LONGTERMTODO: Old code fetches glyph classes at most once and caches
* them across subrule lookups. Not sure it's worth it.
*/
struct
ContextLookupContext
context
=
{
struct
ContextLookupContext
lookup_
context
=
{
{
match_class
,
apply_func
},
(
char
*
)
&
class_def
};
return
rule_set
.
apply
(
APPLY_ARG
,
context
);
return
rule_set
.
apply
(
APPLY_ARG
,
lookup_
context
);
}
private:
...
...
@@ -377,14 +377,14 @@ struct ContextFormat3
const
LookupRecord
*
lookupRecord
=
(
const
LookupRecord
*
)
((
const
char
*
)
coverage
+
sizeof
(
coverage
[
0
])
*
glyphCount
);
struct
ContextLookupContext
context
=
{
struct
ContextLookupContext
lookup_
context
=
{
{
match_coverage
,
apply_func
},
(
char
*
)
this
};
return
context_lookup
(
APPLY_ARG
,
glyphCount
,
(
const
USHORT
*
)
(
coverage
+
1
),
lookupCount
,
lookupRecord
,
context
);
lookup_
context
);
}
private:
...
...
@@ -441,7 +441,7 @@ static inline bool chain_context_lookup (APPLY_ARG_DEF,
const
USHORT
lookahead
[],
unsigned
int
lookupCount
,
const
LookupRecord
lookupRecord
[],
ChainContextLookupContext
&
context
)
ChainContextLookupContext
&
lookup_
context
)
{
/* First guess */
if
(
HB_UNLIKELY
(
buffer
->
out_pos
<
backtrackCount
||
...
...
@@ -452,20 +452,20 @@ static inline bool chain_context_lookup (APPLY_ARG_DEF,
unsigned
int
offset
;
return
match_backtrack
(
APPLY_ARG
,
backtrackCount
,
backtrack
,
context
.
funcs
.
match
,
context
.
match_data
[
0
])
&&
lookup_context
.
funcs
.
match
,
lookup_
context
.
match_data
[
0
])
&&
match_input
(
APPLY_ARG
,
inputCount
,
input
,
context
.
funcs
.
match
,
context
.
match_data
[
1
],
lookup_context
.
funcs
.
match
,
lookup_
context
.
match_data
[
1
],
&
offset
)
&&
match_lookahead
(
APPLY_ARG
,
lookaheadCount
,
lookahead
,
context
.
funcs
.
match
,
context
.
match_data
[
2
],
lookup_context
.
funcs
.
match
,
lookup_
context
.
match_data
[
2
],
offset
)
&&
(
context_length
=
offset
,
true
)
&&
apply_lookup
(
APPLY_ARG
,
inputCount
,
lookupCount
,
lookupRecord
,
context
.
funcs
.
apply
);
lookup_
context
.
funcs
.
apply
);
}
struct
ChainRule
...
...
@@ -473,7 +473,7 @@ struct ChainRule
friend
struct
ChainRuleSet
;
private:
inline
bool
apply
(
APPLY_ARG_DEF
,
ChainContextLookupContext
&
context
)
const
inline
bool
apply
(
APPLY_ARG_DEF
,
ChainContextLookupContext
&
lookup_
context
)
const
{
const
HeadlessArrayOf
<
USHORT
>
&
input
=
*
(
const
HeadlessArrayOf
<
USHORT
>*
)
((
const
char
*
)
&
backtrack
+
backtrack
.
get_size
());
...
...
@@ -486,7 +486,7 @@ struct ChainRule
input
.
len
,
input
.
array
+
1
,
lookahead
.
len
,
lookahead
.
array
,
lookup
.
len
,
lookup
.
array
,
context
);
lookup_
context
);
return
false
;
}
...
...
@@ -510,12 +510,12 @@ ASSERT_SIZE (ChainRule, 8);
struct
ChainRuleSet
{
inline
bool
apply
(
APPLY_ARG_DEF
,
ChainContextLookupContext
&
context
)
const
inline
bool
apply
(
APPLY_ARG_DEF
,
ChainContextLookupContext
&
lookup_
context
)
const
{
unsigned
int
num_rules
=
rule
.
len
;
for
(
unsigned
int
i
=
0
;
i
<
num_rules
;
i
++
)
{
if
((
this
+
rule
[
i
]).
apply
(
APPLY_ARG
,
context
))
if
((
this
+
rule
[
i
]).
apply
(
APPLY_ARG
,
lookup_
context
))
return
true
;
}
...
...
@@ -541,11 +541,11 @@ struct ChainContextFormat1
return
false
;
const
ChainRuleSet
&
rule_set
=
this
+
ruleSet
[
index
];
struct
ChainContextLookupContext
context
=
{
struct
ChainContextLookupContext
lookup_
context
=
{
{
match_glyph
,
apply_func
},
{
NULL
,
NULL
,
NULL
}
};
return
rule_set
.
apply
(
APPLY_ARG
,
context
);
return
rule_set
.
apply
(
APPLY_ARG
,
lookup_
context
);
}
private:
USHORT
format
;
/* Format identifier--format = 1 */
...
...
@@ -578,13 +578,13 @@ struct ChainContextFormat2
/* LONGTERMTODO: Old code fetches glyph classes at most once and caches
* them across subrule lookups. Not sure it's worth it.
*/
struct
ChainContextLookupContext
context
=
{
struct
ChainContextLookupContext
lookup_
context
=
{
{
match_class
,
apply_func
},
{(
char
*
)
&
backtrack_class_def
,
(
char
*
)
&
input_class_def
,
(
char
*
)
&
lookahead_class_def
}
};
return
rule_set
.
apply
(
APPLY_ARG
,
context
);
return
rule_set
.
apply
(
APPLY_ARG
,
lookup_
context
);
}
private:
...
...
@@ -629,7 +629,7 @@ struct ChainContextFormat3
((
const
char
*
)
&
input
+
input
.
get_size
());
const
ArrayOf
<
LookupRecord
>
&
lookup
=
*
(
const
ArrayOf
<
LookupRecord
>*
)
((
const
char
*
)
&
lookahead
+
lookahead
.
get_size
());
struct
ChainContextLookupContext
context
=
{
struct
ChainContextLookupContext
lookup_
context
=
{
{
match_coverage
,
apply_func
},
{(
char
*
)
this
,
(
char
*
)
this
,
(
char
*
)
this
}
};
...
...
@@ -638,7 +638,7 @@ struct ChainContextFormat3
input
.
len
,
(
USHORT
*
)
input
.
array
,
lookahead
.
len
,
(
USHORT
*
)
lookahead
.
array
,
lookup
.
len
,
lookup
.
array
,
context
);
lookup_
context
);
return
false
;
}
...
...
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录