1 // Copyright 2016 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 use hir::map::definitions::*;
12 use hir::def_id::{CRATE_DEF_INDEX, DefIndex, DefIndexAddressSpace};
13 use session::CrateDisambiguator;
16 use syntax::ext::hygiene::Mark;
18 use syntax::symbol::keywords;
19 use syntax::symbol::Symbol;
20 use syntax::parse::token::{self, Token};
22 use hir::map::{ITEM_LIKE_SPACE, REGULAR_SPACE};
24 /// Creates def ids for nodes in the AST.
25 pub struct DefCollector<'a> {
26 definitions: &'a mut Definitions,
27 parent_def: Option<DefIndex>,
29 pub visit_macro_invoc: Option<&'a mut FnMut(MacroInvocationData)>,
32 pub struct MacroInvocationData {
34 pub def_index: DefIndex,
38 impl<'a> DefCollector<'a> {
39 pub fn new(definitions: &'a mut Definitions, expansion: Mark) -> Self {
44 visit_macro_invoc: None,
48 pub fn collect_root(&mut self,
50 crate_disambiguator: CrateDisambiguator) {
51 let root = self.definitions.create_root_def(crate_name,
53 assert_eq!(root, CRATE_DEF_INDEX);
54 self.parent_def = Some(root);
57 fn create_def(&mut self,
60 address_space: DefIndexAddressSpace)
62 let parent_def = self.parent_def.unwrap();
63 debug!("create_def(node_id={:?}, data={:?}, parent_def={:?})", node_id, data, parent_def);
65 .create_def_with_parent(parent_def, node_id, data, address_space, self.expansion)
68 pub fn with_parent<F: FnOnce(&mut Self)>(&mut self, parent_def: DefIndex, f: F) {
69 let parent = self.parent_def;
70 self.parent_def = Some(parent_def);
72 self.parent_def = parent;
75 pub fn visit_const_expr(&mut self, expr: &Expr) {
77 // Find the node which will be used after lowering.
78 ExprKind::Paren(ref inner) => return self.visit_const_expr(inner),
79 ExprKind::Mac(..) => return self.visit_macro_invoc(expr.id, true),
80 // FIXME(eddyb) Closures should have separate
81 // function definition IDs and expression IDs.
82 ExprKind::Closure(..) => return,
86 self.create_def(expr.id, DefPathData::Initializer, REGULAR_SPACE);
89 fn visit_macro_invoc(&mut self, id: NodeId, const_expr: bool) {
90 if let Some(ref mut visit) = self.visit_macro_invoc {
91 visit(MacroInvocationData {
92 mark: id.placeholder_to_mark(),
94 def_index: self.parent_def.unwrap(),
100 impl<'a> visit::Visitor<'a> for DefCollector<'a> {
101 fn visit_item(&mut self, i: &'a Item) {
102 debug!("visit_item: {:?}", i);
104 // Pick the def data. This need not be unique, but the more
105 // information we encapsulate into
106 let def_data = match i.node {
107 ItemKind::AutoImpl(..) | ItemKind::Impl(..) =>
109 ItemKind::Enum(..) | ItemKind::Struct(..) | ItemKind::Union(..) |
110 ItemKind::Trait(..) | ItemKind::TraitAlias(..) |
111 ItemKind::ExternCrate(..) | ItemKind::ForeignMod(..) | ItemKind::Ty(..) =>
112 DefPathData::TypeNs(i.ident.name.as_str()),
113 ItemKind::Mod(..) if i.ident == keywords::Invalid.ident() => {
114 return visit::walk_item(self, i);
116 ItemKind::Mod(..) => DefPathData::Module(i.ident.name.as_str()),
117 ItemKind::Static(..) | ItemKind::Const(..) | ItemKind::Fn(..) =>
118 DefPathData::ValueNs(i.ident.name.as_str()),
119 ItemKind::MacroDef(..) => DefPathData::MacroDef(i.ident.name.as_str()),
120 ItemKind::Mac(..) => return self.visit_macro_invoc(i.id, false),
121 ItemKind::GlobalAsm(..) => DefPathData::Misc,
122 ItemKind::Use(..) => {
123 return visit::walk_item(self, i);
126 let def = self.create_def(i.id, def_data, ITEM_LIKE_SPACE);
128 self.with_parent(def, |this| {
130 ItemKind::Enum(ref enum_definition, _) => {
131 for v in &enum_definition.variants {
132 let variant_def_index =
133 this.create_def(v.node.data.id(),
134 DefPathData::EnumVariant(v.node.name.name.as_str()),
136 this.with_parent(variant_def_index, |this| {
137 for (index, field) in v.node.data.fields().iter().enumerate() {
138 let name = field.ident.map(|ident| ident.name)
139 .unwrap_or_else(|| Symbol::intern(&index.to_string()));
140 this.create_def(field.id,
141 DefPathData::Field(name.as_str()),
145 if let Some(ref expr) = v.node.disr_expr {
146 this.visit_const_expr(expr);
151 ItemKind::Struct(ref struct_def, _) | ItemKind::Union(ref struct_def, _) => {
152 // If this is a tuple-like struct, register the constructor.
153 if !struct_def.is_struct() {
154 this.create_def(struct_def.id(),
155 DefPathData::StructCtor,
159 for (index, field) in struct_def.fields().iter().enumerate() {
160 let name = field.ident.map(|ident| ident.name)
161 .unwrap_or_else(|| Symbol::intern(&index.to_string()));
162 this.create_def(field.id, DefPathData::Field(name.as_str()), REGULAR_SPACE);
167 visit::walk_item(this, i);
171 fn visit_use_tree(&mut self, use_tree: &'a UseTree, id: NodeId, _nested: bool) {
172 self.create_def(id, DefPathData::Misc, ITEM_LIKE_SPACE);
173 visit::walk_use_tree(self, use_tree, id);
176 fn visit_foreign_item(&mut self, foreign_item: &'a ForeignItem) {
177 let def = self.create_def(foreign_item.id,
178 DefPathData::ValueNs(foreign_item.ident.name.as_str()),
181 self.with_parent(def, |this| {
182 visit::walk_foreign_item(this, foreign_item);
186 fn visit_generic_param(&mut self, param: &'a GenericParam) {
188 GenericParam::Lifetime(ref lifetime_def) => {
190 lifetime_def.lifetime.id,
191 DefPathData::LifetimeDef(lifetime_def.lifetime.ident.name.as_str()),
195 GenericParam::Type(ref ty_param) => {
198 DefPathData::TypeParam(ty_param.ident.name.as_str()),
204 visit::walk_generic_param(self, param);
207 fn visit_trait_item(&mut self, ti: &'a TraitItem) {
208 let def_data = match ti.node {
209 TraitItemKind::Method(..) | TraitItemKind::Const(..) =>
210 DefPathData::ValueNs(ti.ident.name.as_str()),
211 TraitItemKind::Type(..) => DefPathData::TypeNs(ti.ident.name.as_str()),
212 TraitItemKind::Macro(..) => return self.visit_macro_invoc(ti.id, false),
215 let def = self.create_def(ti.id, def_data, ITEM_LIKE_SPACE);
216 self.with_parent(def, |this| {
217 if let TraitItemKind::Const(_, Some(ref expr)) = ti.node {
218 this.visit_const_expr(expr);
221 visit::walk_trait_item(this, ti);
225 fn visit_impl_item(&mut self, ii: &'a ImplItem) {
226 let def_data = match ii.node {
227 ImplItemKind::Method(..) | ImplItemKind::Const(..) =>
228 DefPathData::ValueNs(ii.ident.name.as_str()),
229 ImplItemKind::Type(..) => DefPathData::TypeNs(ii.ident.name.as_str()),
230 ImplItemKind::Macro(..) => return self.visit_macro_invoc(ii.id, false),
233 let def = self.create_def(ii.id, def_data, ITEM_LIKE_SPACE);
234 self.with_parent(def, |this| {
235 if let ImplItemKind::Const(_, ref expr) = ii.node {
236 this.visit_const_expr(expr);
239 visit::walk_impl_item(this, ii);
243 fn visit_pat(&mut self, pat: &'a Pat) {
245 PatKind::Mac(..) => return self.visit_macro_invoc(pat.id, false),
246 _ => visit::walk_pat(self, pat),
250 fn visit_expr(&mut self, expr: &'a Expr) {
251 let parent_def = self.parent_def;
254 ExprKind::Mac(..) => return self.visit_macro_invoc(expr.id, false),
255 ExprKind::Repeat(_, ref count) => self.visit_const_expr(count),
256 ExprKind::Closure(..) => {
257 let def = self.create_def(expr.id,
258 DefPathData::ClosureExpr,
260 self.parent_def = Some(def);
265 visit::walk_expr(self, expr);
266 self.parent_def = parent_def;
269 fn visit_ty(&mut self, ty: &'a Ty) {
271 TyKind::Mac(..) => return self.visit_macro_invoc(ty.id, false),
272 TyKind::Array(_, ref length) => self.visit_const_expr(length),
273 TyKind::ImplTrait(..) => {
274 self.create_def(ty.id, DefPathData::ImplTrait, REGULAR_SPACE);
276 TyKind::Typeof(ref expr) => self.visit_const_expr(expr),
279 visit::walk_ty(self, ty);
282 fn visit_stmt(&mut self, stmt: &'a Stmt) {
284 StmtKind::Mac(..) => self.visit_macro_invoc(stmt.id, false),
285 _ => visit::walk_stmt(self, stmt),
289 fn visit_token(&mut self, t: Token) {
290 if let Token::Interpolated(nt) = t {
292 token::NtExpr(ref expr) => {
293 if let ExprKind::Mac(..) = expr.node {
294 self.visit_macro_invoc(expr.id, false);