1 // Copyright 2012 The Rust Project Developers. See the COPYRIGHT
2 // file at the top-level directory of this distribution and at
3 // http://rust-lang.org/COPYRIGHT.
5 // Licensed under the Apache License, Version 2.0 <LICENSE-APACHE or
6 // http://www.apache.org/licenses/LICENSE-2.0> or the MIT license
7 // <LICENSE-MIT or http://opensource.org/licenses/MIT>, at your
8 // option. This file may not be copied, modified, or distributed
9 // except according to those terms.
11 //! # Standalone Tests for the Inference Module
14 use rustc::dep_graph::DepGraph;
16 use rustc_resolve::MakeGlobMap;
18 use rustc::middle::lang_items;
19 use rustc::middle::free_region::FreeRegionMap;
20 use rustc::middle::region::{CodeExtent, RegionMaps};
21 use rustc::middle::resolve_lifetime;
22 use rustc::middle::stability;
23 use rustc::ty::subst::{Kind, Subst};
24 use rustc::traits::{ObligationCause, Reveal};
25 use rustc::ty::{self, Ty, TyCtxt, TypeFoldable};
26 use rustc::infer::{self, InferOk, InferResult};
27 use rustc::infer::type_variable::TypeVariableOrigin;
28 use rustc_metadata::cstore::CStore;
29 use rustc::hir::map as hir_map;
30 use rustc::mir::transform::Passes;
31 use rustc::session::{self, config};
35 use syntax::codemap::{CodeMap, FilePathMapping};
37 use errors::emitter::Emitter;
38 use errors::{Level, DiagnosticBuilder};
39 use syntax::feature_gate::UnstableFeatures;
40 use syntax::symbol::Symbol;
41 use syntax_pos::DUMMY_SP;
42 use arena::DroplessArena;
46 struct Env<'a, 'gcx: 'a + 'tcx, 'tcx: 'a> {
47 infcx: &'a infer::InferCtxt<'a, 'gcx, 'tcx>,
48 region_maps: &'a mut RegionMaps,
56 const EMPTY_SOURCE_STR: &'static str = "#![feature(no_core)] #![no_core]";
58 struct ExpectErrorEmitter {
59 messages: Vec<String>,
62 fn remove_message(e: &mut ExpectErrorEmitter, msg: &str, lvl: Level) {
64 Level::Bug | Level::Fatal | Level::Error => {}
70 debug!("Error: {}", msg);
71 match e.messages.iter().position(|m| msg.contains(m)) {
76 debug!("Unexpected error: {} Expected: {:?}", msg, e.messages);
77 panic!("Unexpected error: {} Expected: {:?}", msg, e.messages);
82 impl Emitter for ExpectErrorEmitter {
83 fn emit(&mut self, db: &DiagnosticBuilder) {
84 remove_message(self, &db.message(), db.level);
85 for child in &db.children {
86 remove_message(self, &child.message(), child.level);
91 fn errors(msgs: &[&str]) -> (Box<Emitter + Send>, usize) {
92 let v = msgs.iter().map(|m| m.to_string()).collect();
93 (box ExpectErrorEmitter { messages: v } as Box<Emitter + Send>, msgs.len())
96 fn test_env<F>(source_string: &str,
97 (emitter, expected_err_count): (Box<Emitter + Send>, usize),
101 let mut options = config::basic_options();
102 options.debugging_opts.verbose = true;
103 options.unstable_features = UnstableFeatures::Allow;
104 let diagnostic_handler = errors::Handler::with_emitter(true, false, emitter);
106 let dep_graph = DepGraph::new(false);
107 let _ignore = dep_graph.in_ignore();
108 let cstore = Rc::new(CStore::new(&dep_graph, box rustc_trans::LlvmMetadataLoader));
109 let sess = session::build_session_(options,
113 Rc::new(CodeMap::new(FilePathMapping::empty())),
115 rustc_trans::init(&sess);
116 rustc_lint::register_builtins(&mut sess.lint_store.borrow_mut(), Some(&sess));
117 let input = config::Input::Str {
118 name: driver::anon_src(),
119 input: source_string.to_string(),
121 let krate = driver::phase_1_parse_input(&sess, &input).unwrap();
122 let driver::ExpansionResult { defs, resolutions, mut hir_forest, .. } = {
123 driver::phase_2_configure_and_expand(&sess,
131 .expect("phase 2 aborted")
133 let _ignore = dep_graph.in_ignore();
135 let arena = DroplessArena::new();
136 let arenas = ty::GlobalArenas::new();
137 let hir_map = hir_map::map_crate(&mut hir_forest, defs);
139 // run just enough stuff to build a tcx:
140 let lang_items = lang_items::collect_language_items(&sess, &hir_map);
141 let named_region_map = resolve_lifetime::krate(&sess, &hir_map);
142 let index = stability::Index::new(&sess);
143 TyCtxt::create_and_enter(&sess,
144 ty::maps::Providers::default(),
145 ty::maps::Providers::default(),
146 Rc::new(Passes::new()),
150 named_region_map.unwrap(),
156 tcx.infer_ctxt((), Reveal::UserFacing).enter(|infcx| {
157 let mut region_maps = RegionMaps::new();
158 body(Env { infcx: &infcx, region_maps: &mut region_maps });
159 let free_regions = FreeRegionMap::new();
160 let def_id = tcx.hir.local_def_id(ast::CRATE_NODE_ID);
161 infcx.resolve_regions_and_report_errors(def_id, ®ion_maps, &free_regions);
162 assert_eq!(tcx.sess.err_count(), expected_err_count);
167 impl<'a, 'gcx, 'tcx> Env<'a, 'gcx, 'tcx> {
168 pub fn tcx(&self) -> TyCtxt<'a, 'gcx, 'tcx> {
172 pub fn create_region_hierarchy(&mut self, rh: &RH, parent: CodeExtent) {
173 let me = CodeExtent::Misc(rh.id);
174 self.region_maps.record_code_extent(me, Some(parent));
175 for child_rh in rh.sub {
176 self.create_region_hierarchy(child_rh, me);
180 pub fn create_simple_region_hierarchy(&mut self) {
181 // creates a region hierarchy where 1 is root, 10 and 11 are
182 // children of 1, etc
184 let node = ast::NodeId::from_u32;
185 let dscope = CodeExtent::DestructionScope(node(1));
186 self.region_maps.record_code_extent(dscope, None);
187 self.create_region_hierarchy(&RH {
201 #[allow(dead_code)] // this seems like it could be useful, even if we don't use it now
202 pub fn lookup_item(&self, names: &[String]) -> ast::NodeId {
203 return match search_mod(self, &self.infcx.tcx.hir.krate().module, 0, names) {
206 panic!("no item found: `{}`", names.join("::"));
210 fn search_mod(this: &Env,
214 -> Option<ast::NodeId> {
215 assert!(idx < names.len());
216 for item in &m.item_ids {
217 let item = this.infcx.tcx.hir.expect_item(item.id);
218 if item.name.to_string() == names[idx] {
219 return search(this, item, idx + 1, names);
225 fn search(this: &Env, it: &hir::Item, idx: usize, names: &[String]) -> Option<ast::NodeId> {
226 if idx == names.len() {
230 return match it.node {
232 hir::ItemExternCrate(..) |
234 hir::ItemStatic(..) |
236 hir::ItemForeignMod(..) |
237 hir::ItemGlobalAsm(..) |
238 hir::ItemTy(..) => None,
241 hir::ItemStruct(..) |
245 hir::ItemDefaultImpl(..) => None,
247 hir::ItemMod(ref m) => search_mod(this, m, idx, names),
252 pub fn make_subtype(&self, a: Ty<'tcx>, b: Ty<'tcx>) -> bool {
253 match self.infcx.sub_types(true, &ObligationCause::dummy(), a, b) {
255 Err(ref e) => panic!("Encountered error: {}", e),
259 pub fn is_subtype(&self, a: Ty<'tcx>, b: Ty<'tcx>) -> bool {
260 self.infcx.can_sub_types(a, b).is_ok()
263 pub fn assert_subtype(&self, a: Ty<'tcx>, b: Ty<'tcx>) {
264 if !self.is_subtype(a, b) {
265 panic!("{} is not a subtype of {}, but it should be", a, b);
269 pub fn assert_eq(&self, a: Ty<'tcx>, b: Ty<'tcx>) {
270 self.assert_subtype(a, b);
271 self.assert_subtype(b, a);
274 pub fn t_fn(&self, input_tys: &[Ty<'tcx>], output_ty: Ty<'tcx>) -> Ty<'tcx> {
275 self.infcx.tcx.mk_fn_ptr(ty::Binder(self.infcx.tcx.mk_fn_sig(
276 input_tys.iter().cloned(),
279 hir::Unsafety::Normal,
284 pub fn t_nil(&self) -> Ty<'tcx> {
285 self.infcx.tcx.mk_nil()
288 pub fn t_pair(&self, ty1: Ty<'tcx>, ty2: Ty<'tcx>) -> Ty<'tcx> {
289 self.infcx.tcx.intern_tup(&[ty1, ty2], false)
292 pub fn t_param(&self, index: u32) -> Ty<'tcx> {
293 let name = format!("T{}", index);
294 self.infcx.tcx.mk_param(index, Symbol::intern(&name))
297 pub fn re_early_bound(&self, index: u32, name: &'static str) -> ty::Region<'tcx> {
298 let name = Symbol::intern(name);
299 self.infcx.tcx.mk_region(ty::ReEarlyBound(ty::EarlyBoundRegion {
300 def_id: self.infcx.tcx.hir.local_def_id(ast::CRATE_NODE_ID),
306 pub fn re_late_bound_with_debruijn(&self,
308 debruijn: ty::DebruijnIndex)
309 -> ty::Region<'tcx> {
310 self.infcx.tcx.mk_region(ty::ReLateBound(debruijn, ty::BrAnon(id)))
313 pub fn t_rptr(&self, r: ty::Region<'tcx>) -> Ty<'tcx> {
314 self.infcx.tcx.mk_imm_ref(r, self.tcx().types.isize)
317 pub fn t_rptr_late_bound(&self, id: u32) -> Ty<'tcx> {
318 let r = self.re_late_bound_with_debruijn(id, ty::DebruijnIndex::new(1));
319 self.infcx.tcx.mk_imm_ref(r, self.tcx().types.isize)
322 pub fn t_rptr_late_bound_with_debruijn(&self,
324 debruijn: ty::DebruijnIndex)
326 let r = self.re_late_bound_with_debruijn(id, debruijn);
327 self.infcx.tcx.mk_imm_ref(r, self.tcx().types.isize)
330 pub fn t_rptr_scope(&self, id: u32) -> Ty<'tcx> {
331 let r = ty::ReScope(CodeExtent::Misc(ast::NodeId::from_u32(id)));
332 self.infcx.tcx.mk_imm_ref(self.infcx.tcx.mk_region(r), self.tcx().types.isize)
335 pub fn re_free(&self, id: u32) -> ty::Region<'tcx> {
336 self.infcx.tcx.mk_region(ty::ReFree(ty::FreeRegion {
337 scope: self.infcx.tcx.hir.local_def_id(ast::CRATE_NODE_ID),
338 bound_region: ty::BrAnon(id),
342 pub fn t_rptr_free(&self, id: u32) -> Ty<'tcx> {
343 let r = self.re_free(id);
344 self.infcx.tcx.mk_imm_ref(r, self.tcx().types.isize)
347 pub fn t_rptr_static(&self) -> Ty<'tcx> {
348 self.infcx.tcx.mk_imm_ref(self.infcx.tcx.types.re_static,
349 self.tcx().types.isize)
352 pub fn t_rptr_empty(&self) -> Ty<'tcx> {
353 self.infcx.tcx.mk_imm_ref(self.infcx.tcx.types.re_empty,
354 self.tcx().types.isize)
357 pub fn dummy_type_trace(&self) -> infer::TypeTrace<'tcx> {
358 infer::TypeTrace::dummy(self.tcx())
361 pub fn sub(&self, t1: Ty<'tcx>, t2: Ty<'tcx>) -> InferResult<'tcx, Ty<'tcx>> {
362 let trace = self.dummy_type_trace();
363 self.infcx.sub(true, trace, &t1, &t2)
366 pub fn lub(&self, t1: Ty<'tcx>, t2: Ty<'tcx>) -> InferResult<'tcx, Ty<'tcx>> {
367 let trace = self.dummy_type_trace();
368 self.infcx.lub(true, trace, &t1, &t2)
371 pub fn glb(&self, t1: Ty<'tcx>, t2: Ty<'tcx>) -> InferResult<'tcx, Ty<'tcx>> {
372 let trace = self.dummy_type_trace();
373 self.infcx.glb(true, trace, &t1, &t2)
376 /// Checks that `t1 <: t2` is true (this may register additional
378 pub fn check_sub(&self, t1: Ty<'tcx>, t2: Ty<'tcx>) {
379 match self.sub(t1, t2) {
380 Ok(InferOk { obligations, .. }) => {
381 // None of these tests should require nested obligations:
382 assert!(obligations.is_empty());
385 panic!("unexpected error computing sub({:?},{:?}): {}", t1, t2, e);
390 /// Checks that `t1 <: t2` is false (this may register additional
392 pub fn check_not_sub(&self, t1: Ty<'tcx>, t2: Ty<'tcx>) {
393 match self.sub(t1, t2) {
396 panic!("unexpected success computing sub({:?},{:?})", t1, t2);
401 /// Checks that `LUB(t1,t2) == t_lub`
402 pub fn check_lub(&self, t1: Ty<'tcx>, t2: Ty<'tcx>, t_lub: Ty<'tcx>) {
403 match self.lub(t1, t2) {
404 Ok(InferOk { obligations, value: t }) => {
405 // None of these tests should require nested obligations:
406 assert!(obligations.is_empty());
408 self.assert_eq(t, t_lub);
410 Err(ref e) => panic!("unexpected error in LUB: {}", e),
414 /// Checks that `GLB(t1,t2) == t_glb`
415 pub fn check_glb(&self, t1: Ty<'tcx>, t2: Ty<'tcx>, t_glb: Ty<'tcx>) {
416 debug!("check_glb(t1={}, t2={}, t_glb={})", t1, t2, t_glb);
417 match self.glb(t1, t2) {
418 Err(e) => panic!("unexpected error computing LUB: {:?}", e),
419 Ok(InferOk { obligations, value: t }) => {
420 // None of these tests should require nested obligations:
421 assert!(obligations.is_empty());
423 self.assert_eq(t, t_glb);
425 // sanity check for good measure:
426 self.assert_subtype(t, t1);
427 self.assert_subtype(t, t2);
434 fn contravariant_region_ptr_ok() {
435 test_env(EMPTY_SOURCE_STR, errors(&[]), |mut env| {
436 env.create_simple_region_hierarchy();
437 let t_rptr1 = env.t_rptr_scope(1);
438 let t_rptr10 = env.t_rptr_scope(10);
439 env.assert_eq(t_rptr1, t_rptr1);
440 env.assert_eq(t_rptr10, t_rptr10);
441 env.make_subtype(t_rptr1, t_rptr10);
446 fn contravariant_region_ptr_err() {
447 test_env(EMPTY_SOURCE_STR, errors(&["mismatched types"]), |mut env| {
448 env.create_simple_region_hierarchy();
449 let t_rptr1 = env.t_rptr_scope(1);
450 let t_rptr10 = env.t_rptr_scope(10);
451 env.assert_eq(t_rptr1, t_rptr1);
452 env.assert_eq(t_rptr10, t_rptr10);
454 // will cause an error when regions are resolved
455 env.make_subtype(t_rptr10, t_rptr1);
460 fn sub_free_bound_false() {
463 //! fn(&'a isize) <: for<'b> fn(&'b isize)
467 test_env(EMPTY_SOURCE_STR, errors(&[]), |mut env| {
468 env.create_simple_region_hierarchy();
469 let t_rptr_free1 = env.t_rptr_free(1);
470 let t_rptr_bound1 = env.t_rptr_late_bound(1);
471 env.check_not_sub(env.t_fn(&[t_rptr_free1], env.tcx().types.isize),
472 env.t_fn(&[t_rptr_bound1], env.tcx().types.isize));
477 fn sub_bound_free_true() {
480 //! for<'a> fn(&'a isize) <: fn(&'b isize)
484 test_env(EMPTY_SOURCE_STR, errors(&[]), |mut env| {
485 env.create_simple_region_hierarchy();
486 let t_rptr_bound1 = env.t_rptr_late_bound(1);
487 let t_rptr_free1 = env.t_rptr_free(1);
488 env.check_sub(env.t_fn(&[t_rptr_bound1], env.tcx().types.isize),
489 env.t_fn(&[t_rptr_free1], env.tcx().types.isize));
494 fn sub_free_bound_false_infer() {
497 //! fn(_#1) <: for<'b> fn(&'b isize)
499 //! does NOT hold for any instantiation of `_#1`.
501 test_env(EMPTY_SOURCE_STR, errors(&[]), |env| {
502 let t_infer1 = env.infcx.next_ty_var(TypeVariableOrigin::MiscVariable(DUMMY_SP));
503 let t_rptr_bound1 = env.t_rptr_late_bound(1);
504 env.check_not_sub(env.t_fn(&[t_infer1], env.tcx().types.isize),
505 env.t_fn(&[t_rptr_bound1], env.tcx().types.isize));
510 fn lub_free_bound_infer() {
513 //! LUB(fn(_#1), for<'b> fn(&'b isize))
515 //! This should yield `fn(&'_ isize)`. We check
516 //! that it yields `fn(&'x isize)` for some free `'x`,
519 test_env(EMPTY_SOURCE_STR, errors(&[]), |mut env| {
520 env.create_simple_region_hierarchy();
521 let t_infer1 = env.infcx.next_ty_var(TypeVariableOrigin::MiscVariable(DUMMY_SP));
522 let t_rptr_bound1 = env.t_rptr_late_bound(1);
523 let t_rptr_free1 = env.t_rptr_free(1);
524 env.check_lub(env.t_fn(&[t_infer1], env.tcx().types.isize),
525 env.t_fn(&[t_rptr_bound1], env.tcx().types.isize),
526 env.t_fn(&[t_rptr_free1], env.tcx().types.isize));
531 fn lub_bound_bound() {
532 test_env(EMPTY_SOURCE_STR, errors(&[]), |env| {
533 let t_rptr_bound1 = env.t_rptr_late_bound(1);
534 let t_rptr_bound2 = env.t_rptr_late_bound(2);
535 env.check_lub(env.t_fn(&[t_rptr_bound1], env.tcx().types.isize),
536 env.t_fn(&[t_rptr_bound2], env.tcx().types.isize),
537 env.t_fn(&[t_rptr_bound1], env.tcx().types.isize));
542 fn lub_bound_free() {
543 test_env(EMPTY_SOURCE_STR, errors(&[]), |mut env| {
544 env.create_simple_region_hierarchy();
545 let t_rptr_bound1 = env.t_rptr_late_bound(1);
546 let t_rptr_free1 = env.t_rptr_free(1);
547 env.check_lub(env.t_fn(&[t_rptr_bound1], env.tcx().types.isize),
548 env.t_fn(&[t_rptr_free1], env.tcx().types.isize),
549 env.t_fn(&[t_rptr_free1], env.tcx().types.isize));
554 fn lub_bound_static() {
555 test_env(EMPTY_SOURCE_STR, errors(&[]), |env| {
556 let t_rptr_bound1 = env.t_rptr_late_bound(1);
557 let t_rptr_static = env.t_rptr_static();
558 env.check_lub(env.t_fn(&[t_rptr_bound1], env.tcx().types.isize),
559 env.t_fn(&[t_rptr_static], env.tcx().types.isize),
560 env.t_fn(&[t_rptr_static], env.tcx().types.isize));
565 fn lub_bound_bound_inverse_order() {
566 test_env(EMPTY_SOURCE_STR, errors(&[]), |env| {
567 let t_rptr_bound1 = env.t_rptr_late_bound(1);
568 let t_rptr_bound2 = env.t_rptr_late_bound(2);
569 env.check_lub(env.t_fn(&[t_rptr_bound1, t_rptr_bound2], t_rptr_bound1),
570 env.t_fn(&[t_rptr_bound2, t_rptr_bound1], t_rptr_bound1),
571 env.t_fn(&[t_rptr_bound1, t_rptr_bound1], t_rptr_bound1));
577 test_env(EMPTY_SOURCE_STR, errors(&[]), |mut env| {
578 env.create_simple_region_hierarchy();
579 let t_rptr_free1 = env.t_rptr_free(1);
580 let t_rptr_free2 = env.t_rptr_free(2);
581 let t_rptr_static = env.t_rptr_static();
582 env.check_lub(env.t_fn(&[t_rptr_free1], env.tcx().types.isize),
583 env.t_fn(&[t_rptr_free2], env.tcx().types.isize),
584 env.t_fn(&[t_rptr_static], env.tcx().types.isize));
589 fn lub_returning_scope() {
590 test_env(EMPTY_SOURCE_STR, errors(&[]), |mut env| {
591 env.create_simple_region_hierarchy();
592 let t_rptr_scope10 = env.t_rptr_scope(10);
593 let t_rptr_scope11 = env.t_rptr_scope(11);
594 let t_rptr_empty = env.t_rptr_empty();
595 env.check_lub(env.t_fn(&[t_rptr_scope10], env.tcx().types.isize),
596 env.t_fn(&[t_rptr_scope11], env.tcx().types.isize),
597 env.t_fn(&[t_rptr_empty], env.tcx().types.isize));
602 fn glb_free_free_with_common_scope() {
603 test_env(EMPTY_SOURCE_STR, errors(&[]), |mut env| {
604 env.create_simple_region_hierarchy();
605 let t_rptr_free1 = env.t_rptr_free(1);
606 let t_rptr_free2 = env.t_rptr_free(2);
607 let t_rptr_scope = env.t_rptr_scope(1);
608 env.check_glb(env.t_fn(&[t_rptr_free1], env.tcx().types.isize),
609 env.t_fn(&[t_rptr_free2], env.tcx().types.isize),
610 env.t_fn(&[t_rptr_scope], env.tcx().types.isize));
615 fn glb_bound_bound() {
616 test_env(EMPTY_SOURCE_STR, errors(&[]), |env| {
617 let t_rptr_bound1 = env.t_rptr_late_bound(1);
618 let t_rptr_bound2 = env.t_rptr_late_bound(2);
619 env.check_glb(env.t_fn(&[t_rptr_bound1], env.tcx().types.isize),
620 env.t_fn(&[t_rptr_bound2], env.tcx().types.isize),
621 env.t_fn(&[t_rptr_bound1], env.tcx().types.isize));
626 fn glb_bound_free() {
627 test_env(EMPTY_SOURCE_STR, errors(&[]), |mut env| {
628 env.create_simple_region_hierarchy();
629 let t_rptr_bound1 = env.t_rptr_late_bound(1);
630 let t_rptr_free1 = env.t_rptr_free(1);
631 env.check_glb(env.t_fn(&[t_rptr_bound1], env.tcx().types.isize),
632 env.t_fn(&[t_rptr_free1], env.tcx().types.isize),
633 env.t_fn(&[t_rptr_bound1], env.tcx().types.isize));
638 fn glb_bound_free_infer() {
639 test_env(EMPTY_SOURCE_STR, errors(&[]), |env| {
640 let t_rptr_bound1 = env.t_rptr_late_bound(1);
641 let t_infer1 = env.infcx.next_ty_var(TypeVariableOrigin::MiscVariable(DUMMY_SP));
643 // compute GLB(fn(_) -> isize, for<'b> fn(&'b isize) -> isize),
644 // which should yield for<'b> fn(&'b isize) -> isize
645 env.check_glb(env.t_fn(&[t_rptr_bound1], env.tcx().types.isize),
646 env.t_fn(&[t_infer1], env.tcx().types.isize),
647 env.t_fn(&[t_rptr_bound1], env.tcx().types.isize));
649 // as a side-effect, computing GLB should unify `_` with
651 let t_resolve1 = env.infcx.shallow_resolve(t_infer1);
652 match t_resolve1.sty {
655 panic!("t_resolve1={:?}", t_resolve1);
662 fn glb_bound_static() {
663 test_env(EMPTY_SOURCE_STR, errors(&[]), |env| {
664 let t_rptr_bound1 = env.t_rptr_late_bound(1);
665 let t_rptr_static = env.t_rptr_static();
666 env.check_glb(env.t_fn(&[t_rptr_bound1], env.tcx().types.isize),
667 env.t_fn(&[t_rptr_static], env.tcx().types.isize),
668 env.t_fn(&[t_rptr_bound1], env.tcx().types.isize));
672 /// Test substituting a bound region into a function, which introduces another level of binding.
673 /// This requires adjusting the Debruijn index.
675 fn subst_ty_renumber_bound() {
677 test_env(EMPTY_SOURCE_STR, errors(&[]), |env| {
679 // Theta = [A -> &'a foo]
681 let t_rptr_bound1 = env.t_rptr_late_bound(1);
685 let t_param = env.t_param(0);
686 env.t_fn(&[t_param], env.t_nil())
689 let substs = env.infcx.tcx.intern_substs(&[Kind::from(t_rptr_bound1)]);
690 let t_substituted = t_source.subst(env.infcx.tcx, substs);
692 // t_expected = fn(&'a isize)
694 let t_ptr_bound2 = env.t_rptr_late_bound_with_debruijn(1, ty::DebruijnIndex::new(2));
695 env.t_fn(&[t_ptr_bound2], env.t_nil())
698 debug!("subst_bound: t_source={:?} substs={:?} t_substituted={:?} t_expected={:?}",
704 assert_eq!(t_substituted, t_expected);
708 /// Test substituting a bound region into a function, which introduces another level of binding.
709 /// This requires adjusting the Debruijn index.
711 fn subst_ty_renumber_some_bounds() {
712 test_env(EMPTY_SOURCE_STR, errors(&[]), |env| {
714 // Theta = [A -> &'a foo]
716 let t_rptr_bound1 = env.t_rptr_late_bound(1);
718 // t_source = (A, fn(A))
720 let t_param = env.t_param(0);
721 env.t_pair(t_param, env.t_fn(&[t_param], env.t_nil()))
724 let substs = env.infcx.tcx.intern_substs(&[Kind::from(t_rptr_bound1)]);
725 let t_substituted = t_source.subst(env.infcx.tcx, substs);
727 // t_expected = (&'a isize, fn(&'a isize))
729 // but not that the Debruijn index is different in the different cases.
731 let t_rptr_bound2 = env.t_rptr_late_bound_with_debruijn(1, ty::DebruijnIndex::new(2));
732 env.t_pair(t_rptr_bound1, env.t_fn(&[t_rptr_bound2], env.t_nil()))
735 debug!("subst_bound: t_source={:?} substs={:?} t_substituted={:?} t_expected={:?}",
741 assert_eq!(t_substituted, t_expected);
745 /// Test that we correctly compute whether a type has escaping regions or not.
749 test_env(EMPTY_SOURCE_STR, errors(&[]), |mut env| {
751 // Theta = [A -> &'a foo]
752 env.create_simple_region_hierarchy();
754 assert!(!env.t_nil().has_escaping_regions());
756 let t_rptr_free1 = env.t_rptr_free(1);
757 assert!(!t_rptr_free1.has_escaping_regions());
759 let t_rptr_bound1 = env.t_rptr_late_bound_with_debruijn(1, ty::DebruijnIndex::new(1));
760 assert!(t_rptr_bound1.has_escaping_regions());
762 let t_rptr_bound2 = env.t_rptr_late_bound_with_debruijn(1, ty::DebruijnIndex::new(2));
763 assert!(t_rptr_bound2.has_escaping_regions());
766 let t_param = env.t_param(0);
767 assert!(!t_param.has_escaping_regions());
768 let t_fn = env.t_fn(&[t_param], env.t_nil());
769 assert!(!t_fn.has_escaping_regions());
773 /// Test applying a substitution where the value being substituted for an early-bound region is a
774 /// late-bound region.
776 fn subst_region_renumber_region() {
777 test_env(EMPTY_SOURCE_STR, errors(&[]), |env| {
778 let re_bound1 = env.re_late_bound_with_debruijn(1, ty::DebruijnIndex::new(1));
780 // type t_source<'a> = fn(&'a isize)
782 let re_early = env.re_early_bound(0, "'a");
783 env.t_fn(&[env.t_rptr(re_early)], env.t_nil())
786 let substs = env.infcx.tcx.intern_substs(&[Kind::from(re_bound1)]);
787 let t_substituted = t_source.subst(env.infcx.tcx, substs);
789 // t_expected = fn(&'a isize)
791 // but not that the Debruijn index is different in the different cases.
793 let t_rptr_bound2 = env.t_rptr_late_bound_with_debruijn(1, ty::DebruijnIndex::new(2));
794 env.t_fn(&[t_rptr_bound2], env.t_nil())
797 debug!("subst_bound: t_source={:?} substs={:?} t_substituted={:?} t_expected={:?}",
803 assert_eq!(t_substituted, t_expected);
809 test_env(EMPTY_SOURCE_STR, errors(&[]), |env| {
810 let tcx = env.infcx.tcx;
811 let int_ty = tcx.types.isize;
812 let uint_ty = tcx.types.usize;
813 let tup1_ty = tcx.intern_tup(&[int_ty, uint_ty, int_ty, uint_ty], false);
814 let tup2_ty = tcx.intern_tup(&[tup1_ty, tup1_ty, uint_ty], false);
815 let walked: Vec<_> = tup2_ty.walk().collect();
817 [tup2_ty, tup1_ty, int_ty, uint_ty, int_ty, uint_ty, tup1_ty, int_ty,
818 uint_ty, int_ty, uint_ty, uint_ty]);
823 fn walk_ty_skip_subtree() {
824 test_env(EMPTY_SOURCE_STR, errors(&[]), |env| {
825 let tcx = env.infcx.tcx;
826 let int_ty = tcx.types.isize;
827 let uint_ty = tcx.types.usize;
828 let tup1_ty = tcx.intern_tup(&[int_ty, uint_ty, int_ty, uint_ty], false);
829 let tup2_ty = tcx.intern_tup(&[tup1_ty, tup1_ty, uint_ty], false);
831 // types we expect to see (in order), plus a boolean saying
832 // whether to skip the subtree.
833 let mut expected = vec![(tup2_ty, false),
839 (tup1_ty, true), // skip the isize/usize/isize/usize
843 let mut walker = tup2_ty.walk();
844 while let Some(t) = walker.next() {
845 debug!("walked to {:?}", t);
846 let (expected_ty, skip) = expected.pop().unwrap();
847 assert_eq!(t, expected_ty);
849 walker.skip_current_subtree();
853 assert!(expected.is_empty());