Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
OpenHarmony
Third Party Harfbuzz
提交
9082efc4
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看板
体验新版 GitCode,发现更多精彩内容 >>
提交
9082efc4
编写于
2月 11, 2013
作者:
B
Behdad Esfahbod
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
[OTLayout] s/mark_skipping/skipping/
In aticipation of upcoming changes.
上级
9621e0ba
变更
2
隐藏空白更改
内联
并排
Showing
2 changed file
with
20 addition
and
20 deletion
+20
-20
src/hb-ot-layout-gpos-table.hh
src/hb-ot-layout-gpos-table.hh
+6
-6
src/hb-ot-layout-gsubgpos-private.hh
src/hb-ot-layout-gsubgpos-private.hh
+14
-14
未找到文件。
src/hb-ot-layout-gpos-table.hh
浏览文件 @
9082efc4
...
@@ -658,7 +658,7 @@ struct PairPosFormat1
...
@@ -658,7 +658,7 @@ struct PairPosFormat1
inline
bool
apply
(
hb_apply_context_t
*
c
)
const
inline
bool
apply
(
hb_apply_context_t
*
c
)
const
{
{
TRACE_APPLY
(
this
);
TRACE_APPLY
(
this
);
hb_apply_context_t
::
mark_
skipping_forward_iterator_t
skippy_iter
(
c
,
c
->
buffer
->
idx
,
1
);
hb_apply_context_t
::
skipping_forward_iterator_t
skippy_iter
(
c
,
c
->
buffer
->
idx
,
1
);
if
(
skippy_iter
.
has_no_chance
())
return
TRACE_RETURN
(
false
);
if
(
skippy_iter
.
has_no_chance
())
return
TRACE_RETURN
(
false
);
unsigned
int
index
=
(
this
+
coverage
).
get_coverage
(
c
->
buffer
->
cur
().
codepoint
);
unsigned
int
index
=
(
this
+
coverage
).
get_coverage
(
c
->
buffer
->
cur
().
codepoint
);
...
@@ -730,7 +730,7 @@ struct PairPosFormat2
...
@@ -730,7 +730,7 @@ struct PairPosFormat2
inline
bool
apply
(
hb_apply_context_t
*
c
)
const
inline
bool
apply
(
hb_apply_context_t
*
c
)
const
{
{
TRACE_APPLY
(
this
);
TRACE_APPLY
(
this
);
hb_apply_context_t
::
mark_
skipping_forward_iterator_t
skippy_iter
(
c
,
c
->
buffer
->
idx
,
1
);
hb_apply_context_t
::
skipping_forward_iterator_t
skippy_iter
(
c
,
c
->
buffer
->
idx
,
1
);
if
(
skippy_iter
.
has_no_chance
())
return
TRACE_RETURN
(
false
);
if
(
skippy_iter
.
has_no_chance
())
return
TRACE_RETURN
(
false
);
unsigned
int
index
=
(
this
+
coverage
).
get_coverage
(
c
->
buffer
->
cur
().
codepoint
);
unsigned
int
index
=
(
this
+
coverage
).
get_coverage
(
c
->
buffer
->
cur
().
codepoint
);
...
@@ -880,7 +880,7 @@ struct CursivePosFormat1
...
@@ -880,7 +880,7 @@ struct CursivePosFormat1
/* We don't handle mark glyphs here. */
/* We don't handle mark glyphs here. */
if
(
c
->
property
&
HB_OT_LAYOUT_GLYPH_PROPS_MARK
)
return
TRACE_RETURN
(
false
);
if
(
c
->
property
&
HB_OT_LAYOUT_GLYPH_PROPS_MARK
)
return
TRACE_RETURN
(
false
);
hb_apply_context_t
::
mark_
skipping_forward_iterator_t
skippy_iter
(
c
,
c
->
buffer
->
idx
,
1
);
hb_apply_context_t
::
skipping_forward_iterator_t
skippy_iter
(
c
,
c
->
buffer
->
idx
,
1
);
if
(
skippy_iter
.
has_no_chance
())
return
TRACE_RETURN
(
false
);
if
(
skippy_iter
.
has_no_chance
())
return
TRACE_RETURN
(
false
);
const
EntryExitRecord
&
this_record
=
entryExitRecord
[(
this
+
coverage
).
get_coverage
(
c
->
buffer
->
cur
().
codepoint
)];
const
EntryExitRecord
&
this_record
=
entryExitRecord
[(
this
+
coverage
).
get_coverage
(
c
->
buffer
->
cur
().
codepoint
)];
...
@@ -1029,7 +1029,7 @@ struct MarkBasePosFormat1
...
@@ -1029,7 +1029,7 @@ struct MarkBasePosFormat1
/* now we search backwards for a non-mark glyph */
/* now we search backwards for a non-mark glyph */
unsigned
int
property
;
unsigned
int
property
;
hb_apply_context_t
::
mark_
skipping_backward_iterator_t
skippy_iter
(
c
,
c
->
buffer
->
idx
,
1
);
hb_apply_context_t
::
skipping_backward_iterator_t
skippy_iter
(
c
,
c
->
buffer
->
idx
,
1
);
do
{
do
{
if
(
!
skippy_iter
.
prev
(
&
property
,
LookupFlag
::
IgnoreMarks
))
return
TRACE_RETURN
(
false
);
if
(
!
skippy_iter
.
prev
(
&
property
,
LookupFlag
::
IgnoreMarks
))
return
TRACE_RETURN
(
false
);
/* We only want to attach to the first of a MultipleSubst sequence. Reject others. */
/* We only want to attach to the first of a MultipleSubst sequence. Reject others. */
...
@@ -1133,7 +1133,7 @@ struct MarkLigPosFormat1
...
@@ -1133,7 +1133,7 @@ struct MarkLigPosFormat1
/* now we search backwards for a non-mark glyph */
/* now we search backwards for a non-mark glyph */
unsigned
int
property
;
unsigned
int
property
;
hb_apply_context_t
::
mark_
skipping_backward_iterator_t
skippy_iter
(
c
,
c
->
buffer
->
idx
,
1
);
hb_apply_context_t
::
skipping_backward_iterator_t
skippy_iter
(
c
,
c
->
buffer
->
idx
,
1
);
if
(
!
skippy_iter
.
prev
(
&
property
,
LookupFlag
::
IgnoreMarks
))
return
TRACE_RETURN
(
false
);
if
(
!
skippy_iter
.
prev
(
&
property
,
LookupFlag
::
IgnoreMarks
))
return
TRACE_RETURN
(
false
);
/* The following assertion is too strong, so we've disabled it. */
/* The following assertion is too strong, so we've disabled it. */
...
@@ -1249,7 +1249,7 @@ struct MarkMarkPosFormat1
...
@@ -1249,7 +1249,7 @@ struct MarkMarkPosFormat1
/* now we search backwards for a suitable mark glyph until a non-mark glyph */
/* now we search backwards for a suitable mark glyph until a non-mark glyph */
unsigned
int
property
;
unsigned
int
property
;
hb_apply_context_t
::
mark_
skipping_backward_iterator_t
skippy_iter
(
c
,
c
->
buffer
->
idx
,
1
);
hb_apply_context_t
::
skipping_backward_iterator_t
skippy_iter
(
c
,
c
->
buffer
->
idx
,
1
);
if
(
!
skippy_iter
.
prev
(
&
property
))
return
TRACE_RETURN
(
false
);
if
(
!
skippy_iter
.
prev
(
&
property
))
return
TRACE_RETURN
(
false
);
if
(
!
(
property
&
HB_OT_LAYOUT_GLYPH_PROPS_MARK
))
return
TRACE_RETURN
(
false
);
if
(
!
(
property
&
HB_OT_LAYOUT_GLYPH_PROPS_MARK
))
return
TRACE_RETURN
(
false
);
...
...
src/hb-ot-layout-gsubgpos-private.hh
浏览文件 @
9082efc4
...
@@ -286,12 +286,12 @@ struct hb_apply_context_t
...
@@ -286,12 +286,12 @@ struct hb_apply_context_t
void
set_lookup_props
(
unsigned
int
lookup_props_
)
{
lookup_props
=
lookup_props_
;
}
void
set_lookup_props
(
unsigned
int
lookup_props_
)
{
lookup_props
=
lookup_props_
;
}
void
set_lookup
(
const
Lookup
&
l
)
{
lookup_props
=
l
.
get_props
();
}
void
set_lookup
(
const
Lookup
&
l
)
{
lookup_props
=
l
.
get_props
();
}
struct
mark_
skipping_forward_iterator_t
struct
skipping_forward_iterator_t
{
{
inline
mark_
skipping_forward_iterator_t
(
hb_apply_context_t
*
c_
,
inline
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_
,
bool
context_match
=
false
)
bool
context_match
=
false
)
{
{
c
=
c_
;
c
=
c_
;
idx
=
start_index_
;
idx
=
start_index_
;
...
@@ -335,13 +335,13 @@ struct hb_apply_context_t
...
@@ -335,13 +335,13 @@ struct hb_apply_context_t
unsigned
int
end
;
unsigned
int
end
;
};
};
struct
mark_
skipping_backward_iterator_t
struct
skipping_backward_iterator_t
{
{
inline
mark_
skipping_backward_iterator_t
(
hb_apply_context_t
*
c_
,
inline
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
,
hb_mask_t
mask_
=
0
,
bool
match_syllable_
=
true
)
bool
match_syllable_
=
true
)
{
{
c
=
c_
;
c
=
c_
;
idx
=
start_index_
;
idx
=
start_index_
;
...
@@ -602,7 +602,7 @@ static inline bool match_input (hb_apply_context_t *c,
...
@@ -602,7 +602,7 @@ static inline bool match_input (hb_apply_context_t *c,
{
{
TRACE_APPLY
(
NULL
);
TRACE_APPLY
(
NULL
);
hb_apply_context_t
::
mark_
skipping_forward_iterator_t
skippy_iter
(
c
,
c
->
buffer
->
idx
,
count
-
1
);
hb_apply_context_t
::
skipping_forward_iterator_t
skippy_iter
(
c
,
c
->
buffer
->
idx
,
count
-
1
);
if
(
skippy_iter
.
has_no_chance
())
return
TRACE_RETURN
(
false
);
if
(
skippy_iter
.
has_no_chance
())
return
TRACE_RETURN
(
false
);
/*
/*
...
@@ -759,7 +759,7 @@ static inline bool match_backtrack (hb_apply_context_t *c,
...
@@ -759,7 +759,7 @@ static inline bool match_backtrack (hb_apply_context_t *c,
{
{
TRACE_APPLY
(
NULL
);
TRACE_APPLY
(
NULL
);
hb_apply_context_t
::
mark_
skipping_backward_iterator_t
skippy_iter
(
c
,
c
->
buffer
->
backtrack_len
(),
count
,
true
);
hb_apply_context_t
::
skipping_backward_iterator_t
skippy_iter
(
c
,
c
->
buffer
->
backtrack_len
(),
count
,
true
);
if
(
skippy_iter
.
has_no_chance
())
if
(
skippy_iter
.
has_no_chance
())
return
TRACE_RETURN
(
false
);
return
TRACE_RETURN
(
false
);
...
@@ -784,7 +784,7 @@ static inline bool match_lookahead (hb_apply_context_t *c,
...
@@ -784,7 +784,7 @@ static inline bool match_lookahead (hb_apply_context_t *c,
{
{
TRACE_APPLY
(
NULL
);
TRACE_APPLY
(
NULL
);
hb_apply_context_t
::
mark_
skipping_forward_iterator_t
skippy_iter
(
c
,
c
->
buffer
->
idx
+
offset
-
1
,
count
,
true
);
hb_apply_context_t
::
skipping_forward_iterator_t
skippy_iter
(
c
,
c
->
buffer
->
idx
+
offset
-
1
,
count
,
true
);
if
(
skippy_iter
.
has_no_chance
())
if
(
skippy_iter
.
has_no_chance
())
return
TRACE_RETURN
(
false
);
return
TRACE_RETURN
(
false
);
...
...
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录