rust-analyzer/crates/hir-def/src/hir.rs

Ignoring revisions in .git-blame-ignore-revs. Click here to bypass and see the normal blame view.

638 lines
17 KiB
Rust
Raw Normal View History

2019-11-12 12:09:25 +00:00
//! This module describes hir-level representation of expressions.
//!
2021-01-08 14:46:48 +00:00
//! This representation is:
2019-11-12 12:09:25 +00:00
//!
//! 1. Identity-based. Each expression has an `id`, so we can distinguish
//! between different `1` in `1 + 1`.
//! 2. Independent of syntax. Though syntactic provenance information can be
//! attached separately via id-based side map.
//! 3. Unresolved. Paths are stored as sequences of names, and not as defs the
//! names refer to.
//! 4. Desugared. There's no `if let`.
2019-11-12 15:53:26 +00:00
//!
//! See also a neighboring `body` module.
2019-11-12 12:09:25 +00:00
pub mod format_args;
2024-01-26 19:08:10 +00:00
pub mod type_ref;
2022-08-15 11:51:45 +00:00
use std::fmt;
use hir_expand::{name::Name, MacroDefId};
2024-07-16 10:05:16 +00:00
use intern::{Interned, Symbol};
2022-07-17 15:22:11 +00:00
use la_arena::{Idx, RawIdx};
2024-07-10 08:38:47 +00:00
use rustc_apfloat::ieee::{Half as f16, Quad as f128};
use syntax::ast;
2019-11-12 12:09:25 +00:00
use crate::{
2021-02-28 00:20:04 +00:00
builtin_type::{BuiltinFloat, BuiltinInt, BuiltinUint},
2019-11-12 12:09:25 +00:00
path::{GenericArgs, Path},
type_ref::{Mutability, Rawness, TypeRef},
2023-06-11 21:07:11 +00:00
BlockId, ConstBlockId,
2019-11-12 12:09:25 +00:00
};
pub use syntax::ast::{ArithOp, BinaryOp, CmpOp, LogicOp, Ordering, RangeOp, UnaryOp};
2023-02-18 20:32:55 +00:00
pub type BindingId = Idx<Binding>;
pub type ExprId = Idx<Expr>;
2022-07-17 15:22:11 +00:00
/// FIXME: this is a hacky function which should be removed
pub(crate) fn dummy_expr_id() -> ExprId {
ExprId::from_raw(RawIdx::from(u32::MAX))
}
2020-03-19 15:00:11 +00:00
pub type PatId = Idx<Pat>;
2019-11-12 12:09:25 +00:00
2023-01-01 12:24:48 +00:00
#[derive(Debug, Copy, Clone, Hash, PartialEq, Eq)]
pub enum ExprOrPatId {
ExprId(ExprId),
PatId(PatId),
}
impl ExprOrPatId {
pub fn as_expr(self) -> Option<ExprId> {
match self {
Self::ExprId(v) => Some(v),
_ => None,
}
}
pub fn as_pat(self) -> Option<PatId> {
match self {
Self::PatId(v) => Some(v),
_ => None,
}
}
}
2023-01-01 12:24:48 +00:00
stdx::impl_from!(ExprId, PatId for ExprOrPatId);
2020-12-23 15:34:30 +00:00
#[derive(Debug, Clone, Eq, PartialEq)]
pub struct Label {
pub name: Name,
}
pub type LabelId = Idx<Label>;
// We leave float values as a string to avoid double rounding.
// For PartialEq, string comparison should work, as ordering is not important
// https://github.com/rust-lang/rust-analyzer/issues/12380#issuecomment-1137284360
2024-07-16 10:05:16 +00:00
#[derive(Debug, Clone, Eq, PartialEq)]
pub struct FloatTypeWrapper(Symbol);
2024-07-10 08:38:47 +00:00
// FIXME(#17451): Use builtin types once stabilised.
impl FloatTypeWrapper {
2024-07-16 10:05:16 +00:00
pub fn new(sym: Symbol) -> Self {
Self(sym)
}
2023-02-03 11:16:25 +00:00
2024-07-10 08:38:47 +00:00
pub fn to_f128(&self) -> f128 {
2024-07-16 10:05:16 +00:00
self.0.as_str().parse().unwrap_or_default()
2024-07-10 08:38:47 +00:00
}
pub fn to_f64(&self) -> f64 {
2024-07-16 10:05:16 +00:00
self.0.as_str().parse().unwrap_or_default()
2023-02-03 11:16:25 +00:00
}
pub fn to_f32(&self) -> f32 {
2024-07-16 10:05:16 +00:00
self.0.as_str().parse().unwrap_or_default()
2023-02-03 11:16:25 +00:00
}
2024-07-10 08:38:47 +00:00
pub fn to_f16(&self) -> f16 {
2024-07-16 10:05:16 +00:00
self.0.as_str().parse().unwrap_or_default()
2024-07-10 08:38:47 +00:00
}
}
2022-08-15 11:51:45 +00:00
impl fmt::Display for FloatTypeWrapper {
fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
2024-07-16 10:05:16 +00:00
f.write_str(self.0.as_str())
}
}
2019-11-12 12:09:25 +00:00
#[derive(Debug, Clone, Eq, PartialEq)]
pub enum Literal {
2024-07-16 10:05:16 +00:00
String(Symbol),
ByteString(Box<[u8]>),
2023-07-18 10:42:02 +00:00
CString(Box<[u8]>),
2019-11-12 12:09:25 +00:00
Char(char),
Bool(bool),
Int(i128, Option<BuiltinInt>),
Uint(u128, Option<BuiltinUint>),
2024-07-10 08:38:47 +00:00
// Here we are using a wrapper around float because float primitives do not implement Eq, so they
// could not be used directly here, to understand how the wrapper works go to definition of
// FloatTypeWrapper
Float(FloatTypeWrapper, Option<BuiltinFloat>),
2019-11-12 12:09:25 +00:00
}
2023-05-25 21:15:37 +00:00
#[derive(Debug, Clone, Eq, PartialEq)]
/// Used in range patterns.
pub enum LiteralOrConst {
Literal(Literal),
Const(PatId),
2023-05-25 21:15:37 +00:00
}
2023-03-14 19:31:46 +00:00
impl Literal {
pub fn negate(self) -> Option<Self> {
if let Literal::Int(i, k) = self {
Some(Literal::Int(-i, k))
} else {
None
}
}
}
impl From<ast::LiteralKind> for Literal {
fn from(ast_lit_kind: ast::LiteralKind) -> Self {
use ast::LiteralKind;
match ast_lit_kind {
LiteralKind::IntNumber(lit) => {
if let builtin @ Some(_) = lit.suffix().and_then(BuiltinFloat::from_suffix) {
2024-07-16 10:05:16 +00:00
Literal::Float(
FloatTypeWrapper::new(Symbol::intern(&lit.value_string())),
builtin,
)
} else if let builtin @ Some(_) = lit.suffix().and_then(BuiltinUint::from_suffix) {
Literal::Uint(lit.value().unwrap_or(0), builtin)
} else {
let builtin = lit.suffix().and_then(BuiltinInt::from_suffix);
Literal::Int(lit.value().unwrap_or(0) as i128, builtin)
}
}
LiteralKind::FloatNumber(lit) => {
let ty = lit.suffix().and_then(BuiltinFloat::from_suffix);
2024-07-16 10:05:16 +00:00
Literal::Float(FloatTypeWrapper::new(Symbol::intern(&lit.value_string())), ty)
}
LiteralKind::ByteString(bs) => {
let text = bs.value().map_or_else(|_| Default::default(), Box::from);
Literal::ByteString(text)
}
LiteralKind::String(s) => {
2024-07-16 10:05:16 +00:00
let text = s.value().map_or_else(|_| Symbol::empty(), |it| Symbol::intern(&it));
Literal::String(text)
}
2023-05-18 09:06:05 +00:00
LiteralKind::CString(s) => {
let text = s.value().map_or_else(|_| Default::default(), Box::from);
2023-05-18 09:06:05 +00:00
Literal::CString(text)
}
LiteralKind::Byte(b) => {
Literal::Uint(b.value().unwrap_or_default() as u128, Some(BuiltinUint::U8))
}
LiteralKind::Char(c) => Literal::Char(c.value().unwrap_or_default()),
LiteralKind::Bool(val) => Literal::Bool(val),
}
}
}
2019-11-12 12:09:25 +00:00
#[derive(Debug, Clone, Eq, PartialEq)]
pub enum Expr {
/// This is produced if the syntax tree does not have a required expression piece.
2019-11-12 12:09:25 +00:00
Missing,
Path(Path),
If {
condition: ExprId,
then_branch: ExprId,
else_branch: Option<ExprId>,
},
2022-01-23 03:39:26 +00:00
Let {
pat: PatId,
expr: ExprId,
},
2019-11-12 12:09:25 +00:00
Block {
id: Option<BlockId>,
statements: Box<[Statement]>,
2019-11-12 12:09:25 +00:00
tail: Option<ExprId>,
2020-12-23 15:34:30 +00:00
label: Option<LabelId>,
2019-11-12 12:09:25 +00:00
},
Async {
id: Option<BlockId>,
statements: Box<[Statement]>,
tail: Option<ExprId>,
},
2023-06-11 21:07:11 +00:00
Const(ConstBlockId),
// FIXME: Fold this into Block with an unsafe flag?
Unsafe {
id: Option<BlockId>,
statements: Box<[Statement]>,
tail: Option<ExprId>,
},
2019-11-12 12:09:25 +00:00
Loop {
body: ExprId,
2020-12-23 15:34:30 +00:00
label: Option<LabelId>,
2019-11-12 12:09:25 +00:00
},
Call {
callee: ExprId,
args: Box<[ExprId]>,
2019-11-12 12:09:25 +00:00
},
MethodCall {
receiver: ExprId,
method_name: Name,
args: Box<[ExprId]>,
generic_args: Option<Box<GenericArgs>>,
2019-11-12 12:09:25 +00:00
},
Match {
expr: ExprId,
arms: Box<[MatchArm]>,
2019-11-12 12:09:25 +00:00
},
2020-05-31 08:59:40 +00:00
Continue {
label: Option<LabelId>,
2020-05-31 08:59:40 +00:00
},
2019-11-12 12:09:25 +00:00
Break {
expr: Option<ExprId>,
label: Option<LabelId>,
2019-11-12 12:09:25 +00:00
},
Return {
expr: Option<ExprId>,
},
Become {
expr: ExprId,
},
2021-01-13 15:01:50 +00:00
Yield {
expr: Option<ExprId>,
},
2022-12-28 23:17:13 +00:00
Yeet {
expr: Option<ExprId>,
},
2019-11-12 12:09:25 +00:00
RecordLit {
path: Option<Box<Path>>,
fields: Box<[RecordLitField]>,
2019-11-12 12:09:25 +00:00
spread: Option<ExprId>,
},
Field {
expr: ExprId,
name: Name,
},
Await {
expr: ExprId,
},
Cast {
expr: ExprId,
type_ref: Interned<TypeRef>,
2019-11-12 12:09:25 +00:00
},
Ref {
expr: ExprId,
rawness: Rawness,
2019-11-12 12:09:25 +00:00
mutability: Mutability,
},
Box {
expr: ExprId,
},
UnaryOp {
expr: ExprId,
op: UnaryOp,
},
/// `op` cannot be bare `=` (but can be `op=`), these are lowered to `Assignment` instead.
2019-11-12 12:09:25 +00:00
BinaryOp {
lhs: ExprId,
rhs: ExprId,
op: Option<BinaryOp>,
},
// Assignments need a special treatment because of destructuring assignment.
Assignment {
target: PatId,
value: ExprId,
},
2019-11-28 19:10:16 +00:00
Range {
2019-11-29 06:49:12 +00:00
lhs: Option<ExprId>,
rhs: Option<ExprId>,
range_type: RangeOp,
2019-11-28 19:10:16 +00:00
},
2019-11-12 12:09:25 +00:00
Index {
base: ExprId,
index: ExprId,
},
Closure {
args: Box<[PatId]>,
arg_types: Box<[Option<Interned<TypeRef>>]>,
ret_type: Option<Interned<TypeRef>>,
2019-11-12 12:09:25 +00:00
body: ExprId,
2022-09-05 13:43:26 +00:00
closure_kind: ClosureKind,
2023-04-06 12:44:38 +00:00
capture_by: CaptureBy,
2019-11-12 12:09:25 +00:00
},
Tuple {
exprs: Box<[ExprId]>,
2019-11-12 12:09:25 +00:00
},
Array(Array),
Literal(Literal),
2022-05-26 17:14:06 +00:00
Underscore,
OffsetOf(OffsetOf),
2023-09-05 11:28:41 +00:00
InlineAsm(InlineAsm),
}
#[derive(Debug, Clone, PartialEq, Eq)]
pub struct OffsetOf {
pub container: Interned<TypeRef>,
pub fields: Box<[Name]>,
2019-11-12 12:09:25 +00:00
}
2023-09-05 11:28:41 +00:00
#[derive(Debug, Clone, PartialEq, Eq)]
pub struct InlineAsm {
pub operands: Box<[(Option<Name>, AsmOperand)]>,
2024-09-01 13:17:52 +00:00
pub options: AsmOptions,
}
#[derive(Clone, Copy, PartialEq, Eq, Hash)]
pub struct AsmOptions(u16);
bitflags::bitflags! {
impl AsmOptions: u16 {
const PURE = 1 << 0;
const NOMEM = 1 << 1;
const READONLY = 1 << 2;
const PRESERVES_FLAGS = 1 << 3;
const NORETURN = 1 << 4;
const NOSTACK = 1 << 5;
const ATT_SYNTAX = 1 << 6;
const RAW = 1 << 7;
const MAY_UNWIND = 1 << 8;
}
}
impl AsmOptions {
pub const COUNT: usize = Self::all().bits().count_ones() as usize;
pub const GLOBAL_OPTIONS: Self = Self::ATT_SYNTAX.union(Self::RAW);
pub const NAKED_OPTIONS: Self = Self::ATT_SYNTAX.union(Self::RAW).union(Self::NORETURN);
pub fn human_readable_names(&self) -> Vec<&'static str> {
let mut options = vec![];
if self.contains(AsmOptions::PURE) {
options.push("pure");
}
if self.contains(AsmOptions::NOMEM) {
options.push("nomem");
}
if self.contains(AsmOptions::READONLY) {
options.push("readonly");
}
if self.contains(AsmOptions::PRESERVES_FLAGS) {
options.push("preserves_flags");
}
if self.contains(AsmOptions::NORETURN) {
options.push("noreturn");
}
if self.contains(AsmOptions::NOSTACK) {
options.push("nostack");
}
if self.contains(AsmOptions::ATT_SYNTAX) {
options.push("att_syntax");
}
if self.contains(AsmOptions::RAW) {
options.push("raw");
}
if self.contains(AsmOptions::MAY_UNWIND) {
options.push("may_unwind");
}
options
}
}
impl std::fmt::Debug for AsmOptions {
fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {
bitflags::parser::to_writer(self, f)
}
}
#[derive(Clone, Debug, Eq, PartialEq, Hash)]
pub enum AsmOperand {
In {
reg: InlineAsmRegOrRegClass,
expr: ExprId,
},
Out {
reg: InlineAsmRegOrRegClass,
expr: Option<ExprId>,
late: bool,
},
InOut {
reg: InlineAsmRegOrRegClass,
expr: ExprId,
late: bool,
},
SplitInOut {
reg: InlineAsmRegOrRegClass,
in_expr: ExprId,
out_expr: Option<ExprId>,
late: bool,
},
Label(ExprId),
Const(ExprId),
Sym(Path),
}
impl AsmOperand {
pub fn reg(&self) -> Option<&InlineAsmRegOrRegClass> {
match self {
Self::In { reg, .. }
| Self::Out { reg, .. }
| Self::InOut { reg, .. }
| Self::SplitInOut { reg, .. } => Some(reg),
Self::Const { .. } | Self::Sym { .. } | Self::Label { .. } => None,
}
}
pub fn is_clobber(&self) -> bool {
matches!(self, AsmOperand::Out { reg: InlineAsmRegOrRegClass::Reg(_), late: _, expr: None })
}
}
#[derive(Clone, Debug, Eq, PartialEq, Hash)]
pub enum InlineAsmRegOrRegClass {
Reg(Symbol),
RegClass(Symbol),
2023-09-05 11:28:41 +00:00
}
2022-09-05 13:43:26 +00:00
#[derive(Debug, Clone, Copy, PartialEq, Eq)]
pub enum ClosureKind {
Closure,
Coroutine(Movability),
Async,
2022-09-05 13:43:26 +00:00
}
2023-04-06 12:44:38 +00:00
#[derive(Debug, Clone, Copy, PartialEq, Eq)]
pub enum CaptureBy {
/// `move |x| y + x`.
Value,
/// `move` keyword was not specified.
Ref,
}
2022-09-05 13:43:26 +00:00
#[derive(Debug, Clone, Copy, PartialEq, Eq)]
pub enum Movability {
Static,
Movable,
}
2019-11-12 12:09:25 +00:00
#[derive(Debug, Clone, Eq, PartialEq)]
pub enum Array {
ElementList { elements: Box<[ExprId]> },
2019-11-12 12:09:25 +00:00
Repeat { initializer: ExprId, repeat: ExprId },
}
#[derive(Debug, Clone, Eq, PartialEq)]
pub struct MatchArm {
2020-02-09 18:57:01 +00:00
pub pat: PatId,
2022-01-23 03:39:26 +00:00
pub guard: Option<ExprId>,
2019-11-12 12:09:25 +00:00
pub expr: ExprId,
}
#[derive(Debug, Clone, Eq, PartialEq)]
pub struct RecordLitField {
pub name: Name,
pub expr: ExprId,
}
#[derive(Debug, Clone, Eq, PartialEq)]
pub enum Statement {
2021-10-07 15:05:50 +00:00
Let {
pat: PatId,
type_ref: Option<Interned<TypeRef>>,
initializer: Option<ExprId>,
else_branch: Option<ExprId>,
},
Expr {
expr: ExprId,
has_semi: bool,
},
Item(Item),
}
#[derive(Debug, Clone, PartialEq, Eq)]
pub enum Item {
MacroDef(Box<MacroDefId>),
Other,
2019-11-12 12:09:25 +00:00
}
/// Explicit binding annotations given in the HIR for a binding. Note
/// that this is not the final binding *mode* that we infer after type
/// inference.
#[derive(Clone, PartialEq, Eq, Debug, Copy)]
pub enum BindingAnnotation {
/// No binding annotation given: this means that the final binding mode
/// will depend on whether we have skipped through a `&` reference
/// when matching. For example, the `x` in `Some(x)` will have binding
/// mode `None`; if you do `let Some(x) = &Some(22)`, it will
/// ultimately be inferred to be by-reference.
Unannotated,
/// Annotated with `mut x` -- could be either ref or not, similar to `None`.
Mutable,
/// Annotated as `ref`, like `ref x`
Ref,
/// Annotated as `ref mut x`.
RefMut,
}
impl BindingAnnotation {
pub fn new(is_mutable: bool, is_ref: bool) -> Self {
match (is_mutable, is_ref) {
(true, true) => BindingAnnotation::RefMut,
(false, true) => BindingAnnotation::Ref,
(true, false) => BindingAnnotation::Mutable,
(false, false) => BindingAnnotation::Unannotated,
}
}
}
#[derive(Debug, Clone, Eq, PartialEq)]
pub enum BindingProblems {
/// <https://doc.rust-lang.org/stable/error_codes/E0416.html>
BoundMoreThanOnce,
/// <https://doc.rust-lang.org/stable/error_codes/E0409.html>
BoundInconsistently,
/// <https://doc.rust-lang.org/stable/error_codes/E0408.html>
NotBoundAcrossAll,
}
2023-02-18 20:32:55 +00:00
#[derive(Debug, Clone, Eq, PartialEq)]
pub struct Binding {
pub name: Name,
pub mode: BindingAnnotation,
pub problems: Option<BindingProblems>,
2023-04-06 12:44:38 +00:00
}
2019-11-12 12:09:25 +00:00
#[derive(Debug, Clone, Eq, PartialEq)]
pub struct RecordFieldPat {
pub name: Name,
pub pat: PatId,
}
/// Close relative to rustc's hir::PatKind
#[derive(Debug, Clone, Eq, PartialEq)]
pub enum Pat {
Missing,
Wild,
Tuple {
args: Box<[PatId]>,
ellipsis: Option<u32>,
},
Or(Box<[PatId]>),
Record {
path: Option<Box<Path>>,
args: Box<[RecordFieldPat]>,
ellipsis: bool,
},
Range {
start: Option<Box<LiteralOrConst>>,
end: Option<Box<LiteralOrConst>>,
},
Slice {
prefix: Box<[PatId]>,
slice: Option<PatId>,
suffix: Box<[PatId]>,
},
/// This might refer to a variable if a single segment path (specifically, on destructuring assignment).
Path(Box<Path>),
2019-11-12 12:09:25 +00:00
Lit(ExprId),
Bind {
id: BindingId,
subpat: Option<PatId>,
},
TupleStruct {
path: Option<Box<Path>>,
args: Box<[PatId]>,
ellipsis: Option<u32>,
},
Ref {
pat: PatId,
mutability: Mutability,
},
Box {
inner: PatId,
},
2020-12-23 11:15:38 +00:00
ConstBlock(ExprId),
/// An expression inside a pattern. That can only occur inside assignments.
///
/// E.g. in `(a, *b) = (1, &mut 2)`, `*b` is an expression.
Expr(ExprId),
2019-11-12 12:09:25 +00:00
}
impl Pat {
pub fn walk_child_pats(&self, mut f: impl FnMut(PatId)) {
match self {
2020-12-23 11:15:38 +00:00
Pat::Range { .. }
| Pat::Lit(..)
| Pat::Path(..)
| Pat::ConstBlock(..)
| Pat::Wild
| Pat::Missing
| Pat::Expr(_) => {}
2019-11-12 12:09:25 +00:00
Pat::Bind { subpat, .. } => {
subpat.iter().copied().for_each(f);
}
2020-04-12 15:40:09 +00:00
Pat::Or(args) | Pat::Tuple { args, .. } | Pat::TupleStruct { args, .. } => {
2019-11-12 12:09:25 +00:00
args.iter().copied().for_each(f);
}
Pat::Ref { pat, .. } => f(*pat),
Pat::Slice { prefix, slice, suffix } => {
let total_iter = prefix.iter().chain(slice.iter()).chain(suffix.iter());
2019-11-12 12:09:25 +00:00
total_iter.copied().for_each(f);
}
Pat::Record { args, .. } => {
args.iter().map(|f| f.pat).for_each(f);
}
2020-09-12 19:18:57 +00:00
Pat::Box { inner } => f(*inner),
2019-11-12 12:09:25 +00:00
}
}
}