Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
OpenHarmony
Third Party Harfbuzz
提交
203d7106
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看板
提交
203d7106
编写于
5月 11, 2012
作者:
B
Behdad Esfahbod
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
[GSUB/GPOS] Check all glyph masks when matching input
上级
668c6046
变更
1
隐藏空白更改
内联
并排
Showing
1 changed file
with
12 addition
and
6 deletion
+12
-6
src/hb-ot-layout-gsubgpos-private.hh
src/hb-ot-layout-gsubgpos-private.hh
+12
-6
未找到文件。
src/hb-ot-layout-gsubgpos-private.hh
浏览文件 @
203d7106
...
@@ -134,11 +134,13 @@ struct hb_apply_context_t
...
@@ -134,11 +134,13 @@ struct hb_apply_context_t
{
{
inline
mark_skipping_forward_iterator_t
(
hb_apply_context_t
*
c_
,
inline
mark_skipping_forward_iterator_t
(
hb_apply_context_t
*
c_
,
unsigned
int
start_index_
,
unsigned
int
start_index_
,
unsigned
int
num_items_
)
unsigned
int
num_items_
,
hb_mask_t
mask_
=
0
)
{
{
c
=
c_
;
c
=
c_
;
idx
=
start_index_
;
idx
=
start_index_
;
num_items
=
num_items_
;
num_items
=
num_items_
;
mask
=
mask_
?
mask_
:
c
->
lookup_mask
;
end
=
MIN
(
c
->
buffer
->
len
,
c
->
buffer
->
idx
+
c
->
context_length
);
end
=
MIN
(
c
->
buffer
->
len
,
c
->
buffer
->
idx
+
c
->
context_length
);
}
}
inline
bool
has_no_chance
(
void
)
const
inline
bool
has_no_chance
(
void
)
const
...
@@ -156,7 +158,7 @@ struct hb_apply_context_t
...
@@ -156,7 +158,7 @@ struct hb_apply_context_t
idx
++
;
idx
++
;
}
while
(
_hb_ot_layout_skip_mark
(
c
->
face
,
&
c
->
buffer
->
info
[
idx
],
lookup_props
,
property_out
));
}
while
(
_hb_ot_layout_skip_mark
(
c
->
face
,
&
c
->
buffer
->
info
[
idx
],
lookup_props
,
property_out
));
num_items
--
;
num_items
--
;
return
true
;
return
!!
(
c
->
buffer
->
info
[
idx
].
mask
&
mask
)
;
}
}
inline
bool
next
(
unsigned
int
*
property_out
=
NULL
)
inline
bool
next
(
unsigned
int
*
property_out
=
NULL
)
{
{
...
@@ -167,6 +169,7 @@ struct hb_apply_context_t
...
@@ -167,6 +169,7 @@ struct hb_apply_context_t
private:
private:
hb_apply_context_t
*
c
;
hb_apply_context_t
*
c
;
unsigned
int
num_items
;
unsigned
int
num_items
;
hb_mask_t
mask
;
unsigned
int
end
;
unsigned
int
end
;
};
};
...
@@ -174,11 +177,13 @@ struct hb_apply_context_t
...
@@ -174,11 +177,13 @@ struct hb_apply_context_t
{
{
inline
mark_skipping_backward_iterator_t
(
hb_apply_context_t
*
c_
,
inline
mark_skipping_backward_iterator_t
(
hb_apply_context_t
*
c_
,
unsigned
int
start_index_
,
unsigned
int
start_index_
,
unsigned
int
num_items_
)
unsigned
int
num_items_
,
hb_mask_t
mask_
=
0
)
{
{
c
=
c_
;
c
=
c_
;
idx
=
start_index_
;
idx
=
start_index_
;
num_items
=
num_items_
;
num_items
=
num_items_
;
mask
=
mask_
?
mask_
:
c
->
lookup_mask
;
}
}
inline
bool
has_no_chance
(
void
)
const
inline
bool
has_no_chance
(
void
)
const
{
{
...
@@ -195,7 +200,7 @@ struct hb_apply_context_t
...
@@ -195,7 +200,7 @@ struct hb_apply_context_t
idx
--
;
idx
--
;
}
while
(
_hb_ot_layout_skip_mark
(
c
->
face
,
&
c
->
buffer
->
out_info
[
idx
],
lookup_props
,
property_out
));
}
while
(
_hb_ot_layout_skip_mark
(
c
->
face
,
&
c
->
buffer
->
out_info
[
idx
],
lookup_props
,
property_out
));
num_items
--
;
num_items
--
;
return
true
;
return
!!
(
c
->
buffer
->
info
[
idx
].
mask
&
mask
)
;
}
}
inline
bool
prev
(
unsigned
int
*
property_out
=
NULL
)
inline
bool
prev
(
unsigned
int
*
property_out
=
NULL
)
{
{
...
@@ -206,6 +211,7 @@ struct hb_apply_context_t
...
@@ -206,6 +211,7 @@ struct hb_apply_context_t
private:
private:
hb_apply_context_t
*
c
;
hb_apply_context_t
*
c
;
unsigned
int
num_items
;
unsigned
int
num_items
;
hb_mask_t
mask
;
};
};
inline
bool
should_mark_skip_current_glyph
(
void
)
const
inline
bool
should_mark_skip_current_glyph
(
void
)
const
...
@@ -335,7 +341,7 @@ static inline bool match_backtrack (hb_apply_context_t *c,
...
@@ -335,7 +341,7 @@ static inline bool match_backtrack (hb_apply_context_t *c,
match_func_t
match_func
,
match_func_t
match_func
,
const
void
*
match_data
)
const
void
*
match_data
)
{
{
hb_apply_context_t
::
mark_skipping_backward_iterator_t
skippy_iter
(
c
,
c
->
buffer
->
backtrack_len
(),
count
);
hb_apply_context_t
::
mark_skipping_backward_iterator_t
skippy_iter
(
c
,
c
->
buffer
->
backtrack_len
(),
count
,
(
hb_mask_t
)
-
1
);
if
(
skippy_iter
.
has_no_chance
())
if
(
skippy_iter
.
has_no_chance
())
return
false
;
return
false
;
...
@@ -358,7 +364,7 @@ static inline bool match_lookahead (hb_apply_context_t *c,
...
@@ -358,7 +364,7 @@ static inline bool match_lookahead (hb_apply_context_t *c,
const
void
*
match_data
,
const
void
*
match_data
,
unsigned
int
offset
)
unsigned
int
offset
)
{
{
hb_apply_context_t
::
mark_skipping_forward_iterator_t
skippy_iter
(
c
,
c
->
buffer
->
idx
+
offset
-
1
,
count
);
hb_apply_context_t
::
mark_skipping_forward_iterator_t
skippy_iter
(
c
,
c
->
buffer
->
idx
+
offset
-
1
,
count
,
(
hb_mask_t
)
-
1
);
if
(
skippy_iter
.
has_no_chance
())
if
(
skippy_iter
.
has_no_chance
())
return
false
;
return
false
;
...
...
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录