Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
int
Rust
提交
da545cee
R
Rust
项目概览
int
/
Rust
大约 1 年 前同步成功
通知
1
Star
0
Fork
0
代码
文件
提交
分支
Tags
贡献者
分支图
Diff
Issue
0
列表
看板
标记
里程碑
合并请求
0
DevOps
流水线
流水线任务
计划
Wiki
0
Wiki
分析
仓库
DevOps
项目成员
Pages
R
Rust
项目概览
项目概览
详情
发布
仓库
仓库
文件
提交
分支
标签
贡献者
分支图
比较
Issue
0
Issue
0
列表
看板
标记
里程碑
合并请求
0
合并请求
0
Pages
DevOps
DevOps
流水线
流水线任务
计划
分析
分析
仓库分析
DevOps
Wiki
0
Wiki
成员
成员
收起侧边栏
关闭侧边栏
动态
分支图
创建新Issue
流水线任务
提交
Issue看板
体验新版 GitCode,发现更多精彩内容 >>
提交
da545cee
编写于
1月 26, 2018
作者:
S
Santiago Pastorino
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
Make region inference use a dirty list
Fixes #47602
上级
a97cd17f
变更
2
隐藏空白更改
内联
并排
Showing
2 changed file
with
59 addition
and
24 deletion
+59
-24
src/librustc_data_structures/bitvec.rs
src/librustc_data_structures/bitvec.rs
+11
-0
src/librustc_mir/borrow_check/nll/region_infer/mod.rs
src/librustc_mir/borrow_check/nll/region_infer/mod.rs
+48
-24
未找到文件。
src/librustc_data_structures/bitvec.rs
浏览文件 @
da545cee
...
...
@@ -51,6 +51,17 @@ pub fn insert(&mut self, bit: usize) -> bool {
new_value
!=
value
}
/// Returns true if the bit has changed.
#[inline]
pub
fn
remove
(
&
mut
self
,
bit
:
usize
)
->
bool
{
let
(
word
,
mask
)
=
word_mask
(
bit
);
let
data
=
&
mut
self
.data
[
word
];
let
value
=
*
data
;
let
new_value
=
value
&
!
mask
;
*
data
=
new_value
;
new_value
!=
value
}
#[inline]
pub
fn
insert_all
(
&
mut
self
,
all
:
&
BitVector
)
->
bool
{
assert
!
(
self
.data
.len
()
==
all
.data
.len
());
...
...
src/librustc_mir/borrow_check/nll/region_infer/mod.rs
浏览文件 @
da545cee
...
...
@@ -8,6 +8,8 @@
// option. This file may not be copied, modified, or distributed
// except according to those terms.
use
std
::
collections
::
HashMap
;
use
super
::
universal_regions
::
UniversalRegions
;
use
rustc
::
hir
::
def_id
::
DefId
;
use
rustc
::
infer
::
InferCtxt
;
...
...
@@ -22,6 +24,7 @@
use
rustc
::
traits
::
ObligationCause
;
use
rustc
::
ty
::{
self
,
RegionVid
,
Ty
,
TypeFoldable
};
use
rustc
::
util
::
common
::
ErrorReported
;
use
rustc_data_structures
::
bitvec
::
BitVector
;
use
rustc_data_structures
::
indexed_vec
::
IndexVec
;
use
rustc_errors
::
DiagnosticBuilder
;
use
std
::
fmt
;
...
...
@@ -452,8 +455,6 @@ pub(super) fn solve<'gcx>(
/// satisfied. Note that some values may grow **too** large to be
/// feasible, but we check this later.
fn
propagate_constraints
(
&
mut
self
,
mir
:
&
Mir
<
'tcx
>
)
{
let
mut
changed
=
true
;
debug!
(
"propagate_constraints()"
);
debug!
(
"propagate_constraints: constraints={:#?}"
,
{
let
mut
constraints
:
Vec
<
_
>
=
self
.constraints
.iter
()
.collect
();
...
...
@@ -465,37 +466,60 @@ fn propagate_constraints(&mut self, mir: &Mir<'tcx>) {
// constraints we have accumulated.
let
mut
inferred_values
=
self
.liveness_constraints
.clone
();
while
changed
{
changed
=
false
;
debug!
(
"propagate_constraints: --------------------"
);
for
constraint
in
&
self
.constraints
{
debug!
(
"propagate_constraints: constraint={:?}"
,
constraint
);
// Grow the value as needed to accommodate the
// outlives constraint.
let
Ok
(
made_changes
)
=
self
.dfs
(
mir
,
CopyFromSourceToTarget
{
source_region
:
constraint
.sub
,
target_region
:
constraint
.sup
,
inferred_values
:
&
mut
inferred_values
,
constraint_point
:
constraint
.point
,
constraint_span
:
constraint
.span
,
},
);
let
dependency_map
=
self
.build_dependency_map
();
let
mut
dirty_list
:
Vec
<
_
>
=
(
0
..
self
.constraints
.len
())
.collect
();
let
mut
dirty_bit_vec
=
BitVector
::
new
(
dirty_list
.len
());
debug!
(
"propagate_constraints: --------------------"
);
while
let
Some
(
constraint_idx
)
=
dirty_list
.pop
()
{
dirty_bit_vec
.remove
(
constraint_idx
);
let
constraint
=
&
self
.constraints
[
constraint_idx
];
debug!
(
"propagate_constraints: constraint={:?}"
,
constraint
);
// Grow the value as needed to accommodate the
// outlives constraint.
let
Ok
(
made_changes
)
=
self
.dfs
(
mir
,
CopyFromSourceToTarget
{
source_region
:
constraint
.sub
,
target_region
:
constraint
.sup
,
inferred_values
:
&
mut
inferred_values
,
constraint_point
:
constraint
.point
,
constraint_span
:
constraint
.span
,
},
);
if
made_changes
{
debug!
(
"propagate_constraints: sub={:?}"
,
constraint
.sub
);
debug!
(
"propagate_constraints: sup={:?}"
,
constraint
.sup
);
if
made_changes
{
debug!
(
"propagate_constraints: sub={:?}"
,
constraint
.sub
);
debug!
(
"propagate_constraints: sup={:?}"
,
constraint
.sup
);
changed
=
true
;
for
&
dep_idx
in
dependency_map
.get
(
&
constraint
.sup
)
.unwrap_or
(
&
vec!
[])
{
if
dirty_bit_vec
.insert
(
dep_idx
)
{
dirty_list
.push
(
dep_idx
);
}
}
}
debug!
(
"
\n
"
);
}
self
.inferred_values
=
Some
(
inferred_values
);
}
/// Builds up a map from each region variable X to a vector with the indices of constraints that
/// need to be re-evaluated when X changes. These are constraints like Y: X @ P -- so if X
/// changed, we may need to grow Y.
fn
build_dependency_map
(
&
self
)
->
HashMap
<
RegionVid
,
Vec
<
usize
>>
{
let
mut
map
=
HashMap
::
new
();
for
(
idx
,
constraint
)
in
self
.constraints
.iter
()
.enumerate
()
{
map
.entry
(
constraint
.sub
)
.or_insert
(
Vec
::
new
())
.push
(
idx
);
}
map
}
/// Once regions have been propagated, this method is used to see
/// whether the "type tests" produced by typeck were satisfied;
/// type tests encode type-outlives relationships like `T:
...
...
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录