Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
int
Rust
提交
a5236e9d
R
Rust
项目概览
int
/
Rust
12 个月 前同步成功
通知
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,发现更多精彩内容 >>
提交
a5236e9d
编写于
4月 05, 2016
作者:
N
Niko Matsakis
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
add some comments
上级
068142a2
变更
2
隐藏空白更改
内联
并排
Showing
2 changed file
with
19 addition
and
1 deletion
+19
-1
src/librustc_incremental/persist/README.md
src/librustc_incremental/persist/README.md
+13
-0
src/librustc_incremental/persist/load.rs
src/librustc_incremental/persist/load.rs
+6
-1
未找到文件。
src/librustc_incremental/persist/README.md
0 → 100644
浏览文件 @
a5236e9d
This is the code to load/save the dependency graph. Loading is assumed
to run early in compilation, and saving at the very end. When loading,
the basic idea is that we will load up the dependency graph from the
previous compilation and compare the hashes of our HIR nodes to the
hashes of the HIR nodes that existed at the time. For each node whose
hash has changed, or which no longer exists in the new HIR, we can
remove that node from the old graph along with any nodes that depend
on it. Then we add what's left to the new graph (if any such nodes or
edges already exist, then there would be no effect, but since we do
this first thing, they do not).
src/librustc_incremental/persist/load.rs
浏览文件 @
a5236e9d
...
...
@@ -10,7 +10,6 @@
//! Code to save/load the dep-graph from files.
use
calculate_svh
::
SvhCalculate
;
use
rbml
::{
self
,
Doc
};
use
rbml
::
reader
::{
self
,
DecodeResult
,
Decoder
};
...
...
@@ -32,6 +31,12 @@
type
CleanEdges
=
Vec
<
(
DepNode
<
DefId
>
,
DepNode
<
DefId
>
)
>
;
/// If we are in incremental mode, and a previous dep-graph exists,
/// then load up those nodes/edges that are still valid into the
/// dep-graph for this session. (This is assumed to be running very
/// early in compilation, before we've really done any work, but
/// actually it doesn't matter all that much.) See `README.md` for
/// more general overview.
pub
fn
load_dep_graph
<
'tcx
>
(
tcx
:
&
ty
::
TyCtxt
<
'tcx
>
)
{
let
_
ignore
=
tcx
.dep_graph
.in_ignore
();
...
...
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录