Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
OpenHarmony
Third Party Harfbuzz
提交
4d3aeb8c
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,发现更多精彩内容 >>
提交
4d3aeb8c
编写于
1月 16, 2012
作者:
B
Behdad Esfahbod
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
[GSUB/GPOS] Fix mark skip indexing issues
Mozilla bug 701637 and 714067 combined. Patch from Jonathan Kew.
上级
e8eedf26
变更
3
隐藏空白更改
内联
并排
Showing
3 changed file
with
54 addition
and
54 deletion
+54
-54
src/hb-ot-layout-gpos-table.hh
src/hb-ot-layout-gpos-table.hh
+21
-21
src/hb-ot-layout-gsub-table.hh
src/hb-ot-layout-gsub-table.hh
+11
-10
src/hb-ot-layout-gsubgpos-private.hh
src/hb-ot-layout-gsubgpos-private.hh
+22
-23
未找到文件。
src/hb-ot-layout-gpos-table.hh
浏览文件 @
4d3aeb8c
...
...
@@ -629,21 +629,21 @@ struct PairPosFormat1
inline
bool
apply
(
hb_apply_context_t
*
c
)
const
{
TRACE_APPLY
();
unsigned
int
end
=
MIN
(
c
->
buffer
->
len
,
c
->
buffer
->
idx
+
c
->
context_length
);
if
(
unlikely
(
c
->
buffer
->
idx
+
2
>
end
))
unsigned
int
j
=
c
->
buffer
->
idx
;
unsigned
int
end
=
MIN
(
c
->
buffer
->
len
,
j
+
c
->
context_length
);
if
(
unlikely
(
j
>=
end
))
return
false
;
unsigned
int
index
=
(
this
+
coverage
)
(
c
->
buffer
->
info
[
c
->
buffer
->
idx
].
codepoint
);
unsigned
int
index
=
(
this
+
coverage
)
(
c
->
buffer
->
info
[
j
].
codepoint
);
if
(
likely
(
index
==
NOT_COVERED
))
return
false
;
unsigned
int
j
=
c
->
buffer
->
idx
+
1
;
while
(
_hb_ot_layout_skip_mark
(
c
->
face
,
&
c
->
buffer
->
info
[
j
],
c
->
lookup_props
,
NULL
))
do
{
j
++
;
if
(
unlikely
(
j
==
end
))
return
false
;
j
++
;
}
}
while
(
_hb_ot_layout_skip_mark
(
c
->
face
,
&
c
->
buffer
->
info
[
j
],
c
->
lookup_props
,
NULL
));
return
(
this
+
pairSet
[
index
]).
apply
(
c
,
&
valueFormat1
,
j
);
}
...
...
@@ -691,21 +691,21 @@ struct PairPosFormat2
inline
bool
apply
(
hb_apply_context_t
*
c
)
const
{
TRACE_APPLY
();
unsigned
int
end
=
MIN
(
c
->
buffer
->
len
,
c
->
buffer
->
idx
+
c
->
context_length
);
if
(
unlikely
(
c
->
buffer
->
idx
+
2
>
end
))
unsigned
int
j
=
c
->
buffer
->
idx
;
unsigned
int
end
=
MIN
(
c
->
buffer
->
len
,
j
+
c
->
context_length
);
if
(
unlikely
(
j
>=
end
))
return
false
;
unsigned
int
index
=
(
this
+
coverage
)
(
c
->
buffer
->
info
[
c
->
buffer
->
idx
].
codepoint
);
unsigned
int
index
=
(
this
+
coverage
)
(
c
->
buffer
->
info
[
j
].
codepoint
);
if
(
likely
(
index
==
NOT_COVERED
))
return
false
;
unsigned
int
j
=
c
->
buffer
->
idx
+
1
;
while
(
_hb_ot_layout_skip_mark
(
c
->
face
,
&
c
->
buffer
->
info
[
j
],
c
->
lookup_props
,
NULL
))
do
{
j
++
;
if
(
unlikely
(
j
==
end
))
return
false
;
j
++
;
}
}
while
(
_hb_ot_layout_skip_mark
(
c
->
face
,
&
c
->
buffer
->
info
[
j
],
c
->
lookup_props
,
NULL
));
unsigned
int
len1
=
valueFormat1
.
get_len
();
unsigned
int
len2
=
valueFormat2
.
get_len
();
...
...
@@ -846,21 +846,21 @@ struct CursivePosFormat1
if
(
c
->
property
&
HB_OT_LAYOUT_GLYPH_CLASS_MARK
)
return
false
;
unsigned
int
end
=
MIN
(
c
->
buffer
->
len
,
c
->
buffer
->
idx
+
c
->
context_length
);
if
(
unlikely
(
c
->
buffer
->
idx
+
2
>
end
))
unsigned
int
j
=
c
->
buffer
->
idx
;
unsigned
int
end
=
MIN
(
c
->
buffer
->
len
,
j
+
c
->
context_length
);
if
(
unlikely
(
j
>=
end
))
return
false
;
const
EntryExitRecord
&
this_record
=
entryExitRecord
[(
this
+
coverage
)
(
c
->
buffer
->
info
[
c
->
buffer
->
idx
].
codepoint
)];
const
EntryExitRecord
&
this_record
=
entryExitRecord
[(
this
+
coverage
)
(
c
->
buffer
->
info
[
j
].
codepoint
)];
if
(
!
this_record
.
exitAnchor
)
return
false
;
unsigned
int
j
=
c
->
buffer
->
idx
+
1
;
while
(
_hb_ot_layout_skip_mark
(
c
->
face
,
&
c
->
buffer
->
info
[
j
],
c
->
lookup_props
,
NULL
))
do
{
j
++
;
if
(
unlikely
(
j
==
end
))
return
false
;
j
++
;
}
}
while
(
_hb_ot_layout_skip_mark
(
c
->
face
,
&
c
->
buffer
->
info
[
j
],
c
->
lookup_props
,
NULL
));
const
EntryExitRecord
&
next_record
=
entryExitRecord
[(
this
+
coverage
)
(
c
->
buffer
->
info
[
j
].
codepoint
)];
if
(
!
next_record
.
entryAnchor
)
...
...
src/hb-ot-layout-gsub-table.hh
浏览文件 @
4d3aeb8c
...
...
@@ -343,24 +343,25 @@ struct Ligature
inline
bool
apply
(
hb_apply_context_t
*
c
)
const
{
TRACE_APPLY
();
unsigned
int
i
,
j
;
unsigned
int
i
;
unsigned
int
j
=
c
->
buffer
->
idx
;
unsigned
int
count
=
component
.
len
;
unsigned
int
end
=
MIN
(
c
->
buffer
->
len
,
c
->
buffer
->
idx
+
c
->
context_length
);
if
(
unlikely
(
count
<
2
||
c
->
buffer
->
idx
+
count
>
end
))
unsigned
int
end
=
MIN
(
c
->
buffer
->
len
,
j
+
c
->
context_length
);
if
(
unlikely
(
count
<
2
||
j
>=
end
))
return
false
;
bool
first_was_mark
=
(
c
->
property
&
HB_OT_LAYOUT_GLYPH_CLASS_MARK
);
bool
found_non_mark
=
false
;
for
(
i
=
1
,
j
=
c
->
buffer
->
idx
+
1
;
i
<
count
;
i
++
,
j
++
)
for
(
i
=
1
;
i
<
count
;
i
++
)
{
unsigned
int
property
;
while
(
_hb_ot_layout_skip_mark
(
c
->
face
,
&
c
->
buffer
->
info
[
j
],
c
->
lookup_props
,
&
property
))
do
{
if
(
unlikely
(
j
+
count
-
i
==
end
))
return
false
;
j
++
;
}
if
(
unlikely
(
j
==
end
))
return
false
;
}
while
(
_hb_ot_layout_skip_mark
(
c
->
face
,
&
c
->
buffer
->
info
[
j
],
c
->
lookup_props
,
&
property
));
found_non_mark
|=
!
(
property
&
HB_OT_LAYOUT_GLYPH_CLASS_MARK
);
...
...
@@ -376,9 +377,9 @@ struct Ligature
c
->
buffer
->
info
[
c
->
buffer
->
idx
].
lig_comp
()
=
0
;
c
->
buffer
->
info
[
c
->
buffer
->
idx
].
lig_id
()
=
lig_id
;
if
(
j
==
c
->
buffer
->
idx
+
i
)
/* No input glyphs skipped */
if
(
j
<
c
->
buffer
->
idx
+
count
)
/* No input glyphs skipped */
{
c
->
replace_glyphs_be16
(
i
,
1
,
(
const
uint16_t
*
)
&
ligGlyph
);
c
->
replace_glyphs_be16
(
count
,
1
,
(
const
uint16_t
*
)
&
ligGlyph
);
}
else
{
...
...
src/hb-ot-layout-gsubgpos-private.hh
浏览文件 @
4d3aeb8c
...
...
@@ -132,25 +132,26 @@ static inline bool match_input (hb_apply_context_t *c,
const
void
*
match_data
,
unsigned
int
*
context_length_out
)
{
unsigned
int
i
,
j
;
unsigned
int
end
=
MIN
(
c
->
buffer
->
len
,
c
->
buffer
->
idx
+
c
->
context_length
);
if
(
unlikely
(
c
->
buffer
->
idx
+
count
>
end
))
unsigned
int
i
;
unsigned
int
j
=
c
->
buffer
->
idx
;
unsigned
int
end
=
MIN
(
c
->
buffer
->
len
,
j
+
c
->
context_length
);
if
(
unlikely
(
j
+
count
>
end
))
return
false
;
for
(
i
=
1
,
j
=
c
->
buffer
->
idx
+
1
;
i
<
count
;
i
++
,
j
++
)
for
(
i
=
1
;
i
<
count
;
i
++
)
{
while
(
_hb_ot_layout_skip_mark
(
c
->
face
,
&
c
->
buffer
->
info
[
j
],
c
->
lookup_props
,
NULL
))
do
{
if
(
unlikely
(
j
+
count
-
i
==
end
))
return
false
;
j
++
;
}
if
(
unlikely
(
j
>=
end
))
return
false
;
}
while
(
_hb_ot_layout_skip_mark
(
c
->
face
,
&
c
->
buffer
->
info
[
j
],
c
->
lookup_props
,
NULL
));
if
(
likely
(
!
match_func
(
c
->
buffer
->
info
[
j
].
codepoint
,
input
[
i
-
1
],
match_data
)))
return
false
;
}
*
context_length_out
=
j
-
c
->
buffer
->
idx
;
*
context_length_out
=
j
-
c
->
buffer
->
idx
+
1
;
return
true
;
}
...
...
@@ -161,17 +162,16 @@ static inline bool match_backtrack (hb_apply_context_t *c,
match_func_t
match_func
,
const
void
*
match_data
)
{
if
(
unlikely
(
c
->
buffer
->
backtrack_len
()
<
count
))
return
false
;
unsigned
int
j
=
c
->
buffer
->
backtrack_len
();
for
(
unsigned
int
i
=
0
,
j
=
c
->
buffer
->
backtrack_len
()
-
1
;
i
<
count
;
i
++
,
j
--
)
for
(
unsigned
int
i
=
0
;
i
<
count
;
i
++
)
{
while
(
_hb_ot_layout_skip_mark
(
c
->
face
,
&
c
->
buffer
->
out_info
[
j
],
c
->
lookup_props
,
NULL
))
do
{
if
(
unlikely
(
j
+
1
==
count
-
i
))
if
(
unlikely
(
!
j
))
return
false
;
j
--
;
}
}
while
(
_hb_ot_layout_skip_mark
(
c
->
face
,
&
c
->
buffer
->
out_info
[
j
],
c
->
lookup_props
,
NULL
));
if
(
likely
(
!
match_func
(
c
->
buffer
->
out_info
[
j
].
codepoint
,
backtrack
[
i
],
match_data
)))
return
false
;
...
...
@@ -187,19 +187,18 @@ static inline bool match_lookahead (hb_apply_context_t *c,
const
void
*
match_data
,
unsigned
int
offset
)
{
unsigned
int
i
,
j
;
unsigned
int
i
;
unsigned
int
j
=
c
->
buffer
->
idx
+
offset
-
1
;
unsigned
int
end
=
MIN
(
c
->
buffer
->
len
,
c
->
buffer
->
idx
+
c
->
context_length
);
if
(
unlikely
(
c
->
buffer
->
idx
+
offset
+
count
>
end
))
return
false
;
for
(
i
=
0
,
j
=
c
->
buffer
->
idx
+
offset
;
i
<
count
;
i
++
,
j
++
)
for
(
i
=
0
;
i
<
count
;
i
++
)
{
while
(
_hb_ot_layout_skip_mark
(
c
->
face
,
&
c
->
buffer
->
info
[
j
],
c
->
lookup_props
,
NULL
))
do
{
if
(
unlikely
(
j
+
count
-
i
==
end
))
return
false
;
j
++
;
}
if
(
unlikely
(
j
>=
end
))
return
false
;
}
while
(
_hb_ot_layout_skip_mark
(
c
->
face
,
&
c
->
buffer
->
info
[
j
],
c
->
lookup_props
,
NULL
));
if
(
likely
(
!
match_func
(
c
->
buffer
->
info
[
j
].
codepoint
,
lookahead
[
i
],
match_data
)))
return
false
;
...
...
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录