Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
int
Rust
提交
98dab333
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,发现更多精彩内容 >>
提交
98dab333
编写于
11月 08, 2018
作者:
N
Nicholas Nethercote
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
Wrap some query results in `Lrc`.
So that the frequent clones in `try_get` are cheaper. Fixes #54274.
上级
5c9f7dcd
变更
14
显示空白变更内容
内联
并排
Showing
14 changed file
with
73 addition
and
69 deletion
+73
-69
src/librustc/infer/outlives/verify.rs
src/librustc/infer/outlives/verify.rs
+2
-2
src/librustc/traits/object_safety.rs
src/librustc/traits/object_safety.rs
+3
-2
src/librustc/traits/specialize/mod.rs
src/librustc/traits/specialize/mod.rs
+1
-1
src/librustc/ty/mod.rs
src/librustc/ty/mod.rs
+3
-3
src/librustc/ty/query/mod.rs
src/librustc/ty/query/mod.rs
+6
-5
src/librustc_metadata/cstore_impl.rs
src/librustc_metadata/cstore_impl.rs
+3
-3
src/librustc_traits/lowering/mod.rs
src/librustc_traits/lowering/mod.rs
+7
-5
src/librustc_typeck/astconv.rs
src/librustc_typeck/astconv.rs
+4
-3
src/librustc_typeck/check/mod.rs
src/librustc_typeck/check/mod.rs
+3
-3
src/librustc_typeck/check/wfcheck.rs
src/librustc_typeck/check/wfcheck.rs
+2
-2
src/librustc_typeck/collect.rs
src/librustc_typeck/collect.rs
+33
-34
src/librustc_typeck/outlives/explicit.rs
src/librustc_typeck/outlives/explicit.rs
+3
-3
src/librustdoc/clean/mod.rs
src/librustdoc/clean/mod.rs
+1
-1
src/librustdoc/clean/simplify.rs
src/librustdoc/clean/simplify.rs
+2
-2
未找到文件。
src/librustc/infer/outlives/verify.rs
浏览文件 @
98dab333
...
...
@@ -299,8 +299,8 @@ fn region_bounds_declared_on_associated_item(
let
assoc_item
=
tcx
.associated_item
(
assoc_item_def_id
);
let
trait_def_id
=
assoc_item
.container
.assert_trait
();
let
trait_predicates
=
tcx
.predicates_of
(
trait_def_id
)
.predicates
.i
nto_i
ter
()
.map
(|(
p
,
_
)|
p
)
.iter
()
.map
(|(
p
,
_
)|
*
p
)
.collect
();
let
identity_substs
=
Substs
::
identity_for_item
(
tcx
,
assoc_item_def_id
);
let
identity_proj
=
tcx
.mk_projection
(
assoc_item_def_id
,
identity_substs
);
...
...
src/librustc/traits/object_safety.rs
浏览文件 @
98dab333
...
...
@@ -182,7 +182,7 @@ fn predicates_reference_self(
};
predicates
.predicates
.i
nto_i
ter
()
.iter
()
.map
(|(
predicate
,
_
)|
predicate
.subst_supertrait
(
self
,
&
trait_ref
))
.any
(|
predicate
|
{
match
predicate
{
...
...
@@ -302,9 +302,10 @@ fn virtual_call_violation_for_method(self,
return
Some
(
MethodViolationCode
::
Generic
);
}
if
self
.predicates_of
(
method
.def_id
)
.predicates
.i
nto_i
ter
()
if
self
.predicates_of
(
method
.def_id
)
.predicates
.iter
()
// A trait object can't claim to live more than the concrete type,
// so outlives predicates will always hold.
.cloned
()
.filter
(|(
p
,
_
)|
p
.to_opt_type_outlives
()
.is_none
())
.collect
::
<
Vec
<
_
>>
()
// Do a shallow visit so that `contains_illegal_self_type_reference`
...
...
src/librustc/traits/specialize/mod.rs
浏览文件 @
98dab333
...
...
@@ -407,7 +407,7 @@ fn to_pretty_impl_header(tcx: TyCtxt<'_, '_, '_>, impl_def_id: DefId) -> Option<
// The predicates will contain default bounds like `T: Sized`. We need to
// remove these bounds, and add `T: ?Sized` to any untouched type parameters.
let
predicates
=
tcx
.predicates_of
(
impl_def_id
)
.predicates
;
let
predicates
=
&
tcx
.predicates_of
(
impl_def_id
)
.predicates
;
let
mut
pretty_predicates
=
Vec
::
with_capacity
(
predicates
.len
()
+
types_without_default_bounds
.len
());
...
...
src/librustc/ty/mod.rs
浏览文件 @
98dab333
...
...
@@ -2126,7 +2126,7 @@ pub fn non_enum_variant(&self) -> &VariantDef {
}
#[inline]
pub
fn
predicates
(
&
self
,
tcx
:
TyCtxt
<
'a
,
'gcx
,
'tcx
>
)
->
GenericPredicates
<
'gcx
>
{
pub
fn
predicates
(
&
self
,
tcx
:
TyCtxt
<
'a
,
'gcx
,
'tcx
>
)
->
Lrc
<
GenericPredicates
<
'gcx
>
>
{
tcx
.predicates_of
(
self
.did
)
}
...
...
@@ -2369,8 +2369,8 @@ fn sized_constraint_for_ty(&self,
def_id
:
sized_trait
,
substs
:
tcx
.mk_substs_trait
(
ty
,
&
[])
})
.to_predicate
();
let
predicates
=
tcx
.predicates_of
(
self
.did
)
.predicates
;
if
predicates
.i
nto_iter
()
.any
(|(
p
,
_
)|
p
==
sized_predicate
)
{
let
predicates
=
&
tcx
.predicates_of
(
self
.did
)
.predicates
;
if
predicates
.i
ter
()
.any
(|(
p
,
_
)|
*
p
==
sized_predicate
)
{
vec!
[]
}
else
{
vec!
[
ty
]
...
...
src/librustc/ty/query/mod.rs
浏览文件 @
98dab333
...
...
@@ -127,17 +127,18 @@
/// predicate gets in the way of some checks, which are intended
/// to operate over only the actual where-clauses written by the
/// user.)
[]
fn
predicates_of
:
PredicatesOfItem
(
DefId
)
->
ty
::
GenericPredicates
<
'tcx
>
,
[]
fn
predicates_of
:
PredicatesOfItem
(
DefId
)
->
Lrc
<
ty
::
GenericPredicates
<
'tcx
>
>
,
/// Maps from the def-id of an item (trait/struct/enum/fn) to the
/// predicates (where clauses) directly defined on it. This is
/// equal to the `explicit_predicates_of` predicates plus the
/// `inferred_outlives_of` predicates.
[]
fn
predicates_defined_on
:
PredicatesDefinedOnItem
(
DefId
)
->
ty
::
GenericPredicates
<
'tcx
>
,
[]
fn
predicates_defined_on
:
PredicatesDefinedOnItem
(
DefId
)
->
Lrc
<
ty
::
GenericPredicates
<
'tcx
>>
,
/// Returns the predicates written explicit by the user.
[]
fn
explicit_predicates_of
:
ExplicitPredicatesOfItem
(
DefId
)
->
ty
::
GenericPredicates
<
'tcx
>
,
->
Lrc
<
ty
::
GenericPredicates
<
'tcx
>
>
,
/// Returns the inferred outlives predicates (e.g., for `struct
/// Foo<'a, T> { x: &'a T }`, this would return `T: 'a`).
...
...
@@ -149,12 +150,12 @@
/// evaluate them even during type conversion, often before the
/// full predicates are available (note that supertraits have
/// additional acyclicity requirements).
[]
fn
super_predicates_of
:
SuperPredicatesOfItem
(
DefId
)
->
ty
::
GenericPredicates
<
'tcx
>
,
[]
fn
super_predicates_of
:
SuperPredicatesOfItem
(
DefId
)
->
Lrc
<
ty
::
GenericPredicates
<
'tcx
>
>
,
/// To avoid cycles within the predicates of a single item we compute
/// per-type-parameter predicates for resolving `T::AssocTy`.
[]
fn
type_param_predicates
:
type_param_predicates
((
DefId
,
DefId
))
->
ty
::
GenericPredicates
<
'tcx
>
,
->
Lrc
<
ty
::
GenericPredicates
<
'tcx
>
>
,
[]
fn
trait_def
:
TraitDefOfItem
(
DefId
)
->
&
'tcx
ty
::
TraitDef
,
[]
fn
adt_def
:
AdtDefOfItem
(
DefId
)
->
&
'tcx
ty
::
AdtDef
,
...
...
src/librustc_metadata/cstore_impl.rs
浏览文件 @
98dab333
...
...
@@ -103,9 +103,9 @@ fn into_args(self) -> (DefId, DefId) { (self.0.as_def_id(), self.1) }
generics_of
=>
{
tcx
.alloc_generics
(
cdata
.get_generics
(
def_id
.index
,
tcx
.sess
))
}
predicates_of
=>
{
cdata
.get_predicates
(
def_id
.index
,
tcx
)
}
predicates_defined_on
=>
{
cdata
.get_predicates_defined_on
(
def_id
.index
,
tcx
)
}
super_predicates_of
=>
{
cdata
.get_super_predicates
(
def_id
.index
,
tcx
)
}
predicates_of
=>
{
Lrc
::
new
(
cdata
.get_predicates
(
def_id
.index
,
tcx
)
)
}
predicates_defined_on
=>
{
Lrc
::
new
(
cdata
.get_predicates_defined_on
(
def_id
.index
,
tcx
)
)
}
super_predicates_of
=>
{
Lrc
::
new
(
cdata
.get_super_predicates
(
def_id
.index
,
tcx
)
)
}
trait_def
=>
{
tcx
.alloc_trait_def
(
cdata
.get_trait_def
(
def_id
.index
,
tcx
.sess
))
}
...
...
src/librustc_traits/lowering/mod.rs
浏览文件 @
98dab333
...
...
@@ -217,8 +217,9 @@ fn program_clauses_for_trait<'a, 'tcx>(
let
implemented_from_env
=
Clause
::
ForAll
(
ty
::
Binder
::
bind
(
implemented_from_env
));
let
where_clauses
=
&
tcx
.predicates_defined_on
(
def_id
)
.predicates
.into_iter
()
let
predicates
=
&
tcx
.predicates_defined_on
(
def_id
)
.predicates
;
let
where_clauses
=
&
predicates
.iter
()
.map
(|(
wc
,
_
)|
wc
.lower
())
.map
(|
wc
|
wc
.subst
(
tcx
,
bound_vars
))
.collect
::
<
Vec
<
_
>>
();
...
...
@@ -314,8 +315,9 @@ fn program_clauses_for_impl<'a, 'tcx>(tcx: TyCtxt<'a, 'tcx, 'tcx>, def_id: DefId
let
trait_pred
=
ty
::
TraitPredicate
{
trait_ref
}
.lower
();
// `WC`
let
where_clauses
=
tcx
.predicates_of
(
def_id
)
.predicates
.into_iter
()
let
predicates
=
&
tcx
.predicates_of
(
def_id
)
.predicates
;
let
where_clauses
=
predicates
.iter
()
.map
(|(
wc
,
_
)|
wc
.lower
())
.map
(|
wc
|
wc
.subst
(
tcx
,
bound_vars
));
...
...
@@ -352,7 +354,7 @@ pub fn program_clauses_for_type_def<'a, 'tcx>(
// `WC`
let
where_clauses
=
tcx
.predicates_of
(
def_id
)
.predicates
.i
nto_i
ter
()
.iter
()
.map
(|(
wc
,
_
)|
wc
.lower
())
.map
(|
wc
|
wc
.subst
(
tcx
,
bound_vars
))
.collect
::
<
Vec
<
_
>>
();
...
...
src/librustc_typeck/astconv.rs
浏览文件 @
98dab333
...
...
@@ -24,6 +24,7 @@
use
rustc
::
ty
::{
self
,
Ty
,
TyCtxt
,
ToPredicate
,
TypeFoldable
};
use
rustc
::
ty
::{
GenericParamDef
,
GenericParamDefKind
};
use
rustc
::
ty
::
wf
::
object_region_bounds
;
use
rustc_data_structures
::
sync
::
Lrc
;
use
rustc_target
::
spec
::
abi
;
use
std
::
collections
::
BTreeSet
;
use
std
::
slice
;
...
...
@@ -45,7 +46,7 @@ pub trait AstConv<'gcx, 'tcx> {
/// Returns the set of bounds in scope for the type parameter with
/// the given id.
fn
get_type_parameter_bounds
(
&
self
,
span
:
Span
,
def_id
:
DefId
)
->
ty
::
GenericPredicates
<
'tcx
>
;
->
Lrc
<
ty
::
GenericPredicates
<
'tcx
>
>
;
/// What lifetime should we use when a lifetime is omitted (and not elided)?
fn
re_infer
(
&
self
,
span
:
Span
,
_
def
:
Option
<&
ty
::
GenericParamDef
>
)
...
...
@@ -1119,8 +1120,8 @@ fn find_bound_for_assoc_item(&self,
{
let
tcx
=
self
.tcx
();
let
bounds
=
self
.get_type_parameter_bounds
(
span
,
ty_param_def_id
)
.predicates
.into_
iter
()
.filter_map
(|(
p
,
_
)|
p
.to_opt_poly_trait_ref
());
let
predicates
=
&
self
.get_type_parameter_bounds
(
span
,
ty_param_def_id
)
.predicates
;
let
bounds
=
predicates
.
iter
()
.filter_map
(|(
p
,
_
)|
p
.to_opt_poly_trait_ref
());
// Check that there is exactly one way to find an associated type with the
// correct name.
...
...
src/librustc_typeck/check/mod.rs
浏览文件 @
98dab333
...
...
@@ -1869,7 +1869,7 @@ impl<'a, 'gcx, 'tcx> AstConv<'gcx, 'tcx> for FnCtxt<'a, 'gcx, 'tcx> {
fn
tcx
<
'b
>
(
&
'b
self
)
->
TyCtxt
<
'b
,
'gcx
,
'tcx
>
{
self
.tcx
}
fn
get_type_parameter_bounds
(
&
self
,
_
:
Span
,
def_id
:
DefId
)
->
ty
::
GenericPredicates
<
'tcx
>
->
Lrc
<
ty
::
GenericPredicates
<
'tcx
>
>
{
let
tcx
=
self
.tcx
;
let
node_id
=
tcx
.hir
.as_local_node_id
(
def_id
)
.unwrap
();
...
...
@@ -1877,7 +1877,7 @@ fn get_type_parameter_bounds(&self, _: Span, def_id: DefId)
let
item_def_id
=
tcx
.hir
.local_def_id
(
item_id
);
let
generics
=
tcx
.generics_of
(
item_def_id
);
let
index
=
generics
.param_def_id_to_index
[
&
def_id
];
ty
::
GenericPredicates
{
Lrc
::
new
(
ty
::
GenericPredicates
{
parent
:
None
,
predicates
:
self
.param_env.caller_bounds
.iter
()
.filter_map
(|
&
predicate
|
{
match
predicate
{
...
...
@@ -1890,7 +1890,7 @@ fn get_type_parameter_bounds(&self, _: Span, def_id: DefId)
_
=>
None
}
})
.collect
()
}
}
)
}
fn
re_infer
(
&
self
,
span
:
Span
,
def
:
Option
<&
ty
::
GenericParamDef
>
)
...
...
src/librustc_typeck/check/wfcheck.rs
浏览文件 @
98dab333
...
...
@@ -910,8 +910,8 @@ fn check_false_global_bounds<'a, 'gcx, 'tcx>(
let
def_id
=
fcx
.tcx.hir
.local_def_id
(
id
);
let
predicates
=
fcx
.tcx
.predicates_of
(
def_id
)
.predicates
.i
nto_i
ter
()
.map
(|(
p
,
_
)|
p
)
.iter
()
.map
(|(
p
,
_
)|
*
p
)
.collect
();
// Check elaborated bounds
let
implied_obligations
=
traits
::
elaborate_predicates
(
fcx
.tcx
,
predicates
);
...
...
src/librustc_typeck/collect.rs
浏览文件 @
98dab333
...
...
@@ -39,6 +39,7 @@
use
rustc
::
ty
::{
ReprOptions
,
ToPredicate
};
use
rustc
::
util
::
captures
::
Captures
;
use
rustc
::
util
::
nodemap
::
FxHashMap
;
use
rustc_data_structures
::
sync
::
Lrc
;
use
rustc_target
::
spec
::
abi
;
use
syntax
::
ast
;
...
...
@@ -178,7 +179,8 @@ fn tcx<'b>(&'b self) -> TyCtxt<'b, 'tcx, 'tcx> {
self
.tcx
}
fn
get_type_parameter_bounds
(
&
self
,
span
:
Span
,
def_id
:
DefId
)
->
ty
::
GenericPredicates
<
'tcx
>
{
fn
get_type_parameter_bounds
(
&
self
,
span
:
Span
,
def_id
:
DefId
)
->
Lrc
<
ty
::
GenericPredicates
<
'tcx
>>
{
self
.tcx
.at
(
span
)
.type_param_predicates
((
self
.item_def_id
,
def_id
))
...
...
@@ -243,7 +245,7 @@ fn record_ty(&self, _hir_id: hir::HirId, _ty: Ty<'tcx>, _span: Span) {
fn
type_param_predicates
<
'a
,
'tcx
>
(
tcx
:
TyCtxt
<
'a
,
'tcx
,
'tcx
>
,
(
item_def_id
,
def_id
):
(
DefId
,
DefId
),
)
->
ty
::
GenericPredicates
<
'tcx
>
{
)
->
Lrc
<
ty
::
GenericPredicates
<
'tcx
>
>
{
use
rustc
::
hir
::
*
;
// In the AST, bounds can derive from two places. Either
...
...
@@ -264,11 +266,11 @@ fn type_param_predicates<'a, 'tcx>(
tcx
.generics_of
(
item_def_id
)
.parent
};
let
mut
result
=
parent
.map_or
(
ty
::
GenericPredicates
{
let
mut
result
=
parent
.map_or
_else
(
||
Lrc
::
new
(
ty
::
GenericPredicates
{
parent
:
None
,
predicates
:
vec!
[],
},
}
)
,
|
parent
|
{
let
icx
=
ItemCtxt
::
new
(
tcx
,
parent
);
icx
.get_type_parameter_bounds
(
DUMMY_SP
,
def_id
)
...
...
@@ -298,7 +300,7 @@ fn type_param_predicates<'a, 'tcx>(
// Implied `Self: Trait` and supertrait bounds.
if
param_id
==
item_node_id
{
let
identity_trait_ref
=
ty
::
TraitRef
::
identity
(
tcx
,
item_def_id
);
result
Lrc
::
make_mut
(
&
mut
result
)
.predicates
.push
((
identity_trait_ref
.to_predicate
(),
item
.span
));
}
...
...
@@ -317,7 +319,7 @@ fn type_param_predicates<'a, 'tcx>(
};
let
icx
=
ItemCtxt
::
new
(
tcx
,
item_def_id
);
result
Lrc
::
make_mut
(
&
mut
result
)
.predicates
.extend
(
icx
.type_parameter_bounds_in_generics
(
ast_generics
,
param_id
,
ty
,
OnlySelfBounds
(
true
)));
...
...
@@ -685,7 +687,7 @@ fn adt_def<'a, 'tcx>(tcx: TyCtxt<'a, 'tcx, 'tcx>, def_id: DefId) -> &'tcx ty::Ad
fn
super_predicates_of
<
'a
,
'tcx
>
(
tcx
:
TyCtxt
<
'a
,
'tcx
,
'tcx
>
,
trait_def_id
:
DefId
,
)
->
ty
::
GenericPredicates
<
'tcx
>
{
)
->
Lrc
<
ty
::
GenericPredicates
<
'tcx
>
>
{
debug!
(
"super_predicates(trait_def_id={:?})"
,
trait_def_id
);
let
trait_node_id
=
tcx
.hir
.as_local_node_id
(
trait_def_id
)
.unwrap
();
...
...
@@ -729,10 +731,10 @@ fn super_predicates_of<'a, 'tcx>(
}
}
ty
::
GenericPredicates
{
Lrc
::
new
(
ty
::
GenericPredicates
{
parent
:
None
,
predicates
:
superbounds
,
}
}
)
}
fn
trait_def
<
'a
,
'tcx
>
(
tcx
:
TyCtxt
<
'a
,
'tcx
,
'tcx
>
,
def_id
:
DefId
)
->
&
'tcx
ty
::
TraitDef
{
...
...
@@ -1605,27 +1607,23 @@ fn early_bound_lifetimes_from_generics<'a, 'tcx>(
fn
predicates_defined_on
<
'a
,
'tcx
>
(
tcx
:
TyCtxt
<
'a
,
'tcx
,
'tcx
>
,
def_id
:
DefId
,
)
->
ty
::
GenericPredicates
<
'tcx
>
{
let
explicit
=
tcx
.explicit_predicates_of
(
def_id
);
)
->
Lrc
<
ty
::
GenericPredicates
<
'tcx
>>
{
let
mut
result
=
tcx
.explicit_predicates_of
(
def_id
);
let
inferred_outlives
=
tcx
.inferred_outlives_of
(
def_id
);
if
!
inferred_outlives
.is_empty
()
{
let
span
=
tcx
.def_span
(
def_id
);
let
predicates
=
explicit
.predicates
.into_iter
()
.chain
(
tcx
.inferred_outlives_of
(
def_id
)
.iter
()
.map
(|
&
p
|
(
p
,
span
))
)
.collect
();
ty
::
GenericPredicates
{
parent
:
explicit
.parent
,
predicates
:
predicates
,
Lrc
::
make_mut
(
&
mut
result
)
.predicates
.extend
(
inferred_outlives
.iter
()
.map
(|
&
p
|
(
p
,
span
)));
}
result
}
fn
predicates_of
<
'a
,
'tcx
>
(
tcx
:
TyCtxt
<
'a
,
'tcx
,
'tcx
>
,
def_id
:
DefId
,
)
->
ty
::
GenericPredicates
<
'tcx
>
{
let
ty
::
GenericPredicates
{
parent
,
mut
predicates
,
}
=
tcx
.predicates_defined_on
(
def_id
);
)
->
Lrc
<
ty
::
GenericPredicates
<
'tcx
>>
{
let
mut
result
=
tcx
.predicates_defined_on
(
def_id
);
if
tcx
.is_trait
(
def_id
)
{
// For traits, add `Self: Trait` predicate. This is
...
...
@@ -1641,16 +1639,17 @@ fn predicates_of<'a, 'tcx>(
// used, and adding the predicate into this list ensures
// that this is done.
let
span
=
tcx
.def_span
(
def_id
);
predicates
.push
((
ty
::
TraitRef
::
identity
(
tcx
,
def_id
)
.to_predicate
(),
span
));
Lrc
::
make_mut
(
&
mut
result
)
.predicates
.push
((
ty
::
TraitRef
::
identity
(
tcx
,
def_id
)
.to_predicate
(),
span
));
}
ty
::
GenericPredicates
{
parent
,
predicates
}
result
}
fn
explicit_predicates_of
<
'a
,
'tcx
>
(
tcx
:
TyCtxt
<
'a
,
'tcx
,
'tcx
>
,
def_id
:
DefId
,
)
->
ty
::
GenericPredicates
<
'tcx
>
{
)
->
Lrc
<
ty
::
GenericPredicates
<
'tcx
>
>
{
use
rustc
::
hir
::
*
;
use
rustc_data_structures
::
fx
::
FxHashSet
;
...
...
@@ -1761,10 +1760,10 @@ fn extend<I: IntoIterator<Item = (ty::Predicate<'tcx>, Span)>>(&mut self, iter:
if
impl_trait_fn
.is_some
()
{
// impl Trait
return
ty
::
GenericPredicates
{
return
Lrc
::
new
(
ty
::
GenericPredicates
{
parent
:
None
,
predicates
:
bounds
.predicates
(
tcx
,
opaque_ty
),
};
}
)
;
}
else
{
// named existential types
predicates
.extend
(
bounds
.predicates
(
tcx
,
opaque_ty
));
...
...
@@ -1794,7 +1793,7 @@ fn extend<I: IntoIterator<Item = (ty::Predicate<'tcx>, Span)>>(&mut self, iter:
// on a trait we need to add in the supertrait bounds and bounds found on
// associated types.
if
let
Some
((
_
trait_ref
,
_
))
=
is_trait
{
predicates
.extend
(
tcx
.super_predicates_of
(
def_id
)
.predicates
);
predicates
.extend
(
tcx
.super_predicates_of
(
def_id
)
.predicates
.iter
()
.cloned
()
);
}
// In default impls, we can assume that the self type implements
...
...
@@ -1971,10 +1970,10 @@ fn extend<I: IntoIterator<Item = (ty::Predicate<'tcx>, Span)>>(&mut self, iter:
);
}
ty
::
GenericPredicates
{
Lrc
::
new
(
ty
::
GenericPredicates
{
parent
:
generics
.parent
,
predicates
,
}
}
)
}
pub
enum
SizedByDefault
{
...
...
src/librustc_typeck/outlives/explicit.rs
浏览文件 @
98dab333
...
...
@@ -33,14 +33,14 @@ pub fn explicit_predicates_of(
)
->
&
RequiredPredicates
<
'tcx
>
{
self
.map
.entry
(
def_id
)
.or_insert_with
(||
{
let
predicates
=
if
def_id
.is_local
()
{
tcx
.explicit_predicates_of
(
def_id
)
.predicates
tcx
.explicit_predicates_of
(
def_id
)
}
else
{
tcx
.predicates_of
(
def_id
)
.predicates
tcx
.predicates_of
(
def_id
)
};
let
mut
required_predicates
=
RequiredPredicates
::
default
();
// process predicates and convert to `RequiredPredicates` entry, see below
for
(
pred
,
_
)
in
predicates
.
into_
iter
()
{
for
(
pred
,
_
)
in
predicates
.
predicates
.
iter
()
{
match
pred
{
ty
::
Predicate
::
TypeOutlives
(
predicate
)
=>
{
let
OutlivesPredicate
(
ref
ty
,
ref
reg
)
=
predicate
.skip_binder
();
...
...
src/librustdoc/clean/mod.rs
浏览文件 @
98dab333
...
...
@@ -1563,7 +1563,7 @@ fn is_impl_trait(param: &hir::GenericParam) -> bool {
}
impl
<
'a
,
'tcx
>
Clean
<
Generics
>
for
(
&
'a
ty
::
Generics
,
&
'a
ty
::
GenericPredicates
<
'tcx
>
)
{
&
'a
Lrc
<
ty
::
GenericPredicates
<
'tcx
>
>
)
{
fn
clean
(
&
self
,
cx
:
&
DocContext
)
->
Generics
{
use
self
::
WherePredicate
as
WP
;
...
...
src/librustdoc/clean/simplify.rs
浏览文件 @
98dab333
...
...
@@ -156,8 +156,8 @@ fn trait_is_same_or_supertrait(cx: &DocContext, child: DefId,
if
child
==
trait_
{
return
true
}
let
predicates
=
cx
.tcx
.super_predicates_of
(
child
)
.predicates
;
predicates
.iter
()
.filter_map
(|(
pred
,
_
)|
{
let
predicates
=
cx
.tcx
.super_predicates_of
(
child
);
predicates
.
predicates
.
iter
()
.filter_map
(|(
pred
,
_
)|
{
if
let
ty
::
Predicate
::
Trait
(
ref
pred
)
=
*
pred
{
if
pred
.skip_binder
()
.trait_ref
.self_ty
()
.is_self
()
{
Some
(
pred
.def_id
())
...
...
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录