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};
15 use syntax::ext::hygiene::Mark;
17 use syntax::symbol::{Symbol, keywords};
19 use hir::map::{ITEM_LIKE_SPACE, REGULAR_SPACE};
21 /// Creates def ids for nodes in the AST.
22 pub struct DefCollector<'a> {
23 definitions: &'a mut Definitions,
24 parent_def: Option<DefIndex>,
25 pub visit_macro_invoc: Option<&'a mut FnMut(MacroInvocationData)>,
28 pub struct MacroInvocationData {
30 pub def_index: DefIndex,
34 impl<'a> DefCollector<'a> {
35 pub fn new(definitions: &'a mut Definitions) -> Self {
37 definitions: definitions,
39 visit_macro_invoc: None,
43 pub fn collect_root(&mut self, crate_name: &str, crate_disambiguator: &str) {
44 let root = self.definitions.create_root_def(crate_name,
46 assert_eq!(root, CRATE_DEF_INDEX);
47 self.parent_def = Some(root);
50 fn create_def(&mut self,
53 address_space: DefIndexAddressSpace)
55 let parent_def = self.parent_def.unwrap();
56 debug!("create_def(node_id={:?}, data={:?}, parent_def={:?})", node_id, data, parent_def);
57 self.definitions.create_def_with_parent(parent_def, node_id, data, address_space)
60 pub fn with_parent<F: FnOnce(&mut Self)>(&mut self, parent_def: DefIndex, f: F) {
61 let parent = self.parent_def;
62 self.parent_def = Some(parent_def);
64 self.parent_def = parent;
67 pub fn visit_const_expr(&mut self, expr: &Expr) {
69 // Find the node which will be used after lowering.
70 ExprKind::Paren(ref inner) => return self.visit_const_expr(inner),
71 ExprKind::Mac(..) => return self.visit_macro_invoc(expr.id, true),
72 // FIXME(eddyb) Closures should have separate
73 // function definition IDs and expression IDs.
74 ExprKind::Closure(..) => return,
78 self.create_def(expr.id, DefPathData::Initializer, REGULAR_SPACE);
81 fn visit_macro_invoc(&mut self, id: NodeId, const_expr: bool) {
82 if let Some(ref mut visit) = self.visit_macro_invoc {
83 visit(MacroInvocationData {
84 mark: id.placeholder_to_mark(),
85 const_expr: const_expr,
86 def_index: self.parent_def.unwrap(),
92 impl<'a> visit::Visitor<'a> for DefCollector<'a> {
93 fn visit_item(&mut self, i: &'a Item) {
94 debug!("visit_item: {:?}", i);
96 // Pick the def data. This need not be unique, but the more
97 // information we encapsulate into
98 let def_data = match i.node {
99 ItemKind::DefaultImpl(..) | ItemKind::Impl(..) =>
101 ItemKind::Enum(..) | ItemKind::Struct(..) | ItemKind::Union(..) | ItemKind::Trait(..) |
102 ItemKind::ExternCrate(..) | ItemKind::ForeignMod(..) | ItemKind::Ty(..) =>
103 DefPathData::TypeNs(i.ident.name.as_str()),
104 ItemKind::Mod(..) if i.ident == keywords::Invalid.ident() => {
105 return visit::walk_item(self, i);
107 ItemKind::Mod(..) => DefPathData::Module(i.ident.name.as_str()),
108 ItemKind::Static(..) | ItemKind::Const(..) | ItemKind::Fn(..) =>
109 DefPathData::ValueNs(i.ident.name.as_str()),
110 ItemKind::MacroDef(..) => DefPathData::MacroDef(i.ident.name.as_str()),
111 ItemKind::Mac(..) => return self.visit_macro_invoc(i.id, false),
112 ItemKind::GlobalAsm(..) => DefPathData::Misc,
113 ItemKind::Use(ref view_path) => {
114 match view_path.node {
115 ViewPathGlob(..) => {}
117 // FIXME(eddyb) Should use the real name. Which namespace?
118 ViewPathSimple(..) => {}
119 ViewPathList(_, ref imports) => {
120 for import in imports {
121 self.create_def(import.node.id,
130 let def = self.create_def(i.id, def_data, ITEM_LIKE_SPACE);
132 self.with_parent(def, |this| {
134 ItemKind::Enum(ref enum_definition, _) => {
135 for v in &enum_definition.variants {
136 let variant_def_index =
137 this.create_def(v.node.data.id(),
138 DefPathData::EnumVariant(v.node.name.name.as_str()),
140 this.with_parent(variant_def_index, |this| {
141 for (index, field) in v.node.data.fields().iter().enumerate() {
142 let name = field.ident.map(|ident| ident.name)
143 .unwrap_or_else(|| Symbol::intern(&index.to_string()));
144 this.create_def(field.id,
145 DefPathData::Field(name.as_str()),
149 if let Some(ref expr) = v.node.disr_expr {
150 this.visit_const_expr(expr);
155 ItemKind::Struct(ref struct_def, _) | ItemKind::Union(ref struct_def, _) => {
156 // If this is a tuple-like struct, register the constructor.
157 if !struct_def.is_struct() {
158 this.create_def(struct_def.id(),
159 DefPathData::StructCtor,
163 for (index, field) in struct_def.fields().iter().enumerate() {
164 let name = field.ident.map(|ident| ident.name.as_str())
165 .unwrap_or(Symbol::intern(&index.to_string()).as_str());
166 this.create_def(field.id, DefPathData::Field(name), REGULAR_SPACE);
171 visit::walk_item(this, i);
175 fn visit_foreign_item(&mut self, foreign_item: &'a ForeignItem) {
176 let def = self.create_def(foreign_item.id,
177 DefPathData::ValueNs(foreign_item.ident.name.as_str()),
180 self.with_parent(def, |this| {
181 visit::walk_foreign_item(this, foreign_item);
185 fn visit_generics(&mut self, generics: &'a Generics) {
186 for ty_param in generics.ty_params.iter() {
187 self.create_def(ty_param.id,
188 DefPathData::TypeParam(ty_param.ident.name.as_str()),
192 visit::walk_generics(self, generics);
195 fn visit_trait_item(&mut self, ti: &'a TraitItem) {
196 let def_data = match ti.node {
197 TraitItemKind::Method(..) | TraitItemKind::Const(..) =>
198 DefPathData::ValueNs(ti.ident.name.as_str()),
199 TraitItemKind::Type(..) => DefPathData::TypeNs(ti.ident.name.as_str()),
200 TraitItemKind::Macro(..) => return self.visit_macro_invoc(ti.id, false),
203 let def = self.create_def(ti.id, def_data, ITEM_LIKE_SPACE);
204 self.with_parent(def, |this| {
205 if let TraitItemKind::Const(_, Some(ref expr)) = ti.node {
206 this.visit_const_expr(expr);
209 visit::walk_trait_item(this, ti);
213 fn visit_impl_item(&mut self, ii: &'a ImplItem) {
214 let def_data = match ii.node {
215 ImplItemKind::Method(..) | ImplItemKind::Const(..) =>
216 DefPathData::ValueNs(ii.ident.name.as_str()),
217 ImplItemKind::Type(..) => DefPathData::TypeNs(ii.ident.name.as_str()),
218 ImplItemKind::Macro(..) => return self.visit_macro_invoc(ii.id, false),
221 let def = self.create_def(ii.id, def_data, ITEM_LIKE_SPACE);
222 self.with_parent(def, |this| {
223 if let ImplItemKind::Const(_, ref expr) = ii.node {
224 this.visit_const_expr(expr);
227 visit::walk_impl_item(this, ii);
231 fn visit_pat(&mut self, pat: &'a Pat) {
232 let parent_def = self.parent_def;
235 PatKind::Mac(..) => return self.visit_macro_invoc(pat.id, false),
236 PatKind::Ident(_, id, _) => {
237 let def = self.create_def(pat.id,
238 DefPathData::Binding(id.node.name.as_str()),
240 self.parent_def = Some(def);
245 visit::walk_pat(self, pat);
246 self.parent_def = parent_def;
249 fn visit_expr(&mut self, expr: &'a Expr) {
250 let parent_def = self.parent_def;
253 ExprKind::Mac(..) => return self.visit_macro_invoc(expr.id, false),
254 ExprKind::Repeat(_, ref count) => self.visit_const_expr(count),
255 ExprKind::Closure(..) => {
256 let def = self.create_def(expr.id,
257 DefPathData::ClosureExpr,
259 self.parent_def = Some(def);
264 visit::walk_expr(self, expr);
265 self.parent_def = parent_def;
268 fn visit_ty(&mut self, ty: &'a Ty) {
270 TyKind::Mac(..) => return self.visit_macro_invoc(ty.id, false),
271 TyKind::Array(_, ref length) => self.visit_const_expr(length),
272 TyKind::ImplTrait(..) => {
273 self.create_def(ty.id, DefPathData::ImplTrait, REGULAR_SPACE);
275 TyKind::Typeof(ref expr) => self.visit_const_expr(expr),
278 visit::walk_ty(self, ty);
281 fn visit_lifetime_def(&mut self, def: &'a LifetimeDef) {
282 self.create_def(def.lifetime.id,
283 DefPathData::LifetimeDef(def.lifetime.name.as_str()),
287 fn visit_stmt(&mut self, stmt: &'a Stmt) {
289 StmtKind::Mac(..) => self.visit_macro_invoc(stmt.id, false),
290 _ => visit::walk_stmt(self, stmt),