1 //! The Rust abstract syntax tree module.
3 //! This module contains common structures forming the language AST.
4 //! Two main entities in the module are [`Item`] (which represents an AST element with
5 //! additional metadata), and [`ItemKind`] (which represents a concrete type and contains
6 //! information specific to the type of the item).
8 //! Other module items worth mentioning:
9 //! - [`Ty`] and [`TyKind`]: A parsed Rust type.
10 //! - [`Expr`] and [`ExprKind`]: A parsed Rust expression.
11 //! - [`Pat`] and [`PatKind`]: A parsed Rust pattern. Patterns are often dual to expressions.
12 //! - [`Stmt`] and [`StmtKind`]: An executable action that does not return a value.
13 //! - [`FnDecl`], [`FnHeader`] and [`Param`]: Metadata associated with a function declaration.
14 //! - [`Generics`], [`GenericParam`], [`WhereClause`]: Metadata associated with generic parameters.
15 //! - [`EnumDef`] and [`Variant`]: Enum declaration.
16 //! - [`Lit`] and [`LitKind`]: Literal expressions.
17 //! - [`MacroDef`], [`MacStmtStyle`], [`MacCall`], [`MacDelimiter`]: Macro definition and invocation.
18 //! - [`Attribute`]: Metadata associated with item.
19 //! - [`UnOp`], [`BinOp`], and [`BinOpKind`]: Unary and binary operators.
21 pub use crate::util::parser::ExprPrecedence;
22 pub use GenericArgs::*;
23 pub use UnsafeSource::*;
26 use crate::token::{self, CommentKind, DelimToken};
27 use crate::tokenstream::{DelimSpan, TokenStream, TokenTree};
29 use rustc_data_structures::stable_hasher::{HashStable, StableHasher};
30 use rustc_data_structures::sync::Lrc;
31 use rustc_data_structures::thin_vec::ThinVec;
32 use rustc_macros::HashStable_Generic;
33 use rustc_serialize::{self, Decoder, Encoder};
34 use rustc_span::source_map::{respan, Spanned};
35 use rustc_span::symbol::{kw, sym, Ident, Symbol};
36 use rustc_span::{Span, DUMMY_SP};
38 use std::cmp::Ordering;
39 use std::convert::TryFrom;
46 /// A "Label" is an identifier of some point in sources,
47 /// e.g. in the following code:
55 /// `'outer` is a label.
56 #[derive(Clone, Encodable, Decodable, Copy, HashStable_Generic)]
61 impl fmt::Debug for Label {
62 fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
63 write!(f, "label({:?})", self.ident)
67 /// A "Lifetime" is an annotation of the scope in which variable
68 /// can be used, e.g. `'a` in `&'a i32`.
69 #[derive(Clone, Encodable, Decodable, Copy)]
75 impl fmt::Debug for Lifetime {
76 fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
77 write!(f, "lifetime({}: {})", self.id, self)
81 impl fmt::Display for Lifetime {
82 fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
83 write!(f, "{}", self.ident.name)
87 /// A "Path" is essentially Rust's notion of a name.
89 /// It's represented as a sequence of identifiers,
90 /// along with a bunch of supporting information.
92 /// E.g., `std::cmp::PartialEq`.
93 #[derive(Clone, Encodable, Decodable, Debug)]
96 /// The segments in the path: the things separated by `::`.
97 /// Global paths begin with `kw::PathRoot`.
98 pub segments: Vec<PathSegment>,
101 impl PartialEq<Symbol> for Path {
102 fn eq(&self, symbol: &Symbol) -> bool {
103 self.segments.len() == 1 && { self.segments[0].ident.name == *symbol }
107 impl<CTX> HashStable<CTX> for Path {
108 fn hash_stable(&self, hcx: &mut CTX, hasher: &mut StableHasher) {
109 self.segments.len().hash_stable(hcx, hasher);
110 for segment in &self.segments {
111 segment.ident.name.hash_stable(hcx, hasher);
117 // Convert a span and an identifier to the corresponding
119 pub fn from_ident(ident: Ident) -> Path {
120 Path { segments: vec![PathSegment::from_ident(ident)], span: ident.span }
123 pub fn is_global(&self) -> bool {
124 !self.segments.is_empty() && self.segments[0].ident.name == kw::PathRoot
128 /// A segment of a path: an identifier, an optional lifetime, and a set of types.
130 /// E.g., `std`, `String` or `Box<T>`.
131 #[derive(Clone, Encodable, Decodable, Debug)]
132 pub struct PathSegment {
133 /// The identifier portion of this path segment.
138 /// Type/lifetime parameters attached to this path. They come in
139 /// two flavors: `Path<A,B,C>` and `Path(A,B) -> C`.
140 /// `None` means that no parameter list is supplied (`Path`),
141 /// `Some` means that parameter list is supplied (`Path<X, Y>`)
142 /// but it can be empty (`Path<>`).
143 /// `P` is used as a size optimization for the common case with no parameters.
144 pub args: Option<P<GenericArgs>>,
148 pub fn from_ident(ident: Ident) -> Self {
149 PathSegment { ident, id: DUMMY_NODE_ID, args: None }
151 pub fn path_root(span: Span) -> Self {
152 PathSegment::from_ident(Ident::new(kw::PathRoot, span))
156 /// The arguments of a path segment.
158 /// E.g., `<A, B>` as in `Foo<A, B>` or `(A, B)` as in `Foo(A, B)`.
159 #[derive(Clone, Encodable, Decodable, Debug)]
160 pub enum GenericArgs {
161 /// The `<'a, A, B, C>` in `foo::bar::baz::<'a, A, B, C>`.
162 AngleBracketed(AngleBracketedArgs),
163 /// The `(A, B)` and `C` in `Foo(A, B) -> C`.
164 Parenthesized(ParenthesizedArgs),
168 pub fn is_parenthesized(&self) -> bool {
170 Parenthesized(..) => true,
175 pub fn is_angle_bracketed(&self) -> bool {
177 AngleBracketed(..) => true,
182 pub fn span(&self) -> Span {
184 AngleBracketed(ref data) => data.span,
185 Parenthesized(ref data) => data.span,
190 /// Concrete argument in the sequence of generic args.
191 #[derive(Clone, Encodable, Decodable, Debug)]
192 pub enum GenericArg {
193 /// `'a` in `Foo<'a>`
195 /// `Bar` in `Foo<Bar>`
202 pub fn span(&self) -> Span {
204 GenericArg::Lifetime(lt) => lt.ident.span,
205 GenericArg::Type(ty) => ty.span,
206 GenericArg::Const(ct) => ct.value.span,
211 /// A path like `Foo<'a, T>`.
212 #[derive(Clone, Encodable, Decodable, Debug, Default)]
213 pub struct AngleBracketedArgs {
214 /// The overall span.
216 /// The comma separated parts in the `<...>`.
217 pub args: Vec<AngleBracketedArg>,
220 /// Either an argument for a parameter e.g., `'a`, `Vec<u8>`, `0`,
221 /// or a constraint on an associated item, e.g., `Item = String` or `Item: Bound`.
222 #[derive(Clone, Encodable, Decodable, Debug)]
223 pub enum AngleBracketedArg {
224 /// Argument for a generic parameter.
226 /// Constraint for an associated item.
227 Constraint(AssocTyConstraint),
230 impl Into<Option<P<GenericArgs>>> for AngleBracketedArgs {
231 fn into(self) -> Option<P<GenericArgs>> {
232 Some(P(GenericArgs::AngleBracketed(self)))
236 impl Into<Option<P<GenericArgs>>> for ParenthesizedArgs {
237 fn into(self) -> Option<P<GenericArgs>> {
238 Some(P(GenericArgs::Parenthesized(self)))
242 /// A path like `Foo(A, B) -> C`.
243 #[derive(Clone, Encodable, Decodable, Debug)]
244 pub struct ParenthesizedArgs {
249 pub inputs: Vec<P<Ty>>,
255 impl ParenthesizedArgs {
256 pub fn as_angle_bracketed_args(&self) -> AngleBracketedArgs {
261 .map(|input| AngleBracketedArg::Arg(GenericArg::Type(input)))
263 AngleBracketedArgs { span: self.span, args }
267 pub use crate::node_id::{NodeId, CRATE_NODE_ID, DUMMY_NODE_ID};
269 /// A modifier on a bound, e.g., `?Sized` or `?const Trait`.
271 /// Negative bounds should also be handled here.
272 #[derive(Copy, Clone, PartialEq, Eq, Encodable, Decodable, Debug)]
273 pub enum TraitBoundModifier {
285 // This parses but will be rejected during AST validation.
289 /// The AST represents all type param bounds as types.
290 /// `typeck::collect::compute_bounds` matches these against
291 /// the "special" built-in traits (see `middle::lang_items`) and
292 /// detects `Copy`, `Send` and `Sync`.
293 #[derive(Clone, Encodable, Decodable, Debug)]
294 pub enum GenericBound {
295 Trait(PolyTraitRef, TraitBoundModifier),
300 pub fn span(&self) -> Span {
302 GenericBound::Trait(ref t, ..) => t.span,
303 GenericBound::Outlives(ref l) => l.ident.span,
308 pub type GenericBounds = Vec<GenericBound>;
310 /// Specifies the enforced ordering for generic parameters. In the future,
311 /// if we wanted to relax this order, we could override `PartialEq` and
312 /// `PartialOrd`, to allow the kinds to be unordered.
313 #[derive(Hash, Clone, Copy)]
314 pub enum ParamKindOrd {
317 // `unordered` is only `true` if `sess.has_features().const_generics`
318 // is active. Specifically, if it's only `min_const_generics`, it will still require
319 // ordering consts after types.
320 Const { unordered: bool },
323 impl Ord for ParamKindOrd {
324 fn cmp(&self, other: &Self) -> Ordering {
326 let to_int = |v| match v {
328 Type | Const { unordered: true } => 1,
329 // technically both consts should be ordered equally,
330 // but only one is ever encountered at a time, so this is
332 Const { unordered: false } => 2,
335 to_int(*self).cmp(&to_int(*other))
338 impl PartialOrd for ParamKindOrd {
339 fn partial_cmp(&self, other: &Self) -> Option<Ordering> {
340 Some(self.cmp(other))
343 impl PartialEq for ParamKindOrd {
344 fn eq(&self, other: &Self) -> bool {
345 self.cmp(other) == Ordering::Equal
348 impl Eq for ParamKindOrd {}
350 impl fmt::Display for ParamKindOrd {
351 fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
353 ParamKindOrd::Lifetime => "lifetime".fmt(f),
354 ParamKindOrd::Type => "type".fmt(f),
355 ParamKindOrd::Const { .. } => "const".fmt(f),
360 #[derive(Clone, Encodable, Decodable, Debug)]
361 pub enum GenericParamKind {
362 /// A lifetime definition (e.g., `'a: 'b + 'c + 'd`).
365 default: Option<P<Ty>>,
369 /// Span of the `const` keyword.
374 #[derive(Clone, Encodable, Decodable, Debug)]
375 pub struct GenericParam {
379 pub bounds: GenericBounds,
380 pub is_placeholder: bool,
381 pub kind: GenericParamKind,
384 /// Represents lifetime, type and const parameters attached to a declaration of
385 /// a function, enum, trait, etc.
386 #[derive(Clone, Encodable, Decodable, Debug)]
387 pub struct Generics {
388 pub params: Vec<GenericParam>,
389 pub where_clause: WhereClause,
393 impl Default for Generics {
394 /// Creates an instance of `Generics`.
395 fn default() -> Generics {
398 where_clause: WhereClause {
399 has_where_token: false,
400 predicates: Vec::new(),
408 /// A where-clause in a definition.
409 #[derive(Clone, Encodable, Decodable, Debug)]
410 pub struct WhereClause {
411 /// `true` if we ate a `where` token: this can happen
412 /// if we parsed no predicates (e.g. `struct Foo where {}`).
413 /// This allows us to accurately pretty-print
414 /// in `nt_to_tokenstream`
415 pub has_where_token: bool,
416 pub predicates: Vec<WherePredicate>,
420 /// A single predicate in a where-clause.
421 #[derive(Clone, Encodable, Decodable, Debug)]
422 pub enum WherePredicate {
423 /// A type binding (e.g., `for<'c> Foo: Send + Clone + 'c`).
424 BoundPredicate(WhereBoundPredicate),
425 /// A lifetime predicate (e.g., `'a: 'b + 'c`).
426 RegionPredicate(WhereRegionPredicate),
427 /// An equality predicate (unsupported).
428 EqPredicate(WhereEqPredicate),
431 impl WherePredicate {
432 pub fn span(&self) -> Span {
434 &WherePredicate::BoundPredicate(ref p) => p.span,
435 &WherePredicate::RegionPredicate(ref p) => p.span,
436 &WherePredicate::EqPredicate(ref p) => p.span,
443 /// E.g., `for<'c> Foo: Send + Clone + 'c`.
444 #[derive(Clone, Encodable, Decodable, Debug)]
445 pub struct WhereBoundPredicate {
447 /// Any generics from a `for` binding.
448 pub bound_generic_params: Vec<GenericParam>,
449 /// The type being bounded.
450 pub bounded_ty: P<Ty>,
451 /// Trait and lifetime bounds (`Clone + Send + 'static`).
452 pub bounds: GenericBounds,
455 /// A lifetime predicate.
457 /// E.g., `'a: 'b + 'c`.
458 #[derive(Clone, Encodable, Decodable, Debug)]
459 pub struct WhereRegionPredicate {
461 pub lifetime: Lifetime,
462 pub bounds: GenericBounds,
465 /// An equality predicate (unsupported).
468 #[derive(Clone, Encodable, Decodable, Debug)]
469 pub struct WhereEqPredicate {
476 #[derive(Clone, Encodable, Decodable, Debug)]
479 pub attrs: Vec<Attribute>,
481 /// The order of items in the HIR is unrelated to the order of
482 /// items in the AST. However, we generate proc macro harnesses
483 /// based on the AST order, and later refer to these harnesses
484 /// from the HIR. This field keeps track of the order in which
485 /// we generated proc macros harnesses, so that we can map
486 /// HIR proc macros items back to their harness items.
487 pub proc_macros: Vec<NodeId>,
490 /// Possible values inside of compile-time attribute lists.
492 /// E.g., the '..' in `#[name(..)]`.
493 #[derive(Clone, Encodable, Decodable, Debug, HashStable_Generic)]
494 pub enum NestedMetaItem {
495 /// A full MetaItem, for recursive meta items.
499 /// E.g., `"foo"`, `64`, `true`.
503 /// A spanned compile-time attribute item.
505 /// E.g., `#[test]`, `#[derive(..)]`, `#[rustfmt::skip]` or `#[feature = "foo"]`.
506 #[derive(Clone, Encodable, Decodable, Debug, HashStable_Generic)]
507 pub struct MetaItem {
509 pub kind: MetaItemKind,
513 /// A compile-time attribute item.
515 /// E.g., `#[test]`, `#[derive(..)]` or `#[feature = "foo"]`.
516 #[derive(Clone, Encodable, Decodable, Debug, HashStable_Generic)]
517 pub enum MetaItemKind {
520 /// E.g., `test` as in `#[test]`.
524 /// E.g., `derive(..)` as in `#[derive(..)]`.
525 List(Vec<NestedMetaItem>),
526 /// Name value meta item.
528 /// E.g., `feature = "foo"` as in `#[feature = "foo"]`.
532 /// A block (`{ .. }`).
534 /// E.g., `{ .. }` as in `fn foo() { .. }`.
535 #[derive(Clone, Encodable, Decodable, Debug)]
537 /// The statements in the block.
538 pub stmts: Vec<Stmt>,
540 /// Distinguishes between `unsafe { ... }` and `{ ... }`.
541 pub rules: BlockCheckMode,
547 /// Patterns appear in match statements and some other contexts, such as `let` and `if let`.
548 #[derive(Clone, Encodable, Decodable, Debug)]
553 pub tokens: Option<TokenStream>,
557 /// Attempt reparsing the pattern as a type.
558 /// This is intended for use by diagnostics.
559 pub fn to_ty(&self) -> Option<P<Ty>> {
560 let kind = match &self.kind {
561 // In a type expression `_` is an inference variable.
562 PatKind::Wild => TyKind::Infer,
563 // An IDENT pattern with no binding mode would be valid as path to a type. E.g. `u32`.
564 PatKind::Ident(BindingMode::ByValue(Mutability::Not), ident, None) => {
565 TyKind::Path(None, Path::from_ident(*ident))
567 PatKind::Path(qself, path) => TyKind::Path(qself.clone(), path.clone()),
568 PatKind::MacCall(mac) => TyKind::MacCall(mac.clone()),
569 // `&mut? P` can be reinterpreted as `&mut? T` where `T` is `P` reparsed as a type.
570 PatKind::Ref(pat, mutbl) => {
571 pat.to_ty().map(|ty| TyKind::Rptr(None, MutTy { ty, mutbl: *mutbl }))?
573 // A slice/array pattern `[P]` can be reparsed as `[T]`, an unsized array,
574 // when `P` can be reparsed as a type `T`.
575 PatKind::Slice(pats) if pats.len() == 1 => pats[0].to_ty().map(TyKind::Slice)?,
576 // A tuple pattern `(P0, .., Pn)` can be reparsed as `(T0, .., Tn)`
577 // assuming `T0` to `Tn` are all syntactically valid as types.
578 PatKind::Tuple(pats) => {
579 let mut tys = Vec::with_capacity(pats.len());
580 // FIXME(#48994) - could just be collected into an Option<Vec>
582 tys.push(pat.to_ty()?);
589 Some(P(Ty { kind, id: self.id, span: self.span }))
592 /// Walk top-down and call `it` in each place where a pattern occurs
593 /// starting with the root pattern `walk` is called on. If `it` returns
594 /// false then we will descend no further but siblings will be processed.
595 pub fn walk(&self, it: &mut impl FnMut(&Pat) -> bool) {
601 // Walk into the pattern associated with `Ident` (if any).
602 PatKind::Ident(_, _, Some(p)) => p.walk(it),
604 // Walk into each field of struct.
605 PatKind::Struct(_, fields, _) => fields.iter().for_each(|field| field.pat.walk(it)),
607 // Sequence of patterns.
608 PatKind::TupleStruct(_, s) | PatKind::Tuple(s) | PatKind::Slice(s) | PatKind::Or(s) => {
609 s.iter().for_each(|p| p.walk(it))
612 // Trivial wrappers over inner patterns.
613 PatKind::Box(s) | PatKind::Ref(s, _) | PatKind::Paren(s) => s.walk(it),
615 // These patterns do not contain subpatterns, skip.
622 | PatKind::MacCall(_) => {}
626 /// Is this a `..` pattern?
627 pub fn is_rest(&self) -> bool {
629 PatKind::Rest => true,
635 /// A single field in a struct pattern
637 /// Patterns like the fields of Foo `{ x, ref y, ref mut z }`
638 /// are treated the same as` x: x, y: ref y, z: ref mut z`,
639 /// except is_shorthand is true
640 #[derive(Clone, Encodable, Decodable, Debug)]
641 pub struct FieldPat {
642 /// The identifier for the field
644 /// The pattern the field is destructured to
646 pub is_shorthand: bool,
650 pub is_placeholder: bool,
653 #[derive(Clone, PartialEq, Encodable, Decodable, Debug, Copy)]
654 pub enum BindingMode {
659 #[derive(Clone, Encodable, Decodable, Debug)]
661 Included(RangeSyntax),
665 #[derive(Clone, Encodable, Decodable, Debug)]
666 pub enum RangeSyntax {
673 #[derive(Clone, Encodable, Decodable, Debug)]
675 /// Represents a wildcard pattern (`_`).
678 /// A `PatKind::Ident` may either be a new bound variable (`ref mut binding @ OPT_SUBPATTERN`),
679 /// or a unit struct/variant pattern, or a const pattern (in the last two cases the third
680 /// field must be `None`). Disambiguation cannot be done with parser alone, so it happens
681 /// during name resolution.
682 Ident(BindingMode, Ident, Option<P<Pat>>),
684 /// A struct or struct variant pattern (e.g., `Variant {x, y, ..}`).
685 /// The `bool` is `true` in the presence of a `..`.
686 Struct(Path, Vec<FieldPat>, /* recovered */ bool),
688 /// A tuple struct/variant pattern (`Variant(x, y, .., z)`).
689 TupleStruct(Path, Vec<P<Pat>>),
691 /// An or-pattern `A | B | C`.
692 /// Invariant: `pats.len() >= 2`.
695 /// A possibly qualified path pattern.
696 /// Unqualified path patterns `A::B::C` can legally refer to variants, structs, constants
697 /// or associated constants. Qualified path patterns `<A>::B::C`/`<A as Trait>::B::C` can
698 /// only legally refer to associated constants.
699 Path(Option<QSelf>, Path),
701 /// A tuple pattern (`(a, b)`).
707 /// A reference pattern (e.g., `&mut (a, b)`).
708 Ref(P<Pat>, Mutability),
713 /// A range pattern (e.g., `1...2`, `1..=2` or `1..2`).
714 Range(Option<P<Expr>>, Option<P<Expr>>, Spanned<RangeEnd>),
716 /// A slice pattern `[a, b, c]`.
719 /// A rest pattern `..`.
721 /// Syntactically it is valid anywhere.
723 /// Semantically however, it only has meaning immediately inside:
724 /// - a slice pattern: `[a, .., b]`,
725 /// - a binding pattern immediately inside a slice pattern: `[a, r @ ..]`,
726 /// - a tuple pattern: `(a, .., b)`,
727 /// - a tuple struct/variant pattern: `$path(a, .., b)`.
729 /// In all of these cases, an additional restriction applies,
730 /// only one rest pattern may occur in the pattern sequences.
733 /// Parentheses in patterns used for grouping (i.e., `(PAT)`).
736 /// A macro pattern; pre-expansion.
740 #[derive(Clone, PartialEq, Eq, PartialOrd, Ord, Hash, Debug, Copy)]
741 #[derive(HashStable_Generic, Encodable, Decodable)]
742 pub enum Mutability {
748 /// Returns `MutMutable` only if both `self` and `other` are mutable.
749 pub fn and(self, other: Self) -> Self {
751 Mutability::Mut => other,
752 Mutability::Not => Mutability::Not,
756 pub fn invert(self) -> Self {
758 Mutability::Mut => Mutability::Not,
759 Mutability::Not => Mutability::Mut,
763 pub fn prefix_str(&self) -> &'static str {
765 Mutability::Mut => "mut ",
766 Mutability::Not => "",
771 /// The kind of borrow in an `AddrOf` expression,
772 /// e.g., `&place` or `&raw const place`.
773 #[derive(Clone, Copy, PartialEq, Eq, Debug)]
774 #[derive(Encodable, Decodable, HashStable_Generic)]
775 pub enum BorrowKind {
776 /// A normal borrow, `&$expr` or `&mut $expr`.
777 /// The resulting type is either `&'a T` or `&'a mut T`
778 /// where `T = typeof($expr)` and `'a` is some lifetime.
780 /// A raw borrow, `&raw const $expr` or `&raw mut $expr`.
781 /// The resulting type is either `*const T` or `*mut T`
782 /// where `T = typeof($expr)`.
786 #[derive(Clone, PartialEq, Encodable, Decodable, Debug, Copy)]
788 /// The `+` operator (addition)
790 /// The `-` operator (subtraction)
792 /// The `*` operator (multiplication)
794 /// The `/` operator (division)
796 /// The `%` operator (modulus)
798 /// The `&&` operator (logical and)
800 /// The `||` operator (logical or)
802 /// The `^` operator (bitwise xor)
804 /// The `&` operator (bitwise and)
806 /// The `|` operator (bitwise or)
808 /// The `<<` operator (shift left)
810 /// The `>>` operator (shift right)
812 /// The `==` operator (equality)
814 /// The `<` operator (less than)
816 /// The `<=` operator (less than or equal to)
818 /// The `!=` operator (not equal to)
820 /// The `>=` operator (greater than or equal to)
822 /// The `>` operator (greater than)
827 pub fn to_string(&self) -> &'static str {
850 pub fn lazy(&self) -> bool {
852 BinOpKind::And | BinOpKind::Or => true,
857 pub fn is_shift(&self) -> bool {
859 BinOpKind::Shl | BinOpKind::Shr => true,
864 pub fn is_comparison(&self) -> bool {
866 // Note for developers: please keep this as is;
867 // we want compilation to fail if another variant is added.
869 Eq | Lt | Le | Ne | Gt | Ge => true,
870 And | Or | Add | Sub | Mul | Div | Rem | BitXor | BitAnd | BitOr | Shl | Shr => false,
874 /// Returns `true` if the binary operator takes its arguments by value
875 pub fn is_by_value(&self) -> bool {
876 !self.is_comparison()
880 pub type BinOp = Spanned<BinOpKind>;
884 /// Note that `&data` is not an operator, it's an `AddrOf` expression.
885 #[derive(Clone, Encodable, Decodable, Debug, Copy)]
887 /// The `*` operator for dereferencing
889 /// The `!` operator for logical inversion
891 /// The `-` operator for negation
896 /// Returns `true` if the unary operator takes its argument by value
897 pub fn is_by_value(u: UnOp) -> bool {
899 UnOp::Neg | UnOp::Not => true,
904 pub fn to_string(op: UnOp) -> &'static str {
914 #[derive(Clone, Encodable, Decodable, Debug)]
922 pub fn add_trailing_semicolon(mut self) -> Self {
923 self.kind = match self.kind {
924 StmtKind::Expr(expr) => StmtKind::Semi(expr),
925 StmtKind::MacCall(mac) => {
926 StmtKind::MacCall(mac.map(|MacCallStmt { mac, style: _, attrs }| MacCallStmt {
928 style: MacStmtStyle::Semicolon,
937 pub fn is_item(&self) -> bool {
939 StmtKind::Item(_) => true,
944 pub fn is_expr(&self) -> bool {
946 StmtKind::Expr(_) => true,
952 #[derive(Clone, Encodable, Decodable, Debug)]
954 /// A local (let) binding.
956 /// An item definition.
958 /// Expr without trailing semi-colon.
960 /// Expr with a trailing semi-colon.
962 /// Just a trailing semi-colon.
965 MacCall(P<MacCallStmt>),
968 #[derive(Clone, Encodable, Decodable, Debug)]
969 pub struct MacCallStmt {
971 pub style: MacStmtStyle,
975 #[derive(Clone, Copy, PartialEq, Encodable, Decodable, Debug)]
976 pub enum MacStmtStyle {
977 /// The macro statement had a trailing semicolon (e.g., `foo! { ... };`
978 /// `foo!(...);`, `foo![...];`).
980 /// The macro statement had braces (e.g., `foo! { ... }`).
982 /// The macro statement had parentheses or brackets and no semicolon (e.g.,
983 /// `foo!(...)`). All of these will end up being converted into macro
988 /// Local represents a `let` statement, e.g., `let <pat>:<ty> = <expr>;`.
989 #[derive(Clone, Encodable, Decodable, Debug)]
993 pub ty: Option<P<Ty>>,
994 /// Initializer expression to set the value, if any.
995 pub init: Option<P<Expr>>,
1000 /// An arm of a 'match'.
1002 /// E.g., `0..=10 => { println!("match!") }` as in
1006 /// 0..=10 => { println!("match!") },
1007 /// _ => { println!("no match!") },
1010 #[derive(Clone, Encodable, Decodable, Debug)]
1012 pub attrs: Vec<Attribute>,
1013 /// Match arm pattern, e.g. `10` in `match foo { 10 => {}, _ => {} }`
1015 /// Match arm guard, e.g. `n > 10` in `match foo { n if n > 10 => {}, _ => {} }`
1016 pub guard: Option<P<Expr>>,
1021 pub is_placeholder: bool,
1024 /// Access of a named (e.g., `obj.foo`) or unnamed (e.g., `obj.0`) struct field.
1025 #[derive(Clone, Encodable, Decodable, Debug)]
1032 pub is_shorthand: bool,
1033 pub is_placeholder: bool,
1036 #[derive(Clone, PartialEq, Encodable, Decodable, Debug, Copy)]
1037 pub enum BlockCheckMode {
1039 Unsafe(UnsafeSource),
1042 #[derive(Clone, PartialEq, Encodable, Decodable, Debug, Copy)]
1043 pub enum UnsafeSource {
1048 /// A constant (expression) that's not an item or associated item,
1049 /// but needs its own `DefId` for type-checking, const-eval, etc.
1050 /// These are usually found nested inside types (e.g., array lengths)
1051 /// or expressions (e.g., repeat counts), and also used to define
1052 /// explicit discriminant values for enum variants.
1053 #[derive(Clone, Encodable, Decodable, Debug)]
1054 pub struct AnonConst {
1060 #[derive(Clone, Encodable, Decodable, Debug)]
1066 pub tokens: Option<TokenStream>,
1069 // `Expr` is used a lot. Make sure it doesn't unintentionally get bigger.
1070 #[cfg(target_arch = "x86_64")]
1071 rustc_data_structures::static_assert_size!(Expr, 104);
1074 /// Returns `true` if this expression would be valid somewhere that expects a value;
1075 /// for example, an `if` condition.
1076 pub fn returns(&self) -> bool {
1077 if let ExprKind::Block(ref block, _) = self.kind {
1078 match block.stmts.last().map(|last_stmt| &last_stmt.kind) {
1080 Some(&StmtKind::Expr(_)) => true,
1081 Some(&StmtKind::Semi(ref expr)) => {
1082 if let ExprKind::Ret(_) = expr.kind {
1083 // Last statement is explicit return.
1089 // This is a block that doesn't end in either an implicit or explicit return.
1093 // This is not a block, it is a value.
1098 /// Is this expr either `N`, or `{ N }`.
1100 /// If this is not the case, name resolution does not resolve `N` when using
1101 /// `feature(min_const_generics)` as more complex expressions are not supported.
1102 pub fn is_potential_trivial_const_param(&self) -> bool {
1103 let this = if let ExprKind::Block(ref block, None) = self.kind {
1104 if block.stmts.len() == 1 {
1105 if let StmtKind::Expr(ref expr) = block.stmts[0].kind { expr } else { self }
1113 if let ExprKind::Path(None, ref path) = this.kind {
1114 if path.segments.len() == 1 && path.segments[0].args.is_none() {
1122 pub fn to_bound(&self) -> Option<GenericBound> {
1124 ExprKind::Path(None, path) => Some(GenericBound::Trait(
1125 PolyTraitRef::new(Vec::new(), path.clone(), self.span),
1126 TraitBoundModifier::None,
1132 /// Attempts to reparse as `Ty` (for diagnostic purposes).
1133 pub fn to_ty(&self) -> Option<P<Ty>> {
1134 let kind = match &self.kind {
1135 // Trivial conversions.
1136 ExprKind::Path(qself, path) => TyKind::Path(qself.clone(), path.clone()),
1137 ExprKind::MacCall(mac) => TyKind::MacCall(mac.clone()),
1139 ExprKind::Paren(expr) => expr.to_ty().map(TyKind::Paren)?,
1141 ExprKind::AddrOf(BorrowKind::Ref, mutbl, expr) => {
1142 expr.to_ty().map(|ty| TyKind::Rptr(None, MutTy { ty, mutbl: *mutbl }))?
1145 ExprKind::Repeat(expr, expr_len) => {
1146 expr.to_ty().map(|ty| TyKind::Array(ty, expr_len.clone()))?
1149 ExprKind::Array(exprs) if exprs.len() == 1 => exprs[0].to_ty().map(TyKind::Slice)?,
1151 ExprKind::Tup(exprs) => {
1152 let tys = exprs.iter().map(|expr| expr.to_ty()).collect::<Option<Vec<_>>>()?;
1156 // If binary operator is `Add` and both `lhs` and `rhs` are trait bounds,
1157 // then type of result is trait object.
1158 // Otherwise we don't assume the result type.
1159 ExprKind::Binary(binop, lhs, rhs) if binop.node == BinOpKind::Add => {
1160 if let (Some(lhs), Some(rhs)) = (lhs.to_bound(), rhs.to_bound()) {
1161 TyKind::TraitObject(vec![lhs, rhs], TraitObjectSyntax::None)
1167 // This expression doesn't look like a type syntactically.
1171 Some(P(Ty { kind, id: self.id, span: self.span }))
1174 pub fn precedence(&self) -> ExprPrecedence {
1176 ExprKind::Box(_) => ExprPrecedence::Box,
1177 ExprKind::Array(_) => ExprPrecedence::Array,
1178 ExprKind::Call(..) => ExprPrecedence::Call,
1179 ExprKind::MethodCall(..) => ExprPrecedence::MethodCall,
1180 ExprKind::Tup(_) => ExprPrecedence::Tup,
1181 ExprKind::Binary(op, ..) => ExprPrecedence::Binary(op.node),
1182 ExprKind::Unary(..) => ExprPrecedence::Unary,
1183 ExprKind::Lit(_) => ExprPrecedence::Lit,
1184 ExprKind::Type(..) | ExprKind::Cast(..) => ExprPrecedence::Cast,
1185 ExprKind::Let(..) => ExprPrecedence::Let,
1186 ExprKind::If(..) => ExprPrecedence::If,
1187 ExprKind::While(..) => ExprPrecedence::While,
1188 ExprKind::ForLoop(..) => ExprPrecedence::ForLoop,
1189 ExprKind::Loop(..) => ExprPrecedence::Loop,
1190 ExprKind::Match(..) => ExprPrecedence::Match,
1191 ExprKind::Closure(..) => ExprPrecedence::Closure,
1192 ExprKind::Block(..) => ExprPrecedence::Block,
1193 ExprKind::TryBlock(..) => ExprPrecedence::TryBlock,
1194 ExprKind::Async(..) => ExprPrecedence::Async,
1195 ExprKind::Await(..) => ExprPrecedence::Await,
1196 ExprKind::Assign(..) => ExprPrecedence::Assign,
1197 ExprKind::AssignOp(..) => ExprPrecedence::AssignOp,
1198 ExprKind::Field(..) => ExprPrecedence::Field,
1199 ExprKind::Index(..) => ExprPrecedence::Index,
1200 ExprKind::Range(..) => ExprPrecedence::Range,
1201 ExprKind::Path(..) => ExprPrecedence::Path,
1202 ExprKind::AddrOf(..) => ExprPrecedence::AddrOf,
1203 ExprKind::Break(..) => ExprPrecedence::Break,
1204 ExprKind::Continue(..) => ExprPrecedence::Continue,
1205 ExprKind::Ret(..) => ExprPrecedence::Ret,
1206 ExprKind::InlineAsm(..) | ExprKind::LlvmInlineAsm(..) => ExprPrecedence::InlineAsm,
1207 ExprKind::MacCall(..) => ExprPrecedence::Mac,
1208 ExprKind::Struct(..) => ExprPrecedence::Struct,
1209 ExprKind::Repeat(..) => ExprPrecedence::Repeat,
1210 ExprKind::Paren(..) => ExprPrecedence::Paren,
1211 ExprKind::Try(..) => ExprPrecedence::Try,
1212 ExprKind::Yield(..) => ExprPrecedence::Yield,
1213 ExprKind::Err => ExprPrecedence::Err,
1218 /// Limit types of a range (inclusive or exclusive)
1219 #[derive(Copy, Clone, PartialEq, Encodable, Decodable, Debug)]
1220 pub enum RangeLimits {
1221 /// Inclusive at the beginning, exclusive at the end
1223 /// Inclusive at the beginning and end
1227 #[derive(Clone, Encodable, Decodable, Debug)]
1229 /// A `box x` expression.
1231 /// An array (`[a, b, c, d]`)
1232 Array(Vec<P<Expr>>),
1235 /// The first field resolves to the function itself,
1236 /// and the second field is the list of arguments.
1237 /// This also represents calling the constructor of
1238 /// tuple-like ADTs such as tuple structs and enum variants.
1239 Call(P<Expr>, Vec<P<Expr>>),
1240 /// A method call (`x.foo::<'static, Bar, Baz>(a, b, c, d)`)
1242 /// The `PathSegment` represents the method name and its generic arguments
1243 /// (within the angle brackets).
1244 /// The first element of the vector of an `Expr` is the expression that evaluates
1245 /// to the object on which the method is being called on (the receiver),
1246 /// and the remaining elements are the rest of the arguments.
1247 /// Thus, `x.foo::<Bar, Baz>(a, b, c, d)` is represented as
1248 /// `ExprKind::MethodCall(PathSegment { foo, [Bar, Baz] }, [x, a, b, c, d])`.
1249 /// This `Span` is the span of the function, without the dot and receiver
1250 /// (e.g. `foo(a, b)` in `x.foo(a, b)`
1251 MethodCall(PathSegment, Vec<P<Expr>>, Span),
1252 /// A tuple (e.g., `(a, b, c, d)`).
1254 /// A binary operation (e.g., `a + b`, `a * b`).
1255 Binary(BinOp, P<Expr>, P<Expr>),
1256 /// A unary operation (e.g., `!x`, `*x`).
1257 Unary(UnOp, P<Expr>),
1258 /// A literal (e.g., `1`, `"foo"`).
1260 /// A cast (e.g., `foo as f64`).
1261 Cast(P<Expr>, P<Ty>),
1262 /// A type ascription (e.g., `42: usize`).
1263 Type(P<Expr>, P<Ty>),
1264 /// A `let pat = expr` expression that is only semantically allowed in the condition
1265 /// of `if` / `while` expressions. (e.g., `if let 0 = x { .. }`).
1266 Let(P<Pat>, P<Expr>),
1267 /// An `if` block, with an optional `else` block.
1269 /// `if expr { block } else { expr }`
1270 If(P<Expr>, P<Block>, Option<P<Expr>>),
1271 /// A while loop, with an optional label.
1273 /// `'label: while expr { block }`
1274 While(P<Expr>, P<Block>, Option<Label>),
1275 /// A `for` loop, with an optional label.
1277 /// `'label: for pat in expr { block }`
1279 /// This is desugared to a combination of `loop` and `match` expressions.
1280 ForLoop(P<Pat>, P<Expr>, P<Block>, Option<Label>),
1281 /// Conditionless loop (can be exited with `break`, `continue`, or `return`).
1283 /// `'label: loop { block }`
1284 Loop(P<Block>, Option<Label>),
1285 /// A `match` block.
1286 Match(P<Expr>, Vec<Arm>),
1287 /// A closure (e.g., `move |a, b, c| a + b + c`).
1289 /// The final span is the span of the argument block `|...|`.
1290 Closure(CaptureBy, Async, Movability, P<FnDecl>, P<Expr>, Span),
1291 /// A block (`'label: { ... }`).
1292 Block(P<Block>, Option<Label>),
1293 /// An async block (`async move { ... }`).
1295 /// The `NodeId` is the `NodeId` for the closure that results from
1296 /// desugaring an async block, just like the NodeId field in the
1297 /// `Async::Yes` variant. This is necessary in order to create a def for the
1298 /// closure which can be used as a parent of any child defs. Defs
1299 /// created during lowering cannot be made the parent of any other
1300 /// preexisting defs.
1301 Async(CaptureBy, NodeId, P<Block>),
1302 /// An await expression (`my_future.await`).
1305 /// A try block (`try { ... }`).
1308 /// An assignment (`a = foo()`).
1309 /// The `Span` argument is the span of the `=` token.
1310 Assign(P<Expr>, P<Expr>, Span),
1311 /// An assignment with an operator.
1314 AssignOp(BinOp, P<Expr>, P<Expr>),
1315 /// Access of a named (e.g., `obj.foo`) or unnamed (e.g., `obj.0`) struct field.
1316 Field(P<Expr>, Ident),
1317 /// An indexing operation (e.g., `foo[2]`).
1318 Index(P<Expr>, P<Expr>),
1319 /// A range (e.g., `1..2`, `1..`, `..2`, `1..=2`, `..=2`).
1320 Range(Option<P<Expr>>, Option<P<Expr>>, RangeLimits),
1322 /// Variable reference, possibly containing `::` and/or type
1323 /// parameters (e.g., `foo::bar::<baz>`).
1325 /// Optionally "qualified" (e.g., `<Vec<T> as SomeTrait>::SomeType`).
1326 Path(Option<QSelf>, Path),
1328 /// A referencing operation (`&a`, `&mut a`, `&raw const a` or `&raw mut a`).
1329 AddrOf(BorrowKind, Mutability, P<Expr>),
1330 /// A `break`, with an optional label to break, and an optional expression.
1331 Break(Option<Label>, Option<P<Expr>>),
1332 /// A `continue`, with an optional label.
1333 Continue(Option<Label>),
1334 /// A `return`, with an optional value to be returned.
1335 Ret(Option<P<Expr>>),
1337 /// Output of the `asm!()` macro.
1338 InlineAsm(P<InlineAsm>),
1339 /// Output of the `llvm_asm!()` macro.
1340 LlvmInlineAsm(P<LlvmInlineAsm>),
1342 /// A macro invocation; pre-expansion.
1345 /// A struct literal expression.
1347 /// E.g., `Foo {x: 1, y: 2}`, or `Foo {x: 1, .. base}`,
1348 /// where `base` is the `Option<Expr>`.
1349 Struct(Path, Vec<Field>, Option<P<Expr>>),
1351 /// An array literal constructed from one repeated element.
1353 /// E.g., `[1; 5]`. The expression is the element to be
1354 /// repeated; the constant is the number of times to repeat it.
1355 Repeat(P<Expr>, AnonConst),
1357 /// No-op: used solely so we can pretty-print faithfully.
1360 /// A try expression (`expr?`).
1363 /// A `yield`, with an optional value to be yielded.
1364 Yield(Option<P<Expr>>),
1366 /// Placeholder for an expression that wasn't syntactically well formed in some way.
1370 /// The explicit `Self` type in a "qualified path". The actual
1371 /// path, including the trait and the associated item, is stored
1372 /// separately. `position` represents the index of the associated
1373 /// item qualified with this `Self` type.
1375 /// ```ignore (only-for-syntax-highlight)
1376 /// <Vec<T> as a::b::Trait>::AssociatedItem
1377 /// ^~~~~ ~~~~~~~~~~~~~~^
1380 /// <Vec<T>>::AssociatedItem
1384 #[derive(Clone, Encodable, Decodable, Debug)]
1388 /// The span of `a::b::Trait` in a path like `<Vec<T> as
1389 /// a::b::Trait>::AssociatedItem`; in the case where `position ==
1390 /// 0`, this is an empty span.
1391 pub path_span: Span,
1392 pub position: usize,
1395 /// A capture clause used in closures and `async` blocks.
1396 #[derive(Clone, Copy, PartialEq, Encodable, Decodable, Debug, HashStable_Generic)]
1397 pub enum CaptureBy {
1398 /// `move |x| y + x`.
1400 /// `move` keyword was not specified.
1404 /// The movability of a generator / closure literal:
1405 /// whether a generator contains self-references, causing it to be `!Unpin`.
1406 #[derive(Clone, PartialEq, Eq, PartialOrd, Ord, Hash, Encodable, Decodable, Debug, Copy)]
1407 #[derive(HashStable_Generic)]
1408 pub enum Movability {
1409 /// May contain self-references, `!Unpin`.
1411 /// Must not contain self-references, `Unpin`.
1415 /// Represents a macro invocation. The `path` indicates which macro
1416 /// is being invoked, and the `args` are arguments passed to it.
1417 #[derive(Clone, Encodable, Decodable, Debug)]
1418 pub struct MacCall {
1420 pub args: P<MacArgs>,
1421 pub prior_type_ascription: Option<(Span, bool)>,
1425 pub fn span(&self) -> Span {
1426 self.path.span.to(self.args.span().unwrap_or(self.path.span))
1430 /// Arguments passed to an attribute or a function-like macro.
1431 #[derive(Clone, Encodable, Decodable, Debug, HashStable_Generic)]
1433 /// No arguments - `#[attr]`.
1435 /// Delimited arguments - `#[attr()/[]/{}]` or `mac!()/[]/{}`.
1436 Delimited(DelimSpan, MacDelimiter, TokenStream),
1437 /// Arguments of a key-value attribute - `#[attr = "value"]`.
1439 /// Span of the `=` token.
1441 /// Token stream of the "value".
1447 pub fn delim(&self) -> DelimToken {
1449 MacArgs::Delimited(_, delim, _) => delim.to_token(),
1450 MacArgs::Empty | MacArgs::Eq(..) => token::NoDelim,
1454 pub fn span(&self) -> Option<Span> {
1456 MacArgs::Empty => None,
1457 MacArgs::Delimited(dspan, ..) => Some(dspan.entire()),
1458 MacArgs::Eq(eq_span, ref tokens) => Some(eq_span.to(tokens.span().unwrap_or(eq_span))),
1462 /// Tokens inside the delimiters or after `=`.
1463 /// Proc macros see these tokens, for example.
1464 pub fn inner_tokens(&self) -> TokenStream {
1466 MacArgs::Empty => TokenStream::default(),
1467 MacArgs::Delimited(.., tokens) | MacArgs::Eq(.., tokens) => tokens.clone(),
1471 /// Tokens together with the delimiters or `=`.
1472 /// Use of this method generally means that something suboptimal or hacky is happening.
1473 pub fn outer_tokens(&self) -> TokenStream {
1475 MacArgs::Empty => TokenStream::default(),
1476 MacArgs::Delimited(dspan, delim, ref tokens) => {
1477 TokenTree::Delimited(dspan, delim.to_token(), tokens.clone()).into()
1479 MacArgs::Eq(eq_span, ref tokens) => {
1480 iter::once(TokenTree::token(token::Eq, eq_span)).chain(tokens.trees()).collect()
1485 /// Whether a macro with these arguments needs a semicolon
1486 /// when used as a standalone item or statement.
1487 pub fn need_semicolon(&self) -> bool {
1488 !matches!(self, MacArgs::Delimited(_, MacDelimiter::Brace, _))
1492 #[derive(Copy, Clone, PartialEq, Eq, Encodable, Decodable, Debug, HashStable_Generic)]
1493 pub enum MacDelimiter {
1500 pub fn to_token(self) -> DelimToken {
1502 MacDelimiter::Parenthesis => DelimToken::Paren,
1503 MacDelimiter::Bracket => DelimToken::Bracket,
1504 MacDelimiter::Brace => DelimToken::Brace,
1508 pub fn from_token(delim: DelimToken) -> Option<MacDelimiter> {
1510 token::Paren => Some(MacDelimiter::Parenthesis),
1511 token::Bracket => Some(MacDelimiter::Bracket),
1512 token::Brace => Some(MacDelimiter::Brace),
1513 token::NoDelim => None,
1518 /// Represents a macro definition.
1519 #[derive(Clone, Encodable, Decodable, Debug, HashStable_Generic)]
1520 pub struct MacroDef {
1521 pub body: P<MacArgs>,
1522 /// `true` if macro was defined with `macro_rules`.
1523 pub macro_rules: bool,
1526 #[derive(Clone, Encodable, Decodable, Debug, Copy, Hash, Eq, PartialEq)]
1527 #[derive(HashStable_Generic)]
1529 /// A regular string, like `"foo"`.
1531 /// A raw string, like `r##"foo"##`.
1533 /// The value is the number of `#` symbols used.
1538 #[derive(Clone, Encodable, Decodable, Debug, HashStable_Generic)]
1540 /// The original literal token as written in source code.
1541 pub token: token::Lit,
1542 /// The "semantic" representation of the literal lowered from the original tokens.
1543 /// Strings are unescaped, hexadecimal forms are eliminated, etc.
1544 /// FIXME: Remove this and only create the semantic representation during lowering to HIR.
1549 /// Same as `Lit`, but restricted to string literals.
1550 #[derive(Clone, Copy, Encodable, Decodable, Debug)]
1552 /// The original literal token as written in source code.
1553 pub style: StrStyle,
1555 pub suffix: Option<Symbol>,
1557 /// The unescaped "semantic" representation of the literal lowered from the original token.
1558 /// FIXME: Remove this and only create the semantic representation during lowering to HIR.
1559 pub symbol_unescaped: Symbol,
1563 pub fn as_lit(&self) -> Lit {
1564 let token_kind = match self.style {
1565 StrStyle::Cooked => token::Str,
1566 StrStyle::Raw(n) => token::StrRaw(n),
1569 token: token::Lit::new(token_kind, self.symbol, self.suffix),
1571 kind: LitKind::Str(self.symbol_unescaped, self.style),
1576 /// Type of the integer literal based on provided suffix.
1577 #[derive(Clone, Copy, Encodable, Decodable, Debug, Hash, Eq, PartialEq)]
1578 #[derive(HashStable_Generic)]
1579 pub enum LitIntType {
1588 /// Type of the float literal based on provided suffix.
1589 #[derive(Clone, Copy, Encodable, Decodable, Debug, Hash, Eq, PartialEq)]
1590 #[derive(HashStable_Generic)]
1591 pub enum LitFloatType {
1592 /// A float literal with a suffix (`1f32` or `1E10f32`).
1594 /// A float literal without a suffix (`1.0 or 1.0E10`).
1600 /// E.g., `"foo"`, `42`, `12.34`, or `bool`.
1601 #[derive(Clone, Encodable, Decodable, Debug, Hash, Eq, PartialEq, HashStable_Generic)]
1603 /// A string literal (`"foo"`).
1604 Str(Symbol, StrStyle),
1605 /// A byte string (`b"foo"`).
1606 ByteStr(Lrc<Vec<u8>>),
1607 /// A byte char (`b'f'`).
1609 /// A character literal (`'a'`).
1611 /// An integer literal (`1`).
1612 Int(u128, LitIntType),
1613 /// A float literal (`1f64` or `1E10f64`).
1614 Float(Symbol, LitFloatType),
1615 /// A boolean literal.
1617 /// Placeholder for a literal that wasn't well-formed in some way.
1622 /// Returns `true` if this literal is a string.
1623 pub fn is_str(&self) -> bool {
1625 LitKind::Str(..) => true,
1630 /// Returns `true` if this literal is byte literal string.
1631 pub fn is_bytestr(&self) -> bool {
1633 LitKind::ByteStr(_) => true,
1638 /// Returns `true` if this is a numeric literal.
1639 pub fn is_numeric(&self) -> bool {
1641 LitKind::Int(..) | LitKind::Float(..) => true,
1646 /// Returns `true` if this literal has no suffix.
1647 /// Note: this will return true for literals with prefixes such as raw strings and byte strings.
1648 pub fn is_unsuffixed(&self) -> bool {
1652 /// Returns `true` if this literal has a suffix.
1653 pub fn is_suffixed(&self) -> bool {
1655 // suffixed variants
1656 LitKind::Int(_, LitIntType::Signed(..) | LitIntType::Unsigned(..))
1657 | LitKind::Float(_, LitFloatType::Suffixed(..)) => true,
1658 // unsuffixed variants
1660 | LitKind::ByteStr(..)
1663 | LitKind::Int(_, LitIntType::Unsuffixed)
1664 | LitKind::Float(_, LitFloatType::Unsuffixed)
1666 | LitKind::Err(..) => false,
1671 // N.B., If you change this, you'll probably want to change the corresponding
1672 // type structure in `middle/ty.rs` as well.
1673 #[derive(Clone, Encodable, Decodable, Debug)]
1676 pub mutbl: Mutability,
1679 /// Represents a function's signature in a trait declaration,
1680 /// trait implementation, or free function.
1681 #[derive(Clone, Encodable, Decodable, Debug)]
1683 pub header: FnHeader,
1684 pub decl: P<FnDecl>,
1688 #[derive(Clone, Copy, PartialEq, Eq, PartialOrd, Ord, Hash, Debug)]
1689 #[derive(Encodable, Decodable, HashStable_Generic)]
1696 pub fn name_str(self) -> &'static str {
1698 FloatTy::F32 => "f32",
1699 FloatTy::F64 => "f64",
1703 pub fn name(self) -> Symbol {
1705 FloatTy::F32 => sym::f32,
1706 FloatTy::F64 => sym::f64,
1710 pub fn bit_width(self) -> u64 {
1718 #[derive(Clone, Copy, PartialEq, Eq, PartialOrd, Ord, Hash, Debug)]
1719 #[derive(Encodable, Decodable, HashStable_Generic)]
1730 pub fn name_str(&self) -> &'static str {
1732 IntTy::Isize => "isize",
1734 IntTy::I16 => "i16",
1735 IntTy::I32 => "i32",
1736 IntTy::I64 => "i64",
1737 IntTy::I128 => "i128",
1741 pub fn name(&self) -> Symbol {
1743 IntTy::Isize => sym::isize,
1744 IntTy::I8 => sym::i8,
1745 IntTy::I16 => sym::i16,
1746 IntTy::I32 => sym::i32,
1747 IntTy::I64 => sym::i64,
1748 IntTy::I128 => sym::i128,
1752 pub fn val_to_string(&self, val: i128) -> String {
1753 // Cast to a `u128` so we can correctly print `INT128_MIN`. All integral types
1754 // are parsed as `u128`, so we wouldn't want to print an extra negative
1756 format!("{}{}", val as u128, self.name_str())
1759 pub fn bit_width(&self) -> Option<u64> {
1761 IntTy::Isize => return None,
1770 pub fn normalize(&self, target_width: u32) -> Self {
1772 IntTy::Isize => match target_width {
1776 _ => unreachable!(),
1783 #[derive(Clone, PartialEq, Eq, PartialOrd, Ord, Hash, Copy, Debug)]
1784 #[derive(Encodable, Decodable, HashStable_Generic)]
1795 pub fn name_str(&self) -> &'static str {
1797 UintTy::Usize => "usize",
1799 UintTy::U16 => "u16",
1800 UintTy::U32 => "u32",
1801 UintTy::U64 => "u64",
1802 UintTy::U128 => "u128",
1806 pub fn name(&self) -> Symbol {
1808 UintTy::Usize => sym::usize,
1809 UintTy::U8 => sym::u8,
1810 UintTy::U16 => sym::u16,
1811 UintTy::U32 => sym::u32,
1812 UintTy::U64 => sym::u64,
1813 UintTy::U128 => sym::u128,
1817 pub fn val_to_string(&self, val: u128) -> String {
1818 format!("{}{}", val, self.name_str())
1821 pub fn bit_width(&self) -> Option<u64> {
1823 UintTy::Usize => return None,
1828 UintTy::U128 => 128,
1832 pub fn normalize(&self, target_width: u32) -> Self {
1834 UintTy::Usize => match target_width {
1838 _ => unreachable!(),
1845 /// A constraint on an associated type (e.g., `A = Bar` in `Foo<A = Bar>` or
1846 /// `A: TraitA + TraitB` in `Foo<A: TraitA + TraitB>`).
1847 #[derive(Clone, Encodable, Decodable, Debug)]
1848 pub struct AssocTyConstraint {
1851 pub kind: AssocTyConstraintKind,
1855 /// The kinds of an `AssocTyConstraint`.
1856 #[derive(Clone, Encodable, Decodable, Debug)]
1857 pub enum AssocTyConstraintKind {
1858 /// E.g., `A = Bar` in `Foo<A = Bar>`.
1859 Equality { ty: P<Ty> },
1860 /// E.g. `A: TraitA + TraitB` in `Foo<A: TraitA + TraitB>`.
1861 Bound { bounds: GenericBounds },
1864 #[derive(Clone, Encodable, Decodable, Debug)]
1871 #[derive(Clone, Encodable, Decodable, Debug)]
1872 pub struct BareFnTy {
1873 pub unsafety: Unsafe,
1875 pub generic_params: Vec<GenericParam>,
1876 pub decl: P<FnDecl>,
1879 /// The various kinds of type recognized by the compiler.
1880 #[derive(Clone, Encodable, Decodable, Debug)]
1882 /// A variable-length slice (`[T]`).
1884 /// A fixed length array (`[T; n]`).
1885 Array(P<Ty>, AnonConst),
1886 /// A raw pointer (`*const T` or `*mut T`).
1888 /// A reference (`&'a T` or `&'a mut T`).
1889 Rptr(Option<Lifetime>, MutTy),
1890 /// A bare function (e.g., `fn(usize) -> bool`).
1891 BareFn(P<BareFnTy>),
1892 /// The never type (`!`).
1894 /// A tuple (`(A, B, C, D,...)`).
1896 /// A path (`module::module::...::Type`), optionally
1897 /// "qualified", e.g., `<Vec<T> as SomeTrait>::SomeType`.
1899 /// Type parameters are stored in the `Path` itself.
1900 Path(Option<QSelf>, Path),
1901 /// A trait object type `Bound1 + Bound2 + Bound3`
1902 /// where `Bound` is a trait or a lifetime.
1903 TraitObject(GenericBounds, TraitObjectSyntax),
1904 /// An `impl Bound1 + Bound2 + Bound3` type
1905 /// where `Bound` is a trait or a lifetime.
1907 /// The `NodeId` exists to prevent lowering from having to
1908 /// generate `NodeId`s on the fly, which would complicate
1909 /// the generation of opaque `type Foo = impl Trait` items significantly.
1910 ImplTrait(NodeId, GenericBounds),
1911 /// No-op; kept solely so that we can pretty-print faithfully.
1915 /// This means the type should be inferred instead of it having been
1916 /// specified. This can appear anywhere in a type.
1918 /// Inferred type of a `self` or `&self` argument in a method.
1920 /// A macro in the type position.
1922 /// Placeholder for a kind that has failed to be defined.
1924 /// Placeholder for a `va_list`.
1929 pub fn is_implicit_self(&self) -> bool {
1930 if let TyKind::ImplicitSelf = *self { true } else { false }
1933 pub fn is_unit(&self) -> bool {
1934 if let TyKind::Tup(ref tys) = *self { tys.is_empty() } else { false }
1938 /// Syntax used to declare a trait object.
1939 #[derive(Clone, Copy, PartialEq, Encodable, Decodable, Debug)]
1940 pub enum TraitObjectSyntax {
1945 /// Inline assembly operand explicit register or register class.
1947 /// E.g., `"eax"` as in `asm!("mov eax, 2", out("eax") result)`.
1948 #[derive(Clone, Copy, Encodable, Decodable, Debug)]
1949 pub enum InlineAsmRegOrRegClass {
1954 bitflags::bitflags! {
1955 #[derive(Encodable, Decodable, HashStable_Generic)]
1956 pub struct InlineAsmOptions: u8 {
1957 const PURE = 1 << 0;
1958 const NOMEM = 1 << 1;
1959 const READONLY = 1 << 2;
1960 const PRESERVES_FLAGS = 1 << 3;
1961 const NORETURN = 1 << 4;
1962 const NOSTACK = 1 << 5;
1963 const ATT_SYNTAX = 1 << 6;
1967 #[derive(Clone, PartialEq, Encodable, Decodable, Debug, HashStable_Generic)]
1968 pub enum InlineAsmTemplatePiece {
1970 Placeholder { operand_idx: usize, modifier: Option<char>, span: Span },
1973 impl fmt::Display for InlineAsmTemplatePiece {
1974 fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
1976 Self::String(s) => {
1977 for c in s.chars() {
1979 '{' => f.write_str("{{")?,
1980 '}' => f.write_str("}}")?,
1986 Self::Placeholder { operand_idx, modifier: Some(modifier), .. } => {
1987 write!(f, "{{{}:{}}}", operand_idx, modifier)
1989 Self::Placeholder { operand_idx, modifier: None, .. } => {
1990 write!(f, "{{{}}}", operand_idx)
1996 impl InlineAsmTemplatePiece {
1997 /// Rebuilds the asm template string from its pieces.
1998 pub fn to_string(s: &[Self]) -> String {
2000 let mut out = String::new();
2002 let _ = write!(out, "{}", p);
2008 /// Inline assembly operand.
2010 /// E.g., `out("eax") result` as in `asm!("mov eax, 2", out("eax") result)`.
2011 #[derive(Clone, Encodable, Decodable, Debug)]
2012 pub enum InlineAsmOperand {
2014 reg: InlineAsmRegOrRegClass,
2018 reg: InlineAsmRegOrRegClass,
2020 expr: Option<P<Expr>>,
2023 reg: InlineAsmRegOrRegClass,
2028 reg: InlineAsmRegOrRegClass,
2031 out_expr: Option<P<Expr>>,
2041 /// Inline assembly.
2043 /// E.g., `asm!("NOP");`.
2044 #[derive(Clone, Encodable, Decodable, Debug)]
2045 pub struct InlineAsm {
2046 pub template: Vec<InlineAsmTemplatePiece>,
2047 pub operands: Vec<(InlineAsmOperand, Span)>,
2048 pub options: InlineAsmOptions,
2049 pub line_spans: Vec<Span>,
2052 /// Inline assembly dialect.
2054 /// E.g., `"intel"` as in `llvm_asm!("mov eax, 2" : "={eax}"(result) : : : "intel")`.
2055 #[derive(Clone, PartialEq, Encodable, Decodable, Debug, Copy, HashStable_Generic)]
2056 pub enum LlvmAsmDialect {
2061 /// LLVM-style inline assembly.
2063 /// E.g., `"={eax}"(result)` as in `llvm_asm!("mov eax, 2" : "={eax}"(result) : : : "intel")`.
2064 #[derive(Clone, Encodable, Decodable, Debug)]
2065 pub struct LlvmInlineAsmOutput {
2066 pub constraint: Symbol,
2069 pub is_indirect: bool,
2072 /// LLVM-style inline assembly.
2074 /// E.g., `llvm_asm!("NOP");`.
2075 #[derive(Clone, Encodable, Decodable, Debug)]
2076 pub struct LlvmInlineAsm {
2078 pub asm_str_style: StrStyle,
2079 pub outputs: Vec<LlvmInlineAsmOutput>,
2080 pub inputs: Vec<(Symbol, P<Expr>)>,
2081 pub clobbers: Vec<Symbol>,
2083 pub alignstack: bool,
2084 pub dialect: LlvmAsmDialect,
2087 /// A parameter in a function header.
2089 /// E.g., `bar: usize` as in `fn foo(bar: usize)`.
2090 #[derive(Clone, Encodable, Decodable, Debug)]
2097 pub is_placeholder: bool,
2100 /// Alternative representation for `Arg`s describing `self` parameter of methods.
2102 /// E.g., `&mut self` as in `fn foo(&mut self)`.
2103 #[derive(Clone, Encodable, Decodable, Debug)]
2105 /// `self`, `mut self`
2107 /// `&'lt self`, `&'lt mut self`
2108 Region(Option<Lifetime>, Mutability),
2109 /// `self: TYPE`, `mut self: TYPE`
2110 Explicit(P<Ty>, Mutability),
2113 pub type ExplicitSelf = Spanned<SelfKind>;
2116 /// Attempts to cast parameter to `ExplicitSelf`.
2117 pub fn to_self(&self) -> Option<ExplicitSelf> {
2118 if let PatKind::Ident(BindingMode::ByValue(mutbl), ident, _) = self.pat.kind {
2119 if ident.name == kw::SelfLower {
2120 return match self.ty.kind {
2121 TyKind::ImplicitSelf => Some(respan(self.pat.span, SelfKind::Value(mutbl))),
2122 TyKind::Rptr(lt, MutTy { ref ty, mutbl }) if ty.kind.is_implicit_self() => {
2123 Some(respan(self.pat.span, SelfKind::Region(lt, mutbl)))
2126 self.pat.span.to(self.ty.span),
2127 SelfKind::Explicit(self.ty.clone(), mutbl),
2135 /// Returns `true` if parameter is `self`.
2136 pub fn is_self(&self) -> bool {
2137 if let PatKind::Ident(_, ident, _) = self.pat.kind {
2138 ident.name == kw::SelfLower
2144 /// Builds a `Param` object from `ExplicitSelf`.
2145 pub fn from_self(attrs: AttrVec, eself: ExplicitSelf, eself_ident: Ident) -> Param {
2146 let span = eself.span.to(eself_ident.span);
2147 let infer_ty = P(Ty { id: DUMMY_NODE_ID, kind: TyKind::ImplicitSelf, span });
2148 let param = |mutbl, ty| Param {
2152 kind: PatKind::Ident(BindingMode::ByValue(mutbl), eself_ident, None),
2159 is_placeholder: false,
2162 SelfKind::Explicit(ty, mutbl) => param(mutbl, ty),
2163 SelfKind::Value(mutbl) => param(mutbl, infer_ty),
2164 SelfKind::Region(lt, mutbl) => param(
2168 kind: TyKind::Rptr(lt, MutTy { ty: infer_ty, mutbl }),
2176 /// A signature (not the body) of a function declaration.
2178 /// E.g., `fn foo(bar: baz)`.
2180 /// Please note that it's different from `FnHeader` structure
2181 /// which contains metadata about function safety, asyncness, constness and ABI.
2182 #[derive(Clone, Encodable, Decodable, Debug)]
2184 pub inputs: Vec<Param>,
2185 pub output: FnRetTy,
2189 pub fn get_self(&self) -> Option<ExplicitSelf> {
2190 self.inputs.get(0).and_then(Param::to_self)
2192 pub fn has_self(&self) -> bool {
2193 self.inputs.get(0).map_or(false, Param::is_self)
2195 pub fn c_variadic(&self) -> bool {
2196 self.inputs.last().map_or(false, |arg| match arg.ty.kind {
2197 TyKind::CVarArgs => true,
2203 /// Is the trait definition an auto trait?
2204 #[derive(Copy, Clone, PartialEq, Encodable, Decodable, Debug, HashStable_Generic)]
2210 #[derive(Copy, Clone, PartialEq, Eq, PartialOrd, Ord, Hash, Encodable, Decodable, Debug)]
2211 #[derive(HashStable_Generic)]
2217 #[derive(Copy, Clone, Encodable, Decodable, Debug)]
2219 Yes { span: Span, closure_id: NodeId, return_impl_trait_id: NodeId },
2224 pub fn is_async(self) -> bool {
2225 if let Async::Yes { .. } = self { true } else { false }
2228 /// In this case this is an `async` return, the `NodeId` for the generated `impl Trait` item.
2229 pub fn opt_return_id(self) -> Option<NodeId> {
2231 Async::Yes { return_impl_trait_id, .. } => Some(return_impl_trait_id),
2237 #[derive(Copy, Clone, PartialEq, Eq, Hash, Encodable, Decodable, Debug)]
2238 #[derive(HashStable_Generic)]
2244 /// Item defaultness.
2245 /// For details see the [RFC #2532](https://github.com/rust-lang/rfcs/pull/2532).
2246 #[derive(Copy, Clone, PartialEq, Encodable, Decodable, Debug, HashStable_Generic)]
2247 pub enum Defaultness {
2252 #[derive(Copy, Clone, PartialEq, Encodable, Decodable, HashStable_Generic)]
2253 pub enum ImplPolarity {
2254 /// `impl Trait for Type`
2256 /// `impl !Trait for Type`
2260 impl fmt::Debug for ImplPolarity {
2261 fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
2263 ImplPolarity::Positive => "positive".fmt(f),
2264 ImplPolarity::Negative(_) => "negative".fmt(f),
2269 #[derive(Clone, Encodable, Decodable, Debug)]
2271 /// Returns type is not specified.
2273 /// Functions default to `()` and closures default to inference.
2274 /// Span points to where return type would be inserted.
2276 /// Everything else.
2281 pub fn span(&self) -> Span {
2283 FnRetTy::Default(span) => span,
2284 FnRetTy::Ty(ref ty) => ty.span,
2289 /// Module declaration.
2291 /// E.g., `mod foo;` or `mod foo { .. }`.
2292 #[derive(Clone, Encodable, Decodable, Debug)]
2294 /// A span from the first token past `{` to the last token until `}`.
2295 /// For `mod foo;`, the inner span ranges from the first token
2296 /// to the last token in the external file.
2298 /// `unsafe` keyword accepted syntactically for macro DSLs, but not
2299 /// semantically by Rust.
2300 pub unsafety: Unsafe,
2301 pub items: Vec<P<Item>>,
2302 /// `true` for `mod foo { .. }`; `false` for `mod foo;`.
2306 /// Foreign module declaration.
2308 /// E.g., `extern { .. }` or `extern "C" { .. }`.
2309 #[derive(Clone, Encodable, Decodable, Debug)]
2310 pub struct ForeignMod {
2311 /// `unsafe` keyword accepted syntactically for macro DSLs, but not
2312 /// semantically by Rust.
2313 pub unsafety: Unsafe,
2314 pub abi: Option<StrLit>,
2315 pub items: Vec<P<ForeignItem>>,
2318 /// Global inline assembly.
2320 /// Also known as "module-level assembly" or "file-scoped assembly".
2321 #[derive(Clone, Encodable, Decodable, Debug, Copy)]
2322 pub struct GlobalAsm {
2326 #[derive(Clone, Encodable, Decodable, Debug)]
2327 pub struct EnumDef {
2328 pub variants: Vec<Variant>,
2331 #[derive(Clone, Encodable, Decodable, Debug)]
2332 pub struct Variant {
2333 /// Attributes of the variant.
2334 pub attrs: Vec<Attribute>,
2335 /// Id of the variant (not the constructor, see `VariantData::ctor_id()`).
2339 /// The visibility of the variant. Syntactically accepted but not semantically.
2340 pub vis: Visibility,
2341 /// Name of the variant.
2344 /// Fields and constructor id of the variant.
2345 pub data: VariantData,
2346 /// Explicit discriminant, e.g., `Foo = 1`.
2347 pub disr_expr: Option<AnonConst>,
2348 /// Is a macro placeholder
2349 pub is_placeholder: bool,
2352 /// Part of `use` item to the right of its prefix.
2353 #[derive(Clone, Encodable, Decodable, Debug)]
2354 pub enum UseTreeKind {
2355 /// `use prefix` or `use prefix as rename`
2357 /// The extra `NodeId`s are for HIR lowering, when additional statements are created for each
2359 Simple(Option<Ident>, NodeId, NodeId),
2360 /// `use prefix::{...}`
2361 Nested(Vec<(UseTree, NodeId)>),
2366 /// A tree of paths sharing common prefixes.
2367 /// Used in `use` items both at top-level and inside of braces in import groups.
2368 #[derive(Clone, Encodable, Decodable, Debug)]
2369 pub struct UseTree {
2371 pub kind: UseTreeKind,
2376 pub fn ident(&self) -> Ident {
2378 UseTreeKind::Simple(Some(rename), ..) => rename,
2379 UseTreeKind::Simple(None, ..) => {
2380 self.prefix.segments.last().expect("empty prefix in a simple import").ident
2382 _ => panic!("`UseTree::ident` can only be used on a simple import"),
2387 /// Distinguishes between `Attribute`s that decorate items and Attributes that
2388 /// are contained as statements within items. These two cases need to be
2389 /// distinguished for pretty-printing.
2390 #[derive(Clone, PartialEq, Encodable, Decodable, Debug, Copy, HashStable_Generic)]
2391 pub enum AttrStyle {
2396 rustc_index::newtype_index! {
2399 DEBUG_FORMAT = "AttrId({})"
2403 impl<S: Encoder> rustc_serialize::Encodable<S> for AttrId {
2404 fn encode(&self, s: &mut S) -> Result<(), S::Error> {
2409 impl<D: Decoder> rustc_serialize::Decodable<D> for AttrId {
2410 fn decode(d: &mut D) -> Result<AttrId, D::Error> {
2411 d.read_nil().map(|_| crate::attr::mk_attr_id())
2415 #[derive(Clone, Encodable, Decodable, Debug, HashStable_Generic)]
2416 pub struct AttrItem {
2421 /// A list of attributes.
2422 pub type AttrVec = ThinVec<Attribute>;
2424 /// Metadata associated with an item.
2425 #[derive(Clone, Encodable, Decodable, Debug)]
2426 pub struct Attribute {
2429 /// Denotes if the attribute decorates the following construct (outer)
2430 /// or the construct this attribute is contained within (inner).
2431 pub style: AttrStyle,
2435 #[derive(Clone, Encodable, Decodable, Debug)]
2437 /// A normal attribute.
2440 /// A doc comment (e.g. `/// ...`, `//! ...`, `/** ... */`, `/*! ... */`).
2441 /// Doc attributes (e.g. `#[doc="..."]`) are represented with the `Normal`
2442 /// variant (which is much less compact and thus more expensive).
2443 DocComment(CommentKind, Symbol),
2446 /// `TraitRef`s appear in impls.
2448 /// Resolution maps each `TraitRef`'s `ref_id` to its defining trait; that's all
2449 /// that the `ref_id` is for. The `impl_id` maps to the "self type" of this impl.
2450 /// If this impl is an `ItemKind::Impl`, the `impl_id` is redundant (it could be the
2451 /// same as the impl's `NodeId`).
2452 #[derive(Clone, Encodable, Decodable, Debug)]
2453 pub struct TraitRef {
2458 #[derive(Clone, Encodable, Decodable, Debug)]
2459 pub struct PolyTraitRef {
2460 /// The `'a` in `<'a> Foo<&'a T>`.
2461 pub bound_generic_params: Vec<GenericParam>,
2463 /// The `Foo<&'a T>` in `<'a> Foo<&'a T>`.
2464 pub trait_ref: TraitRef,
2470 pub fn new(generic_params: Vec<GenericParam>, path: Path, span: Span) -> Self {
2472 bound_generic_params: generic_params,
2473 trait_ref: TraitRef { path, ref_id: DUMMY_NODE_ID },
2479 #[derive(Copy, Clone, Encodable, Decodable, Debug, HashStable_Generic)]
2480 pub enum CrateSugar {
2481 /// Source is `pub(crate)`.
2484 /// Source is (just) `crate`.
2488 pub type Visibility = Spanned<VisibilityKind>;
2490 #[derive(Clone, Encodable, Decodable, Debug)]
2491 pub enum VisibilityKind {
2494 Restricted { path: P<Path>, id: NodeId },
2498 impl VisibilityKind {
2499 pub fn is_pub(&self) -> bool {
2500 if let VisibilityKind::Public = *self { true } else { false }
2504 /// Field of a struct.
2506 /// E.g., `bar: usize` as in `struct Foo { bar: usize }`.
2507 #[derive(Clone, Encodable, Decodable, Debug)]
2508 pub struct StructField {
2509 pub attrs: Vec<Attribute>,
2512 pub vis: Visibility,
2513 pub ident: Option<Ident>,
2516 pub is_placeholder: bool,
2519 /// Fields and constructor ids of enum variants and structs.
2520 #[derive(Clone, Encodable, Decodable, Debug)]
2521 pub enum VariantData {
2524 /// E.g., `Bar { .. }` as in `enum Foo { Bar { .. } }`.
2525 Struct(Vec<StructField>, bool),
2528 /// E.g., `Bar(..)` as in `enum Foo { Bar(..) }`.
2529 Tuple(Vec<StructField>, NodeId),
2532 /// E.g., `Bar = ..` as in `enum Foo { Bar = .. }`.
2537 /// Return the fields of this variant.
2538 pub fn fields(&self) -> &[StructField] {
2540 VariantData::Struct(ref fields, ..) | VariantData::Tuple(ref fields, _) => fields,
2545 /// Return the `NodeId` of this variant's constructor, if it has one.
2546 pub fn ctor_id(&self) -> Option<NodeId> {
2548 VariantData::Struct(..) => None,
2549 VariantData::Tuple(_, id) | VariantData::Unit(id) => Some(id),
2554 /// An item definition.
2555 #[derive(Clone, Encodable, Decodable, Debug)]
2556 pub struct Item<K = ItemKind> {
2557 pub attrs: Vec<Attribute>,
2560 pub vis: Visibility,
2561 /// The name of the item.
2562 /// It might be a dummy name in case of anonymous items.
2567 /// Original tokens this item was parsed from. This isn't necessarily
2568 /// available for all items, although over time more and more items should
2569 /// have this be `Some`. Right now this is primarily used for procedural
2570 /// macros, notably custom attributes.
2572 /// Note that the tokens here do not include the outer attributes, but will
2573 /// include inner attributes.
2574 pub tokens: Option<TokenStream>,
2578 /// Return the span that encompasses the attributes.
2579 pub fn span_with_attributes(&self) -> Span {
2580 self.attrs.iter().fold(self.span, |acc, attr| acc.to(attr.span))
2584 impl<K: Into<ItemKind>> Item<K> {
2585 pub fn into_item(self) -> Item {
2586 let Item { attrs, id, span, vis, ident, kind, tokens } = self;
2587 Item { attrs, id, span, vis, ident, kind: kind.into(), tokens }
2591 /// `extern` qualifier on a function item or function type.
2592 #[derive(Clone, Copy, Encodable, Decodable, Debug)]
2600 pub fn from_abi(abi: Option<StrLit>) -> Extern {
2601 abi.map_or(Extern::Implicit, Extern::Explicit)
2605 /// A function header.
2607 /// All the information between the visibility and the name of the function is
2608 /// included in this struct (e.g., `async unsafe fn` or `const extern "C" fn`).
2609 #[derive(Clone, Copy, Encodable, Decodable, Debug)]
2610 pub struct FnHeader {
2611 pub unsafety: Unsafe,
2612 pub asyncness: Async,
2613 pub constness: Const,
2618 /// Does this function header have any qualifiers or is it empty?
2619 pub fn has_qualifiers(&self) -> bool {
2620 let Self { unsafety, asyncness, constness, ext } = self;
2621 matches!(unsafety, Unsafe::Yes(_))
2622 || asyncness.is_async()
2623 || matches!(constness, Const::Yes(_))
2624 || !matches!(ext, Extern::None)
2628 impl Default for FnHeader {
2629 fn default() -> FnHeader {
2631 unsafety: Unsafe::No,
2632 asyncness: Async::No,
2633 constness: Const::No,
2639 #[derive(Clone, Encodable, Decodable, Debug)]
2641 /// An `extern crate` item, with the optional *original* crate name if the crate was renamed.
2643 /// E.g., `extern crate foo` or `extern crate foo_bar as foo`.
2644 ExternCrate(Option<Symbol>),
2645 /// A use declaration item (`use`).
2647 /// E.g., `use foo;`, `use foo::bar;` or `use foo::bar as FooBar;`.
2649 /// A static item (`static`).
2651 /// E.g., `static FOO: i32 = 42;` or `static FOO: &'static str = "bar";`.
2652 Static(P<Ty>, Mutability, Option<P<Expr>>),
2653 /// A constant item (`const`).
2655 /// E.g., `const FOO: i32 = 42;`.
2656 Const(Defaultness, P<Ty>, Option<P<Expr>>),
2657 /// A function declaration (`fn`).
2659 /// E.g., `fn foo(bar: usize) -> usize { .. }`.
2660 Fn(Defaultness, FnSig, Generics, Option<P<Block>>),
2661 /// A module declaration (`mod`).
2663 /// E.g., `mod foo;` or `mod foo { .. }`.
2665 /// An external module (`extern`).
2667 /// E.g., `extern {}` or `extern "C" {}`.
2668 ForeignMod(ForeignMod),
2669 /// Module-level inline assembly (from `global_asm!()`).
2670 GlobalAsm(P<GlobalAsm>),
2671 /// A type alias (`type`).
2673 /// E.g., `type Foo = Bar<u8>;`.
2674 TyAlias(Defaultness, Generics, GenericBounds, Option<P<Ty>>),
2675 /// An enum definition (`enum`).
2677 /// E.g., `enum Foo<A, B> { C<A>, D<B> }`.
2678 Enum(EnumDef, Generics),
2679 /// A struct definition (`struct`).
2681 /// E.g., `struct Foo<A> { x: A }`.
2682 Struct(VariantData, Generics),
2683 /// A union definition (`union`).
2685 /// E.g., `union Foo<A, B> { x: A, y: B }`.
2686 Union(VariantData, Generics),
2687 /// A trait declaration (`trait`).
2689 /// E.g., `trait Foo { .. }`, `trait Foo<T> { .. }` or `auto trait Foo {}`.
2690 Trait(IsAuto, Unsafe, Generics, GenericBounds, Vec<P<AssocItem>>),
2693 /// E.g., `trait Foo = Bar + Quux;`.
2694 TraitAlias(Generics, GenericBounds),
2695 /// An implementation.
2697 /// E.g., `impl<A> Foo<A> { .. }` or `impl<A> Trait for Foo<A> { .. }`.
2700 polarity: ImplPolarity,
2701 defaultness: Defaultness,
2705 /// The trait being implemented, if any.
2706 of_trait: Option<TraitRef>,
2709 items: Vec<P<AssocItem>>,
2711 /// A macro invocation.
2713 /// E.g., `foo!(..)`.
2716 /// A macro definition.
2721 pub fn article(&self) -> &str {
2724 Use(..) | Static(..) | Const(..) | Fn(..) | Mod(..) | GlobalAsm(..) | TyAlias(..)
2725 | Struct(..) | Union(..) | Trait(..) | TraitAlias(..) | MacroDef(..) => "a",
2726 ExternCrate(..) | ForeignMod(..) | MacCall(..) | Enum(..) | Impl { .. } => "an",
2730 pub fn descr(&self) -> &str {
2732 ItemKind::ExternCrate(..) => "extern crate",
2733 ItemKind::Use(..) => "`use` import",
2734 ItemKind::Static(..) => "static item",
2735 ItemKind::Const(..) => "constant item",
2736 ItemKind::Fn(..) => "function",
2737 ItemKind::Mod(..) => "module",
2738 ItemKind::ForeignMod(..) => "extern block",
2739 ItemKind::GlobalAsm(..) => "global asm item",
2740 ItemKind::TyAlias(..) => "type alias",
2741 ItemKind::Enum(..) => "enum",
2742 ItemKind::Struct(..) => "struct",
2743 ItemKind::Union(..) => "union",
2744 ItemKind::Trait(..) => "trait",
2745 ItemKind::TraitAlias(..) => "trait alias",
2746 ItemKind::MacCall(..) => "item macro invocation",
2747 ItemKind::MacroDef(..) => "macro definition",
2748 ItemKind::Impl { .. } => "implementation",
2752 pub fn generics(&self) -> Option<&Generics> {
2754 Self::Fn(_, _, generics, _)
2755 | Self::TyAlias(_, generics, ..)
2756 | Self::Enum(_, generics)
2757 | Self::Struct(_, generics)
2758 | Self::Union(_, generics)
2759 | Self::Trait(_, _, generics, ..)
2760 | Self::TraitAlias(generics, _)
2761 | Self::Impl { generics, .. } => Some(generics),
2767 /// Represents associated items.
2768 /// These include items in `impl` and `trait` definitions.
2769 pub type AssocItem = Item<AssocItemKind>;
2771 /// Represents associated item kinds.
2773 /// The term "provided" in the variants below refers to the item having a default
2774 /// definition / body. Meanwhile, a "required" item lacks a definition / body.
2775 /// In an implementation, all items must be provided.
2776 /// The `Option`s below denote the bodies, where `Some(_)`
2777 /// means "provided" and conversely `None` means "required".
2778 #[derive(Clone, Encodable, Decodable, Debug)]
2779 pub enum AssocItemKind {
2780 /// An associated constant, `const $ident: $ty $def?;` where `def ::= "=" $expr? ;`.
2781 /// If `def` is parsed, then the constant is provided, and otherwise required.
2782 Const(Defaultness, P<Ty>, Option<P<Expr>>),
2783 /// An associated function.
2784 Fn(Defaultness, FnSig, Generics, Option<P<Block>>),
2785 /// An associated type.
2786 TyAlias(Defaultness, Generics, GenericBounds, Option<P<Ty>>),
2787 /// A macro expanding to associated items.
2791 impl AssocItemKind {
2792 pub fn defaultness(&self) -> Defaultness {
2794 Self::Const(def, ..) | Self::Fn(def, ..) | Self::TyAlias(def, ..) => def,
2795 Self::MacCall(..) => Defaultness::Final,
2800 impl From<AssocItemKind> for ItemKind {
2801 fn from(assoc_item_kind: AssocItemKind) -> ItemKind {
2802 match assoc_item_kind {
2803 AssocItemKind::Const(a, b, c) => ItemKind::Const(a, b, c),
2804 AssocItemKind::Fn(a, b, c, d) => ItemKind::Fn(a, b, c, d),
2805 AssocItemKind::TyAlias(a, b, c, d) => ItemKind::TyAlias(a, b, c, d),
2806 AssocItemKind::MacCall(a) => ItemKind::MacCall(a),
2811 impl TryFrom<ItemKind> for AssocItemKind {
2812 type Error = ItemKind;
2814 fn try_from(item_kind: ItemKind) -> Result<AssocItemKind, ItemKind> {
2815 Ok(match item_kind {
2816 ItemKind::Const(a, b, c) => AssocItemKind::Const(a, b, c),
2817 ItemKind::Fn(a, b, c, d) => AssocItemKind::Fn(a, b, c, d),
2818 ItemKind::TyAlias(a, b, c, d) => AssocItemKind::TyAlias(a, b, c, d),
2819 ItemKind::MacCall(a) => AssocItemKind::MacCall(a),
2820 _ => return Err(item_kind),
2825 /// An item in `extern` block.
2826 #[derive(Clone, Encodable, Decodable, Debug)]
2827 pub enum ForeignItemKind {
2828 /// A foreign static item (`static FOO: u8`).
2829 Static(P<Ty>, Mutability, Option<P<Expr>>),
2830 /// A foreign function.
2831 Fn(Defaultness, FnSig, Generics, Option<P<Block>>),
2833 TyAlias(Defaultness, Generics, GenericBounds, Option<P<Ty>>),
2834 /// A macro expanding to foreign items.
2838 impl From<ForeignItemKind> for ItemKind {
2839 fn from(foreign_item_kind: ForeignItemKind) -> ItemKind {
2840 match foreign_item_kind {
2841 ForeignItemKind::Static(a, b, c) => ItemKind::Static(a, b, c),
2842 ForeignItemKind::Fn(a, b, c, d) => ItemKind::Fn(a, b, c, d),
2843 ForeignItemKind::TyAlias(a, b, c, d) => ItemKind::TyAlias(a, b, c, d),
2844 ForeignItemKind::MacCall(a) => ItemKind::MacCall(a),
2849 impl TryFrom<ItemKind> for ForeignItemKind {
2850 type Error = ItemKind;
2852 fn try_from(item_kind: ItemKind) -> Result<ForeignItemKind, ItemKind> {
2853 Ok(match item_kind {
2854 ItemKind::Static(a, b, c) => ForeignItemKind::Static(a, b, c),
2855 ItemKind::Fn(a, b, c, d) => ForeignItemKind::Fn(a, b, c, d),
2856 ItemKind::TyAlias(a, b, c, d) => ForeignItemKind::TyAlias(a, b, c, d),
2857 ItemKind::MacCall(a) => ForeignItemKind::MacCall(a),
2858 _ => return Err(item_kind),
2863 pub type ForeignItem = Item<ForeignItemKind>;