use bitflags::bitflags; use rustpython_parser::ast::{self, Constant, Expr, Stmt}; bitflags! { #[derive(Default, Debug, Copy, Clone, PartialEq, Eq)] pub struct AllNamesFlags: u8 { const INVALID_FORMAT = 0b0000_0001; const INVALID_OBJECT = 0b0000_0010; } } /// Extract the names bound to a given __all__ assignment. /// /// Accepts a closure that determines whether a given name (e.g., `"list"`) is a Python builtin. pub fn extract_all_names(stmt: &Stmt, is_builtin: F) -> (Vec<&str>, AllNamesFlags) where F: Fn(&str) -> bool, { fn add_to_names<'a>(elts: &'a [Expr], names: &mut Vec<&'a str>, flags: &mut AllNamesFlags) { for elt in elts { if let Expr::Constant(ast::ExprConstant { value: Constant::Str(value), .. }) = elt { names.push(value); } else { *flags |= AllNamesFlags::INVALID_OBJECT; } } } fn extract_elts(expr: &Expr, is_builtin: F) -> (Option<&[Expr]>, AllNamesFlags) where F: Fn(&str) -> bool, { match expr { Expr::List(ast::ExprList { elts, .. }) => { return (Some(elts), AllNamesFlags::empty()); } Expr::Tuple(ast::ExprTuple { elts, .. }) => { return (Some(elts), AllNamesFlags::empty()); } Expr::ListComp(_) => { // Allow comprehensions, even though we can't statically analyze them. return (None, AllNamesFlags::empty()); } Expr::Call(ast::ExprCall { func, args, keywords, range: _range, }) => { // Allow `tuple()` and `list()` calls. if keywords.is_empty() && args.len() <= 1 { if let Expr::Name(ast::ExprName { id, .. }) = &**func { let id = id.as_str(); if id == "tuple" || id == "list" { if is_builtin(id) { if args.is_empty() { return (None, AllNamesFlags::empty()); } match &args[0] { Expr::List(ast::ExprList { elts, .. }) | Expr::Set(ast::ExprSet { elts, .. }) | Expr::Tuple(ast::ExprTuple { elts, .. }) => { return (Some(elts), AllNamesFlags::empty()); } Expr::ListComp(_) | Expr::SetComp(_) | Expr::GeneratorExp(_) => { // Allow comprehensions, even though we can't statically analyze // them. return (None, AllNamesFlags::empty()); } _ => {} } } } } } } _ => {} } (None, AllNamesFlags::INVALID_FORMAT) } let mut names: Vec<&str> = vec![]; let mut flags = AllNamesFlags::empty(); if let Some(value) = match stmt { Stmt::Assign(ast::StmtAssign { value, .. }) => Some(value), Stmt::AnnAssign(ast::StmtAnnAssign { value, .. }) => value.as_ref(), Stmt::AugAssign(ast::StmtAugAssign { value, .. }) => Some(value), _ => None, } { if let Expr::BinOp(ast::ExprBinOp { left, right, .. }) = &**value { let mut current_left = left; let mut current_right = right; loop { // Process the right side, which should be a "real" value. let (elts, new_flags) = extract_elts(current_right, |expr| is_builtin(expr)); flags |= new_flags; if let Some(elts) = elts { add_to_names(elts, &mut names, &mut flags); } // Process the left side, which can be a "real" value or the "rest" of the // binary operation. if let Expr::BinOp(ast::ExprBinOp { left, right, .. }) = &**current_left { current_left = left; current_right = right; } else { let (elts, new_flags) = extract_elts(current_left, |expr| is_builtin(expr)); flags |= new_flags; if let Some(elts) = elts { add_to_names(elts, &mut names, &mut flags); } break; } } } else { let (elts, new_flags) = extract_elts(value, |expr| is_builtin(expr)); flags |= new_flags; if let Some(elts) = elts { add_to_names(elts, &mut names, &mut flags); } } } (names, flags) }