let mut expressions: SmallVec<[&ast::Expr; 2]> = SmallVec::new();

expressions.push(subject);

match subject {

ast::Expr::Subscript(subscript) => expressions.push(&subscript.value),

ast::Expr::Attribute(attribute) => expressions.push(&attribute.value),

_ => {}

}

expressions

/// A simple symbol, e.g. `x`.

Symbol(Symbol),

/// A member expression, e.g. `x.y.z[0]`.

Member(Member),

/// Create a new `PlaceExpr` from a name.

///

/// This always returns a `PlaceExpr::Symbol` with empty flags and `name`.

pub fn from_expr_name(name: &ast::ExprName) -> Self {

PlaceExpr::Symbol(Symbol::new(name.id.clone()))

}

/// Tries to create a `PlaceExpr` from an expression.

///

/// Returns `None` if the expression is not a valid place expression and `Some` otherwise.

///

/// Valid expressions are:

/// * name: `x`

/// * attribute: `x.y`

/// * subscripts with integer or string literals: `x[0]`, `x['key']`

pub fn try_from_expr<'e>(expr: impl Into<ast::ExprRef<'e>>) -> Option<Self> {

let expr = expr.into();

// For named expressions (walrus operator), extract the target. The grammar only permits

// names as targets; parser recovery may still produce other expressions here.

let expr = match expr {

ast::ExprRef::Named(named) if named.target.is_name_expr() => {

named.target.as_ref().into()

}

ast::ExprRef::Named(_) => return None,

_ => expr,

};

if let ast::ExprRef::Name(name) = expr {

return Some(PlaceExpr::Symbol(Symbol::new(name.id.clone())));

}

MemberExprBuilder::visit_expr(expr).and_then(Self::try_from_member_expr)

}

/// Tries to create a `PlaceExpr` from a member expression.

///

/// Returns `None` if the expression is not a valid place expression and `Some` otherwise.

pub(super) fn try_from_member_expr(builder: MemberExprBuilder) -> Option<Self> {

let member_expression = MemberExpr::try_from_builder(builder)?;

Some(Self::Member(Member::new(member_expression)))

}

fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {

match self {

Self::Symbol(symbol) => std::fmt::Display::fmt(symbol, f),

Self::Member(member) => std::fmt::Display::fmt(member, f),

}

}

/// Returns `Some` if the reference is a `Symbol`, otherwise `None`.

pub const fn as_symbol(self) -> Option<&'a Symbol> {

if let PlaceExprRef::Symbol(symbol) = self {

Some(symbol)

} else {

None

}

}

/// Returns `true` if the reference is a `Symbol`, otherwise `false`.

pub const fn is_symbol(self) -> bool {

matches!(self, PlaceExprRef::Symbol(_))

}

pub fn is_declared(self) -> bool {

match self {

Self::Symbol(symbol) => symbol.is_declared(),

Self::Member(member) => member.is_declared(),

}

}

pub const fn is_bound(self) -> bool {

match self {

PlaceExprRef::Symbol(symbol) => symbol.is_bound(),

PlaceExprRef::Member(member) => member.is_bound(),

}

}

pub fn num_member_segments(self) -> usize {

match self {

PlaceExprRef::Symbol(_) => 0,

PlaceExprRef::Member(member) => member.expression().num_segments(),

}

}

fn from(value: &'a Symbol) -> Self {

Self::Symbol(value)

}

fn from(value: &'a Member) -> Self {

Self::Member(value)

}

fn from(value: &'a PlaceExpr) -> Self {

match value {

PlaceExpr::Symbol(symbol) => PlaceExprRef::Symbol(symbol),

PlaceExpr::Member(member) => PlaceExprRef::Member(member),

}

}

fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {

match self {

Self::Symbol(symbol) => std::fmt::Display::fmt(symbol, f),

Self::Member(member) => std::fmt::Display::fmt(member, f),

}

}

fn hash<H: Hasher>(&self, state: &mut H) {

// The reverse-lookup indexes are also ignored by equality.

self.symbols.iter().len().hash(state);

for symbol in self.symbols.iter() {

symbol.name().hash(state);

symbol.is_used().hash(state);

symbol.is_bound().hash(state);

symbol.is_declared().hash(state);

symbol.is_global().hash(state);

symbol.is_nonlocal().hash(state);

symbol.is_reassigned().hash(state);

symbol.is_parameter().hash(state);

}

self.members.iter().len().hash(state);

for member in self.members.iter() {

member.expression().as_ref().hash(state);

member.is_bound().hash(state);

member.is_declared().hash(state);

member.is_instance_attribute().hash(state);

}

}

/// Iterate over the "root" expressions of the place (e.g. `x.y.z`, `x.y`, `x` for `x.y.z[0]`).

///

/// Note, this iterator may skip some parents if they are not defined in the current scope.

pub fn parents<'a>(&'a self, place_expr: impl Into<PlaceExprRef<'a>>) -> ParentPlaceIter<'a> {

match place_expr.into() {

PlaceExprRef::Symbol(_) => ParentPlaceIter::for_symbol(),

PlaceExprRef::Member(member) => {

ParentPlaceIter::for_member(member.expression(), &self.symbols, &self.members)

}

}

}

/// Iterator over all symbols in this scope.

pub fn symbols(&self) -> std::slice::Iter<'_, Symbol> {

self.symbols.iter()

}

/// Iterator over all members in this scope.

pub fn members(&self) -> std::slice::Iter<'_, Member> {

self.members.iter()

}

/// Receiver attributes that this scope can define. A read of `self.value` alone

/// does not establish `value` as an implicit attribute.

pub fn defined_instance_attribute_names(&self) -> impl Iterator<Item = &str> {

self.members

.iter()

.filter(|member| member.is_bound() || member.is_declared())

.filter_map(Member::as_instance_attribute)

}

/// Receiver attributes declared in this scope, such as `self.value: int`.

pub fn declared_instance_attributes(&self) -> impl Iterator<Item = (ScopedMemberId, &str)> {

self.members.iter().enumerate().filter_map(|(id, member)| {

if !member.is_declared() {

return None;

}

Some((

ScopedMemberId::from_usize(id),

member.as_instance_attribute()?,

))

})

}

/// Looks up a symbol by its ID and returns a reference to it.

///

/// ## Panics

/// If the symbol ID is not found in the table.

#[track_caller]

pub fn symbol(&self, id: ScopedSymbolId) -> &Symbol {

self.symbols.symbol(id)

}

/// Looks up a symbol by its name and returns a reference to it, if it exists.

///

/// This should only be used in diagnostics and tests.

pub fn symbol_by_name(&self, name: &str) -> Option<&Symbol> {

self.symbols.symbol_id(name).map(|id| self.symbol(id))

}

/// Looks up a member by its ID and returns a reference to it.

///

/// ## Panics

/// If the member ID is not found in the table.

#[track_caller]

pub fn member(&self, id: ScopedMemberId) -> &Member {

self.members.member(id)

}

/// Returns the [`ScopedSymbolId`] of the place named `name`.

pub fn symbol_id(&self, name: &str) -> Option<ScopedSymbolId> {

self.symbols.symbol_id(name)

}

/// Returns the [`ScopedPlaceId`] of the place expression.

pub fn place_id<'e>(&self, place_expr: impl Into<PlaceExprRef<'e>>) -> Option<ScopedPlaceId> {

let place_expr = place_expr.into();

match place_expr {

PlaceExprRef::Symbol(symbol) => self.symbols.symbol_id(symbol.name()).map(Into::into),

PlaceExprRef::Member(member) => {

self.members.member_id(member.expression()).map(Into::into)

}

}

}

/// Returns the place expression for the given place ID.

///

/// ## Panics

/// If the place ID is not found in the table.

#[track_caller]

pub fn place(&self, place_id: impl Into<ScopedPlaceId>) -> PlaceExprRef<'_> {

match place_id.into() {

ScopedPlaceId::Symbol(symbol) => self.symbol(symbol).into(),

ScopedPlaceId::Member(member) => self.member(member).into(),

}

}

pub fn member_id_by_instance_attribute_name(&self, name: &str) -> Option<ScopedMemberId> {

self.members.place_id_by_instance_attribute_name(name)

}

symbols: SymbolTableBuilder,

member: MemberTableBuilder,

associated_symbol_members: IndexVec<ScopedSymbolId, SmallVec<[ScopedMemberId; 4]>>,

associated_sub_members: IndexVec<ScopedMemberId, SmallVec<[ScopedMemberId; 4]>>,

/// Looks up a place ID by its expression.

pub(crate) fn place_id(&self, expression: PlaceExprRef) -> Option<ScopedPlaceId> {

match expression {

PlaceExprRef::Symbol(symbol) => self.symbols.symbol_id(symbol.name()).map(Into::into),

PlaceExprRef::Member(member) => {

self.member.member_id(member.expression()).map(Into::into)

}

}

}

#[track_caller]

pub(super) fn symbol(&self, id: ScopedSymbolId) -> &Symbol {

self.symbols.symbol(id)

}

pub(super) fn member(&self, id: ScopedMemberId) -> &Member {

self.member.member(id)

}

pub(super) fn symbol_id(&self, name: &str) -> Option<ScopedSymbolId> {

self.symbols.symbol_id(name)

}

#[track_caller]

pub(super) fn symbol_mut(&mut self, id: ScopedSymbolId) -> &mut Symbol {

self.symbols.symbol_mut(id)

}

#[track_caller]

fn member_mut(&mut self, id: ScopedMemberId) -> &mut Member {

self.member.member_mut(id)

}

#[track_caller]

pub(crate) fn place(&self, place_id: impl Into<ScopedPlaceId>) -> PlaceExprRef<'_> {

match place_id.into() {

ScopedPlaceId::Symbol(id) => PlaceExprRef::Symbol(self.symbols.symbol(id)),

ScopedPlaceId::Member(id) => PlaceExprRef::Member(self.member.member(id)),

}

}

pub(crate) fn associated_place_ids(&self, place: ScopedPlaceId) -> &[ScopedMemberId] {

match place {

ScopedPlaceId::Symbol(symbol) => &self.associated_symbol_members[symbol],

ScopedPlaceId::Member(member) => &self.associated_sub_members[member],

}

}

pub(crate) fn iter(&self) -> impl Iterator<Item = PlaceExprRef<'_>> {

self.symbols

.iter()

.map(Into::into)

.chain(self.member.iter().map(PlaceExprRef::Member))

}

pub(crate) fn symbols(&self) -> impl Iterator<Item = &Symbol> {

self.symbols.iter()

}

pub(crate) fn add_symbol(&mut self, symbol: Symbol) -> (ScopedSymbolId, bool) {

let (id, is_new) = self.symbols.add(symbol);

if is_new {

let new_id = self.associated_symbol_members.push(SmallVec::new_const());

debug_assert_eq!(new_id, id);

}

(id, is_new)

}

fn add_member(&mut self, member: Member) -> (ScopedMemberId, bool) {

let (id, is_new) = self.member.add(member);

if is_new {

let new_id = self.associated_sub_members.push(SmallVec::new_const());

debug_assert_eq!(new_id, id);

let member = self.member.member(id);

// iterate over parents

for parent_id in

ParentPlaceIter::for_member(member.expression(), &self.symbols, &self.member)

{

match parent_id {

ScopedPlaceId::Symbol(scoped_symbol_id) => {

self.associated_symbol_members[scoped_symbol_id].push(id);

}

ScopedPlaceId::Member(scoped_member_id) => {

self.associated_sub_members[scoped_member_id].push(id);

}

}

}

}

(id, is_new)

}

pub(crate) fn add_place(&mut self, place: PlaceExpr) -> (ScopedPlaceId, bool) {

match place {

PlaceExpr::Symbol(symbol) => {

let (id, is_new) = self.add_symbol(symbol);

(ScopedPlaceId::Symbol(id), is_new)

}

PlaceExpr::Member(member) => {

let (id, is_new) = self.add_member(member);

(ScopedPlaceId::Member(id), is_new)

}

}

}

#[track_caller]

pub(super) fn mark_bound(&mut self, id: ScopedPlaceId) {

match id {

ScopedPlaceId::Symbol(symbol_id) => {

self.symbol_mut(symbol_id).mark_bound();

}

ScopedPlaceId::Member(member_id) => {

self.member_mut(member_id).mark_bound();

}

}

}

#[track_caller]

pub(super) fn mark_declared(&mut self, id: ScopedPlaceId) {

match id {

ScopedPlaceId::Symbol(symbol_id) => {

self.symbol_mut(symbol_id).mark_declared();

}

ScopedPlaceId::Member(member_id) => {

self.member_mut(member_id).mark_declared();

}

}

}

pub(crate) fn finish(self) -> PlaceTable {

PlaceTable {

symbols: self.symbols.build(),

members: self.member.build(),

}

}

pub const fn is_symbol(self) -> bool {

matches!(self, ScopedPlaceId::Symbol(_))

}

pub const fn is_member(self) -> bool {

matches!(self, ScopedPlaceId::Member(_))

}

pub const fn as_symbol(self) -> Option<ScopedSymbolId> {

if let ScopedPlaceId::Symbol(id) = self {

Some(id)

} else {

None

}

}

pub const fn expect_symbol(self) -> ScopedSymbolId {

match self {

ScopedPlaceId::Symbol(symbol) => symbol,

ScopedPlaceId::Member(_) => {

panic!("Expected ScopedPlaceId::Symbol, found ScopedPlaceId::Member")

}

}

}

type Output = T;

fn index(&self, index: ScopedPlaceId) -> &Self::Output {

match index {

ScopedPlaceId::Symbol(id) => &self[id.index()],

ScopedPlaceId::Member(id) => &self[id.index()],

}

}

fn from(value: ScopedMemberId) -> Self {

Self::Member(value)

}

fn from(value: ScopedSymbolId) -> Self {

Self::Symbol(value)

}

Symbol {

symbol_name: &'a str,

symbols: &'a SymbolTable,

},

Member {

symbols: &'a SymbolTable,

members: &'a MemberTable,

next_member: MemberExprRef<'a>,

},

fn parent_state(

expression: &MemberExprRef<'a>,

symbols: &'a SymbolTable,

members: &'a MemberTable,

) -> Self {

match expression.parent() {

Some(parent) => Self::Member {

next_member: parent,

symbols,

members,

},

None => Self::Symbol {

symbol_name: expression.symbol_name(),

symbols,

},

}

}

fn for_symbol() -> Self {

ParentPlaceIter { state: None }

}

fn for_member(

expression: &'a MemberExpr,

symbol_table: &'a SymbolTable,

member_table: &'a MemberTable,

) -> Self {

let expr_ref = expression.as_ref();

ParentPlaceIter {

state: Some(ParentPlaceIterState::parent_state(

&expr_ref,

symbol_table,

member_table,

)),

}

}

type Item = ScopedPlaceId;

fn next(&mut self) -> Option<Self::Item> {

loop {

match self.state.take()? {

ParentPlaceIterState::Symbol {

symbol_name,

symbols,

} => {

let id = symbols.symbol_id(symbol_name)?;

break Some(id.into());

}

ParentPlaceIterState::Member {

symbols,

members,

next_member,

} => {

self.state = Some(ParentPlaceIterState::parent_state(

&next_member,

symbols,

members,

));

if let Some(id) = members.member_id(next_member) {

break Some(id.into());

}

}

}

}

}

pub(crate) fn new(db: &'db dyn Db, places: &'a PlaceTableBuilder) -> Self {

Self { db, places }

}

/// Compute possibly narrowed places for an expression predicate.

pub(crate) fn expression(self, expr: &ast::Expr) -> PossiblyNarrowedPlaces {

self.expression_node(expr)

}

/// Compute possibly narrowed places for a pattern predicate.

pub(crate) fn pattern(

self,

pattern: PatternPredicate<'db>,

module: &ParsedModuleRef,

) -> PossiblyNarrowedPlaces {

self.pattern_kind(pattern.subject(self.db), module)

}

fn expression_node(&self, expr: &ast::Expr) -> PossiblyNarrowedPlaces {

match expr {

// Simple expressions that directly narrow a place.

ast::Expr::Name(_) => self.simple_expr(expr),

// Attribute truthiness can also narrow its base (nominal tagged unions).

ast::Expr::Attribute(attribute) => {

let mut places = self.simple_expr(expr);

places.extend(self.simple_expr(&attribute.value));

places

}

// Subscript truthiness can also narrow its base (`TypedDict` and tuple unions).

ast::Expr::Subscript(subscript) => {

let mut places = self.simple_expr(expr);

places.extend(self.simple_expr(&subscript.value));

places

}

// Compare expressions can narrow places on either side

ast::Expr::Compare(expr_compare) => self.expr_compare(expr_compare),

// Call expressions (isinstance, issubclass, hasattr, TypeGuard, len, bool, etc.)

ast::Expr::Call(expr_call) => self.expr_call(expr_call),

// Unary not just delegates to its operand

ast::Expr::UnaryOp(unary_op) if unary_op.op == ast::UnaryOp::Not => {

self.expression_node(&unary_op.operand)

}

// Boolean operations combine places from all sub-expressions

ast::Expr::BoolOp(bool_op) => self.expr_bool_op(bool_op),

// Conditional expressions combine places from all branches and the test.

ast::Expr::If(expr_if) => self.expr_if(expr_if),

// Named expressions narrow both the target and the value

ast::Expr::Named(expr_named) => {

let mut places = self.simple_expr(&expr_named.target);

places.extend(self.expression_node(&expr_named.value));

places

}

_ => PossiblyNarrowedPlaces::default(),

}

}

/// Simple expressions that directly narrow a single place.

fn simple_expr(&self, expr: &ast::Expr) -> PossiblyNarrowedPlaces {

let mut places = PossiblyNarrowedPlaces::default();

if let Some(place_expr) = PlaceExpr::try_from_expr(expr) {

if let Some(place) = self.places.place_id((&place_expr).into()) {

places.insert(place);

}

}

places

}

/// Compare expressions can narrow places on either side of the comparison,

/// and can also narrow subscript bases (for `TypedDict` and tuple narrowing).

fn expr_compare(&self, expr_compare: &ast::ExprCompare) -> PossiblyNarrowedPlaces {

let mut places = PossiblyNarrowedPlaces::default();

for operand in &expr_compare.operands {

self.add_narrowing_target(operand, &mut places);

}

let can_narrow_tagged_union_base = matches!(

&*expr_compare.ops,

[ast::CmpOp::Eq | ast::CmpOp::NotEq | ast::CmpOp::Is | ast::CmpOp::IsNot]

);

// Tagged-union checks can also narrow the base of a subscript or attribute on either side.

for expr in &expr_compare.operands {

if can_narrow_tagged_union_base

&& let ast::Expr::Subscript(subscript) = expr.expression_value()

&& let Some(place_expr) = PlaceExpr::try_from_expr(&subscript.value)

&& let Some(place) = self.places.place_id((&place_expr).into())

{

places.insert(place);

}

if can_narrow_tagged_union_base

&& let ast::Expr::Attribute(attribute) = expr

&& let Some(place_expr) = PlaceExpr::try_from_expr(&attribute.value)

&& let Some(place) = self.places.place_id((&place_expr).into())

{

places.insert(place);

}

}

places

}

/// Call expressions can narrow their first argument (isinstance, issubclass, hasattr, len)

/// or narrow based on TypeGuard/TypeIs return types.

fn expr_call(&self, expr_call: &ast::ExprCall) -> PossiblyNarrowedPlaces {

let mut places = PossiblyNarrowedPlaces::default();

// Under the current narrowing semantics, we only ever use the first two positional

// arguments: argument 0 for most narrowing calls, and argument 1 for unbound

// TypeGuard/TypeIs methods (e.g. `C.f(C(), x)`). TypeGuard and TypeIs calls can also

// narrow an explicit keyword argument. We don't know which keyword maps to the target

// parameter while building the semantic index, so include every explicit keyword here.

// This set is only a conservative upper bound.

for argument in expr_call.arguments.args.iter().take(2).chain(

expr_call

.arguments

.keywords

.iter()

.filter(|keyword| keyword.arg.is_some())

.map(|keyword| &keyword.value),

) {

if let Some(place_expr) = PlaceExpr::try_from_expr(argument)

&& let Some(place) = self.places.place_id((&place_expr).into())

{

places.insert(place);

}

// Checking a tuple element can also eliminate alternatives of its tuple union.

if let ast::Expr::Subscript(subscript) = argument.expression_value()

&& let Some(place_expr) = PlaceExpr::try_from_expr(&subscript.value)

&& let Some(place) = self.places.place_id((&place_expr).into())

{

places.insert(place);

}

}

// `bool(expr)` can delegate to narrowing `expr` itself, e.g. `bool(x is not None)`

if let Some(first_arg) = expr_call.arguments.args.first() {

if expr_call.arguments.args.len() == 1 && expr_call.arguments.keywords.is_empty() {

places.extend(self.expression_node(first_arg));

}

}

places

}

/// Boolean operations combine places from all sub-expressions.

fn expr_bool_op(&self, bool_op: &ast::ExprBoolOp) -> PossiblyNarrowedPlaces {

let mut places = PossiblyNarrowedPlaces::default();

for value in &bool_op.values {

places.extend(self.expression_node(value));

}

places

}

fn expr_if(&self, expr_if: &ast::ExprIf) -> PossiblyNarrowedPlaces {

let mut places = self.expression_node(&expr_if.test);

places.extend(self.expression_node(&expr_if.body));

places.extend(self.expression_node(&expr_if.orelse));

places

}

/// Helper to add a potential narrowing target expression to the set.

fn add_narrowing_target(&self, expr: &ast::Expr, places: &mut PossiblyNarrowedPlaces) {

if let Some(place_expr) = PlaceExpr::try_from_expr(expr)

&& let Some(place) = self.places.place_id((&place_expr).into())

{

places.insert(place);

}

match expr.expression_value() {

// type(x) is Y can narrow x

ast::Expr::Call(call) if call.arguments.args.len() == 1 => {

if let Some(first_arg) = call.arguments.args.first()

&& let Some(place_expr) = PlaceExpr::try_from_expr(first_arg)

&& let Some(place) = self.places.place_id((&place_expr).into())

{

places.insert(place);

}

}

// x.__class__ is Y can narrow x

ast::Expr::Attribute(attribute) if attribute.attr.as_str() == "__class__" => {

if let Some(place_expr) = PlaceExpr::try_from_expr(&attribute.value)

&& let Some(place) = self.places.place_id((&place_expr).into())

{

places.insert(place);

}

}

_ => {}

}

}

/// Pattern predicates narrow the match subject.

fn pattern_kind(

&self,