1 // ignore-tidy-filelength
2 use crate::def::{CtorKind, DefKind, Namespace, Res};
3 use crate::def_id::DefId;
4 crate use crate::hir_id::HirId;
5 use crate::{itemlikevisit, LangItem};
7 use rustc_ast::util::parser::ExprPrecedence;
8 use rustc_ast::{self as ast, CrateSugar, LlvmAsmDialect};
9 use rustc_ast::{AttrVec, Attribute, FloatTy, IntTy, Label, LitKind, StrStyle, UintTy};
10 pub use rustc_ast::{BorrowKind, ImplPolarity, IsAuto};
11 pub use rustc_ast::{CaptureBy, Movability, Mutability};
12 use rustc_ast::{InlineAsmOptions, InlineAsmTemplatePiece};
13 use rustc_data_structures::sync::{par_for_each_in, Send, Sync};
14 use rustc_macros::HashStable_Generic;
15 use rustc_span::source_map::{SourceMap, Spanned};
16 use rustc_span::symbol::{kw, sym, Ident, Symbol};
17 use rustc_span::{def_id::LocalDefId, BytePos};
18 use rustc_span::{MultiSpan, Span, DUMMY_SP};
19 use rustc_target::asm::InlineAsmRegOrRegClass;
20 use rustc_target::spec::abi::Abi;
22 use smallvec::SmallVec;
23 use std::collections::{BTreeMap, BTreeSet};
26 #[derive(Copy, Clone, Encodable, HashStable_Generic)]
31 /// Either "`'a`", referring to a named lifetime definition,
32 /// or "``" (i.e., `kw::Empty`), for elision placeholders.
34 /// HIR lowering inserts these placeholders in type paths that
35 /// refer to type definitions needing lifetime parameters,
36 /// `&T` and `&mut T`, and trait objects without `... + 'a`.
37 pub name: LifetimeName,
40 #[derive(Debug, Clone, PartialEq, Eq, Encodable, Hash, Copy)]
41 #[derive(HashStable_Generic)]
43 /// Some user-given name like `T` or `'x`.
46 /// Synthetic name generated when user elided a lifetime in an impl header.
48 /// E.g., the lifetimes in cases like these:
51 /// impl Foo<'_> for u32
53 /// in that case, we rewrite to
55 /// impl<'f> Foo for &'f u32
56 /// impl<'f> Foo<'f> for u32
58 /// where `'f` is something like `Fresh(0)`. The indices are
59 /// unique per impl, but not necessarily continuous.
62 /// Indicates an illegal name was given and an error has been
63 /// reported (so we should squelch other derived errors). Occurs
64 /// when, e.g., `'_` is used in the wrong place.
69 pub fn ident(&self) -> Ident {
71 ParamName::Plain(ident) => ident,
72 ParamName::Fresh(_) | ParamName::Error => {
73 Ident::with_dummy_span(kw::UnderscoreLifetime)
78 pub fn normalize_to_macros_2_0(&self) -> ParamName {
80 ParamName::Plain(ident) => ParamName::Plain(ident.normalize_to_macros_2_0()),
81 param_name => param_name,
86 #[derive(Debug, Clone, PartialEq, Eq, Encodable, Hash, Copy)]
87 #[derive(HashStable_Generic)]
88 pub enum LifetimeName {
89 /// User-given names or fresh (synthetic) names.
92 /// User wrote nothing (e.g., the lifetime in `&u32`).
95 /// Implicit lifetime in a context like `dyn Foo`. This is
96 /// distinguished from implicit lifetimes elsewhere because the
97 /// lifetime that they default to must appear elsewhere within the
98 /// enclosing type. This means that, in an `impl Trait` context, we
99 /// don't have to create a parameter for them. That is, `impl
100 /// Trait<Item = &u32>` expands to an opaque type like `type
101 /// Foo<'a> = impl Trait<Item = &'a u32>`, but `impl Trait<item =
102 /// dyn Bar>` expands to `type Foo = impl Trait<Item = dyn Bar +
103 /// 'static>`. The latter uses `ImplicitObjectLifetimeDefault` so
104 /// that surrounding code knows not to create a lifetime
106 ImplicitObjectLifetimeDefault,
108 /// Indicates an error during lowering (usually `'_` in wrong place)
109 /// that was already reported.
112 /// User wrote specifies `'_`.
115 /// User wrote `'static`.
120 pub fn ident(&self) -> Ident {
122 LifetimeName::ImplicitObjectLifetimeDefault
123 | LifetimeName::Implicit
124 | LifetimeName::Error => Ident::invalid(),
125 LifetimeName::Underscore => Ident::with_dummy_span(kw::UnderscoreLifetime),
126 LifetimeName::Static => Ident::with_dummy_span(kw::StaticLifetime),
127 LifetimeName::Param(param_name) => param_name.ident(),
131 pub fn is_elided(&self) -> bool {
133 LifetimeName::ImplicitObjectLifetimeDefault
134 | LifetimeName::Implicit
135 | LifetimeName::Underscore => true,
137 // It might seem surprising that `Fresh(_)` counts as
138 // *not* elided -- but this is because, as far as the code
139 // in the compiler is concerned -- `Fresh(_)` variants act
140 // equivalently to "some fresh name". They correspond to
141 // early-bound regions on an impl, in other words.
142 LifetimeName::Error | LifetimeName::Param(_) | LifetimeName::Static => false,
146 fn is_static(&self) -> bool {
147 self == &LifetimeName::Static
150 pub fn normalize_to_macros_2_0(&self) -> LifetimeName {
152 LifetimeName::Param(param_name) => {
153 LifetimeName::Param(param_name.normalize_to_macros_2_0())
155 lifetime_name => lifetime_name,
160 impl fmt::Display for Lifetime {
161 fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
162 self.name.ident().fmt(f)
166 impl fmt::Debug for Lifetime {
167 fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
168 write!(f, "lifetime({}: {})", self.hir_id, self.name.ident())
173 pub fn is_elided(&self) -> bool {
174 self.name.is_elided()
177 pub fn is_static(&self) -> bool {
178 self.name.is_static()
182 /// A `Path` is essentially Rust's notion of a name; for instance,
183 /// `std::cmp::PartialEq`. It's represented as a sequence of identifiers,
184 /// along with a bunch of supporting information.
185 #[derive(Debug, HashStable_Generic)]
186 pub struct Path<'hir> {
188 /// The resolution for the path.
190 /// The segments in the path: the things separated by `::`.
191 pub segments: &'hir [PathSegment<'hir>],
195 pub fn is_global(&self) -> bool {
196 !self.segments.is_empty() && self.segments[0].ident.name == kw::PathRoot
200 /// A segment of a path: an identifier, an optional lifetime, and a set of
202 #[derive(Debug, HashStable_Generic)]
203 pub struct PathSegment<'hir> {
204 /// The identifier portion of this path segment.
205 #[stable_hasher(project(name))]
207 // `id` and `res` are optional. We currently only use these in save-analysis,
208 // any path segments without these will not have save-analysis info and
209 // therefore will not have 'jump to def' in IDEs, but otherwise will not be
210 // affected. (In general, we don't bother to get the defs for synthesized
211 // segments, only for segments which have come from the AST).
212 pub hir_id: Option<HirId>,
213 pub res: Option<Res>,
215 /// Type/lifetime parameters attached to this path. They come in
216 /// two flavors: `Path<A,B,C>` and `Path(A,B) -> C`. Note that
217 /// this is more than just simple syntactic sugar; the use of
218 /// parens affects the region binding rules, so we preserve the
220 pub args: Option<&'hir GenericArgs<'hir>>,
222 /// Whether to infer remaining type parameters, if any.
223 /// This only applies to expression and pattern paths, and
224 /// out of those only the segments with no type parameters
225 /// to begin with, e.g., `Vec::new` is `<Vec<..>>::new::<..>`.
226 pub infer_args: bool,
229 impl<'hir> PathSegment<'hir> {
230 /// Converts an identifier to the corresponding segment.
231 pub fn from_ident(ident: Ident) -> PathSegment<'hir> {
232 PathSegment { ident, hir_id: None, res: None, infer_args: true, args: None }
235 pub fn invalid() -> Self {
236 Self::from_ident(Ident::invalid())
239 pub fn args(&self) -> &GenericArgs<'hir> {
240 if let Some(ref args) = self.args {
243 const DUMMY: &GenericArgs<'_> = &GenericArgs::none();
249 #[derive(Encodable, Debug, HashStable_Generic)]
250 pub struct ConstArg {
251 pub value: AnonConst,
255 #[derive(Debug, HashStable_Generic)]
256 pub enum GenericArg<'hir> {
262 impl GenericArg<'_> {
263 pub fn span(&self) -> Span {
265 GenericArg::Lifetime(l) => l.span,
266 GenericArg::Type(t) => t.span,
267 GenericArg::Const(c) => c.span,
271 pub fn id(&self) -> HirId {
273 GenericArg::Lifetime(l) => l.hir_id,
274 GenericArg::Type(t) => t.hir_id,
275 GenericArg::Const(c) => c.value.hir_id,
279 pub fn is_const(&self) -> bool {
280 matches!(self, GenericArg::Const(_))
283 pub fn is_synthetic(&self) -> bool {
284 matches!(self, GenericArg::Lifetime(lifetime) if lifetime.name.ident() == Ident::invalid())
287 pub fn descr(&self) -> &'static str {
289 GenericArg::Lifetime(_) => "lifetime",
290 GenericArg::Type(_) => "type",
291 GenericArg::Const(_) => "constant",
295 pub fn to_ord(&self, feats: &rustc_feature::Features) -> ast::ParamKindOrd {
297 GenericArg::Lifetime(_) => ast::ParamKindOrd::Lifetime,
298 GenericArg::Type(_) => ast::ParamKindOrd::Type,
299 GenericArg::Const(_) => ast::ParamKindOrd::Const { unordered: feats.const_generics },
304 #[derive(Debug, HashStable_Generic)]
305 pub struct GenericArgs<'hir> {
306 /// The generic arguments for this path segment.
307 pub args: &'hir [GenericArg<'hir>],
308 /// Bindings (equality constraints) on associated types, if present.
309 /// E.g., `Foo<A = Bar>`.
310 pub bindings: &'hir [TypeBinding<'hir>],
311 /// Were arguments written in parenthesized form `Fn(T) -> U`?
312 /// This is required mostly for pretty-printing and diagnostics,
313 /// but also for changing lifetime elision rules to be "function-like".
314 pub parenthesized: bool,
317 impl GenericArgs<'_> {
318 pub const fn none() -> Self {
319 Self { args: &[], bindings: &[], parenthesized: false }
322 pub fn inputs(&self) -> &[Ty<'_>] {
323 if self.parenthesized {
324 for arg in self.args {
326 GenericArg::Lifetime(_) => {}
327 GenericArg::Type(ref ty) => {
328 if let TyKind::Tup(ref tys) = ty.kind {
333 GenericArg::Const(_) => {}
337 panic!("GenericArgs::inputs: not a `Fn(T) -> U`");
340 pub fn own_counts(&self) -> GenericParamCount {
341 // We could cache this as a property of `GenericParamCount`, but
342 // the aim is to refactor this away entirely eventually and the
343 // presence of this method will be a constant reminder.
344 let mut own_counts: GenericParamCount = Default::default();
346 for arg in self.args {
348 GenericArg::Lifetime(_) => own_counts.lifetimes += 1,
349 GenericArg::Type(_) => own_counts.types += 1,
350 GenericArg::Const(_) => own_counts.consts += 1,
357 pub fn span(&self) -> Option<Span> {
360 .filter(|arg| !arg.is_synthetic())
361 .map(|arg| arg.span())
362 .reduce(|span1, span2| span1.to(span2))
365 /// Returns span encompassing arguments and their surrounding `<>` or `()`
366 pub fn span_ext(&self, sm: &SourceMap) -> Option<Span> {
367 let mut span = self.span()?;
369 let (o, c) = if self.parenthesized { ('(', ')') } else { ('<', '>') };
371 if let Ok(snippet) = sm.span_to_snippet(span) {
372 let snippet = snippet.as_bytes();
374 if snippet[0] != (o as u8) || snippet[snippet.len() - 1] != (c as u8) {
375 span = sm.span_extend_to_prev_char(span, o, true);
376 span = span.with_lo(span.lo() - BytePos(1));
378 span = sm.span_extend_to_next_char(span, c, true);
379 span = span.with_hi(span.hi() + BytePos(1));
386 pub fn is_empty(&self) -> bool {
391 /// A modifier on a bound, currently this is only used for `?Sized`, where the
392 /// modifier is `Maybe`. Negative bounds should also be handled here.
393 #[derive(Copy, Clone, PartialEq, Eq, Encodable, Hash, Debug)]
394 #[derive(HashStable_Generic)]
395 pub enum TraitBoundModifier {
401 /// The AST represents all type param bounds as types.
402 /// `typeck::collect::compute_bounds` matches these against
403 /// the "special" built-in traits (see `middle::lang_items`) and
404 /// detects `Copy`, `Send` and `Sync`.
405 #[derive(Debug, HashStable_Generic)]
406 pub enum GenericBound<'hir> {
407 Trait(PolyTraitRef<'hir>, TraitBoundModifier),
408 // FIXME(davidtwco): Introduce `PolyTraitRef::LangItem`
409 LangItemTrait(LangItem, Span, HirId, &'hir GenericArgs<'hir>),
413 impl GenericBound<'_> {
414 pub fn trait_ref(&self) -> Option<&TraitRef<'_>> {
416 GenericBound::Trait(data, _) => Some(&data.trait_ref),
421 pub fn span(&self) -> Span {
423 GenericBound::Trait(t, ..) => t.span,
424 GenericBound::LangItemTrait(_, span, ..) => *span,
425 GenericBound::Outlives(l) => l.span,
430 pub type GenericBounds<'hir> = &'hir [GenericBound<'hir>];
432 #[derive(Copy, Clone, PartialEq, Eq, Encodable, Debug, HashStable_Generic)]
433 pub enum LifetimeParamKind {
434 // Indicates that the lifetime definition was explicitly declared (e.g., in
435 // `fn foo<'a>(x: &'a u8) -> &'a u8 { x }`).
438 // Indicates that the lifetime definition was synthetically added
439 // as a result of an in-band lifetime usage (e.g., in
440 // `fn foo(x: &'a u8) -> &'a u8 { x }`).
443 // Indication that the lifetime was elided (e.g., in both cases in
444 // `fn foo(x: &u8) -> &'_ u8 { x }`).
447 // Indication that the lifetime name was somehow in error.
451 #[derive(Debug, HashStable_Generic)]
452 pub enum GenericParamKind<'hir> {
453 /// A lifetime definition (e.g., `'a: 'b + 'c + 'd`).
455 kind: LifetimeParamKind,
458 default: Option<&'hir Ty<'hir>>,
459 synthetic: Option<SyntheticTyParamKind>,
463 /// Optional default value for the const generic param
464 default: Option<AnonConst>,
468 #[derive(Debug, HashStable_Generic)]
469 pub struct GenericParam<'hir> {
472 pub attrs: &'hir [Attribute],
473 pub bounds: GenericBounds<'hir>,
475 pub pure_wrt_drop: bool,
476 pub kind: GenericParamKind<'hir>,
479 impl GenericParam<'hir> {
480 pub fn bounds_span(&self) -> Option<Span> {
481 self.bounds.iter().fold(None, |span, bound| {
482 let span = span.map(|s| s.to(bound.span())).unwrap_or_else(|| bound.span());
490 pub struct GenericParamCount {
491 pub lifetimes: usize,
496 /// Represents lifetimes and type parameters attached to a declaration
497 /// of a function, enum, trait, etc.
498 #[derive(Debug, HashStable_Generic)]
499 pub struct Generics<'hir> {
500 pub params: &'hir [GenericParam<'hir>],
501 pub where_clause: WhereClause<'hir>,
505 impl Generics<'hir> {
506 pub const fn empty() -> Generics<'hir> {
509 where_clause: WhereClause { predicates: &[], span: DUMMY_SP },
514 pub fn get_named(&self, name: Symbol) -> Option<&GenericParam<'_>> {
515 for param in self.params {
516 if name == param.name.ident().name {
523 pub fn spans(&self) -> MultiSpan {
524 if self.params.is_empty() {
527 self.params.iter().map(|p| p.span).collect::<Vec<Span>>().into()
532 /// Synthetic type parameters are converted to another form during lowering; this allows
533 /// us to track the original form they had, and is useful for error messages.
534 #[derive(Copy, Clone, PartialEq, Eq, Encodable, Decodable, Hash, Debug)]
535 #[derive(HashStable_Generic)]
536 pub enum SyntheticTyParamKind {
538 // Created by the `#[rustc_synthetic]` attribute.
542 /// A where-clause in a definition.
543 #[derive(Debug, HashStable_Generic)]
544 pub struct WhereClause<'hir> {
545 pub predicates: &'hir [WherePredicate<'hir>],
546 // Only valid if predicates aren't empty.
550 impl WhereClause<'_> {
551 pub fn span(&self) -> Option<Span> {
552 if self.predicates.is_empty() { None } else { Some(self.span) }
555 /// The `WhereClause` under normal circumstances points at either the predicates or the empty
556 /// space where the `where` clause should be. Only of use for diagnostic suggestions.
557 pub fn span_for_predicates_or_empty_place(&self) -> Span {
561 /// `Span` where further predicates would be suggested, accounting for trailing commas, like
562 /// in `fn foo<T>(t: T) where T: Foo,` so we don't suggest two trailing commas.
563 pub fn tail_span_for_suggestion(&self) -> Span {
564 let end = self.span_for_predicates_or_empty_place().shrink_to_hi();
565 self.predicates.last().map_or(end, |p| p.span()).shrink_to_hi().to(end)
569 /// A single predicate in a where-clause.
570 #[derive(Debug, HashStable_Generic)]
571 pub enum WherePredicate<'hir> {
572 /// A type binding (e.g., `for<'c> Foo: Send + Clone + 'c`).
573 BoundPredicate(WhereBoundPredicate<'hir>),
574 /// A lifetime predicate (e.g., `'a: 'b + 'c`).
575 RegionPredicate(WhereRegionPredicate<'hir>),
576 /// An equality predicate (unsupported).
577 EqPredicate(WhereEqPredicate<'hir>),
580 impl WherePredicate<'_> {
581 pub fn span(&self) -> Span {
583 WherePredicate::BoundPredicate(p) => p.span,
584 WherePredicate::RegionPredicate(p) => p.span,
585 WherePredicate::EqPredicate(p) => p.span,
590 /// A type bound (e.g., `for<'c> Foo: Send + Clone + 'c`).
591 #[derive(Debug, HashStable_Generic)]
592 pub struct WhereBoundPredicate<'hir> {
594 /// Any generics from a `for` binding.
595 pub bound_generic_params: &'hir [GenericParam<'hir>],
596 /// The type being bounded.
597 pub bounded_ty: &'hir Ty<'hir>,
598 /// Trait and lifetime bounds (e.g., `Clone + Send + 'static`).
599 pub bounds: GenericBounds<'hir>,
602 /// A lifetime predicate (e.g., `'a: 'b + 'c`).
603 #[derive(Debug, HashStable_Generic)]
604 pub struct WhereRegionPredicate<'hir> {
606 pub lifetime: Lifetime,
607 pub bounds: GenericBounds<'hir>,
610 /// An equality predicate (e.g., `T = int`); currently unsupported.
611 #[derive(Debug, HashStable_Generic)]
612 pub struct WhereEqPredicate<'hir> {
615 pub lhs_ty: &'hir Ty<'hir>,
616 pub rhs_ty: &'hir Ty<'hir>,
619 #[derive(Default, Encodable, Debug, HashStable_Generic)]
620 pub struct ModuleItems {
621 // Use BTreeSets here so items are in the same order as in the
622 // list of all items in Crate
623 pub items: BTreeSet<ItemId>,
624 pub trait_items: BTreeSet<TraitItemId>,
625 pub impl_items: BTreeSet<ImplItemId>,
626 pub foreign_items: BTreeSet<ForeignItemId>,
629 /// A type representing only the top-level module.
630 #[derive(Encodable, Debug, HashStable_Generic)]
631 pub struct CrateItem<'hir> {
632 pub module: Mod<'hir>,
633 pub attrs: &'hir [Attribute],
637 /// The top-level data structure that stores the entire contents of
638 /// the crate currently being compiled.
640 /// For more details, see the [rustc dev guide].
642 /// [rustc dev guide]: https://rustc-dev-guide.rust-lang.org/hir.html
644 pub struct Crate<'hir> {
645 pub item: CrateItem<'hir>,
646 pub exported_macros: &'hir [MacroDef<'hir>],
647 // Attributes from non-exported macros, kept only for collecting the library feature list.
648 pub non_exported_macro_attrs: &'hir [Attribute],
650 // N.B., we use a `BTreeMap` here so that `visit_all_items` iterates
651 // over the ids in increasing order. In principle it should not
652 // matter what order we visit things in, but in *practice* it
653 // does, because it can affect the order in which errors are
654 // detected, which in turn can make UI tests yield
655 // slightly different results.
656 pub items: BTreeMap<ItemId, Item<'hir>>,
658 pub trait_items: BTreeMap<TraitItemId, TraitItem<'hir>>,
659 pub impl_items: BTreeMap<ImplItemId, ImplItem<'hir>>,
660 pub foreign_items: BTreeMap<ForeignItemId, ForeignItem<'hir>>,
661 pub bodies: BTreeMap<BodyId, Body<'hir>>,
662 pub trait_impls: BTreeMap<DefId, Vec<LocalDefId>>,
664 /// A list of the body ids written out in the order in which they
665 /// appear in the crate. If you're going to process all the bodies
666 /// in the crate, you should iterate over this list rather than the keys
668 pub body_ids: Vec<BodyId>,
670 /// A list of modules written out in the order in which they
671 /// appear in the crate. This includes the main crate module.
672 pub modules: BTreeMap<LocalDefId, ModuleItems>,
673 /// A list of proc macro HirIds, written out in the order in which
674 /// they are declared in the static array generated by proc_macro_harness.
675 pub proc_macros: Vec<HirId>,
677 pub trait_map: BTreeMap<HirId, Vec<TraitCandidate>>,
681 pub fn item(&self, id: ItemId) -> &Item<'hir> {
685 pub fn trait_item(&self, id: TraitItemId) -> &TraitItem<'hir> {
686 &self.trait_items[&id]
689 pub fn impl_item(&self, id: ImplItemId) -> &ImplItem<'hir> {
690 &self.impl_items[&id]
693 pub fn foreign_item(&self, id: ForeignItemId) -> &ForeignItem<'hir> {
694 &self.foreign_items[&id]
697 pub fn body(&self, id: BodyId) -> &Body<'hir> {
703 /// Visits all items in the crate in some deterministic (but
704 /// unspecified) order. If you just need to process every item,
705 /// but don't care about nesting, this method is the best choice.
707 /// If you do care about nesting -- usually because your algorithm
708 /// follows lexical scoping rules -- then you want a different
709 /// approach. You should override `visit_nested_item` in your
710 /// visitor and then call `intravisit::walk_crate` instead.
711 pub fn visit_all_item_likes<'hir, V>(&'hir self, visitor: &mut V)
713 V: itemlikevisit::ItemLikeVisitor<'hir>,
715 for item in self.items.values() {
716 visitor.visit_item(item);
719 for trait_item in self.trait_items.values() {
720 visitor.visit_trait_item(trait_item);
723 for impl_item in self.impl_items.values() {
724 visitor.visit_impl_item(impl_item);
727 for foreign_item in self.foreign_items.values() {
728 visitor.visit_foreign_item(foreign_item);
732 /// A parallel version of `visit_all_item_likes`.
733 pub fn par_visit_all_item_likes<'hir, V>(&'hir self, visitor: &V)
735 V: itemlikevisit::ParItemLikeVisitor<'hir> + Sync + Send,
739 par_for_each_in(&self.items, |(_, item)| {
740 visitor.visit_item(item);
744 par_for_each_in(&self.trait_items, |(_, trait_item)| {
745 visitor.visit_trait_item(trait_item);
749 par_for_each_in(&self.impl_items, |(_, impl_item)| {
750 visitor.visit_impl_item(impl_item);
754 par_for_each_in(&self.foreign_items, |(_, foreign_item)| {
755 visitor.visit_foreign_item(foreign_item);
762 /// A macro definition, in this crate or imported from another.
764 /// Not parsed directly, but created on macro import or `macro_rules!` expansion.
766 pub struct MacroDef<'hir> {
768 pub vis: Visibility<'hir>,
769 pub attrs: &'hir [Attribute],
770 pub def_id: LocalDefId,
772 pub ast: ast::MacroDef,
777 pub fn hir_id(&self) -> HirId {
778 HirId::make_owner(self.def_id)
782 /// A block of statements `{ .. }`, which may have a label (in this case the
783 /// `targeted_by_break` field will be `true`) and may be `unsafe` by means of
784 /// the `rules` being anything but `DefaultBlock`.
785 #[derive(Debug, HashStable_Generic)]
786 pub struct Block<'hir> {
787 /// Statements in a block.
788 pub stmts: &'hir [Stmt<'hir>],
789 /// An expression at the end of the block
790 /// without a semicolon, if any.
791 pub expr: Option<&'hir Expr<'hir>>,
792 #[stable_hasher(ignore)]
794 /// Distinguishes between `unsafe { ... }` and `{ ... }`.
795 pub rules: BlockCheckMode,
797 /// If true, then there may exist `break 'a` values that aim to
798 /// break out of this block early.
799 /// Used by `'label: {}` blocks and by `try {}` blocks.
800 pub targeted_by_break: bool,
803 #[derive(Debug, HashStable_Generic)]
804 pub struct Pat<'hir> {
805 #[stable_hasher(ignore)]
807 pub kind: PatKind<'hir>,
809 // Whether to use default binding modes.
810 // At present, this is false only for destructuring assignment.
811 pub default_binding_modes: bool,
814 impl<'hir> Pat<'hir> {
815 // FIXME(#19596) this is a workaround, but there should be a better way
816 fn walk_short_(&self, it: &mut impl FnMut(&Pat<'hir>) -> bool) -> bool {
823 Wild | Lit(_) | Range(..) | Binding(.., None) | Path(_) => true,
824 Box(s) | Ref(s, _) | Binding(.., Some(s)) => s.walk_short_(it),
825 Struct(_, fields, _) => fields.iter().all(|field| field.pat.walk_short_(it)),
826 TupleStruct(_, s, _) | Tuple(s, _) | Or(s) => s.iter().all(|p| p.walk_short_(it)),
827 Slice(before, slice, after) => {
828 before.iter().chain(slice.iter()).chain(after.iter()).all(|p| p.walk_short_(it))
833 /// Walk the pattern in left-to-right order,
834 /// short circuiting (with `.all(..)`) if `false` is returned.
836 /// Note that when visiting e.g. `Tuple(ps)`,
837 /// if visiting `ps[0]` returns `false`,
838 /// then `ps[1]` will not be visited.
839 pub fn walk_short(&self, mut it: impl FnMut(&Pat<'hir>) -> bool) -> bool {
840 self.walk_short_(&mut it)
843 // FIXME(#19596) this is a workaround, but there should be a better way
844 fn walk_(&self, it: &mut impl FnMut(&Pat<'hir>) -> bool) {
851 Wild | Lit(_) | Range(..) | Binding(.., None) | Path(_) => {}
852 Box(s) | Ref(s, _) | Binding(.., Some(s)) => s.walk_(it),
853 Struct(_, fields, _) => fields.iter().for_each(|field| field.pat.walk_(it)),
854 TupleStruct(_, s, _) | Tuple(s, _) | Or(s) => s.iter().for_each(|p| p.walk_(it)),
855 Slice(before, slice, after) => {
856 before.iter().chain(slice.iter()).chain(after.iter()).for_each(|p| p.walk_(it))
861 /// Walk the pattern in left-to-right order.
863 /// If `it(pat)` returns `false`, the children are not visited.
864 pub fn walk(&self, mut it: impl FnMut(&Pat<'hir>) -> bool) {
868 /// Walk the pattern in left-to-right order.
870 /// If you always want to recurse, prefer this method over `walk`.
871 pub fn walk_always(&self, mut it: impl FnMut(&Pat<'_>)) {
879 /// A single field in a struct pattern.
881 /// Patterns like the fields of Foo `{ x, ref y, ref mut z }`
882 /// are treated the same as` x: x, y: ref y, z: ref mut z`,
883 /// except `is_shorthand` is true.
884 #[derive(Debug, HashStable_Generic)]
885 pub struct FieldPat<'hir> {
886 #[stable_hasher(ignore)]
888 /// The identifier for the field.
889 #[stable_hasher(project(name))]
891 /// The pattern the field is destructured to.
892 pub pat: &'hir Pat<'hir>,
893 pub is_shorthand: bool,
897 /// Explicit binding annotations given in the HIR for a binding. Note
898 /// that this is not the final binding *mode* that we infer after type
900 #[derive(Copy, Clone, PartialEq, Encodable, Debug, HashStable_Generic)]
901 pub enum BindingAnnotation {
902 /// No binding annotation given: this means that the final binding mode
903 /// will depend on whether we have skipped through a `&` reference
904 /// when matching. For example, the `x` in `Some(x)` will have binding
905 /// mode `None`; if you do `let Some(x) = &Some(22)`, it will
906 /// ultimately be inferred to be by-reference.
908 /// Note that implicit reference skipping is not implemented yet (#42640).
911 /// Annotated with `mut x` -- could be either ref or not, similar to `None`.
914 /// Annotated as `ref`, like `ref x`
917 /// Annotated as `ref mut x`.
921 #[derive(Copy, Clone, PartialEq, Encodable, Debug, HashStable_Generic)]
927 impl fmt::Display for RangeEnd {
928 fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
929 f.write_str(match self {
930 RangeEnd::Included => "..=",
931 RangeEnd::Excluded => "..",
936 #[derive(Debug, HashStable_Generic)]
937 pub enum PatKind<'hir> {
938 /// Represents a wildcard pattern (i.e., `_`).
941 /// A fresh binding `ref mut binding @ OPT_SUBPATTERN`.
942 /// The `HirId` is the canonical ID for the variable being bound,
943 /// (e.g., in `Ok(x) | Err(x)`, both `x` use the same canonical ID),
944 /// which is the pattern ID of the first `x`.
945 Binding(BindingAnnotation, HirId, Ident, Option<&'hir Pat<'hir>>),
947 /// A struct or struct variant pattern (e.g., `Variant {x, y, ..}`).
948 /// The `bool` is `true` in the presence of a `..`.
949 Struct(QPath<'hir>, &'hir [FieldPat<'hir>], bool),
951 /// A tuple struct/variant pattern `Variant(x, y, .., z)`.
952 /// If the `..` pattern fragment is present, then `Option<usize>` denotes its position.
953 /// `0 <= position <= subpats.len()`
954 TupleStruct(QPath<'hir>, &'hir [&'hir Pat<'hir>], Option<usize>),
956 /// An or-pattern `A | B | C`.
957 /// Invariant: `pats.len() >= 2`.
958 Or(&'hir [&'hir Pat<'hir>]),
960 /// A path pattern for an unit struct/variant or a (maybe-associated) constant.
963 /// A tuple pattern (e.g., `(a, b)`).
964 /// If the `..` pattern fragment is present, then `Option<usize>` denotes its position.
965 /// `0 <= position <= subpats.len()`
966 Tuple(&'hir [&'hir Pat<'hir>], Option<usize>),
969 Box(&'hir Pat<'hir>),
971 /// A reference pattern (e.g., `&mut (a, b)`).
972 Ref(&'hir Pat<'hir>, Mutability),
975 Lit(&'hir Expr<'hir>),
977 /// A range pattern (e.g., `1..=2` or `1..2`).
978 Range(Option<&'hir Expr<'hir>>, Option<&'hir Expr<'hir>>, RangeEnd),
980 /// A slice pattern, `[before_0, ..., before_n, (slice, after_0, ..., after_n)?]`.
982 /// Here, `slice` is lowered from the syntax `($binding_mode $ident @)? ..`.
983 /// If `slice` exists, then `after` can be non-empty.
985 /// The representation for e.g., `[a, b, .., c, d]` is:
987 /// PatKind::Slice([Binding(a), Binding(b)], Some(Wild), [Binding(c), Binding(d)])
989 Slice(&'hir [&'hir Pat<'hir>], Option<&'hir Pat<'hir>>, &'hir [&'hir Pat<'hir>]),
992 #[derive(Copy, Clone, PartialEq, Encodable, Debug, HashStable_Generic)]
994 /// The `+` operator (addition).
996 /// The `-` operator (subtraction).
998 /// The `*` operator (multiplication).
1000 /// The `/` operator (division).
1002 /// The `%` operator (modulus).
1004 /// The `&&` operator (logical and).
1006 /// The `||` operator (logical or).
1008 /// The `^` operator (bitwise xor).
1010 /// The `&` operator (bitwise and).
1012 /// The `|` operator (bitwise or).
1014 /// The `<<` operator (shift left).
1016 /// The `>>` operator (shift right).
1018 /// The `==` operator (equality).
1020 /// The `<` operator (less than).
1022 /// The `<=` operator (less than or equal to).
1024 /// The `!=` operator (not equal to).
1026 /// The `>=` operator (greater than or equal to).
1028 /// The `>` operator (greater than).
1033 pub fn as_str(self) -> &'static str {
1035 BinOpKind::Add => "+",
1036 BinOpKind::Sub => "-",
1037 BinOpKind::Mul => "*",
1038 BinOpKind::Div => "/",
1039 BinOpKind::Rem => "%",
1040 BinOpKind::And => "&&",
1041 BinOpKind::Or => "||",
1042 BinOpKind::BitXor => "^",
1043 BinOpKind::BitAnd => "&",
1044 BinOpKind::BitOr => "|",
1045 BinOpKind::Shl => "<<",
1046 BinOpKind::Shr => ">>",
1047 BinOpKind::Eq => "==",
1048 BinOpKind::Lt => "<",
1049 BinOpKind::Le => "<=",
1050 BinOpKind::Ne => "!=",
1051 BinOpKind::Ge => ">=",
1052 BinOpKind::Gt => ">",
1056 pub fn is_lazy(self) -> bool {
1057 matches!(self, BinOpKind::And | BinOpKind::Or)
1060 pub fn is_shift(self) -> bool {
1061 matches!(self, BinOpKind::Shl | BinOpKind::Shr)
1064 pub fn is_comparison(self) -> bool {
1071 | BinOpKind::Ge => true,
1083 | BinOpKind::Shr => false,
1087 /// Returns `true` if the binary operator takes its arguments by value.
1088 pub fn is_by_value(self) -> bool {
1089 !self.is_comparison()
1093 impl Into<ast::BinOpKind> for BinOpKind {
1094 fn into(self) -> ast::BinOpKind {
1096 BinOpKind::Add => ast::BinOpKind::Add,
1097 BinOpKind::Sub => ast::BinOpKind::Sub,
1098 BinOpKind::Mul => ast::BinOpKind::Mul,
1099 BinOpKind::Div => ast::BinOpKind::Div,
1100 BinOpKind::Rem => ast::BinOpKind::Rem,
1101 BinOpKind::And => ast::BinOpKind::And,
1102 BinOpKind::Or => ast::BinOpKind::Or,
1103 BinOpKind::BitXor => ast::BinOpKind::BitXor,
1104 BinOpKind::BitAnd => ast::BinOpKind::BitAnd,
1105 BinOpKind::BitOr => ast::BinOpKind::BitOr,
1106 BinOpKind::Shl => ast::BinOpKind::Shl,
1107 BinOpKind::Shr => ast::BinOpKind::Shr,
1108 BinOpKind::Eq => ast::BinOpKind::Eq,
1109 BinOpKind::Lt => ast::BinOpKind::Lt,
1110 BinOpKind::Le => ast::BinOpKind::Le,
1111 BinOpKind::Ne => ast::BinOpKind::Ne,
1112 BinOpKind::Ge => ast::BinOpKind::Ge,
1113 BinOpKind::Gt => ast::BinOpKind::Gt,
1118 pub type BinOp = Spanned<BinOpKind>;
1120 #[derive(Copy, Clone, PartialEq, Encodable, Debug, HashStable_Generic)]
1122 /// The `*` operator (deferencing).
1124 /// The `!` operator (logical negation).
1126 /// The `-` operator (negation).
1131 pub fn as_str(self) -> &'static str {
1139 /// Returns `true` if the unary operator takes its argument by value.
1140 pub fn is_by_value(self) -> bool {
1141 matches!(self, Self::Neg | Self::Not)
1146 #[derive(Debug, HashStable_Generic)]
1147 pub struct Stmt<'hir> {
1149 pub kind: StmtKind<'hir>,
1153 /// The contents of a statement.
1154 #[derive(Debug, HashStable_Generic)]
1155 pub enum StmtKind<'hir> {
1156 /// A local (`let`) binding.
1157 Local(&'hir Local<'hir>),
1159 /// An item binding.
1162 /// An expression without a trailing semi-colon (must have unit type).
1163 Expr(&'hir Expr<'hir>),
1165 /// An expression with a trailing semi-colon (may have any type).
1166 Semi(&'hir Expr<'hir>),
1169 impl<'hir> StmtKind<'hir> {
1170 pub fn attrs(&self, get_item: impl FnOnce(ItemId) -> &'hir Item<'hir>) -> &'hir [Attribute] {
1172 StmtKind::Local(ref l) => &l.attrs,
1173 StmtKind::Item(ref item_id) => &get_item(*item_id).attrs,
1174 StmtKind::Expr(ref e) | StmtKind::Semi(ref e) => &e.attrs,
1179 /// Represents a `let` statement (i.e., `let <pat>:<ty> = <expr>;`).
1180 #[derive(Debug, HashStable_Generic)]
1181 pub struct Local<'hir> {
1182 pub pat: &'hir Pat<'hir>,
1183 /// Type annotation, if any (otherwise the type will be inferred).
1184 pub ty: Option<&'hir Ty<'hir>>,
1185 /// Initializer expression to set the value, if any.
1186 pub init: Option<&'hir Expr<'hir>>,
1190 /// Can be `ForLoopDesugar` if the `let` statement is part of a `for` loop
1191 /// desugaring. Otherwise will be `Normal`.
1192 pub source: LocalSource,
1195 /// Represents a single arm of a `match` expression, e.g.
1196 /// `<pat> (if <guard>) => <body>`.
1197 #[derive(Debug, HashStable_Generic)]
1198 pub struct Arm<'hir> {
1199 #[stable_hasher(ignore)]
1202 pub attrs: &'hir [Attribute],
1203 /// If this pattern and the optional guard matches, then `body` is evaluated.
1204 pub pat: &'hir Pat<'hir>,
1205 /// Optional guard clause.
1206 pub guard: Option<Guard<'hir>>,
1207 /// The expression the arm evaluates to if this arm matches.
1208 pub body: &'hir Expr<'hir>,
1211 #[derive(Debug, HashStable_Generic)]
1212 pub enum Guard<'hir> {
1213 If(&'hir Expr<'hir>),
1214 IfLet(&'hir Pat<'hir>, &'hir Expr<'hir>),
1217 #[derive(Debug, HashStable_Generic)]
1218 pub struct Field<'hir> {
1219 #[stable_hasher(ignore)]
1222 pub expr: &'hir Expr<'hir>,
1224 pub is_shorthand: bool,
1227 #[derive(Copy, Clone, PartialEq, Encodable, Debug, HashStable_Generic)]
1228 pub enum BlockCheckMode {
1230 UnsafeBlock(UnsafeSource),
1231 PushUnsafeBlock(UnsafeSource),
1232 PopUnsafeBlock(UnsafeSource),
1235 #[derive(Copy, Clone, PartialEq, Encodable, Debug, HashStable_Generic)]
1236 pub enum UnsafeSource {
1241 #[derive(Copy, Clone, PartialEq, Eq, PartialOrd, Ord, Encodable, Hash, Debug)]
1246 /// The body of a function, closure, or constant value. In the case of
1247 /// a function, the body contains not only the function body itself
1248 /// (which is an expression), but also the argument patterns, since
1249 /// those are something that the caller doesn't really care about.
1254 /// fn foo((x, y): (u32, u32)) -> u32 {
1259 /// Here, the `Body` associated with `foo()` would contain:
1261 /// - an `params` array containing the `(x, y)` pattern
1262 /// - a `value` containing the `x + y` expression (maybe wrapped in a block)
1263 /// - `generator_kind` would be `None`
1265 /// All bodies have an **owner**, which can be accessed via the HIR
1266 /// map using `body_owner_def_id()`.
1268 pub struct Body<'hir> {
1269 pub params: &'hir [Param<'hir>],
1270 pub value: Expr<'hir>,
1271 pub generator_kind: Option<GeneratorKind>,
1275 pub fn id(&self) -> BodyId {
1276 BodyId { hir_id: self.value.hir_id }
1279 pub fn generator_kind(&self) -> Option<GeneratorKind> {
1284 /// The type of source expression that caused this generator to be created.
1297 pub enum GeneratorKind {
1298 /// An explicit `async` block or the body of an async function.
1299 Async(AsyncGeneratorKind),
1301 /// A generator literal created via a `yield` inside a closure.
1305 impl fmt::Display for GeneratorKind {
1306 fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
1308 GeneratorKind::Async(k) => fmt::Display::fmt(k, f),
1309 GeneratorKind::Gen => f.write_str("generator"),
1314 impl GeneratorKind {
1315 pub fn descr(&self) -> &'static str {
1317 GeneratorKind::Async(ask) => ask.descr(),
1318 GeneratorKind::Gen => "generator",
1323 /// In the case of a generator created as part of an async construct,
1324 /// which kind of async construct caused it to be created?
1326 /// This helps error messages but is also used to drive coercions in
1327 /// type-checking (see #60424).
1340 pub enum AsyncGeneratorKind {
1341 /// An explicit `async` block written by the user.
1344 /// An explicit `async` block written by the user.
1347 /// The `async` block generated as the body of an async function.
1351 impl fmt::Display for AsyncGeneratorKind {
1352 fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
1353 f.write_str(match self {
1354 AsyncGeneratorKind::Block => "`async` block",
1355 AsyncGeneratorKind::Closure => "`async` closure body",
1356 AsyncGeneratorKind::Fn => "`async fn` body",
1361 impl AsyncGeneratorKind {
1362 pub fn descr(&self) -> &'static str {
1364 AsyncGeneratorKind::Block => "`async` block",
1365 AsyncGeneratorKind::Closure => "`async` closure body",
1366 AsyncGeneratorKind::Fn => "`async fn` body",
1371 #[derive(Copy, Clone, Debug)]
1372 pub enum BodyOwnerKind {
1373 /// Functions and methods.
1379 /// Constants and associated constants.
1382 /// Initializer of a `static` item.
1386 impl BodyOwnerKind {
1387 pub fn is_fn_or_closure(self) -> bool {
1389 BodyOwnerKind::Fn | BodyOwnerKind::Closure => true,
1390 BodyOwnerKind::Const | BodyOwnerKind::Static(_) => false,
1395 /// The kind of an item that requires const-checking.
1396 #[derive(Clone, Copy, Debug, PartialEq, Eq)]
1397 pub enum ConstContext {
1401 /// A `static` or `static mut`.
1404 /// A `const`, associated `const`, or other const context.
1406 /// Other contexts include:
1407 /// - Array length expressions
1408 /// - Enum discriminants
1409 /// - Const generics
1411 /// For the most part, other contexts are treated just like a regular `const`, so they are
1412 /// lumped into the same category.
1417 /// A description of this const context that can appear between backticks in an error message.
1419 /// E.g. `const` or `static mut`.
1420 pub fn keyword_name(self) -> &'static str {
1422 Self::Const => "const",
1423 Self::Static(Mutability::Not) => "static",
1424 Self::Static(Mutability::Mut) => "static mut",
1425 Self::ConstFn => "const fn",
1430 /// A colloquial, trivially pluralizable description of this const context for use in error
1432 impl fmt::Display for ConstContext {
1433 fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
1435 Self::Const => write!(f, "constant"),
1436 Self::Static(_) => write!(f, "static"),
1437 Self::ConstFn => write!(f, "constant function"),
1443 pub type Lit = Spanned<LitKind>;
1445 /// A constant (expression) that's not an item or associated item,
1446 /// but needs its own `DefId` for type-checking, const-eval, etc.
1447 /// These are usually found nested inside types (e.g., array lengths)
1448 /// or expressions (e.g., repeat counts), and also used to define
1449 /// explicit discriminant values for enum variants.
1450 #[derive(Copy, Clone, PartialEq, Eq, Encodable, Debug, HashStable_Generic)]
1451 pub struct AnonConst {
1458 pub struct Expr<'hir> {
1460 pub kind: ExprKind<'hir>,
1466 pub fn precedence(&self) -> ExprPrecedence {
1468 ExprKind::Box(_) => ExprPrecedence::Box,
1469 ExprKind::ConstBlock(_) => ExprPrecedence::ConstBlock,
1470 ExprKind::Array(_) => ExprPrecedence::Array,
1471 ExprKind::Call(..) => ExprPrecedence::Call,
1472 ExprKind::MethodCall(..) => ExprPrecedence::MethodCall,
1473 ExprKind::Tup(_) => ExprPrecedence::Tup,
1474 ExprKind::Binary(op, ..) => ExprPrecedence::Binary(op.node.into()),
1475 ExprKind::Unary(..) => ExprPrecedence::Unary,
1476 ExprKind::Lit(_) => ExprPrecedence::Lit,
1477 ExprKind::Type(..) | ExprKind::Cast(..) => ExprPrecedence::Cast,
1478 ExprKind::DropTemps(ref expr, ..) => expr.precedence(),
1479 ExprKind::If(..) => ExprPrecedence::If,
1480 ExprKind::Loop(..) => ExprPrecedence::Loop,
1481 ExprKind::Match(..) => ExprPrecedence::Match,
1482 ExprKind::Closure(..) => ExprPrecedence::Closure,
1483 ExprKind::Block(..) => ExprPrecedence::Block,
1484 ExprKind::Assign(..) => ExprPrecedence::Assign,
1485 ExprKind::AssignOp(..) => ExprPrecedence::AssignOp,
1486 ExprKind::Field(..) => ExprPrecedence::Field,
1487 ExprKind::Index(..) => ExprPrecedence::Index,
1488 ExprKind::Path(..) => ExprPrecedence::Path,
1489 ExprKind::AddrOf(..) => ExprPrecedence::AddrOf,
1490 ExprKind::Break(..) => ExprPrecedence::Break,
1491 ExprKind::Continue(..) => ExprPrecedence::Continue,
1492 ExprKind::Ret(..) => ExprPrecedence::Ret,
1493 ExprKind::InlineAsm(..) => ExprPrecedence::InlineAsm,
1494 ExprKind::LlvmInlineAsm(..) => ExprPrecedence::InlineAsm,
1495 ExprKind::Struct(..) => ExprPrecedence::Struct,
1496 ExprKind::Repeat(..) => ExprPrecedence::Repeat,
1497 ExprKind::Yield(..) => ExprPrecedence::Yield,
1498 ExprKind::Err => ExprPrecedence::Err,
1502 // Whether this looks like a place expr, without checking for deref
1504 // This will return `true` in some potentially surprising cases such as
1505 // `CONSTANT.field`.
1506 pub fn is_syntactic_place_expr(&self) -> bool {
1507 self.is_place_expr(|_| true)
1510 /// Whether this is a place expression.
1512 /// `allow_projections_from` should return `true` if indexing a field or index expression based
1513 /// on the given expression should be considered a place expression.
1514 pub fn is_place_expr(&self, mut allow_projections_from: impl FnMut(&Self) -> bool) -> bool {
1516 ExprKind::Path(QPath::Resolved(_, ref path)) => {
1517 matches!(path.res, Res::Local(..) | Res::Def(DefKind::Static, _) | Res::Err)
1520 // Type ascription inherits its place expression kind from its
1522 // https://github.com/rust-lang/rfcs/blob/master/text/0803-type-ascription.md#type-ascription-and-temporaries
1523 ExprKind::Type(ref e, _) => e.is_place_expr(allow_projections_from),
1525 ExprKind::Unary(UnOp::Deref, _) => true,
1527 ExprKind::Field(ref base, _) | ExprKind::Index(ref base, _) => {
1528 allow_projections_from(base) || base.is_place_expr(allow_projections_from)
1531 // Lang item paths cannot currently be local variables or statics.
1532 ExprKind::Path(QPath::LangItem(..)) => false,
1534 // Partially qualified paths in expressions can only legally
1535 // refer to associated items which are always rvalues.
1536 ExprKind::Path(QPath::TypeRelative(..))
1537 | ExprKind::Call(..)
1538 | ExprKind::MethodCall(..)
1539 | ExprKind::Struct(..)
1542 | ExprKind::Match(..)
1543 | ExprKind::Closure(..)
1544 | ExprKind::Block(..)
1545 | ExprKind::Repeat(..)
1546 | ExprKind::Array(..)
1547 | ExprKind::Break(..)
1548 | ExprKind::Continue(..)
1550 | ExprKind::Loop(..)
1551 | ExprKind::Assign(..)
1552 | ExprKind::InlineAsm(..)
1553 | ExprKind::LlvmInlineAsm(..)
1554 | ExprKind::AssignOp(..)
1556 | ExprKind::ConstBlock(..)
1557 | ExprKind::Unary(..)
1559 | ExprKind::AddrOf(..)
1560 | ExprKind::Binary(..)
1561 | ExprKind::Yield(..)
1562 | ExprKind::Cast(..)
1563 | ExprKind::DropTemps(..)
1564 | ExprKind::Err => false,
1568 /// If `Self.kind` is `ExprKind::DropTemps(expr)`, drill down until we get a non-`DropTemps`
1569 /// `Expr`. This is used in suggestions to ignore this `ExprKind` as it is semantically
1570 /// silent, only signaling the ownership system. By doing this, suggestions that check the
1571 /// `ExprKind` of any given `Expr` for presentation don't have to care about `DropTemps`
1572 /// beyond remembering to call this function before doing analysis on it.
1573 pub fn peel_drop_temps(&self) -> &Self {
1574 let mut expr = self;
1575 while let ExprKind::DropTemps(inner) = &expr.kind {
1581 pub fn peel_blocks(&self) -> &Self {
1582 let mut expr = self;
1583 while let ExprKind::Block(Block { expr: Some(inner), .. }, _) = &expr.kind {
1589 pub fn can_have_side_effects(&self) -> bool {
1590 match self.peel_drop_temps().kind {
1591 ExprKind::Path(_) | ExprKind::Lit(_) => false,
1592 ExprKind::Type(base, _)
1593 | ExprKind::Unary(_, base)
1594 | ExprKind::Field(base, _)
1595 | ExprKind::Index(base, _)
1596 | ExprKind::AddrOf(.., base)
1597 | ExprKind::Cast(base, _) => {
1598 // This isn't exactly true for `Index` and all `Unnary`, but we are using this
1599 // method exclusively for diagnostics and there's a *cultural* pressure against
1600 // them being used only for its side-effects.
1601 base.can_have_side_effects()
1603 ExprKind::Struct(_, fields, init) => fields
1605 .map(|field| field.expr)
1606 .chain(init.into_iter())
1607 .all(|e| e.can_have_side_effects()),
1609 ExprKind::Array(args)
1610 | ExprKind::Tup(args)
1614 ExprKind::Path(QPath::Resolved(
1616 Path { res: Res::Def(DefKind::Ctor(_, CtorKind::Fn), _), .. },
1621 ) => args.iter().all(|arg| arg.can_have_side_effects()),
1623 | ExprKind::Match(..)
1624 | ExprKind::MethodCall(..)
1625 | ExprKind::Call(..)
1626 | ExprKind::Closure(..)
1627 | ExprKind::Block(..)
1628 | ExprKind::Repeat(..)
1629 | ExprKind::Break(..)
1630 | ExprKind::Continue(..)
1632 | ExprKind::Loop(..)
1633 | ExprKind::Assign(..)
1634 | ExprKind::InlineAsm(..)
1635 | ExprKind::LlvmInlineAsm(..)
1636 | ExprKind::AssignOp(..)
1637 | ExprKind::ConstBlock(..)
1639 | ExprKind::Binary(..)
1640 | ExprKind::Yield(..)
1641 | ExprKind::DropTemps(..)
1642 | ExprKind::Err => true,
1647 /// Checks if the specified expression is a built-in range literal.
1648 /// (See: `LoweringContext::lower_expr()`).
1649 pub fn is_range_literal(expr: &Expr<'_>) -> bool {
1651 // All built-in range literals but `..=` and `..` desugar to `Struct`s.
1652 ExprKind::Struct(ref qpath, _, _) => matches!(
1657 | LangItem::RangeFrom
1658 | LangItem::RangeFull
1659 | LangItem::RangeToInclusive,
1664 // `..=` desugars into `::std::ops::RangeInclusive::new(...)`.
1665 ExprKind::Call(ref func, _) => {
1666 matches!(func.kind, ExprKind::Path(QPath::LangItem(LangItem::RangeInclusiveNew, _)))
1673 #[derive(Debug, HashStable_Generic)]
1674 pub enum ExprKind<'hir> {
1675 /// A `box x` expression.
1676 Box(&'hir Expr<'hir>),
1677 /// Allow anonymous constants from an inline `const` block
1678 ConstBlock(AnonConst),
1679 /// An array (e.g., `[a, b, c, d]`).
1680 Array(&'hir [Expr<'hir>]),
1681 /// A function call.
1683 /// The first field resolves to the function itself (usually an `ExprKind::Path`),
1684 /// and the second field is the list of arguments.
1685 /// This also represents calling the constructor of
1686 /// tuple-like ADTs such as tuple structs and enum variants.
1687 Call(&'hir Expr<'hir>, &'hir [Expr<'hir>]),
1688 /// A method call (e.g., `x.foo::<'static, Bar, Baz>(a, b, c, d)`).
1690 /// The `PathSegment`/`Span` represent the method name and its generic arguments
1691 /// (within the angle brackets).
1692 /// The first element of the vector of `Expr`s is the expression that evaluates
1693 /// to the object on which the method is being called on (the receiver),
1694 /// and the remaining elements are the rest of the arguments.
1695 /// Thus, `x.foo::<Bar, Baz>(a, b, c, d)` is represented as
1696 /// `ExprKind::MethodCall(PathSegment { foo, [Bar, Baz] }, [x, a, b, c, d])`.
1697 /// The final `Span` represents the span of the function and arguments
1698 /// (e.g. `foo::<Bar, Baz>(a, b, c, d)` in `x.foo::<Bar, Baz>(a, b, c, d)`
1700 /// To resolve the called method to a `DefId`, call [`type_dependent_def_id`] with
1701 /// the `hir_id` of the `MethodCall` node itself.
1703 /// [`type_dependent_def_id`]: ../ty/struct.TypeckResults.html#method.type_dependent_def_id
1704 MethodCall(&'hir PathSegment<'hir>, Span, &'hir [Expr<'hir>], Span),
1705 /// A tuple (e.g., `(a, b, c, d)`).
1706 Tup(&'hir [Expr<'hir>]),
1707 /// A binary operation (e.g., `a + b`, `a * b`).
1708 Binary(BinOp, &'hir Expr<'hir>, &'hir Expr<'hir>),
1709 /// A unary operation (e.g., `!x`, `*x`).
1710 Unary(UnOp, &'hir Expr<'hir>),
1711 /// A literal (e.g., `1`, `"foo"`).
1713 /// A cast (e.g., `foo as f64`).
1714 Cast(&'hir Expr<'hir>, &'hir Ty<'hir>),
1715 /// A type reference (e.g., `Foo`).
1716 Type(&'hir Expr<'hir>, &'hir Ty<'hir>),
1717 /// Wraps the expression in a terminating scope.
1718 /// This makes it semantically equivalent to `{ let _t = expr; _t }`.
1720 /// This construct only exists to tweak the drop order in HIR lowering.
1721 /// An example of that is the desugaring of `for` loops.
1722 DropTemps(&'hir Expr<'hir>),
1723 /// An `if` block, with an optional else block.
1725 /// I.e., `if <expr> { <expr> } else { <expr> }`.
1726 If(&'hir Expr<'hir>, &'hir Expr<'hir>, Option<&'hir Expr<'hir>>),
1727 /// A conditionless loop (can be exited with `break`, `continue`, or `return`).
1729 /// I.e., `'label: loop { <block> }`.
1731 /// The `Span` is the loop header (`for x in y`/`while let pat = expr`).
1732 Loop(&'hir Block<'hir>, Option<Label>, LoopSource, Span),
1733 /// A `match` block, with a source that indicates whether or not it is
1734 /// the result of a desugaring, and if so, which kind.
1735 Match(&'hir Expr<'hir>, &'hir [Arm<'hir>], MatchSource),
1736 /// A closure (e.g., `move |a, b, c| {a + b + c}`).
1738 /// The `Span` is the argument block `|...|`.
1740 /// This may also be a generator literal or an `async block` as indicated by the
1741 /// `Option<Movability>`.
1742 Closure(CaptureBy, &'hir FnDecl<'hir>, BodyId, Span, Option<Movability>),
1743 /// A block (e.g., `'label: { ... }`).
1744 Block(&'hir Block<'hir>, Option<Label>),
1746 /// An assignment (e.g., `a = foo()`).
1747 Assign(&'hir Expr<'hir>, &'hir Expr<'hir>, Span),
1748 /// An assignment with an operator.
1751 AssignOp(BinOp, &'hir Expr<'hir>, &'hir Expr<'hir>),
1752 /// Access of a named (e.g., `obj.foo`) or unnamed (e.g., `obj.0`) struct or tuple field.
1753 Field(&'hir Expr<'hir>, Ident),
1754 /// An indexing operation (`foo[2]`).
1755 Index(&'hir Expr<'hir>, &'hir Expr<'hir>),
1757 /// Path to a definition, possibly containing lifetime or type parameters.
1760 /// A referencing operation (i.e., `&a` or `&mut a`).
1761 AddrOf(BorrowKind, Mutability, &'hir Expr<'hir>),
1762 /// A `break`, with an optional label to break.
1763 Break(Destination, Option<&'hir Expr<'hir>>),
1764 /// A `continue`, with an optional label.
1765 Continue(Destination),
1766 /// A `return`, with an optional value to be returned.
1767 Ret(Option<&'hir Expr<'hir>>),
1769 /// Inline assembly (from `asm!`), with its outputs and inputs.
1770 InlineAsm(&'hir InlineAsm<'hir>),
1771 /// Inline assembly (from `llvm_asm!`), with its outputs and inputs.
1772 LlvmInlineAsm(&'hir LlvmInlineAsm<'hir>),
1774 /// A struct or struct-like variant literal expression.
1776 /// E.g., `Foo {x: 1, y: 2}`, or `Foo {x: 1, .. base}`,
1777 /// where `base` is the `Option<Expr>`.
1778 Struct(&'hir QPath<'hir>, &'hir [Field<'hir>], Option<&'hir Expr<'hir>>),
1780 /// An array literal constructed from one repeated element.
1782 /// E.g., `[1; 5]`. The first expression is the element
1783 /// to be repeated; the second is the number of times to repeat it.
1784 Repeat(&'hir Expr<'hir>, AnonConst),
1786 /// A suspension point for generators (i.e., `yield <expr>`).
1787 Yield(&'hir Expr<'hir>, YieldSource),
1789 /// A placeholder for an expression that wasn't syntactically well formed in some way.
1793 /// Represents an optionally `Self`-qualified value/type path or associated extension.
1795 /// To resolve the path to a `DefId`, call [`qpath_res`].
1797 /// [`qpath_res`]: ../rustc_middle/ty/struct.TypeckResults.html#method.qpath_res
1798 #[derive(Debug, HashStable_Generic)]
1799 pub enum QPath<'hir> {
1800 /// Path to a definition, optionally "fully-qualified" with a `Self`
1801 /// type, if the path points to an associated item in a trait.
1803 /// E.g., an unqualified path like `Clone::clone` has `None` for `Self`,
1804 /// while `<Vec<T> as Clone>::clone` has `Some(Vec<T>)` for `Self`,
1805 /// even though they both have the same two-segment `Clone::clone` `Path`.
1806 Resolved(Option<&'hir Ty<'hir>>, &'hir Path<'hir>),
1808 /// Type-related paths (e.g., `<T>::default` or `<T>::Output`).
1809 /// Will be resolved by type-checking to an associated item.
1811 /// UFCS source paths can desugar into this, with `Vec::new` turning into
1812 /// `<Vec>::new`, and `T::X::Y::method` into `<<<T>::X>::Y>::method`,
1813 /// the `X` and `Y` nodes each being a `TyKind::Path(QPath::TypeRelative(..))`.
1814 TypeRelative(&'hir Ty<'hir>, &'hir PathSegment<'hir>),
1816 /// Reference to a `#[lang = "foo"]` item.
1817 LangItem(LangItem, Span),
1820 impl<'hir> QPath<'hir> {
1821 /// Returns the span of this `QPath`.
1822 pub fn span(&self) -> Span {
1824 QPath::Resolved(_, path) => path.span,
1825 QPath::TypeRelative(_, ps) => ps.ident.span,
1826 QPath::LangItem(_, span) => span,
1830 /// Returns the span of the qself of this `QPath`. For example, `()` in
1831 /// `<() as Trait>::method`.
1832 pub fn qself_span(&self) -> Span {
1834 QPath::Resolved(_, path) => path.span,
1835 QPath::TypeRelative(qself, _) => qself.span,
1836 QPath::LangItem(_, span) => span,
1840 /// Returns the span of the last segment of this `QPath`. For example, `method` in
1841 /// `<() as Trait>::method`.
1842 pub fn last_segment_span(&self) -> Span {
1844 QPath::Resolved(_, path) => path.segments.last().unwrap().ident.span,
1845 QPath::TypeRelative(_, segment) => segment.ident.span,
1846 QPath::LangItem(_, span) => span,
1851 /// Hints at the original code for a let statement.
1852 #[derive(Copy, Clone, Encodable, Debug, HashStable_Generic)]
1853 pub enum LocalSource {
1854 /// A `match _ { .. }`.
1856 /// A desugared `for _ in _ { .. }` loop.
1858 /// When lowering async functions, we create locals within the `async move` so that
1859 /// all parameters are dropped after the future is polled.
1861 /// ```ignore (pseudo-Rust)
1862 /// async fn foo(<pattern> @ x: Type) {
1864 /// let <pattern> = x;
1869 /// A desugared `<expr>.await`.
1871 /// A desugared `expr = expr`, where the LHS is a tuple, struct or array.
1872 /// The span is that of the `=` sign.
1873 AssignDesugar(Span),
1876 /// Hints at the original code for a `match _ { .. }`.
1877 #[derive(Copy, Clone, PartialEq, Eq, Encodable, Hash, Debug)]
1878 #[derive(HashStable_Generic)]
1879 pub enum MatchSource {
1880 /// A `match _ { .. }`.
1882 /// An `if let _ = _ { .. }` (optionally with `else { .. }`).
1883 IfLetDesugar { contains_else_clause: bool },
1884 /// An `if let _ = _ => { .. }` match guard.
1886 /// A `while _ { .. }` (which was desugared to a `loop { match _ { .. } }`).
1888 /// A `while let _ = _ { .. }` (which was desugared to a
1889 /// `loop { match _ { .. } }`).
1891 /// A desugared `for _ in _ { .. }` loop.
1893 /// A desugared `?` operator.
1895 /// A desugared `<expr>.await`.
1900 pub fn name(self) -> &'static str {
1904 IfLetDesugar { .. } | IfLetGuardDesugar => "if",
1905 WhileDesugar | WhileLetDesugar => "while",
1906 ForLoopDesugar => "for",
1908 AwaitDesugar => ".await",
1913 /// The loop type that yielded an `ExprKind::Loop`.
1914 #[derive(Copy, Clone, PartialEq, Encodable, Debug, HashStable_Generic)]
1915 pub enum LoopSource {
1916 /// A `loop { .. }` loop.
1918 /// A `while _ { .. }` loop.
1920 /// A `while let _ = _ { .. }` loop.
1922 /// A `for _ in _ { .. }` loop.
1927 pub fn name(self) -> &'static str {
1929 LoopSource::Loop => "loop",
1930 LoopSource::While | LoopSource::WhileLet => "while",
1931 LoopSource::ForLoop => "for",
1936 #[derive(Copy, Clone, Encodable, Debug, HashStable_Generic)]
1937 pub enum LoopIdError {
1939 UnlabeledCfInWhileCondition,
1943 impl fmt::Display for LoopIdError {
1944 fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
1945 f.write_str(match self {
1946 LoopIdError::OutsideLoopScope => "not inside loop scope",
1947 LoopIdError::UnlabeledCfInWhileCondition => {
1948 "unlabeled control flow (break or continue) in while condition"
1950 LoopIdError::UnresolvedLabel => "label not found",
1955 #[derive(Copy, Clone, Encodable, Debug, HashStable_Generic)]
1956 pub struct Destination {
1957 // This is `Some(_)` iff there is an explicit user-specified `label
1958 pub label: Option<Label>,
1960 // These errors are caught and then reported during the diagnostics pass in
1961 // librustc_passes/loops.rs
1962 pub target_id: Result<HirId, LoopIdError>,
1965 /// The yield kind that caused an `ExprKind::Yield`.
1966 #[derive(Copy, Clone, PartialEq, Eq, Debug, Encodable, Decodable, HashStable_Generic)]
1967 pub enum YieldSource {
1968 /// An `<expr>.await`.
1969 Await { expr: Option<HirId> },
1970 /// A plain `yield`.
1975 pub fn is_await(&self) -> bool {
1977 YieldSource::Await { .. } => true,
1978 YieldSource::Yield => false,
1983 impl fmt::Display for YieldSource {
1984 fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
1985 f.write_str(match self {
1986 YieldSource::Await { .. } => "`await`",
1987 YieldSource::Yield => "`yield`",
1992 impl From<GeneratorKind> for YieldSource {
1993 fn from(kind: GeneratorKind) -> Self {
1995 // Guess based on the kind of the current generator.
1996 GeneratorKind::Gen => Self::Yield,
1997 GeneratorKind::Async(_) => Self::Await { expr: None },
2002 // N.B., if you change this, you'll probably want to change the corresponding
2003 // type structure in middle/ty.rs as well.
2004 #[derive(Debug, HashStable_Generic)]
2005 pub struct MutTy<'hir> {
2006 pub ty: &'hir Ty<'hir>,
2007 pub mutbl: Mutability,
2010 /// Represents a function's signature in a trait declaration,
2011 /// trait implementation, or a free function.
2012 #[derive(Debug, HashStable_Generic)]
2013 pub struct FnSig<'hir> {
2014 pub header: FnHeader,
2015 pub decl: &'hir FnDecl<'hir>,
2019 // The bodies for items are stored "out of line", in a separate
2020 // hashmap in the `Crate`. Here we just record the hir-id of the item
2021 // so it can fetched later.
2022 #[derive(Copy, Clone, PartialEq, Eq, PartialOrd, Ord, Encodable, Debug)]
2023 pub struct TraitItemId {
2024 pub def_id: LocalDefId,
2029 pub fn hir_id(&self) -> HirId {
2030 // Items are always HIR owners.
2031 HirId::make_owner(self.def_id)
2035 /// Represents an item declaration within a trait declaration,
2036 /// possibly including a default implementation. A trait item is
2037 /// either required (meaning it doesn't have an implementation, just a
2038 /// signature) or provided (meaning it has a default implementation).
2040 pub struct TraitItem<'hir> {
2042 pub def_id: LocalDefId,
2043 pub attrs: &'hir [Attribute],
2044 pub generics: Generics<'hir>,
2045 pub kind: TraitItemKind<'hir>,
2049 impl TraitItem<'_> {
2051 pub fn hir_id(&self) -> HirId {
2052 // Items are always HIR owners.
2053 HirId::make_owner(self.def_id)
2056 pub fn trait_item_id(&self) -> TraitItemId {
2057 TraitItemId { def_id: self.def_id }
2061 /// Represents a trait method's body (or just argument names).
2062 #[derive(Encodable, Debug, HashStable_Generic)]
2063 pub enum TraitFn<'hir> {
2064 /// No default body in the trait, just a signature.
2065 Required(&'hir [Ident]),
2067 /// Both signature and body are provided in the trait.
2071 /// Represents a trait method or associated constant or type
2072 #[derive(Debug, HashStable_Generic)]
2073 pub enum TraitItemKind<'hir> {
2074 /// An associated constant with an optional value (otherwise `impl`s must contain a value).
2075 Const(&'hir Ty<'hir>, Option<BodyId>),
2076 /// An associated function with an optional body.
2077 Fn(FnSig<'hir>, TraitFn<'hir>),
2078 /// An associated type with (possibly empty) bounds and optional concrete
2080 Type(GenericBounds<'hir>, Option<&'hir Ty<'hir>>),
2083 // The bodies for items are stored "out of line", in a separate
2084 // hashmap in the `Crate`. Here we just record the hir-id of the item
2085 // so it can fetched later.
2086 #[derive(Copy, Clone, PartialEq, Eq, PartialOrd, Ord, Encodable, Debug)]
2087 pub struct ImplItemId {
2088 pub def_id: LocalDefId,
2093 pub fn hir_id(&self) -> HirId {
2094 // Items are always HIR owners.
2095 HirId::make_owner(self.def_id)
2099 /// Represents anything within an `impl` block.
2101 pub struct ImplItem<'hir> {
2103 pub def_id: LocalDefId,
2104 pub vis: Visibility<'hir>,
2105 pub defaultness: Defaultness,
2106 pub attrs: &'hir [Attribute],
2107 pub generics: Generics<'hir>,
2108 pub kind: ImplItemKind<'hir>,
2114 pub fn hir_id(&self) -> HirId {
2115 // Items are always HIR owners.
2116 HirId::make_owner(self.def_id)
2119 pub fn impl_item_id(&self) -> ImplItemId {
2120 ImplItemId { def_id: self.def_id }
2124 /// Represents various kinds of content within an `impl`.
2125 #[derive(Debug, HashStable_Generic)]
2126 pub enum ImplItemKind<'hir> {
2127 /// An associated constant of the given type, set to the constant result
2128 /// of the expression.
2129 Const(&'hir Ty<'hir>, BodyId),
2130 /// An associated function implementation with the given signature and body.
2131 Fn(FnSig<'hir>, BodyId),
2132 /// An associated type.
2133 TyAlias(&'hir Ty<'hir>),
2136 impl ImplItemKind<'_> {
2137 pub fn namespace(&self) -> Namespace {
2139 ImplItemKind::TyAlias(..) => Namespace::TypeNS,
2140 ImplItemKind::Const(..) | ImplItemKind::Fn(..) => Namespace::ValueNS,
2145 // The name of the associated type for `Fn` return types.
2146 pub const FN_OUTPUT_NAME: Symbol = sym::Output;
2148 /// Bind a type to an associated type (i.e., `A = Foo`).
2150 /// Bindings like `A: Debug` are represented as a special type `A =
2151 /// $::Debug` that is understood by the astconv code.
2153 /// FIXME(alexreg): why have a separate type for the binding case,
2154 /// wouldn't it be better to make the `ty` field an enum like the
2158 /// enum TypeBindingKind {
2163 #[derive(Debug, HashStable_Generic)]
2164 pub struct TypeBinding<'hir> {
2166 #[stable_hasher(project(name))]
2168 pub gen_args: &'hir GenericArgs<'hir>,
2169 pub kind: TypeBindingKind<'hir>,
2173 // Represents the two kinds of type bindings.
2174 #[derive(Debug, HashStable_Generic)]
2175 pub enum TypeBindingKind<'hir> {
2176 /// E.g., `Foo<Bar: Send>`.
2177 Constraint { bounds: &'hir [GenericBound<'hir>] },
2178 /// E.g., `Foo<Bar = ()>`.
2179 Equality { ty: &'hir Ty<'hir> },
2182 impl TypeBinding<'_> {
2183 pub fn ty(&self) -> &Ty<'_> {
2185 TypeBindingKind::Equality { ref ty } => ty,
2186 _ => panic!("expected equality type binding for parenthesized generic args"),
2192 pub struct Ty<'hir> {
2194 pub kind: TyKind<'hir>,
2198 /// Not represented directly in the AST; referred to by name through a `ty_path`.
2199 #[derive(Copy, Clone, PartialEq, Eq, Encodable, Decodable, Hash, Debug)]
2200 #[derive(HashStable_Generic)]
2211 /// All of the primitive types
2212 pub const ALL: [Self; 17] = [
2213 // any changes here should also be reflected in `PrimTy::from_name`
2214 Self::Int(IntTy::I8),
2215 Self::Int(IntTy::I16),
2216 Self::Int(IntTy::I32),
2217 Self::Int(IntTy::I64),
2218 Self::Int(IntTy::I128),
2219 Self::Int(IntTy::Isize),
2220 Self::Uint(UintTy::U8),
2221 Self::Uint(UintTy::U16),
2222 Self::Uint(UintTy::U32),
2223 Self::Uint(UintTy::U64),
2224 Self::Uint(UintTy::U128),
2225 Self::Uint(UintTy::Usize),
2226 Self::Float(FloatTy::F32),
2227 Self::Float(FloatTy::F64),
2233 pub fn name_str(self) -> &'static str {
2235 PrimTy::Int(i) => i.name_str(),
2236 PrimTy::Uint(u) => u.name_str(),
2237 PrimTy::Float(f) => f.name_str(),
2238 PrimTy::Str => "str",
2239 PrimTy::Bool => "bool",
2240 PrimTy::Char => "char",
2244 pub fn name(self) -> Symbol {
2246 PrimTy::Int(i) => i.name(),
2247 PrimTy::Uint(u) => u.name(),
2248 PrimTy::Float(f) => f.name(),
2249 PrimTy::Str => sym::str,
2250 PrimTy::Bool => sym::bool,
2251 PrimTy::Char => sym::char,
2255 /// Returns the matching `PrimTy` for a `Symbol` such as "str" or "i32".
2256 /// Returns `None` if no matching type is found.
2257 pub fn from_name(name: Symbol) -> Option<Self> {
2258 let ty = match name {
2259 // any changes here should also be reflected in `PrimTy::ALL`
2260 sym::i8 => Self::Int(IntTy::I8),
2261 sym::i16 => Self::Int(IntTy::I16),
2262 sym::i32 => Self::Int(IntTy::I32),
2263 sym::i64 => Self::Int(IntTy::I64),
2264 sym::i128 => Self::Int(IntTy::I128),
2265 sym::isize => Self::Int(IntTy::Isize),
2266 sym::u8 => Self::Uint(UintTy::U8),
2267 sym::u16 => Self::Uint(UintTy::U16),
2268 sym::u32 => Self::Uint(UintTy::U32),
2269 sym::u64 => Self::Uint(UintTy::U64),
2270 sym::u128 => Self::Uint(UintTy::U128),
2271 sym::usize => Self::Uint(UintTy::Usize),
2272 sym::f32 => Self::Float(FloatTy::F32),
2273 sym::f64 => Self::Float(FloatTy::F64),
2274 sym::bool => Self::Bool,
2275 sym::char => Self::Char,
2276 sym::str => Self::Str,
2283 #[derive(Debug, HashStable_Generic)]
2284 pub struct BareFnTy<'hir> {
2285 pub unsafety: Unsafety,
2287 pub generic_params: &'hir [GenericParam<'hir>],
2288 pub decl: &'hir FnDecl<'hir>,
2289 pub param_names: &'hir [Ident],
2292 #[derive(Debug, HashStable_Generic)]
2293 pub struct OpaqueTy<'hir> {
2294 pub generics: Generics<'hir>,
2295 pub bounds: GenericBounds<'hir>,
2296 pub impl_trait_fn: Option<DefId>,
2297 pub origin: OpaqueTyOrigin,
2300 /// From whence the opaque type came.
2301 #[derive(Copy, Clone, Encodable, Decodable, Debug, HashStable_Generic)]
2302 pub enum OpaqueTyOrigin {
2307 /// `let _: impl Trait = ...`
2309 /// Impl trait in type aliases, consts, statics, bounds.
2313 /// The various kinds of types recognized by the compiler.
2314 #[derive(Debug, HashStable_Generic)]
2315 pub enum TyKind<'hir> {
2316 /// A variable length slice (i.e., `[T]`).
2317 Slice(&'hir Ty<'hir>),
2318 /// A fixed length array (i.e., `[T; n]`).
2319 Array(&'hir Ty<'hir>, AnonConst),
2320 /// A raw pointer (i.e., `*const T` or `*mut T`).
2322 /// A reference (i.e., `&'a T` or `&'a mut T`).
2323 Rptr(Lifetime, MutTy<'hir>),
2324 /// A bare function (e.g., `fn(usize) -> bool`).
2325 BareFn(&'hir BareFnTy<'hir>),
2326 /// The never type (`!`).
2328 /// A tuple (`(A, B, C, D, ...)`).
2329 Tup(&'hir [Ty<'hir>]),
2330 /// A path to a type definition (`module::module::...::Type`), or an
2331 /// associated type (e.g., `<Vec<T> as Trait>::Type` or `<T>::Target`).
2333 /// Type parameters may be stored in each `PathSegment`.
2335 /// A opaque type definition itself. This is currently only used for the
2336 /// `opaque type Foo: Trait` item that `impl Trait` in desugars to.
2338 /// The generic argument list contains the lifetimes (and in the future
2339 /// possibly parameters) that are actually bound on the `impl Trait`.
2340 OpaqueDef(ItemId, &'hir [GenericArg<'hir>]),
2341 /// A trait object type `Bound1 + Bound2 + Bound3`
2342 /// where `Bound` is a trait or a lifetime.
2343 TraitObject(&'hir [PolyTraitRef<'hir>], Lifetime),
2346 /// `TyKind::Infer` means the type should be inferred instead of it having been
2347 /// specified. This can appear anywhere in a type.
2349 /// Placeholder for a type that has failed to be defined.
2353 #[derive(Debug, HashStable_Generic)]
2354 pub enum InlineAsmOperand<'hir> {
2356 reg: InlineAsmRegOrRegClass,
2360 reg: InlineAsmRegOrRegClass,
2362 expr: Option<Expr<'hir>>,
2365 reg: InlineAsmRegOrRegClass,
2370 reg: InlineAsmRegOrRegClass,
2372 in_expr: Expr<'hir>,
2373 out_expr: Option<Expr<'hir>>,
2383 impl<'hir> InlineAsmOperand<'hir> {
2384 pub fn reg(&self) -> Option<InlineAsmRegOrRegClass> {
2386 Self::In { reg, .. }
2387 | Self::Out { reg, .. }
2388 | Self::InOut { reg, .. }
2389 | Self::SplitInOut { reg, .. } => Some(reg),
2390 Self::Const { .. } | Self::Sym { .. } => None,
2395 #[derive(Debug, HashStable_Generic)]
2396 pub struct InlineAsm<'hir> {
2397 pub template: &'hir [InlineAsmTemplatePiece],
2398 pub operands: &'hir [(InlineAsmOperand<'hir>, Span)],
2399 pub options: InlineAsmOptions,
2400 pub line_spans: &'hir [Span],
2403 #[derive(Copy, Clone, Encodable, Decodable, Debug, Hash, HashStable_Generic, PartialEq)]
2404 pub struct LlvmInlineAsmOutput {
2405 pub constraint: Symbol,
2407 pub is_indirect: bool,
2411 // NOTE(eddyb) This is used within MIR as well, so unlike the rest of the HIR,
2412 // it needs to be `Clone` and `Decodable` and use plain `Vec<T>` instead of
2413 // arena-allocated slice.
2414 #[derive(Clone, Encodable, Decodable, Debug, Hash, HashStable_Generic, PartialEq)]
2415 pub struct LlvmInlineAsmInner {
2417 pub asm_str_style: StrStyle,
2418 pub outputs: Vec<LlvmInlineAsmOutput>,
2419 pub inputs: Vec<Symbol>,
2420 pub clobbers: Vec<Symbol>,
2422 pub alignstack: bool,
2423 pub dialect: LlvmAsmDialect,
2426 #[derive(Debug, HashStable_Generic)]
2427 pub struct LlvmInlineAsm<'hir> {
2428 pub inner: LlvmInlineAsmInner,
2429 pub outputs_exprs: &'hir [Expr<'hir>],
2430 pub inputs_exprs: &'hir [Expr<'hir>],
2433 /// Represents a parameter in a function header.
2434 #[derive(Debug, HashStable_Generic)]
2435 pub struct Param<'hir> {
2436 pub attrs: &'hir [Attribute],
2438 pub pat: &'hir Pat<'hir>,
2443 /// Represents the header (not the body) of a function declaration.
2444 #[derive(Debug, HashStable_Generic)]
2445 pub struct FnDecl<'hir> {
2446 /// The types of the function's parameters.
2448 /// Additional argument data is stored in the function's [body](Body::params).
2449 pub inputs: &'hir [Ty<'hir>],
2450 pub output: FnRetTy<'hir>,
2451 pub c_variadic: bool,
2452 /// Does the function have an implicit self?
2453 pub implicit_self: ImplicitSelfKind,
2456 /// Represents what type of implicit self a function has, if any.
2457 #[derive(Copy, Clone, Encodable, Decodable, Debug, HashStable_Generic)]
2458 pub enum ImplicitSelfKind {
2459 /// Represents a `fn x(self);`.
2461 /// Represents a `fn x(mut self);`.
2463 /// Represents a `fn x(&self);`.
2465 /// Represents a `fn x(&mut self);`.
2467 /// Represents when a function does not have a self argument or
2468 /// when a function has a `self: X` argument.
2472 impl ImplicitSelfKind {
2473 /// Does this represent an implicit self?
2474 pub fn has_implicit_self(&self) -> bool {
2475 !matches!(*self, ImplicitSelfKind::None)
2479 #[derive(Copy, Clone, PartialEq, Eq, PartialOrd, Ord, Encodable, Decodable, Debug)]
2480 #[derive(HashStable_Generic)]
2486 #[derive(Copy, Clone, PartialEq, Eq, Hash, Debug, Encodable, Decodable, HashStable_Generic)]
2487 pub enum Defaultness {
2488 Default { has_value: bool },
2493 pub fn has_value(&self) -> bool {
2495 Defaultness::Default { has_value } => has_value,
2496 Defaultness::Final => true,
2500 pub fn is_final(&self) -> bool {
2501 *self == Defaultness::Final
2504 pub fn is_default(&self) -> bool {
2505 matches!(*self, Defaultness::Default { .. })
2509 #[derive(Debug, HashStable_Generic)]
2510 pub enum FnRetTy<'hir> {
2511 /// Return type is not specified.
2513 /// Functions default to `()` and
2514 /// closures default to inference. Span points to where return
2515 /// type would be inserted.
2516 DefaultReturn(Span),
2517 /// Everything else.
2518 Return(&'hir Ty<'hir>),
2522 pub fn span(&self) -> Span {
2524 Self::DefaultReturn(span) => span,
2525 Self::Return(ref ty) => ty.span,
2530 #[derive(Encodable, Debug)]
2531 pub struct Mod<'hir> {
2532 /// A span from the first token past `{` to the last token until `}`.
2533 /// For `mod foo;`, the inner span ranges from the first token
2534 /// to the last token in the external file.
2536 pub item_ids: &'hir [ItemId],
2539 #[derive(Encodable, Debug, HashStable_Generic)]
2540 pub struct GlobalAsm {
2544 #[derive(Debug, HashStable_Generic)]
2545 pub struct EnumDef<'hir> {
2546 pub variants: &'hir [Variant<'hir>],
2549 #[derive(Debug, HashStable_Generic)]
2550 pub struct Variant<'hir> {
2551 /// Name of the variant.
2552 #[stable_hasher(project(name))]
2554 /// Attributes of the variant.
2555 pub attrs: &'hir [Attribute],
2556 /// Id of the variant (not the constructor, see `VariantData::ctor_hir_id()`).
2558 /// Fields and constructor id of the variant.
2559 pub data: VariantData<'hir>,
2560 /// Explicit discriminant (e.g., `Foo = 1`).
2561 pub disr_expr: Option<AnonConst>,
2566 #[derive(Copy, Clone, PartialEq, Encodable, Debug, HashStable_Generic)]
2568 /// One import, e.g., `use foo::bar` or `use foo::bar as baz`.
2569 /// Also produced for each element of a list `use`, e.g.
2570 /// `use foo::{a, b}` lowers to `use foo::a; use foo::b;`.
2573 /// Glob import, e.g., `use foo::*`.
2576 /// Degenerate list import, e.g., `use foo::{a, b}` produces
2577 /// an additional `use foo::{}` for performing checks such as
2578 /// unstable feature gating. May be removed in the future.
2582 /// References to traits in impls.
2584 /// `resolve` maps each `TraitRef`'s `ref_id` to its defining trait; that's all
2585 /// that the `ref_id` is for. Note that `ref_id`'s value is not the `HirId` of the
2586 /// trait being referred to but just a unique `HirId` that serves as a key
2587 /// within the resolution map.
2588 #[derive(Debug, HashStable_Generic)]
2589 pub struct TraitRef<'hir> {
2590 pub path: &'hir Path<'hir>,
2591 // Don't hash the `ref_id`. It is tracked via the thing it is used to access.
2592 #[stable_hasher(ignore)]
2593 pub hir_ref_id: HirId,
2597 /// Gets the `DefId` of the referenced trait. It _must_ actually be a trait or trait alias.
2598 pub fn trait_def_id(&self) -> Option<DefId> {
2599 match self.path.res {
2600 Res::Def(DefKind::Trait | DefKind::TraitAlias, did) => Some(did),
2602 _ => unreachable!(),
2607 #[derive(Debug, HashStable_Generic)]
2608 pub struct PolyTraitRef<'hir> {
2609 /// The `'a` in `for<'a> Foo<&'a T>`.
2610 pub bound_generic_params: &'hir [GenericParam<'hir>],
2612 /// The `Foo<&'a T>` in `for<'a> Foo<&'a T>`.
2613 pub trait_ref: TraitRef<'hir>,
2618 pub type Visibility<'hir> = Spanned<VisibilityKind<'hir>>;
2621 pub enum VisibilityKind<'hir> {
2624 Restricted { path: &'hir Path<'hir>, hir_id: HirId },
2628 impl VisibilityKind<'_> {
2629 pub fn is_pub(&self) -> bool {
2630 matches!(*self, VisibilityKind::Public)
2633 pub fn is_pub_restricted(&self) -> bool {
2635 VisibilityKind::Public | VisibilityKind::Inherited => false,
2636 VisibilityKind::Crate(..) | VisibilityKind::Restricted { .. } => true,
2641 #[derive(Debug, HashStable_Generic)]
2642 pub struct StructField<'hir> {
2644 #[stable_hasher(project(name))]
2646 pub vis: Visibility<'hir>,
2648 pub ty: &'hir Ty<'hir>,
2649 pub attrs: &'hir [Attribute],
2652 impl StructField<'_> {
2653 // Still necessary in couple of places
2654 pub fn is_positional(&self) -> bool {
2655 let first = self.ident.as_str().as_bytes()[0];
2656 (b'0'..=b'9').contains(&first)
2660 /// Fields and constructor IDs of enum variants and structs.
2661 #[derive(Debug, HashStable_Generic)]
2662 pub enum VariantData<'hir> {
2663 /// A struct variant.
2665 /// E.g., `Bar { .. }` as in `enum Foo { Bar { .. } }`.
2666 Struct(&'hir [StructField<'hir>], /* recovered */ bool),
2667 /// A tuple variant.
2669 /// E.g., `Bar(..)` as in `enum Foo { Bar(..) }`.
2670 Tuple(&'hir [StructField<'hir>], HirId),
2673 /// E.g., `Bar = ..` as in `enum Foo { Bar = .. }`.
2677 impl VariantData<'hir> {
2678 /// Return the fields of this variant.
2679 pub fn fields(&self) -> &'hir [StructField<'hir>] {
2681 VariantData::Struct(ref fields, ..) | VariantData::Tuple(ref fields, ..) => fields,
2686 /// Return the `HirId` of this variant's constructor, if it has one.
2687 pub fn ctor_hir_id(&self) -> Option<HirId> {
2689 VariantData::Struct(_, _) => None,
2690 VariantData::Tuple(_, hir_id) | VariantData::Unit(hir_id) => Some(hir_id),
2695 // The bodies for items are stored "out of line", in a separate
2696 // hashmap in the `Crate`. Here we just record the hir-id of the item
2697 // so it can fetched later.
2698 #[derive(Copy, Clone, PartialEq, Eq, PartialOrd, Ord, Encodable, Debug, Hash)]
2700 pub def_id: LocalDefId,
2705 pub fn hir_id(&self) -> HirId {
2706 // Items are always HIR owners.
2707 HirId::make_owner(self.def_id)
2713 /// The name might be a dummy name in case of anonymous items
2715 pub struct Item<'hir> {
2717 pub def_id: LocalDefId,
2718 pub attrs: &'hir [Attribute],
2719 pub kind: ItemKind<'hir>,
2720 pub vis: Visibility<'hir>,
2726 pub fn hir_id(&self) -> HirId {
2727 // Items are always HIR owners.
2728 HirId::make_owner(self.def_id)
2731 pub fn item_id(&self) -> ItemId {
2732 ItemId { def_id: self.def_id }
2736 #[derive(Copy, Clone, PartialEq, Eq, PartialOrd, Ord, Hash, Debug)]
2737 #[derive(Encodable, Decodable, HashStable_Generic)]
2744 pub fn prefix_str(&self) -> &'static str {
2746 Self::Unsafe => "unsafe ",
2752 impl fmt::Display for Unsafety {
2753 fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
2754 f.write_str(match *self {
2755 Self::Unsafe => "unsafe",
2756 Self::Normal => "normal",
2761 #[derive(Copy, Clone, PartialEq, Eq, PartialOrd, Ord, Hash, Debug)]
2762 #[derive(Encodable, Decodable, HashStable_Generic)]
2763 pub enum Constness {
2768 #[derive(Copy, Clone, Encodable, Debug, HashStable_Generic)]
2769 pub struct FnHeader {
2770 pub unsafety: Unsafety,
2771 pub constness: Constness,
2772 pub asyncness: IsAsync,
2777 pub fn is_const(&self) -> bool {
2778 matches!(&self.constness, Constness::Const)
2782 #[derive(Debug, HashStable_Generic)]
2783 pub enum ItemKind<'hir> {
2784 /// An `extern crate` item, with optional *original* crate name if the crate was renamed.
2786 /// E.g., `extern crate foo` or `extern crate foo_bar as foo`.
2787 ExternCrate(Option<Symbol>),
2789 /// `use foo::bar::*;` or `use foo::bar::baz as quux;`
2793 /// `use foo::bar::baz;` (with `as baz` implicitly on the right).
2794 Use(&'hir Path<'hir>, UseKind),
2796 /// A `static` item.
2797 Static(&'hir Ty<'hir>, Mutability, BodyId),
2799 Const(&'hir Ty<'hir>, BodyId),
2800 /// A function declaration.
2801 Fn(FnSig<'hir>, Generics<'hir>, BodyId),
2804 /// An external module, e.g. `extern { .. }`.
2805 ForeignMod { abi: Abi, items: &'hir [ForeignItemRef<'hir>] },
2806 /// Module-level inline assembly (from `global_asm!`).
2807 GlobalAsm(&'hir GlobalAsm),
2808 /// A type alias, e.g., `type Foo = Bar<u8>`.
2809 TyAlias(&'hir Ty<'hir>, Generics<'hir>),
2810 /// An opaque `impl Trait` type alias, e.g., `type Foo = impl Bar;`.
2811 OpaqueTy(OpaqueTy<'hir>),
2812 /// An enum definition, e.g., `enum Foo<A, B> {C<A>, D<B>}`.
2813 Enum(EnumDef<'hir>, Generics<'hir>),
2814 /// A struct definition, e.g., `struct Foo<A> {x: A}`.
2815 Struct(VariantData<'hir>, Generics<'hir>),
2816 /// A union definition, e.g., `union Foo<A, B> {x: A, y: B}`.
2817 Union(VariantData<'hir>, Generics<'hir>),
2818 /// A trait definition.
2819 Trait(IsAuto, Unsafety, Generics<'hir>, GenericBounds<'hir>, &'hir [TraitItemRef]),
2821 TraitAlias(Generics<'hir>, GenericBounds<'hir>),
2823 /// An implementation, e.g., `impl<A> Trait for Foo { .. }`.
2827 #[derive(Debug, HashStable_Generic)]
2828 pub struct Impl<'hir> {
2829 pub unsafety: Unsafety,
2830 pub polarity: ImplPolarity,
2831 pub defaultness: Defaultness,
2832 // We do not put a `Span` in `Defaultness` because it breaks foreign crate metadata
2833 // decoding as `Span`s cannot be decoded when a `Session` is not available.
2834 pub defaultness_span: Option<Span>,
2835 pub constness: Constness,
2836 pub generics: Generics<'hir>,
2838 /// The trait being implemented, if any.
2839 pub of_trait: Option<TraitRef<'hir>>,
2841 pub self_ty: &'hir Ty<'hir>,
2842 pub items: &'hir [ImplItemRef<'hir>],
2846 pub fn generics(&self) -> Option<&Generics<'_>> {
2848 ItemKind::Fn(_, ref generics, _)
2849 | ItemKind::TyAlias(_, ref generics)
2850 | ItemKind::OpaqueTy(OpaqueTy { ref generics, impl_trait_fn: None, .. })
2851 | ItemKind::Enum(_, ref generics)
2852 | ItemKind::Struct(_, ref generics)
2853 | ItemKind::Union(_, ref generics)
2854 | ItemKind::Trait(_, _, ref generics, _, _)
2855 | ItemKind::Impl(Impl { ref generics, .. }) => generics,
2861 /// A reference from an trait to one of its associated items. This
2862 /// contains the item's id, naturally, but also the item's name and
2863 /// some other high-level details (like whether it is an associated
2864 /// type or method, and whether it is public). This allows other
2865 /// passes to find the impl they want without loading the ID (which
2866 /// means fewer edges in the incremental compilation graph).
2867 #[derive(Encodable, Debug, HashStable_Generic)]
2868 pub struct TraitItemRef {
2869 pub id: TraitItemId,
2870 #[stable_hasher(project(name))]
2872 pub kind: AssocItemKind,
2874 pub defaultness: Defaultness,
2877 /// A reference from an impl to one of its associated items. This
2878 /// contains the item's ID, naturally, but also the item's name and
2879 /// some other high-level details (like whether it is an associated
2880 /// type or method, and whether it is public). This allows other
2881 /// passes to find the impl they want without loading the ID (which
2882 /// means fewer edges in the incremental compilation graph).
2883 #[derive(Debug, HashStable_Generic)]
2884 pub struct ImplItemRef<'hir> {
2886 #[stable_hasher(project(name))]
2888 pub kind: AssocItemKind,
2890 pub vis: Visibility<'hir>,
2891 pub defaultness: Defaultness,
2894 #[derive(Copy, Clone, PartialEq, Encodable, Debug, HashStable_Generic)]
2895 pub enum AssocItemKind {
2897 Fn { has_self: bool },
2901 // The bodies for items are stored "out of line", in a separate
2902 // hashmap in the `Crate`. Here we just record the hir-id of the item
2903 // so it can fetched later.
2904 #[derive(Copy, Clone, PartialEq, Eq, PartialOrd, Ord, Encodable, Debug)]
2905 pub struct ForeignItemId {
2906 pub def_id: LocalDefId,
2909 impl ForeignItemId {
2911 pub fn hir_id(&self) -> HirId {
2912 // Items are always HIR owners.
2913 HirId::make_owner(self.def_id)
2917 /// A reference from a foreign block to one of its items. This
2918 /// contains the item's ID, naturally, but also the item's name and
2919 /// some other high-level details (like whether it is an associated
2920 /// type or method, and whether it is public). This allows other
2921 /// passes to find the impl they want without loading the ID (which
2922 /// means fewer edges in the incremental compilation graph).
2923 #[derive(Debug, HashStable_Generic)]
2924 pub struct ForeignItemRef<'hir> {
2925 pub id: ForeignItemId,
2926 #[stable_hasher(project(name))]
2929 pub vis: Visibility<'hir>,
2933 pub struct ForeignItem<'hir> {
2935 pub attrs: &'hir [Attribute],
2936 pub kind: ForeignItemKind<'hir>,
2937 pub def_id: LocalDefId,
2939 pub vis: Visibility<'hir>,
2942 impl ForeignItem<'_> {
2944 pub fn hir_id(&self) -> HirId {
2945 // Items are always HIR owners.
2946 HirId::make_owner(self.def_id)
2949 pub fn foreign_item_id(&self) -> ForeignItemId {
2950 ForeignItemId { def_id: self.def_id }
2954 /// An item within an `extern` block.
2955 #[derive(Debug, HashStable_Generic)]
2956 pub enum ForeignItemKind<'hir> {
2957 /// A foreign function.
2958 Fn(&'hir FnDecl<'hir>, &'hir [Ident], Generics<'hir>),
2959 /// A foreign static item (`static ext: u8`).
2960 Static(&'hir Ty<'hir>, Mutability),
2965 /// A variable captured by a closure.
2966 #[derive(Debug, Copy, Clone, Encodable, HashStable_Generic)]
2968 // First span where it is accessed (there can be multiple).
2972 // The TraitCandidate's import_ids is empty if the trait is defined in the same module, and
2973 // has length > 0 if the trait is found through an chain of imports, starting with the
2974 // import/use statement in the scope where the trait is used.
2975 #[derive(Encodable, Decodable, Clone, Debug)]
2976 pub struct TraitCandidate {
2978 pub import_ids: SmallVec<[LocalDefId; 1]>,
2981 #[derive(Copy, Clone, Debug, HashStable_Generic)]
2982 pub enum Node<'hir> {
2983 Param(&'hir Param<'hir>),
2984 Item(&'hir Item<'hir>),
2985 ForeignItem(&'hir ForeignItem<'hir>),
2986 TraitItem(&'hir TraitItem<'hir>),
2987 ImplItem(&'hir ImplItem<'hir>),
2988 Variant(&'hir Variant<'hir>),
2989 Field(&'hir StructField<'hir>),
2990 AnonConst(&'hir AnonConst),
2991 Expr(&'hir Expr<'hir>),
2992 Stmt(&'hir Stmt<'hir>),
2993 PathSegment(&'hir PathSegment<'hir>),
2995 TraitRef(&'hir TraitRef<'hir>),
2996 Binding(&'hir Pat<'hir>),
2997 Pat(&'hir Pat<'hir>),
2998 Arm(&'hir Arm<'hir>),
2999 Block(&'hir Block<'hir>),
3000 Local(&'hir Local<'hir>),
3001 MacroDef(&'hir MacroDef<'hir>),
3003 /// `Ctor` refers to the constructor of an enum variant or struct. Only tuple or unit variants
3004 /// with synthesized constructors.
3005 Ctor(&'hir VariantData<'hir>),
3007 Lifetime(&'hir Lifetime),
3008 GenericParam(&'hir GenericParam<'hir>),
3009 Visibility(&'hir Visibility<'hir>),
3011 Crate(&'hir CrateItem<'hir>),
3014 impl<'hir> Node<'hir> {
3015 pub fn ident(&self) -> Option<Ident> {
3017 Node::TraitItem(TraitItem { ident, .. })
3018 | Node::ImplItem(ImplItem { ident, .. })
3019 | Node::ForeignItem(ForeignItem { ident, .. })
3020 | Node::Field(StructField { ident, .. })
3021 | Node::Variant(Variant { ident, .. })
3022 | Node::MacroDef(MacroDef { ident, .. })
3023 | Node::Item(Item { ident, .. }) => Some(*ident),
3028 pub fn fn_decl(&self) -> Option<&FnDecl<'hir>> {
3030 Node::TraitItem(TraitItem { kind: TraitItemKind::Fn(fn_sig, _), .. })
3031 | Node::ImplItem(ImplItem { kind: ImplItemKind::Fn(fn_sig, _), .. })
3032 | Node::Item(Item { kind: ItemKind::Fn(fn_sig, _, _), .. }) => Some(fn_sig.decl),
3033 Node::ForeignItem(ForeignItem { kind: ForeignItemKind::Fn(fn_decl, _, _), .. }) => {
3040 pub fn body_id(&self) -> Option<BodyId> {
3042 Node::TraitItem(TraitItem {
3043 kind: TraitItemKind::Fn(_, TraitFn::Provided(body_id)),
3046 | Node::ImplItem(ImplItem { kind: ImplItemKind::Fn(_, body_id), .. })
3047 | Node::Item(Item { kind: ItemKind::Fn(.., body_id), .. }) => Some(*body_id),
3052 pub fn generics(&self) -> Option<&'hir Generics<'hir>> {
3054 Node::TraitItem(TraitItem { generics, .. })
3055 | Node::ImplItem(ImplItem { generics, .. }) => Some(generics),
3056 Node::Item(item) => item.kind.generics(),
3061 pub fn hir_id(&self) -> Option<HirId> {
3063 Node::Item(Item { def_id, .. })
3064 | Node::TraitItem(TraitItem { def_id, .. })
3065 | Node::ImplItem(ImplItem { def_id, .. })
3066 | Node::ForeignItem(ForeignItem { def_id, .. })
3067 | Node::MacroDef(MacroDef { def_id, .. }) => Some(HirId::make_owner(*def_id)),
3068 Node::Field(StructField { hir_id, .. })
3069 | Node::AnonConst(AnonConst { hir_id, .. })
3070 | Node::Expr(Expr { hir_id, .. })
3071 | Node::Stmt(Stmt { hir_id, .. })
3072 | Node::Ty(Ty { hir_id, .. })
3073 | Node::Binding(Pat { hir_id, .. })
3074 | Node::Pat(Pat { hir_id, .. })
3075 | Node::Arm(Arm { hir_id, .. })
3076 | Node::Block(Block { hir_id, .. })
3077 | Node::Local(Local { hir_id, .. })
3078 | Node::Lifetime(Lifetime { hir_id, .. })
3079 | Node::Param(Param { hir_id, .. })
3080 | Node::GenericParam(GenericParam { hir_id, .. }) => Some(*hir_id),
3081 Node::TraitRef(TraitRef { hir_ref_id, .. }) => Some(*hir_ref_id),
3082 Node::PathSegment(PathSegment { hir_id, .. }) => *hir_id,
3083 Node::Variant(Variant { id, .. }) => Some(*id),
3084 Node::Ctor(variant) => variant.ctor_hir_id(),
3085 Node::Crate(_) | Node::Visibility(_) => None,
3090 // Some nodes are used a lot. Make sure they don't unintentionally get bigger.
3091 #[cfg(target_arch = "x86_64")]
3093 rustc_data_structures::static_assert_size!(super::Block<'static>, 48);
3094 rustc_data_structures::static_assert_size!(super::Expr<'static>, 72);
3095 rustc_data_structures::static_assert_size!(super::Pat<'static>, 88);
3096 rustc_data_structures::static_assert_size!(super::QPath<'static>, 24);
3097 rustc_data_structures::static_assert_size!(super::Ty<'static>, 72);
3099 rustc_data_structures::static_assert_size!(super::Item<'static>, 200);
3100 rustc_data_structures::static_assert_size!(super::TraitItem<'static>, 144);
3101 rustc_data_structures::static_assert_size!(super::ImplItem<'static>, 168);
3102 rustc_data_structures::static_assert_size!(super::ForeignItem<'static>, 152);