Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
int
Rust
提交
64b5d408
R
Rust
项目概览
int
/
Rust
11 个月 前同步成功
通知
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,发现更多精彩内容 >>
提交
64b5d408
编写于
4月 06, 2018
作者:
J
John Kåre Alsaker
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
Make DepGraph thread-safe
上级
cc794209
变更
6
隐藏空白更改
内联
并排
Showing
6 changed file
with
205 addition
and
187 deletion
+205
-187
src/librustc/dep_graph/graph.rs
src/librustc/dep_graph/graph.rs
+188
-132
src/librustc/dep_graph/mod.rs
src/librustc/dep_graph/mod.rs
+1
-2
src/librustc/dep_graph/raii.rs
src/librustc/dep_graph/raii.rs
+0
-33
src/librustc/hir/map/collector.rs
src/librustc/hir/map/collector.rs
+7
-19
src/librustc/ty/context.rs
src/librustc/ty/context.rs
+8
-1
src/librustc/ty/maps/plumbing.rs
src/librustc/ty/maps/plumbing.rs
+1
-0
未找到文件。
src/librustc/dep_graph/graph.rs
浏览文件 @
64b5d408
...
...
@@ -12,11 +12,10 @@
use
rustc_data_structures
::
stable_hasher
::{
HashStable
,
StableHasher
};
use
rustc_data_structures
::
fx
::{
FxHashMap
,
FxHashSet
};
use
rustc_data_structures
::
indexed_vec
::{
Idx
,
IndexVec
};
use
rustc_data_structures
::
sync
::
Lrc
;
use
std
::
cell
::{
Ref
,
RefCell
};
use
rustc_data_structures
::
sync
::{
Lrc
,
RwLock
,
ReadGuard
,
Lock
};
use
std
::
env
;
use
std
::
hash
::
Hash
;
use
ty
::
TyCtxt
;
use
ty
::
{
self
,
TyCtxt
}
;
use
util
::
common
::{
ProfileQueriesMsg
,
profq_msg
};
use
ich
::{
StableHashingContext
,
StableHashingContextProvider
,
Fingerprint
};
...
...
@@ -24,7 +23,6 @@
use
super
::
debug
::
EdgeFilter
;
use
super
::
dep_node
::{
DepNode
,
DepKind
,
WorkProductId
};
use
super
::
query
::
DepGraphQuery
;
use
super
::
raii
;
use
super
::
safe
::
DepGraphSafe
;
use
super
::
serialized
::{
SerializedDepGraph
,
SerializedDepNodeIndex
};
use
super
::
prev
::
PreviousDepGraph
;
...
...
@@ -37,7 +35,7 @@ pub struct DepGraph {
// result value fingerprints. Do not rely on the length of this vector
// being the same as the number of nodes in the graph. The vector can
// contain an arbitrary number of zero-entries at the end.
fingerprints
:
Lrc
<
RefCell
<
IndexVec
<
DepNodeIndex
,
Fingerprint
>>>
fingerprints
:
Lrc
<
Lock
<
IndexVec
<
DepNodeIndex
,
Fingerprint
>>>
}
...
...
@@ -67,27 +65,27 @@ struct DepGraphData {
/// tracking. The `current` field is the dependency graph of only the
/// current compilation session: We don't merge the previous dep-graph into
/// current one anymore.
current
:
RefCell
<
CurrentDepGraph
>
,
current
:
Lock
<
CurrentDepGraph
>
,
/// The dep-graph from the previous compilation session. It contains all
/// nodes and edges as well as all fingerprints of nodes that have them.
previous
:
PreviousDepGraph
,
colors
:
RefCell
<
DepNodeColorMap
>
,
colors
:
Lock
<
DepNodeColorMap
>
,
/// When we load, there may be `.o` files, cached mir, or other such
/// things available to us. If we find that they are not dirty, we
/// load the path to the file storing those work-products here into
/// this map. We can later look for and extract that data.
previous_work_products
:
R
efCell
<
FxHashMap
<
WorkProductId
,
WorkProduct
>>
,
previous_work_products
:
R
wLock
<
FxHashMap
<
WorkProductId
,
WorkProduct
>>
,
/// Work-products that we generate in this run.
work_products
:
R
efCell
<
FxHashMap
<
WorkProductId
,
WorkProduct
>>
,
work_products
:
R
wLock
<
FxHashMap
<
WorkProductId
,
WorkProduct
>>
,
dep_node_debug
:
RefCell
<
FxHashMap
<
DepNode
,
String
>>
,
dep_node_debug
:
Lock
<
FxHashMap
<
DepNode
,
String
>>
,
// Used for testing, only populated when -Zquery-dep-graph is specified.
loaded_from_cache
:
RefCell
<
FxHashMap
<
DepNodeIndex
,
bool
>>
,
loaded_from_cache
:
Lock
<
FxHashMap
<
DepNodeIndex
,
bool
>>
,
}
impl
DepGraph
{
...
...
@@ -102,22 +100,22 @@ pub fn new(prev_graph: PreviousDepGraph) -> DepGraph {
(
prev_graph_node_count
*
115
)
/
100
);
DepGraph
{
data
:
Some
(
Lrc
::
new
(
DepGraphData
{
previous_work_products
:
R
efCell
::
new
(
FxHashMap
()),
work_products
:
R
efCell
::
new
(
FxHashMap
()),
dep_node_debug
:
RefCell
::
new
(
FxHashMap
()),
current
:
RefCell
::
new
(
CurrentDepGraph
::
new
()),
previous_work_products
:
R
wLock
::
new
(
FxHashMap
()),
work_products
:
R
wLock
::
new
(
FxHashMap
()),
dep_node_debug
:
Lock
::
new
(
FxHashMap
()),
current
:
Lock
::
new
(
CurrentDepGraph
::
new
()),
previous
:
prev_graph
,
colors
:
RefCell
::
new
(
DepNodeColorMap
::
new
(
prev_graph_node_count
)),
loaded_from_cache
:
RefCell
::
new
(
FxHashMap
()),
colors
:
Lock
::
new
(
DepNodeColorMap
::
new
(
prev_graph_node_count
)),
loaded_from_cache
:
Lock
::
new
(
FxHashMap
()),
})),
fingerprints
:
Lrc
::
new
(
RefCell
::
new
(
fingerprints
)),
fingerprints
:
Lrc
::
new
(
Lock
::
new
(
fingerprints
)),
}
}
pub
fn
new_disabled
()
->
DepGraph
{
DepGraph
{
data
:
None
,
fingerprints
:
Lrc
::
new
(
RefCell
::
new
(
IndexVec
::
new
())),
fingerprints
:
Lrc
::
new
(
Lock
::
new
(
IndexVec
::
new
())),
}
}
...
...
@@ -144,21 +142,32 @@ pub fn query(&self) -> DepGraphQuery {
pub
fn
assert_ignored
(
&
self
)
{
if
let
Some
(
ref
data
)
=
self
.data
{
match
data
.current
.borrow
()
.task_stack
.last
()
{
Some
(
&
OpenTask
::
Ignore
)
|
None
=>
{
// ignored
if
let
Some
(
..
)
=
self
.data
{
ty
::
tls
::
with_context_opt
(|
icx
|
{
let
icx
=
if
let
Some
(
icx
)
=
icx
{
icx
}
else
{
return
};
match
*
icx
.task
.lock
()
{
OpenTask
::
Ignore
=>
{
// ignored
}
_
=>
panic!
(
"expected an ignore context"
)
}
_
=>
panic!
(
"expected an ignore context"
)
}
})
}
}
pub
fn
with_ignore
<
OP
,
R
>
(
&
self
,
op
:
OP
)
->
R
where
OP
:
FnOnce
()
->
R
{
let
_
task
=
self
.data
.as_ref
()
.map
(|
data
|
raii
::
IgnoreTask
::
new
(
&
data
.current
));
op
()
ty
::
tls
::
with_context
(|
icx
|
{
let
icx
=
ty
::
tls
::
ImplicitCtxt
{
task
:
&
Lock
::
new
(
OpenTask
::
Ignore
),
..
icx
.clone
()
};
ty
::
tls
::
enter_context
(
&
icx
,
|
_
|
{
op
()
})
})
}
/// Starts a new dep-graph task. Dep-graph tasks are specified
...
...
@@ -197,24 +206,49 @@ pub fn with_task<'gcx, C, A, R>(&self,
where
C
:
DepGraphSafe
+
StableHashingContextProvider
<
'gcx
>
,
R
:
HashStable
<
StableHashingContext
<
'gcx
>>
,
{
self
.with_task_impl
(
key
,
cx
,
arg
,
task
,
|
data
,
key
|
data
.borrow_mut
()
.push_task
(
key
),
|
data
,
key
|
data
.borrow_mut
()
.pop_task
(
key
))
self
.with_task_impl
(
key
,
cx
,
arg
,
false
,
task
,
|
key
|
OpenTask
::
Regular
{
node
:
key
,
reads
:
Vec
::
new
(),
read_set
:
FxHashSet
(),
},
|
data
,
key
,
task
|
data
.borrow_mut
()
.complete_task
(
key
,
task
))
}
/// Creates a new dep-graph input with value `input`
pub
fn
input_task
<
'gcx
,
C
,
R
>
(
&
self
,
key
:
DepNode
,
cx
:
C
,
input
:
R
)
->
(
R
,
DepNodeIndex
)
where
C
:
DepGraphSafe
+
StableHashingContextProvider
<
'gcx
>
,
R
:
HashStable
<
StableHashingContext
<
'gcx
>>
,
{
fn
identity_fn
<
C
,
A
>
(
_
:
C
,
arg
:
A
)
->
A
{
arg
}
self
.with_task_impl
(
key
,
cx
,
input
,
true
,
identity_fn
,
|
_
|
OpenTask
::
Ignore
,
|
data
,
key
,
_
|
data
.borrow_mut
()
.alloc_node
(
key
,
Vec
::
new
()))
}
fn
with_task_impl
<
'gcx
,
C
,
A
,
R
>
(
&
self
,
key
:
DepNode
,
cx
:
C
,
arg
:
A
,
task
:
fn
(
C
,
A
)
->
R
,
push
:
fn
(
&
RefCell
<
CurrentDepGraph
>
,
DepNode
),
pop
:
fn
(
&
RefCell
<
CurrentDepGraph
>
,
DepNode
)
->
DepNodeIndex
)
->
(
R
,
DepNodeIndex
)
key
:
DepNode
,
cx
:
C
,
arg
:
A
,
no_tcx
:
bool
,
task
:
fn
(
C
,
A
)
->
R
,
get_task
:
fn
(
DepNode
)
->
OpenTask
,
get_index
:
fn
(
&
Lock
<
CurrentDepGraph
>
,
DepNode
,
OpenTask
)
->
DepNodeIndex
)
->
(
R
,
DepNodeIndex
)
where
C
:
DepGraphSafe
+
StableHashingContextProvider
<
'gcx
>
,
R
:
HashStable
<
StableHashingContext
<
'gcx
>>
,
{
if
let
Some
(
ref
data
)
=
self
.data
{
push
(
&
data
.current
,
key
);
let
open_task
=
get_task
(
key
);
// In incremental mode, hash the result of the task. We don't
// do anything with the hash yet, but we are computing it
...
...
@@ -227,13 +261,32 @@ fn with_task_impl<'gcx, C, A, R>(&self,
profq_msg
(
hcx
.sess
(),
ProfileQueriesMsg
::
TaskBegin
(
key
.clone
()))
};
let
result
=
task
(
cx
,
arg
);
let
(
result
,
open_task
)
=
if
no_tcx
{
(
task
(
cx
,
arg
),
open_task
)
}
else
{
ty
::
tls
::
with_context
(|
icx
|
{
let
open_task
=
Lock
::
new
(
open_task
);
let
r
=
{
let
icx
=
ty
::
tls
::
ImplicitCtxt
{
task
:
&
open_task
,
..
icx
.clone
()
};
ty
::
tls
::
enter_context
(
&
icx
,
|
_
|
{
task
(
cx
,
arg
)
})
};
(
r
,
open_task
.into_inner
())
})
};
if
cfg!
(
debug_assertions
)
{
profq_msg
(
hcx
.sess
(),
ProfileQueriesMsg
::
TaskEnd
)
};
let
dep_node_index
=
pop
(
&
data
.current
,
key
);
let
dep_node_index
=
get_index
(
&
data
.current
,
key
,
open_task
);
let
mut
stable_hasher
=
StableHasher
::
new
();
result
.hash_stable
(
&
mut
hcx
,
&
mut
stable_hasher
);
...
...
@@ -302,11 +355,28 @@ pub fn with_anon_task<OP,R>(&self, dep_kind: DepKind, op: OP) -> (R, DepNodeInde
where
OP
:
FnOnce
()
->
R
{
if
let
Some
(
ref
data
)
=
self
.data
{
data
.current
.borrow_mut
()
.push_anon_task
();
let
result
=
op
();
let
(
result
,
open_task
)
=
ty
::
tls
::
with_context
(|
icx
|
{
let
task
=
Lock
::
new
(
OpenTask
::
Anon
{
reads
:
Vec
::
new
(),
read_set
:
FxHashSet
(),
});
let
r
=
{
let
icx
=
ty
::
tls
::
ImplicitCtxt
{
task
:
&
task
,
..
icx
.clone
()
};
ty
::
tls
::
enter_context
(
&
icx
,
|
_
|
{
op
()
})
};
(
r
,
task
.into_inner
())
});
let
dep_node_index
=
data
.current
.borrow_mut
()
.pop_anon_task
(
dep_kind
);
.pop_anon_task
(
dep_kind
,
open_task
);
(
result
,
dep_node_index
)
}
else
{
(
op
(),
DepNodeIndex
::
INVALID
)
...
...
@@ -324,9 +394,9 @@ pub fn with_eval_always_task<'gcx, C, A, R>(&self,
where
C
:
DepGraphSafe
+
StableHashingContextProvider
<
'gcx
>
,
R
:
HashStable
<
StableHashingContext
<
'gcx
>>
,
{
self
.with_task_impl
(
key
,
cx
,
arg
,
task
,
|
data
,
key
|
data
.borrow_mut
()
.push_eval_always_task
(
key
)
,
|
data
,
key
|
data
.borrow_mut
()
.pop_eval_always_task
(
key
))
self
.with_task_impl
(
key
,
cx
,
arg
,
false
,
task
,
|
key
|
OpenTask
::
EvalAlways
{
node
:
key
}
,
|
data
,
key
,
task
|
data
.borrow_mut
()
.complete_eval_always_task
(
key
,
task
))
}
#[inline]
...
...
@@ -432,13 +502,13 @@ pub fn previous_work_product(&self, v: &WorkProductId) -> Option<WorkProduct> {
/// Access the map of work-products created during this run. Only
/// used during saving of the dep-graph.
pub
fn
work_products
(
&
self
)
->
Re
f
<
FxHashMap
<
WorkProductId
,
WorkProduct
>>
{
pub
fn
work_products
(
&
self
)
->
Re
adGuard
<
FxHashMap
<
WorkProductId
,
WorkProduct
>>
{
self
.data
.as_ref
()
.unwrap
()
.work_products
.borrow
()
}
/// Access the map of work-products created during the cached run. Only
/// used during saving of the dep-graph.
pub
fn
previous_work_products
(
&
self
)
->
Re
f
<
FxHashMap
<
WorkProductId
,
WorkProduct
>>
{
pub
fn
previous_work_products
(
&
self
)
->
Re
adGuard
<
FxHashMap
<
WorkProductId
,
WorkProduct
>>
{
self
.data
.as_ref
()
.unwrap
()
.previous_work_products
.borrow
()
}
...
...
@@ -528,6 +598,7 @@ pub fn try_mark_green<'tcx>(&self,
debug!
(
"try_mark_green({:?}) - BEGIN"
,
dep_node
);
let
data
=
self
.data
.as_ref
()
.unwrap
();
#[cfg(not(parallel_queries))]
debug_assert!
(
!
data
.current
.borrow
()
.node_to_node_index
.contains_key
(
dep_node
));
if
dep_node
.kind
.is_input
()
{
...
...
@@ -668,16 +739,24 @@ pub fn try_mark_green<'tcx>(&self,
}
}
// If we got here without hitting a `return` that means that all
// dependencies of this DepNode could be marked as green. Therefore we
// can also mark this DepNode as green.
We do so by...
// can also mark this DepNode as green.
// ... allocating an entry for it in the current dependency graph and
// adding all the appropriate edges imported from the previous graph ...
let
dep_node_index
=
data
.current
.borrow_mut
()
.alloc_node
(
*
dep_node
,
current_deps
);
// There may be multiple threads trying to mark the same dep node green concurrently
let
(
dep_node_index
,
did_allocation
)
=
{
let
mut
current
=
data
.current
.borrow_mut
();
if
let
Some
(
&
dep_node_index
)
=
current
.node_to_node_index
.get
(
&
dep_node
)
{
// Someone else allocated it before us
(
dep_node_index
,
false
)
}
else
{
// We allocating an entry for the node in the current dependency graph and
// adding all the appropriate edges imported from the previous graph
(
current
.alloc_node
(
*
dep_node
,
current_deps
),
true
)
}
};
// ... copying the fingerprint from the previous graph too, so we don't
// have to recompute it ...
...
...
@@ -689,6 +768,8 @@ pub fn try_mark_green<'tcx>(&self,
fingerprints
.resize
(
dep_node_index
.index
()
+
1
,
Fingerprint
::
ZERO
);
}
// Multiple threads can all write the same fingerprint here
#[cfg(not(parallel_queries))]
debug_assert!
(
fingerprints
[
dep_node_index
]
==
Fingerprint
::
ZERO
,
"DepGraph::try_mark_green() - Duplicate fingerprint
\
insertion for {:?}"
,
dep_node
);
...
...
@@ -697,7 +778,14 @@ pub fn try_mark_green<'tcx>(&self,
}
// ... emitting any stored diagnostic ...
{
if
did_allocation
{
// Only the thread which did the allocation emits the error messages
// FIXME: Ensure that these are printed before returning for all threads.
// Currently threads where did_allocation = false can continue on
// and emit other diagnostics before these diagnostics are emitted.
// Such diagnostics should be emitted after these.
// See https://github.com/rust-lang/rust/issues/48685
let
diagnostics
=
tcx
.on_disk_query_result_cache
.load_diagnostics
(
tcx
,
prev_dep_node_index
);
...
...
@@ -716,6 +804,8 @@ pub fn try_mark_green<'tcx>(&self,
// ... and finally storing a "Green" entry in the color map.
let
mut
colors
=
data
.colors
.borrow_mut
();
// Multiple threads can all write the same color here
#[cfg(not(parallel_queries))]
debug_assert!
(
colors
.get
(
prev_dep_node_index
)
.is_none
(),
"DepGraph::try_mark_green() - Duplicate DepNodeColor
\
insertion for {:?}"
,
dep_node
);
...
...
@@ -839,7 +929,6 @@ pub(super) struct CurrentDepGraph {
nodes
:
IndexVec
<
DepNodeIndex
,
DepNode
>
,
edges
:
IndexVec
<
DepNodeIndex
,
Vec
<
DepNodeIndex
>>
,
node_to_node_index
:
FxHashMap
<
DepNode
,
DepNodeIndex
>
,
task_stack
:
Vec
<
OpenTask
>
,
forbidden_edge
:
Option
<
EdgeFilter
>
,
// Anonymous DepNodes are nodes the ID of which we compute from the list of
...
...
@@ -888,38 +977,18 @@ fn new() -> CurrentDepGraph {
edges
:
IndexVec
::
new
(),
node_to_node_index
:
FxHashMap
(),
anon_id_seed
:
stable_hasher
.finish
(),
task_stack
:
Vec
::
new
(),
forbidden_edge
,
total_read_count
:
0
,
total_duplicate_read_count
:
0
,
}
}
pub
(
super
)
fn
push_ignore
(
&
mut
self
)
{
self
.task_stack
.push
(
OpenTask
::
Ignore
);
}
pub
(
super
)
fn
pop_ignore
(
&
mut
self
)
{
let
popped_node
=
self
.task_stack
.pop
()
.unwrap
();
debug_assert_eq!
(
popped_node
,
OpenTask
::
Ignore
);
}
pub
(
super
)
fn
push_task
(
&
mut
self
,
key
:
DepNode
)
{
self
.task_stack
.push
(
OpenTask
::
Regular
{
node
:
key
,
reads
:
Vec
::
new
(),
read_set
:
FxHashSet
(),
});
}
pub
(
super
)
fn
pop_task
(
&
mut
self
,
key
:
DepNode
)
->
DepNodeIndex
{
let
popped_node
=
self
.task_stack
.pop
()
.unwrap
();
pub
(
super
)
fn
complete_task
(
&
mut
self
,
key
:
DepNode
,
task
:
OpenTask
)
->
DepNodeIndex
{
if
let
OpenTask
::
Regular
{
node
,
read_set
:
_
,
reads
}
=
popped_node
{
}
=
task
{
assert_eq!
(
node
,
key
);
// If this is an input node, we expect that it either has no
...
...
@@ -946,24 +1015,15 @@ pub(super) fn pop_task(&mut self, key: DepNode) -> DepNodeIndex {
self
.alloc_node
(
node
,
reads
)
}
else
{
bug!
(
"
pop
_task() - Expected regular task to be popped"
)
bug!
(
"
complete
_task() - Expected regular task to be popped"
)
}
}
fn
push_anon_task
(
&
mut
self
)
{
self
.task_stack
.push
(
OpenTask
::
Anon
{
reads
:
Vec
::
new
(),
read_set
:
FxHashSet
(),
});
}
fn
pop_anon_task
(
&
mut
self
,
kind
:
DepKind
)
->
DepNodeIndex
{
let
popped_node
=
self
.task_stack
.pop
()
.unwrap
();
fn
pop_anon_task
(
&
mut
self
,
kind
:
DepKind
,
task
:
OpenTask
)
->
DepNodeIndex
{
if
let
OpenTask
::
Anon
{
read_set
:
_
,
reads
}
=
popped_node
{
}
=
task
{
debug_assert!
(
!
kind
.is_input
());
let
mut
fingerprint
=
self
.anon_id_seed
;
...
...
@@ -997,62 +1057,58 @@ fn pop_anon_task(&mut self, kind: DepKind) -> DepNodeIndex {
}
}
fn
push_eval_always_task
(
&
mut
self
,
key
:
DepNode
)
{
self
.task_stack
.push
(
OpenTask
::
EvalAlways
{
node
:
key
});
}
fn
pop_eval_always_task
(
&
mut
self
,
key
:
DepNode
)
->
DepNodeIndex
{
let
popped_node
=
self
.task_stack
.pop
()
.unwrap
();
fn
complete_eval_always_task
(
&
mut
self
,
key
:
DepNode
,
task
:
OpenTask
)
->
DepNodeIndex
{
if
let
OpenTask
::
EvalAlways
{
node
,
}
=
popped_node
{
}
=
task
{
debug_assert_eq!
(
node
,
key
);
let
krate_idx
=
self
.node_to_node_index
[
&
DepNode
::
new_no_params
(
DepKind
::
Krate
)];
self
.alloc_node
(
node
,
vec!
[
krate_idx
])
}
else
{
bug!
(
"
pop
_eval_always_task() - Expected eval always task to be popped"
);
bug!
(
"
complete
_eval_always_task() - Expected eval always task to be popped"
);
}
}
fn
read_index
(
&
mut
self
,
source
:
DepNodeIndex
)
{
match
self
.task_stack
.last_mut
()
{
Some
(
&
mut
OpenTask
::
Regular
{
ref
mut
reads
,
ref
mut
read_set
,
node
:
ref
target
,
})
=>
{
self
.total_read_count
+=
1
;
if
read_set
.insert
(
source
)
{
reads
.push
(
source
);
if
cfg!
(
debug_assertions
)
{
if
let
Some
(
ref
forbidden_edge
)
=
self
.forbidden_edge
{
let
source
=
self
.nodes
[
source
];
if
forbidden_edge
.test
(
&
source
,
&
target
)
{
bug!
(
"forbidden edge {:?} -> {:?} created"
,
source
,
target
)
ty
::
tls
::
with_context_opt
(|
icx
|
{
let
icx
=
if
let
Some
(
icx
)
=
icx
{
icx
}
else
{
return
};
match
*
icx
.task
.lock
()
{
OpenTask
::
Regular
{
ref
mut
reads
,
ref
mut
read_set
,
node
:
ref
target
,
}
=>
{
self
.total_read_count
+=
1
;
if
read_set
.insert
(
source
)
{
reads
.push
(
source
);
if
cfg!
(
debug_assertions
)
{
if
let
Some
(
ref
forbidden_edge
)
=
self
.forbidden_edge
{
let
source
=
self
.nodes
[
source
];
if
forbidden_edge
.test
(
&
source
,
&
target
)
{
bug!
(
"forbidden edge {:?} -> {:?} created"
,
source
,
target
)
}
}
}
}
else
{
self
.total_duplicate_read_count
+=
1
;
}
}
else
{
self
.total_duplicate_read_count
+=
1
;
}
}
Some
(
&
mut
OpenTask
::
Anon
{
ref
mut
reads
,
ref
mut
read_set
,
})
=>
{
if
read_set
.insert
(
source
)
{
reads
.push
(
source
);
OpenTask
::
Anon
{
ref
mut
reads
,
ref
mut
read_set
,
}
=>
{
if
read_set
.insert
(
source
)
{
reads
.push
(
source
);
}
}
OpenTask
::
Ignore
|
OpenTask
::
EvalAlways
{
..
}
=>
{
// ignore
}
}
Some
(
&
mut
OpenTask
::
Ignore
)
|
Some
(
&
mut
OpenTask
::
EvalAlways
{
..
})
|
None
=>
{
// ignore
}
}
})
}
fn
alloc_node
(
&
mut
self
,
...
...
@@ -1071,7 +1127,7 @@ fn alloc_node(&mut self,
}
#[derive(Clone,
Debug,
PartialEq)]
enum
OpenTask
{
pub
enum
OpenTask
{
Regular
{
node
:
DepNode
,
reads
:
Vec
<
DepNodeIndex
>
,
...
...
src/librustc/dep_graph/mod.rs
浏览文件 @
64b5d408
...
...
@@ -14,13 +14,12 @@
mod
graph
;
mod
prev
;
mod
query
;
mod
raii
;
mod
safe
;
mod
serialized
;
pub
use
self
::
dep_tracking_map
::{
DepTrackingMap
,
DepTrackingMapConfig
};
pub
use
self
::
dep_node
::{
DepNode
,
DepKind
,
DepConstructor
,
WorkProductId
,
label_strs
};
pub
use
self
::
graph
::{
DepGraph
,
WorkProduct
,
DepNodeIndex
,
DepNodeColor
};
pub
use
self
::
graph
::{
DepGraph
,
WorkProduct
,
DepNodeIndex
,
DepNodeColor
,
OpenTask
};
pub
use
self
::
graph
::
WorkProductFileKind
;
pub
use
self
::
prev
::
PreviousDepGraph
;
pub
use
self
::
query
::
DepGraphQuery
;
...
...
src/librustc/dep_graph/raii.rs
已删除
100644 → 0
浏览文件 @
cc794209
// Copyright 2012-2015 The Rust Project Developers. See the COPYRIGHT
// file at the top-level directory of this distribution and at
// http://rust-lang.org/COPYRIGHT.
//
// Licensed under the Apache License, Version 2.0 <LICENSE-APACHE or
// http://www.apache.org/licenses/LICENSE-2.0> or the MIT license
// <LICENSE-MIT or http://opensource.org/licenses/MIT>, at your
// option. This file may not be copied, modified, or distributed
// except according to those terms.
use
super
::
graph
::
CurrentDepGraph
;
use
std
::
cell
::
RefCell
;
pub
struct
IgnoreTask
<
'graph
>
{
graph
:
&
'graph
RefCell
<
CurrentDepGraph
>
,
}
impl
<
'graph
>
IgnoreTask
<
'graph
>
{
pub
(
super
)
fn
new
(
graph
:
&
'graph
RefCell
<
CurrentDepGraph
>
)
->
IgnoreTask
<
'graph
>
{
graph
.borrow_mut
()
.push_ignore
();
IgnoreTask
{
graph
,
}
}
}
impl
<
'graph
>
Drop
for
IgnoreTask
<
'graph
>
{
fn
drop
(
&
mut
self
)
{
self
.graph
.borrow_mut
()
.pop_ignore
();
}
}
src/librustc/hir/map/collector.rs
浏览文件 @
64b5d408
...
...
@@ -79,26 +79,23 @@ pub(super) fn root(krate: &'hir Crate,
body_ids
:
_
,
}
=
*
krate
;
root_mod_sig_dep_index
=
dep_graph
.
with
_task
(
root_mod_sig_dep_index
=
dep_graph
.
input
_task
(
root_mod_def_path_hash
.to_dep_node
(
DepKind
::
Hir
),
&
hcx
,
HirItemLike
{
item_like
:
(
module
,
attrs
,
span
),
hash_bodies
:
false
},
identity_fn
)
.1
;
root_mod_full_dep_index
=
dep_graph
.
with
_task
(
root_mod_full_dep_index
=
dep_graph
.
input
_task
(
root_mod_def_path_hash
.to_dep_node
(
DepKind
::
HirBody
),
&
hcx
,
HirItemLike
{
item_like
:
(
module
,
attrs
,
span
),
hash_bodies
:
true
},
identity_fn
)
.1
;
}
{
dep_graph
.
with
_task
(
dep_graph
.
input
_task
(
DepNode
::
new_no_params
(
DepKind
::
AllLocalTraitImpls
),
&
hcx
,
&
krate
.trait_impls
,
identity_fn
);
}
...
...
@@ -169,12 +166,11 @@ pub(super) fn finalize_and_compute_crate_hash(mut self,
let
(
_
,
crate_dep_node_index
)
=
self
.dep_graph
.
with
_task
(
DepNode
::
new_no_params
(
DepKind
::
Krate
),
.
input
_task
(
DepNode
::
new_no_params
(
DepKind
::
Krate
),
&
self
.hcx
,
(((
node_hashes
,
upstream_crates
),
source_file_names
),
(
commandline_args_hash
,
crate_disambiguator
.to_fingerprint
())),
identity_fn
);
crate_disambiguator
.to_fingerprint
())));
let
svh
=
Svh
::
new
(
self
.dep_graph
.fingerprint_of
(
crate_dep_node_index
)
...
...
@@ -267,18 +263,16 @@ fn with_dep_node_owner<T: HashStable<StableHashingContext<'a>>,
let
def_path_hash
=
self
.definitions
.def_path_hash
(
dep_node_owner
);
self
.current_signature_dep_index
=
self
.dep_graph
.
with
_task
(
self
.current_signature_dep_index
=
self
.dep_graph
.
input
_task
(
def_path_hash
.to_dep_node
(
DepKind
::
Hir
),
&
self
.hcx
,
HirItemLike
{
item_like
,
hash_bodies
:
false
},
identity_fn
)
.1
;
self
.current_full_dep_index
=
self
.dep_graph
.
with
_task
(
self
.current_full_dep_index
=
self
.dep_graph
.
input
_task
(
def_path_hash
.to_dep_node
(
DepKind
::
HirBody
),
&
self
.hcx
,
HirItemLike
{
item_like
,
hash_bodies
:
true
},
identity_fn
)
.1
;
self
.hir_body_nodes
.push
((
def_path_hash
,
self
.current_full_dep_index
));
...
...
@@ -520,12 +514,6 @@ fn visit_impl_item_ref(&mut self, ii: &'hir ImplItemRef) {
}
}
// We use this with DepGraph::with_task(). Since we are handling only input
// values here, the "task" computing them just passes them through.
fn
identity_fn
<
T
>
(
_
:
&
StableHashingContext
,
item_like
:
T
)
->
T
{
item_like
}
// This is a wrapper structure that allows determining if span values within
// the wrapped item should be hashed or not.
struct
HirItemLike
<
T
>
{
...
...
src/librustc/ty/context.rs
浏览文件 @
64b5d408
...
...
@@ -1562,6 +1562,7 @@ pub fn enter_local<F, R>(
tcx
,
query
:
icx
.query
.clone
(),
layout_depth
:
icx
.layout_depth
,
task
:
icx
.task
,
};
ty
::
tls
::
enter_context
(
&
new_icx
,
|
new_icx
|
{
f
(
new_icx
.tcx
)
...
...
@@ -1740,7 +1741,8 @@ pub mod tls {
use
ty
::
maps
;
use
errors
::{
Diagnostic
,
TRACK_DIAGNOSTICS
};
use
rustc_data_structures
::
OnDrop
;
use
rustc_data_structures
::
sync
::
Lrc
;
use
rustc_data_structures
::
sync
::{
Lrc
,
Lock
};
use
dep_graph
::
OpenTask
;
/// This is the implicit state of rustc. It contains the current
/// TyCtxt and query. It is updated when creating a local interner or
...
...
@@ -1759,6 +1761,10 @@ pub struct ImplicitCtxt<'a, 'gcx: 'a+'tcx, 'tcx: 'a> {
/// Used to prevent layout from recursing too deeply.
pub
layout_depth
:
usize
,
/// The current dep graph task. This is used to add dependencies to queries
/// when executing them
pub
task
:
&
'a
Lock
<
OpenTask
>
,
}
// A thread local value which stores a pointer to the current ImplicitCtxt
...
...
@@ -1845,6 +1851,7 @@ pub fn enter_global<'gcx, F, R>(gcx: &GlobalCtxt<'gcx>, f: F) -> R
tcx
,
query
:
None
,
layout_depth
:
0
,
task
:
&
Lock
::
new
(
OpenTask
::
Ignore
),
};
enter_context
(
&
icx
,
|
_
|
{
f
(
tcx
)
...
...
src/librustc/ty/maps/plumbing.rs
浏览文件 @
64b5d408
...
...
@@ -530,6 +530,7 @@ fn start_job<F, R>(tcx: TyCtxt<'_, $tcx, 'lcx>,
tcx
,
query
:
Some
(
job
.clone
()),
layout_depth
:
icx
.layout_depth
,
task
:
icx
.task
,
};
// Use the ImplicitCtxt while we execute the query
...
...
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录