forked from VimPlug/jedi
672 lines
26 KiB
Python
672 lines
26 KiB
Python
"""
|
|
Searching for names with given scope and name. This is very central in Jedi and
|
|
Python. The name resolution is quite complicated with descripter,
|
|
``__getattribute__``, ``__getattr__``, ``global``, etc.
|
|
|
|
Flow checks
|
|
+++++++++++
|
|
|
|
Flow checks are not really mature. There's only a check for ``isinstance``. It
|
|
would check whether a flow has the form of ``if isinstance(a, type_or_tuple)``.
|
|
Unfortunately every other thing is being ignored (e.g. a == '' would be easy to
|
|
check for -> a is a string). There's big potential in these checks.
|
|
"""
|
|
from itertools import chain
|
|
|
|
from jedi._compatibility import hasattr, unicode, u
|
|
from jedi.parser import representation as pr, tokenize
|
|
from jedi.parser import fast
|
|
from jedi import debug
|
|
from jedi import common
|
|
from jedi import settings
|
|
from jedi.evaluate import representation as er
|
|
from jedi.evaluate import dynamic
|
|
from jedi.evaluate import compiled
|
|
from jedi.evaluate import docstrings
|
|
from jedi.evaluate import iterable
|
|
from jedi.evaluate import imports
|
|
from jedi.evaluate import analysis
|
|
from jedi.evaluate import flow_analysis
|
|
|
|
|
|
class NameFinder(object):
|
|
def __init__(self, evaluator, scope, name_str, position=None):
|
|
self._evaluator = evaluator
|
|
self.scope = scope
|
|
self.name_str = name_str
|
|
self.position = position
|
|
|
|
@debug.increase_indent
|
|
def find(self, scopes, resolve_decorator=True, search_global=False):
|
|
names = self.filter_name(scopes, search_global)
|
|
types = self._names_to_types(names, resolve_decorator)
|
|
|
|
if not names and not types \
|
|
and not (isinstance(self.name_str, pr.Name)
|
|
and isinstance(self.name_str.parent.parent, pr.Param)):
|
|
if not isinstance(self.name_str, (str, unicode)): # TODO Remove?
|
|
if search_global:
|
|
message = ("NameError: name '%s' is not defined."
|
|
% self.name_str)
|
|
analysis.add(self._evaluator, 'name-error', self.name_str,
|
|
message)
|
|
else:
|
|
analysis.add_attribute_error(self._evaluator,
|
|
self.scope, self.name_str)
|
|
|
|
debug.dbg('finder._names_to_types: %s -> %s', names, types)
|
|
return self._resolve_descriptors(types)
|
|
|
|
def scopes(self, search_global=False):
|
|
if search_global:
|
|
return get_names_of_scope(self._evaluator, self.scope, self.position)
|
|
else:
|
|
return self.scope.scope_names_generator(self.position)
|
|
|
|
def names_dict_lookup(self, scope, position):
|
|
def get_param(el):
|
|
if isinstance(el.parent, pr.Param) or isinstance(el.parent.parent, pr.Param):
|
|
return scope.param_by_name(str(el))
|
|
return el
|
|
|
|
try:
|
|
names = scope.names_dict[str(self.name_str)]
|
|
except KeyError:
|
|
return []
|
|
|
|
if isinstance(scope, pr.CompFor):
|
|
return names
|
|
names = pr.filter_after_position(names, position)
|
|
names = [name for name in names if name.is_definition()]
|
|
|
|
# Only the names defined in the last position are valid definitions.
|
|
last_names = []
|
|
for name in reversed(sorted(names, key=lambda name: name.start_pos)):
|
|
check = flow_analysis.break_check(self._evaluator,
|
|
scope,
|
|
name.get_definition(),
|
|
self.name_str.get_definition().parent)
|
|
if check is not flow_analysis.UNREACHABLE:
|
|
last_names.append(name)
|
|
if check is flow_analysis.REACHABLE:
|
|
break
|
|
|
|
if isinstance(scope, er.FunctionExecution):
|
|
# Replace params
|
|
return [get_param(n) for n in last_names]
|
|
return last_names
|
|
|
|
def filter_name(self, scope_names_generator, search_global=False):
|
|
"""
|
|
Filters all variables of a scope (which are defined in the
|
|
`scope_names_generator`), until the name fits.
|
|
"""
|
|
# TODO Now this import is really ugly. Try to remove it.
|
|
# It's possibly the only api dependency.
|
|
from jedi.api.interpreter import InterpreterNamespace
|
|
names = []
|
|
self.maybe_descriptor = isinstance(self.scope, er.Class)
|
|
if not search_global and self.scope.isinstance(er.Function):
|
|
return [n for n in self.scope.get_magic_function_names()
|
|
if str(n) == str(self.name_str)]
|
|
|
|
for name_list_scope, name_list in scope_names_generator:
|
|
if hasattr(name_list_scope, 'names_dict'):
|
|
names = self.names_dict_lookup(name_list_scope, self.position)
|
|
if names:
|
|
break
|
|
if isinstance(name_list_scope, (pr.Function, er.FunctionExecution)):
|
|
self.position = None
|
|
continue
|
|
|
|
break_scopes = []
|
|
if not isinstance(name_list_scope, compiled.CompiledObject):
|
|
# Here is the position stuff happening (sorting of variables).
|
|
# Compiled objects don't need that, because there's only one
|
|
# reference.
|
|
name_list = sorted(name_list, key=lambda n: n.start_pos, reverse=True)
|
|
|
|
for name in name_list:
|
|
if unicode(self.name_str) != unicode(name):
|
|
continue
|
|
|
|
stmt = name.get_definition()
|
|
scope = stmt.parent
|
|
if scope in break_scopes:
|
|
continue
|
|
# TODO create a working version for filtering private
|
|
# variables.
|
|
#if not search_global and filter_private_variable(self.scope, scope, name.value):
|
|
# filter_private_variable(name_list_scope, scope, name.value):
|
|
# continue
|
|
|
|
# Exclude `arr[1] =` from the result set.
|
|
if not self._name_is_array_assignment(name, stmt):
|
|
# TODO we ignore a lot of elements here that should not be
|
|
# ignored. But then again flow_analysis also stops when the
|
|
# input scope is reached. This is not correct: variables
|
|
# might still have conditions if defined outside of the
|
|
# current scope.
|
|
if isinstance(stmt, (pr.Param, pr.Import)) \
|
|
or isinstance(name_list_scope, (pr.Lambda, pr.ListComprehension, er.Instance, InterpreterNamespace)) \
|
|
or isinstance(scope, compiled.CompiledObject) \
|
|
or isinstance(stmt, pr.ExprStmt) and stmt.is_global():
|
|
# Always reachable.
|
|
names.append(name)
|
|
else:
|
|
check = flow_analysis.break_check(self._evaluator,
|
|
name_list_scope,
|
|
stmt,
|
|
self.scope)
|
|
if check is not flow_analysis.UNREACHABLE:
|
|
names.append(name)
|
|
if check is flow_analysis.REACHABLE:
|
|
break
|
|
|
|
if names and self._is_name_break_scope(stmt):
|
|
if self._does_scope_break_immediately(scope, name_list_scope):
|
|
break
|
|
else:
|
|
break_scopes.append(scope)
|
|
if names:
|
|
break
|
|
|
|
if isinstance(self.scope, er.Instance):
|
|
# After checking the dictionary of an instance (self
|
|
# attributes), an attribute maybe a descriptor.
|
|
self.maybe_descriptor = True
|
|
|
|
scope_txt = (self.scope if self.scope == name_list_scope
|
|
else '%s-%s' % (self.scope, name_list_scope))
|
|
debug.dbg('finder.filter_name "%s" in (%s): %s@%s', self.name_str,
|
|
scope_txt, u(names), self.position)
|
|
return list(self._clean_names(names))
|
|
|
|
def _clean_names(self, names):
|
|
"""
|
|
``NameFinder.filter_name`` should only output names with correct
|
|
wrapper parents. We don't want to see AST classes out in the
|
|
evaluation, so remove them already here!
|
|
"""
|
|
for n in names:
|
|
definition = n.parent
|
|
if isinstance(definition, (pr.Function, pr.Class, pr.Module)):
|
|
yield er.wrap(self._evaluator, definition).name
|
|
else:
|
|
yield n
|
|
|
|
def _check_getattr(self, inst):
|
|
"""Checks for both __getattr__ and __getattribute__ methods"""
|
|
result = []
|
|
# str is important, because it shouldn't be `Name`!
|
|
name = compiled.create(self._evaluator, str(self.name_str))
|
|
with common.ignored(KeyError):
|
|
result = inst.execute_subscope_by_name('__getattr__', [name])
|
|
if not result:
|
|
# this is a little bit special. `__getattribute__` is executed
|
|
# before anything else. But: I know no use case, where this
|
|
# could be practical and the jedi would return wrong types. If
|
|
# you ever have something, let me know!
|
|
with common.ignored(KeyError):
|
|
result = inst.execute_subscope_by_name('__getattribute__', [name])
|
|
return result
|
|
|
|
def _is_name_break_scope(self, stmt):
|
|
"""
|
|
Returns True except for nested imports and instance variables.
|
|
"""
|
|
if stmt.isinstance(pr.ExprStmt):
|
|
if isinstance(stmt, er.InstanceElement) and not stmt.is_class_var:
|
|
return False
|
|
elif isinstance(stmt, pr.Import) and stmt.is_nested():
|
|
return False
|
|
return True
|
|
|
|
def _does_scope_break_immediately(self, scope, name_list_scope):
|
|
"""
|
|
In comparison to everthing else, if/while/etc doesn't break directly,
|
|
because there are multiple different places in which a variable can be
|
|
defined.
|
|
"""
|
|
if isinstance(scope, pr.Flow) \
|
|
or isinstance(scope, pr.GlobalStmt):
|
|
|
|
if isinstance(name_list_scope, er.Class):
|
|
name_list_scope = name_list_scope.base
|
|
return scope == name_list_scope
|
|
else:
|
|
return True
|
|
|
|
def _name_is_array_assignment(self, name, stmt):
|
|
if stmt.isinstance(pr.ExprStmt):
|
|
def is_execution(calls):
|
|
for c in calls:
|
|
if isinstance(c, (unicode, str, tokenize.Token)):
|
|
continue
|
|
if c.isinstance(pr.Array):
|
|
if is_execution(c):
|
|
return True
|
|
elif c.isinstance(pr.Call):
|
|
# Compare start_pos, because names may be different
|
|
# because of executions.
|
|
if c.name.start_pos == name.start_pos \
|
|
and isinstance(c.next, pr.Array):
|
|
return True
|
|
return False
|
|
|
|
is_exe = False
|
|
for assignee, op in stmt.assignment_details:
|
|
is_exe |= is_execution(assignee)
|
|
|
|
if is_exe:
|
|
# filter array[3] = ...
|
|
# TODO check executions for dict contents
|
|
return True
|
|
return False
|
|
|
|
def _names_to_types(self, names, resolve_decorator):
|
|
types = []
|
|
evaluator = self._evaluator
|
|
|
|
# Add isinstance and other if/assert knowledge.
|
|
if isinstance(self.name_str, pr.Name):
|
|
flow_scope = self.name_str.parent.parent
|
|
# Ignore FunctionExecution parents for now.
|
|
until = flow_scope.get_parent_until(er.FunctionExecution)
|
|
while flow_scope and not isinstance(until, er.FunctionExecution):
|
|
# TODO check if result is in scope -> no evaluation necessary
|
|
n = check_flow_information(evaluator, flow_scope,
|
|
self.name_str, self.position)
|
|
if n:
|
|
return n
|
|
flow_scope = flow_scope.parent
|
|
|
|
for name in names:
|
|
typ = name.get_definition()
|
|
if typ.isinstance(pr.ForStmt):
|
|
for_types = self._evaluator.eval_element(typ.children[-3])
|
|
for_types = iterable.get_iterator_types(for_types)
|
|
types += check_tuple_assignments(for_types, name)
|
|
elif typ.isinstance(pr.CompFor):
|
|
for_types = self._evaluator.eval_element(typ.children[3])
|
|
for_types = iterable.get_iterator_types(for_types)
|
|
types += check_tuple_assignments(for_types, name)
|
|
elif isinstance(typ, pr.Param):
|
|
types += self._eval_param(typ)
|
|
elif typ.isinstance(pr.ExprStmt):
|
|
types += self._remove_statements(typ, name)
|
|
elif isinstance(typ, pr.Import):
|
|
types += imports.ImportWrapper(self._evaluator, name).follow()
|
|
else:
|
|
if typ.isinstance(er.Function) and resolve_decorator:
|
|
typ = typ.get_decorated_func()
|
|
types.append(typ)
|
|
|
|
if not names and isinstance(self.scope, er.Instance):
|
|
# handling __getattr__ / __getattribute__
|
|
types = self._check_getattr(self.scope)
|
|
|
|
return types
|
|
|
|
def _remove_statements(self, stmt, name):
|
|
"""
|
|
This is the part where statements are being stripped.
|
|
|
|
Due to lazy evaluation, statements like a = func; b = a; b() have to be
|
|
evaluated.
|
|
"""
|
|
evaluator = self._evaluator
|
|
types = []
|
|
# Remove the statement docstr stuff for now, that has to be
|
|
# implemented with the evaluator class.
|
|
#if stmt.docstr:
|
|
#res_new.append(stmt)
|
|
|
|
check_instance = None
|
|
if isinstance(stmt, er.InstanceElement) and stmt.is_class_var:
|
|
check_instance = stmt.instance
|
|
stmt = stmt.var
|
|
|
|
types += evaluator.eval_statement(stmt, seek_name=name)
|
|
|
|
# check for `except X as y` usages, because y needs to be instantiated.
|
|
p = stmt.parent
|
|
# TODO this looks really hacky, improve parser representation!
|
|
if isinstance(p, pr.Flow) and p.command == 'except' and p.inputs:
|
|
as_names = p.inputs[0].as_names
|
|
try:
|
|
if as_names[0] == name:
|
|
# TODO check for types that are not classes and add it to
|
|
# the static analysis report.
|
|
types = list(chain.from_iterable(
|
|
evaluator.execute(t) for t in types))
|
|
except IndexError:
|
|
pass
|
|
|
|
if check_instance is not None:
|
|
# class renames
|
|
types = [er.get_instance_el(evaluator, check_instance, a, True)
|
|
if isinstance(a, (er.Function, pr.Function))
|
|
else a for a in types]
|
|
return types
|
|
|
|
def _eval_param(self, param):
|
|
evaluator = self._evaluator
|
|
res_new = []
|
|
func = param.parent
|
|
|
|
cls = func.parent.get_parent_until((pr.Class, pr.Function))
|
|
|
|
from jedi.evaluate.param import ExecutedParam, Arguments
|
|
if isinstance(cls, pr.Class) and param.position_nr == 0 \
|
|
and not isinstance(param, ExecutedParam):
|
|
# This is where we add self - if it has never been
|
|
# instantiated.
|
|
if isinstance(self.scope, er.InstanceElement):
|
|
res_new.append(self.scope.instance)
|
|
else:
|
|
inst = er.Instance(evaluator, er.wrap(evaluator, cls),
|
|
Arguments(evaluator, ()), is_generated=True)
|
|
res_new.append(inst)
|
|
return res_new
|
|
|
|
# Instances are typically faked, if the instance is not called from
|
|
# outside. Here we check it for __init__ functions and return.
|
|
if isinstance(func, er.InstanceElement) \
|
|
and func.instance.is_generated and str(func.name) == '__init__':
|
|
param = func.var.params[param.position_nr]
|
|
|
|
# Add docstring knowledge.
|
|
doc_params = docstrings.follow_param(evaluator, param)
|
|
if doc_params:
|
|
return doc_params
|
|
|
|
if not isinstance(param, ExecutedParam):
|
|
# Param owns no information itself.
|
|
res_new += dynamic.search_params(evaluator, param)
|
|
if not res_new:
|
|
if param.stars:
|
|
t = 'tuple' if param.stars == 1 else 'dict'
|
|
typ = evaluator.find_types(compiled.builtin, t)[0]
|
|
res_new = evaluator.execute(typ)
|
|
if not param.assignment_details:
|
|
# this means that there are no default params,
|
|
# so just ignore it.
|
|
return res_new
|
|
return res_new + param.eval(self._evaluator)
|
|
|
|
def _resolve_descriptors(self, types):
|
|
"""Processes descriptors"""
|
|
if not self.maybe_descriptor:
|
|
return types
|
|
result = []
|
|
for r in types:
|
|
if isinstance(self.scope, (er.Instance, er.Class)) \
|
|
and hasattr(r, 'get_descriptor_return'):
|
|
# handle descriptors
|
|
with common.ignored(KeyError):
|
|
result += r.get_descriptor_return(self.scope)
|
|
continue
|
|
result.append(r)
|
|
return result
|
|
|
|
|
|
def check_flow_information(evaluator, flow, search_name_part, pos):
|
|
""" Try to find out the type of a variable just with the information that
|
|
is given by the flows: e.g. It is also responsible for assert checks.::
|
|
|
|
if isinstance(k, str):
|
|
k. # <- completion here
|
|
|
|
ensures that `k` is a string.
|
|
"""
|
|
if not settings.dynamic_flow_information:
|
|
return None
|
|
|
|
result = []
|
|
if False and flow.is_scope():
|
|
for ass in reversed(flow.asserts):
|
|
if pos is None or ass.start_pos > pos:
|
|
continue
|
|
result = _check_isinstance_type(evaluator, ass, search_name_part)
|
|
if result:
|
|
break
|
|
|
|
if isinstance(flow, pr.Flow) and not result:
|
|
if isinstance(flow, (pr.IfStmt, pr.WhileStmt)) and False and len(flow.inputs) == 1:
|
|
result = _check_isinstance_type(evaluator, flow.inputs[0], search_name_part)
|
|
return result
|
|
|
|
|
|
def _check_isinstance_type(evaluator, stmt, search_name):
|
|
try:
|
|
expression_list = stmt.expression_list()
|
|
# this might be removed if we analyze and, etc
|
|
assert len(expression_list) == 1
|
|
call = expression_list[0]
|
|
assert isinstance(call, pr.Call) and str(call.name) == 'isinstance'
|
|
assert call.next_is_execution()
|
|
|
|
# isinstance check
|
|
isinst = call.next.values
|
|
assert len(isinst) == 2 # has two params
|
|
obj, classes = [statement.expression_list() for statement in isinst]
|
|
assert len(obj) == 1
|
|
assert len(classes) == 1
|
|
assert isinstance(obj[0], pr.Call)
|
|
|
|
prev = search_name.parent
|
|
while prev.previous is not None:
|
|
prev = prev.previous
|
|
# Do a simple get_code comparison. They should just have the same code,
|
|
# and everything will be all right.
|
|
assert obj[0].get_code() == prev.get_code()
|
|
assert isinstance(classes[0], pr.StatementElement) # can be type or tuple
|
|
except AssertionError:
|
|
return []
|
|
|
|
result = []
|
|
for c in evaluator.eval_call(classes[0]):
|
|
for typ in (c.values() if isinstance(c, iterable.Array) else [c]):
|
|
result += evaluator.execute(typ)
|
|
return result
|
|
|
|
|
|
def get_names_of_scope(evaluator, scope, position=None, star_search=True, include_builtin=True):
|
|
"""
|
|
Get all completions (names) possible for the current scope. The star search
|
|
option is only here to provide an optimization. Otherwise the whole thing
|
|
would probably start a little recursive madness.
|
|
|
|
This function is used to include names from outer scopes. For example, when
|
|
the current scope is function:
|
|
|
|
>>> from jedi._compatibility import u
|
|
>>> from jedi.parser import Parser
|
|
>>> parser = Parser(u('''
|
|
... x = ['a', 'b', 'c']
|
|
... def func():
|
|
... y = None
|
|
... '''))
|
|
>>> scope = parser.module.subscopes[0]
|
|
>>> scope
|
|
<Function: func@3-5>
|
|
|
|
`get_names_of_scope` is a generator. First it yields names from most inner
|
|
scope.
|
|
|
|
>>> from jedi.evaluate import Evaluator
|
|
>>> pairs = list(get_names_of_scope(Evaluator(), scope))
|
|
>>> pairs[0]
|
|
(<Function: func@3-5>, [<Name: y@4,4>])
|
|
|
|
Then it yield the names from one level outer scope. For this example, this
|
|
is the most outer scope.
|
|
|
|
>>> pairs[1]
|
|
(<ModuleWrapper: <SubModule: None@1-5>>, [<Name: x@2,0>, <Name: func@3,4>])
|
|
|
|
After that we have a few underscore names that have been defined
|
|
|
|
>>> pairs[2]
|
|
(<ModuleWrapper: <SubModule: None@1-5>>, [<LazyName: __file__@0,0>, ...])
|
|
|
|
|
|
Finally, it yields names from builtin, if `include_builtin` is
|
|
true (default).
|
|
|
|
>>> pairs[3] #doctest: +ELLIPSIS
|
|
(<Builtin: ...builtin...>, [<CompiledName: ...>, ...])
|
|
|
|
:rtype: [(pr.Scope, [pr.Name])]
|
|
:return: Return an generator that yields a pair of scope and names.
|
|
"""
|
|
if isinstance(scope, pr.ListComprehension):
|
|
position = scope.parent.start_pos
|
|
|
|
in_func_scope = scope
|
|
non_flow = scope.get_parent_until(pr.Flow, reverse=True)
|
|
while scope:
|
|
# We don't want submodules to report if we have modules.
|
|
# As well as some non-scopes, which are parents of list comprehensions.
|
|
if isinstance(scope, pr.SubModule) and scope.parent or not scope.is_scope():
|
|
scope = scope.parent
|
|
continue
|
|
# `pr.Class` is used, because the parent is never `Class`.
|
|
# Ignore the Flows, because the classes and functions care for that.
|
|
# InstanceElement of Class is ignored, if it is not the start scope.
|
|
if not (scope != non_flow and scope.isinstance(pr.Class)
|
|
or scope.isinstance(pr.Flow)
|
|
or scope.isinstance(er.Instance)
|
|
and non_flow.isinstance(er.Function)
|
|
or isinstance(scope, compiled.CompiledObject)
|
|
and scope.type() == 'class' and in_func_scope != scope):
|
|
|
|
if isinstance(scope, (pr.SubModule, fast.Module)):
|
|
scope = er.ModuleWrapper(evaluator, scope)
|
|
|
|
for g in scope.scope_names_generator(position):
|
|
yield g
|
|
if scope.isinstance(pr.ListComprehension):
|
|
# is a list comprehension
|
|
yield scope, scope.get_defined_names(is_internal_call=True)
|
|
|
|
scope = scope.parent
|
|
# This is used, because subscopes (Flow scopes) would distort the
|
|
# results.
|
|
if scope and scope.isinstance(er.Function, pr.Function, er.FunctionExecution):
|
|
in_func_scope = scope
|
|
if in_func_scope != scope \
|
|
and isinstance(in_func_scope, (pr.Function, er.FunctionExecution)):
|
|
position = None
|
|
|
|
# Add star imports.
|
|
if star_search:
|
|
for s in imports.remove_star_imports(evaluator, non_flow.get_parent_until()):
|
|
for g in get_names_of_scope(evaluator, s, star_search=False):
|
|
yield g
|
|
|
|
# Add builtins to the global scope.
|
|
if include_builtin:
|
|
yield compiled.builtin, compiled.builtin.get_defined_names()
|
|
|
|
|
|
def _assign_tuples(tup, results, seek_name):
|
|
"""
|
|
This is a normal assignment checker. In python functions and other things
|
|
can return tuples:
|
|
>>> a, b = 1, ""
|
|
>>> a, (b, c) = 1, ("", 1.0)
|
|
|
|
Here, if `seek_name` is "a", the number type will be returned.
|
|
The first part (before `=`) is the param tuples, the second one result.
|
|
|
|
:type tup: pr.Array
|
|
"""
|
|
def eval_results(index):
|
|
types = []
|
|
for r in results:
|
|
try:
|
|
func = r.get_exact_index_types
|
|
except AttributeError:
|
|
debug.warning("invalid tuple lookup %s of result %s in %s",
|
|
tup, results, seek_name)
|
|
else:
|
|
with common.ignored(IndexError):
|
|
types += func(index)
|
|
return types
|
|
|
|
result = []
|
|
for i, stmt in enumerate(tup):
|
|
# Used in assignments. There is just one call and no other things,
|
|
# therefore we can just assume, that the first part is important.
|
|
command = stmt.expression_list()[0]
|
|
|
|
if tup.type == pr.Array.NOARRAY:
|
|
|
|
# unnessecary braces -> just remove.
|
|
r = results
|
|
else:
|
|
r = eval_results(i)
|
|
|
|
# LHS of tuples can be nested, so resolve it recursively
|
|
result += find_assignments(command, r, seek_name)
|
|
return result
|
|
|
|
|
|
def find_assignments(lhs, results, seek_name):
|
|
"""
|
|
Check if `seek_name` is in the left hand side `lhs` of assignment.
|
|
|
|
`lhs` can simply be a variable (`pr.Call`) or a tuple/list (`pr.Array`)
|
|
representing the following cases::
|
|
|
|
a = 1 # lhs is pr.Call
|
|
(a, b) = 2 # lhs is pr.Array
|
|
|
|
:type lhs: pr.Call
|
|
:type results: list
|
|
:type seek_name: str
|
|
"""
|
|
if isinstance(lhs, pr.Array):
|
|
return _assign_tuples(lhs, results, seek_name)
|
|
elif unicode(lhs.name) == seek_name:
|
|
return results
|
|
else:
|
|
return []
|
|
|
|
|
|
def check_tuple_assignments(types, name):
|
|
"""
|
|
Checks if tuples are assigned.
|
|
"""
|
|
for index in name.assignment_indexes():
|
|
new_types = []
|
|
for r in types:
|
|
try:
|
|
func = r.get_exact_index_types
|
|
except AttributeError:
|
|
debug.warning("Invalid tuple lookup #%s of result %s in %s",
|
|
index, types, name)
|
|
else:
|
|
try:
|
|
new_types += func(index)
|
|
except IndexError:
|
|
pass
|
|
types = new_types
|
|
return types
|
|
|
|
|
|
def filter_private_variable(scope, call_scope, var_name):
|
|
"""private variables begin with a double underline `__`"""
|
|
if isinstance(scope, er.Instance) and var_name.startswith('__') and not var_name.endswith('__'):
|
|
s = call_scope.get_parent_until((pr.Class, er.Instance, compiled.CompiledObject))
|
|
if s != scope:
|
|
if isinstance(scope.base, compiled.CompiledObject):
|
|
if s != scope.base:
|
|
return True
|
|
else:
|
|
if s != scope.base.base:
|
|
return True
|
|
return False
|