// Copyright 2015-2016 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 or the MIT license // , at your // option. This file may not be copied, modified, or distributed // except according to those terms. use super::*; use super::MapEntry::*; use hir::*; use hir::intravisit::Visitor; use hir::def_id::DefId; use middle::cstore::InlinedItem; use std::iter::repeat; use syntax::ast::{NodeId, CRATE_NODE_ID}; use syntax_pos::Span; /// A Visitor that walks over the HIR and collects Nodes into a HIR map pub struct NodeCollector<'ast> { /// The crate pub krate: &'ast Crate, /// The node map pub map: Vec>, /// The parent of this node pub parent_node: NodeId, } impl<'ast> NodeCollector<'ast> { pub fn root(krate: &'ast Crate) -> NodeCollector<'ast> { let mut collector = NodeCollector { krate: krate, map: vec![], parent_node: CRATE_NODE_ID, }; collector.insert_entry(CRATE_NODE_ID, RootCrate); collector } pub fn extend(krate: &'ast Crate, parent: &'ast InlinedItem, parent_node: NodeId, parent_def_path: DefPath, parent_def_id: DefId, map: Vec>) -> NodeCollector<'ast> { let mut collector = NodeCollector { krate: krate, map: map, parent_node: parent_node, }; assert_eq!(parent_def_path.krate, parent_def_id.krate); collector.insert_entry(parent_node, RootInlinedParent(parent)); collector } fn insert_entry(&mut self, id: NodeId, entry: MapEntry<'ast>) { debug!("ast_map: {:?} => {:?}", id, entry); let len = self.map.len(); if id as usize >= len { self.map.extend(repeat(NotPresent).take(id as usize - len + 1)); } self.map[id as usize] = entry; } fn insert(&mut self, id: NodeId, node: Node<'ast>) { let entry = MapEntry::from_node(self.parent_node, node); self.insert_entry(id, entry); } fn with_parent(&mut self, parent_id: NodeId, f: F) { let parent_node = self.parent_node; self.parent_node = parent_id; f(self); self.parent_node = parent_node; } } impl<'ast> Visitor<'ast> for NodeCollector<'ast> { /// Because we want to track parent items and so forth, enable /// deep walking so that we walk nested items in the context of /// their outer items. fn visit_nested_item(&mut self, item: ItemId) { debug!("visit_nested_item: {:?}", item); self.visit_item(self.krate.item(item.id)) } fn visit_item(&mut self, i: &'ast Item) { debug!("visit_item: {:?}", i); self.insert(i.id, NodeItem(i)); self.with_parent(i.id, |this| { match i.node { ItemEnum(ref enum_definition, _) => { for v in &enum_definition.variants { this.insert(v.node.data.id(), NodeVariant(v)); } } ItemStruct(ref struct_def, _) => { // If this is a tuple-like struct, register the constructor. if !struct_def.is_struct() { this.insert(struct_def.id(), NodeStructCtor(struct_def)); } } ItemTrait(.., ref bounds, _) => { for b in bounds.iter() { if let TraitTyParamBound(ref t, TraitBoundModifier::None) = *b { this.insert(t.trait_ref.ref_id, NodeItem(i)); } } } ItemUse(ref view_path) => { match view_path.node { ViewPathList(_, ref paths) => { for path in paths { this.insert(path.node.id, NodeItem(i)); } } _ => () } } _ => {} } intravisit::walk_item(this, i); }); } fn visit_foreign_item(&mut self, foreign_item: &'ast ForeignItem) { self.insert(foreign_item.id, NodeForeignItem(foreign_item)); self.with_parent(foreign_item.id, |this| { intravisit::walk_foreign_item(this, foreign_item); }); } fn visit_generics(&mut self, generics: &'ast Generics) { for ty_param in generics.ty_params.iter() { self.insert(ty_param.id, NodeTyParam(ty_param)); } intravisit::walk_generics(self, generics); } fn visit_trait_item(&mut self, ti: &'ast TraitItem) { self.insert(ti.id, NodeTraitItem(ti)); self.with_parent(ti.id, |this| { intravisit::walk_trait_item(this, ti); }); } fn visit_impl_item(&mut self, ii: &'ast ImplItem) { self.insert(ii.id, NodeImplItem(ii)); self.with_parent(ii.id, |this| { intravisit::walk_impl_item(this, ii); }); } fn visit_pat(&mut self, pat: &'ast Pat) { let node = if let PatKind::Binding(..) = pat.node { NodeLocal(pat) } else { NodePat(pat) }; self.insert(pat.id, node); self.with_parent(pat.id, |this| { intravisit::walk_pat(this, pat); }); } fn visit_expr(&mut self, expr: &'ast Expr) { self.insert(expr.id, NodeExpr(expr)); self.with_parent(expr.id, |this| { intravisit::walk_expr(this, expr); }); } fn visit_stmt(&mut self, stmt: &'ast Stmt) { let id = stmt.node.id(); self.insert(id, NodeStmt(stmt)); self.with_parent(id, |this| { intravisit::walk_stmt(this, stmt); }); } fn visit_ty(&mut self, ty: &'ast Ty) { self.insert(ty.id, NodeTy(ty)); self.with_parent(ty.id, |this| { intravisit::walk_ty(this, ty); }); } fn visit_fn(&mut self, fk: intravisit::FnKind<'ast>, fd: &'ast FnDecl, b: &'ast Block, s: Span, id: NodeId) { assert_eq!(self.parent_node, id); intravisit::walk_fn(self, fk, fd, b, s, id); } fn visit_block(&mut self, block: &'ast Block) { self.insert(block.id, NodeBlock(block)); self.with_parent(block.id, |this| { intravisit::walk_block(this, block); }); } fn visit_lifetime(&mut self, lifetime: &'ast Lifetime) { self.insert(lifetime.id, NodeLifetime(lifetime)); } }