gvsig-scripting / org.gvsig.scripting / trunk / org.gvsig.scripting / org.gvsig.scripting.app / org.gvsig.scripting.app.mainplugin / src / main / resources-plugin / scripting / lib / astroid / rebuilder.py @ 745
History | View | Annotate | Download (40.9 KB)
1 |
# copyright 2003-2013 LOGILAB S.A. (Paris, FRANCE), all rights reserved.
|
---|---|
2 |
# contact http://www.logilab.fr/ -- mailto:contact@logilab.fr
|
3 |
#
|
4 |
# This file is part of astroid.
|
5 |
#
|
6 |
# astroid is free software: you can redistribute it and/or modify it
|
7 |
# under the terms of the GNU Lesser General Public License as published by the
|
8 |
# Free Software Foundation, either version 2.1 of the License, or (at your
|
9 |
# option) any later version.
|
10 |
#
|
11 |
# astroid is distributed in the hope that it will be useful, but
|
12 |
# WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
|
13 |
# FITNESS FOR A PARTICULAR PURPOSE. See the GNU Lesser General Public License
|
14 |
# for more details.
|
15 |
#
|
16 |
# You should have received a copy of the GNU Lesser General Public License along
|
17 |
# with astroid. If not, see <http://www.gnu.org/licenses/>.
|
18 |
"""this module contains utilities for rebuilding a _ast tree in
|
19 |
order to get a single Astroid representation
|
20 |
"""
|
21 |
|
22 |
import sys |
23 |
import _ast |
24 |
from _ast import ( |
25 |
# binary operators
|
26 |
Add, Div, FloorDiv, Mod, Mult, Pow, Sub, BitAnd, BitOr, BitXor, |
27 |
LShift, RShift, |
28 |
# logical operators
|
29 |
And, Or, |
30 |
# unary operators
|
31 |
UAdd, USub, Not, Invert, |
32 |
# comparison operators
|
33 |
Eq, Gt, GtE, In, Is, IsNot, Lt, LtE, NotEq, NotIn, |
34 |
) |
35 |
|
36 |
from astroid import nodes as new |
37 |
from astroid import astpeephole |
38 |
|
39 |
|
40 |
_BIN_OP_CLASSES = {Add: '+',
|
41 |
BitAnd: '&',
|
42 |
BitOr: '|',
|
43 |
BitXor: '^',
|
44 |
Div: '/',
|
45 |
FloorDiv: '//',
|
46 |
Mod: '%',
|
47 |
Mult: '*',
|
48 |
Pow: '**',
|
49 |
Sub: '-',
|
50 |
LShift: '<<',
|
51 |
RShift: '>>',
|
52 |
} |
53 |
if sys.version_info >= (3, 5): |
54 |
from _ast import MatMult |
55 |
_BIN_OP_CLASSES[MatMult] = '@'
|
56 |
|
57 |
_BOOL_OP_CLASSES = {And: 'and',
|
58 |
Or: 'or',
|
59 |
} |
60 |
|
61 |
_UNARY_OP_CLASSES = {UAdd: '+',
|
62 |
USub: '-',
|
63 |
Not: 'not',
|
64 |
Invert: '~',
|
65 |
} |
66 |
|
67 |
_CMP_OP_CLASSES = {Eq: '==',
|
68 |
Gt: '>',
|
69 |
GtE: '>=',
|
70 |
In: 'in',
|
71 |
Is: 'is',
|
72 |
IsNot: 'is not',
|
73 |
Lt: '<',
|
74 |
LtE: '<=',
|
75 |
NotEq: '!=',
|
76 |
NotIn: 'not in',
|
77 |
} |
78 |
|
79 |
CONST_NAME_TRANSFORMS = {'None': None, |
80 |
'True': True, |
81 |
'False': False, |
82 |
} |
83 |
|
84 |
REDIRECT = {'arguments': 'Arguments', |
85 |
'comprehension': 'Comprehension', |
86 |
"ListCompFor": 'Comprehension', |
87 |
"GenExprFor": 'Comprehension', |
88 |
'excepthandler': 'ExceptHandler', |
89 |
'keyword': 'Keyword', |
90 |
} |
91 |
PY3K = sys.version_info >= (3, 0) |
92 |
PY34 = sys.version_info >= (3, 4) |
93 |
|
94 |
def _init_set_doc(node, newnode): |
95 |
newnode.doc = None
|
96 |
try:
|
97 |
if isinstance(node.body[0], _ast.Expr) and isinstance(node.body[0].value, _ast.Str): |
98 |
newnode.doc = node.body[0].value.s
|
99 |
node.body = node.body[1:]
|
100 |
|
101 |
except IndexError: |
102 |
pass # ast built from scratch |
103 |
|
104 |
def _lineno_parent(oldnode, newnode, parent): |
105 |
newnode.parent = parent |
106 |
newnode.lineno = oldnode.lineno |
107 |
newnode.col_offset = oldnode.col_offset |
108 |
|
109 |
def _set_infos(oldnode, newnode, parent): |
110 |
newnode.parent = parent |
111 |
if hasattr(oldnode, 'lineno'): |
112 |
newnode.lineno = oldnode.lineno |
113 |
if hasattr(oldnode, 'col_offset'): |
114 |
newnode.col_offset = oldnode.col_offset |
115 |
|
116 |
def _create_yield_node(node, parent, rebuilder, factory): |
117 |
newnode = factory() |
118 |
_lineno_parent(node, newnode, parent) |
119 |
if node.value is not None: |
120 |
newnode.value = rebuilder.visit(node.value, newnode, None)
|
121 |
return newnode
|
122 |
|
123 |
def _visit_or_none(node, attr, visitor, parent, assign_ctx, visit='visit', |
124 |
**kws): |
125 |
"""If the given node has an attribute, visits the attribute, and
|
126 |
otherwise returns None.
|
127 |
|
128 |
"""
|
129 |
value = getattr(node, attr, None) |
130 |
if value:
|
131 |
return getattr(visitor, visit)(value, parent, assign_ctx, **kws) |
132 |
else:
|
133 |
return None |
134 |
|
135 |
|
136 |
class TreeRebuilder(object): |
137 |
"""Rebuilds the _ast tree to become an Astroid tree"""
|
138 |
|
139 |
def __init__(self, manager): |
140 |
self._manager = manager
|
141 |
self.asscontext = None |
142 |
self._global_names = []
|
143 |
self._import_from_nodes = []
|
144 |
self._delayed_assattr = []
|
145 |
self._visit_meths = {}
|
146 |
self._peepholer = astpeephole.ASTPeepholeOptimizer()
|
147 |
|
148 |
def visit_module(self, node, modname, modpath, package): |
149 |
"""visit a Module node by returning a fresh instance of it"""
|
150 |
newnode = new.Module(modname, None)
|
151 |
newnode.package = package |
152 |
newnode.parent = None
|
153 |
_init_set_doc(node, newnode) |
154 |
newnode.body = [self.visit(child, newnode) for child in node.body] |
155 |
newnode.source_file = modpath |
156 |
return newnode
|
157 |
|
158 |
def visit(self, node, parent, assign_ctx=None): |
159 |
cls = node.__class__ |
160 |
if cls in self._visit_meths: |
161 |
visit_method = self._visit_meths[cls]
|
162 |
else:
|
163 |
cls_name = cls.__name__ |
164 |
visit_name = 'visit_' + REDIRECT.get(cls_name, cls_name).lower()
|
165 |
visit_method = getattr(self, visit_name) |
166 |
self._visit_meths[cls] = visit_method
|
167 |
return visit_method(node, parent, assign_ctx)
|
168 |
|
169 |
def _save_assignment(self, node, name=None): |
170 |
"""save assignement situation since node.parent is not available yet"""
|
171 |
if self._global_names and node.name in self._global_names[-1]: |
172 |
node.root().set_local(node.name, node) |
173 |
else:
|
174 |
node.parent.set_local(node.name, node) |
175 |
|
176 |
def visit_arguments(self, node, parent, assign_ctx=None): |
177 |
"""visit a Arguments node by returning a fresh instance of it"""
|
178 |
newnode = new.Arguments() |
179 |
newnode.parent = parent |
180 |
newnode.args = [self.visit(child, newnode, "Assign") |
181 |
for child in node.args] |
182 |
newnode.defaults = [self.visit(child, newnode, assign_ctx)
|
183 |
for child in node.defaults] |
184 |
newnode.kwonlyargs = [] |
185 |
newnode.kw_defaults = [] |
186 |
vararg, kwarg = node.vararg, node.kwarg |
187 |
# change added in 82732 (7c5c678e4164), vararg and kwarg
|
188 |
# are instances of `_ast.arg`, not strings
|
189 |
if vararg:
|
190 |
if PY34:
|
191 |
if vararg.annotation:
|
192 |
newnode.varargannotation = self.visit(vararg.annotation,
|
193 |
newnode, assign_ctx) |
194 |
vararg = vararg.arg |
195 |
elif PY3K and node.varargannotation: |
196 |
newnode.varargannotation = self.visit(node.varargannotation,
|
197 |
newnode, assign_ctx) |
198 |
if kwarg:
|
199 |
if PY34:
|
200 |
if kwarg.annotation:
|
201 |
newnode.kwargannotation = self.visit(kwarg.annotation,
|
202 |
newnode, assign_ctx) |
203 |
kwarg = kwarg.arg |
204 |
elif PY3K:
|
205 |
if node.kwargannotation:
|
206 |
newnode.kwargannotation = self.visit(node.kwargannotation,
|
207 |
newnode, assign_ctx) |
208 |
newnode.vararg = vararg |
209 |
newnode.kwarg = kwarg |
210 |
# save argument names in locals:
|
211 |
if vararg:
|
212 |
newnode.parent.set_local(vararg, newnode) |
213 |
if kwarg:
|
214 |
newnode.parent.set_local(kwarg, newnode) |
215 |
return newnode
|
216 |
|
217 |
def visit_assignattr(self, node, parent, assign_ctx=None): |
218 |
"""visit a AssAttr node by returning a fresh instance of it"""
|
219 |
newnode = new.AssignAttr() |
220 |
_lineno_parent(node, newnode, parent) |
221 |
newnode.expr = self.visit(node.expr, newnode, assign_ctx)
|
222 |
self._delayed_assattr.append(newnode)
|
223 |
return newnode
|
224 |
|
225 |
def visit_assert(self, node, parent, assign_ctx=None): |
226 |
"""visit a Assert node by returning a fresh instance of it"""
|
227 |
newnode = new.Assert() |
228 |
_lineno_parent(node, newnode, parent) |
229 |
newnode.test = self.visit(node.test, newnode, assign_ctx)
|
230 |
if node.msg is not None: |
231 |
newnode.fail = self.visit(node.msg, newnode, assign_ctx)
|
232 |
return newnode
|
233 |
|
234 |
def visit_assign(self, node, parent, assign_ctx=None): |
235 |
"""visit a Assign node by returning a fresh instance of it"""
|
236 |
newnode = new.Assign() |
237 |
_lineno_parent(node, newnode, parent) |
238 |
newnode.targets = [self.visit(child, newnode, "Assign") |
239 |
for child in node.targets] |
240 |
newnode.value = self.visit(node.value, newnode, None) |
241 |
return newnode
|
242 |
|
243 |
def visit_assignname(self, node, parent, assign_ctx=None, node_name=None): |
244 |
'''visit a node and return a AssName node'''
|
245 |
newnode = new.AssignName() |
246 |
_set_infos(node, newnode, parent) |
247 |
newnode.name = node_name |
248 |
self._save_assignment(newnode)
|
249 |
return newnode
|
250 |
|
251 |
def visit_augassign(self, node, parent, assign_ctx=None): |
252 |
"""visit a AugAssign node by returning a fresh instance of it"""
|
253 |
newnode = new.AugAssign() |
254 |
_lineno_parent(node, newnode, parent) |
255 |
newnode.op = _BIN_OP_CLASSES[node.op.__class__] + "="
|
256 |
newnode.target = self.visit(node.target, newnode, "Assign") |
257 |
newnode.value = self.visit(node.value, newnode, None) |
258 |
return newnode
|
259 |
|
260 |
def visit_repr(self, node, parent, assign_ctx=None): |
261 |
"""visit a Backquote node by returning a fresh instance of it"""
|
262 |
newnode = new.Repr() |
263 |
_lineno_parent(node, newnode, parent) |
264 |
newnode.value = self.visit(node.value, newnode, assign_ctx)
|
265 |
return newnode
|
266 |
|
267 |
def visit_binop(self, node, parent, assign_ctx=None): |
268 |
"""visit a BinOp node by returning a fresh instance of it"""
|
269 |
if isinstance(node.left, _ast.BinOp) and self._manager.optimize_ast: |
270 |
# Optimize BinOp operations in order to remove
|
271 |
# redundant recursion. For instance, if the
|
272 |
# following code is parsed in order to obtain
|
273 |
# its ast, then the rebuilder will fail with an
|
274 |
# infinite recursion, the same will happen with the
|
275 |
# inference engine as well. There's no need to hold
|
276 |
# so many objects for the BinOp if they can be reduced
|
277 |
# to something else (also, the optimization
|
278 |
# might handle only Const binops, which isn't a big
|
279 |
# problem for the correctness of the program).
|
280 |
#
|
281 |
# ("a" + "b" + # one thousand more + "c")
|
282 |
optimized = self._peepholer.optimize_binop(node)
|
283 |
if optimized:
|
284 |
_lineno_parent(node, optimized, parent) |
285 |
return optimized
|
286 |
|
287 |
newnode = new.BinOp() |
288 |
_lineno_parent(node, newnode, parent) |
289 |
newnode.left = self.visit(node.left, newnode, assign_ctx)
|
290 |
newnode.right = self.visit(node.right, newnode, assign_ctx)
|
291 |
newnode.op = _BIN_OP_CLASSES[node.op.__class__] |
292 |
return newnode
|
293 |
|
294 |
def visit_boolop(self, node, parent, assign_ctx=None): |
295 |
"""visit a BoolOp node by returning a fresh instance of it"""
|
296 |
newnode = new.BoolOp() |
297 |
_lineno_parent(node, newnode, parent) |
298 |
newnode.values = [self.visit(child, newnode, assign_ctx)
|
299 |
for child in node.values] |
300 |
newnode.op = _BOOL_OP_CLASSES[node.op.__class__] |
301 |
return newnode
|
302 |
|
303 |
def visit_break(self, node, parent, assign_ctx=None): |
304 |
"""visit a Break node by returning a fresh instance of it"""
|
305 |
newnode = new.Break() |
306 |
_set_infos(node, newnode, parent) |
307 |
return newnode
|
308 |
|
309 |
def visit_call(self, node, parent, assign_ctx=None): |
310 |
"""visit a CallFunc node by returning a fresh instance of it"""
|
311 |
newnode = new.Call() |
312 |
_lineno_parent(node, newnode, parent) |
313 |
newnode.func = self.visit(node.func, newnode, assign_ctx)
|
314 |
args = [self.visit(child, newnode, assign_ctx)
|
315 |
for child in node.args] |
316 |
|
317 |
starargs = _visit_or_none(node, 'starargs', self, newnode, |
318 |
assign_ctx) |
319 |
kwargs = _visit_or_none(node, 'kwargs', self, newnode, |
320 |
assign_ctx) |
321 |
keywords = None
|
322 |
if node.keywords:
|
323 |
keywords = [self.visit(child, newnode, assign_ctx)
|
324 |
for child in node.keywords] |
325 |
|
326 |
if starargs:
|
327 |
new_starargs = new.Starred() |
328 |
new_starargs.col_offset = starargs.col_offset |
329 |
new_starargs.lineno = starargs.lineno |
330 |
new_starargs.parent = starargs.parent |
331 |
new_starargs.value = starargs |
332 |
args.append(new_starargs) |
333 |
if kwargs:
|
334 |
new_kwargs = new.Keyword() |
335 |
new_kwargs.arg = None
|
336 |
new_kwargs.col_offset = kwargs.col_offset |
337 |
new_kwargs.lineno = kwargs.lineno |
338 |
new_kwargs.parent = kwargs.parent |
339 |
new_kwargs.value = kwargs |
340 |
if keywords:
|
341 |
keywords.append(new_kwargs) |
342 |
else:
|
343 |
keywords = [new_kwargs] |
344 |
|
345 |
newnode.args = args |
346 |
newnode.keywords = keywords |
347 |
return newnode
|
348 |
|
349 |
def visit_classdef(self, node, parent, assign_ctx=None): |
350 |
"""visit a Class node to become astroid"""
|
351 |
newnode = new.ClassDef(node.name, None)
|
352 |
_lineno_parent(node, newnode, parent) |
353 |
_init_set_doc(node, newnode) |
354 |
newnode.bases = [self.visit(child, newnode, assign_ctx)
|
355 |
for child in node.bases] |
356 |
newnode.body = [self.visit(child, newnode, assign_ctx)
|
357 |
for child in node.body] |
358 |
if node.decorator_list:
|
359 |
newnode.decorators = self.visit_decorators(node, newnode, assign_ctx)
|
360 |
newnode.parent.frame().set_local(newnode.name, newnode) |
361 |
return newnode
|
362 |
|
363 |
def visit_const(self, node, parent, assign_ctx=None): |
364 |
"""visit a Const node by returning a fresh instance of it"""
|
365 |
newnode = new.Const(node.value) |
366 |
_set_infos(node, newnode, parent) |
367 |
return newnode
|
368 |
|
369 |
def visit_continue(self, node, parent, assign_ctx=None): |
370 |
"""visit a Continue node by returning a fresh instance of it"""
|
371 |
newnode = new.Continue() |
372 |
_set_infos(node, newnode, parent) |
373 |
return newnode
|
374 |
|
375 |
def visit_compare(self, node, parent, assign_ctx=None): |
376 |
"""visit a Compare node by returning a fresh instance of it"""
|
377 |
newnode = new.Compare() |
378 |
_lineno_parent(node, newnode, parent) |
379 |
newnode.left = self.visit(node.left, newnode, assign_ctx)
|
380 |
newnode.ops = [(_CMP_OP_CLASSES[op.__class__], self.visit(expr, newnode, assign_ctx))
|
381 |
for (op, expr) in zip(node.ops, node.comparators)] |
382 |
return newnode
|
383 |
|
384 |
def visit_comprehension(self, node, parent, assign_ctx=None): |
385 |
"""visit a Comprehension node by returning a fresh instance of it"""
|
386 |
newnode = new.Comprehension() |
387 |
newnode.parent = parent |
388 |
newnode.target = self.visit(node.target, newnode, 'Assign') |
389 |
newnode.iter = self.visit(node.iter, newnode, None) |
390 |
newnode.ifs = [self.visit(child, newnode, None) |
391 |
for child in node.ifs] |
392 |
return newnode
|
393 |
|
394 |
def visit_decorators(self, node, parent, assign_ctx=None): |
395 |
"""visit a Decorators node by returning a fresh instance of it"""
|
396 |
# /!\ node is actually a _ast.Function node while
|
397 |
# parent is a astroid.nodes.Function node
|
398 |
newnode = new.Decorators() |
399 |
_lineno_parent(node, newnode, parent) |
400 |
decorators = node.decorator_list |
401 |
newnode.nodes = [self.visit(child, newnode, assign_ctx)
|
402 |
for child in decorators] |
403 |
return newnode
|
404 |
|
405 |
def visit_delete(self, node, parent, assign_ctx=None): |
406 |
"""visit a Delete node by returning a fresh instance of it"""
|
407 |
newnode = new.Delete() |
408 |
_lineno_parent(node, newnode, parent) |
409 |
newnode.targets = [self.visit(child, newnode, 'Del') |
410 |
for child in node.targets] |
411 |
return newnode
|
412 |
|
413 |
def _visit_dict_items(self, node, parent, newnode, assign_ctx): |
414 |
for key, value in zip(node.keys, node.values): |
415 |
rebuilt_value = self.visit(value, newnode, assign_ctx)
|
416 |
if not key: |
417 |
# Python 3.5 and extended unpacking
|
418 |
rebuilt_key = new.DictUnpack() |
419 |
rebuilt_key.lineno = rebuilt_value.lineno |
420 |
rebuilt_key.col_offset = rebuilt_value.col_offset |
421 |
rebuilt_key.parent = rebuilt_value.parent |
422 |
else:
|
423 |
rebuilt_key = self.visit(key, newnode, assign_ctx)
|
424 |
yield rebuilt_key, rebuilt_value
|
425 |
|
426 |
def visit_dict(self, node, parent, assign_ctx=None): |
427 |
"""visit a Dict node by returning a fresh instance of it"""
|
428 |
newnode = new.Dict() |
429 |
_lineno_parent(node, newnode, parent) |
430 |
newnode.items = list(self._visit_dict_items(node, parent, newnode, assign_ctx)) |
431 |
return newnode
|
432 |
|
433 |
def visit_dictcomp(self, node, parent, assign_ctx=None): |
434 |
"""visit a DictComp node by returning a fresh instance of it"""
|
435 |
newnode = new.DictComp() |
436 |
_lineno_parent(node, newnode, parent) |
437 |
newnode.key = self.visit(node.key, newnode, assign_ctx)
|
438 |
newnode.value = self.visit(node.value, newnode, assign_ctx)
|
439 |
newnode.generators = [self.visit(child, newnode, assign_ctx)
|
440 |
for child in node.generators] |
441 |
return newnode
|
442 |
|
443 |
def visit_expr(self, node, parent, assign_ctx=None): |
444 |
"""visit a Discard node by returning a fresh instance of it"""
|
445 |
newnode = new.Expr() |
446 |
_lineno_parent(node, newnode, parent) |
447 |
newnode.value = self.visit(node.value, newnode, assign_ctx)
|
448 |
return newnode
|
449 |
|
450 |
def visit_ellipsis(self, node, parent, assign_ctx=None): |
451 |
"""visit an Ellipsis node by returning a fresh instance of it"""
|
452 |
newnode = new.Ellipsis() |
453 |
_set_infos(node, newnode, parent) |
454 |
return newnode
|
455 |
|
456 |
def visit_emptynode(self, node, parent, assign_ctx=None): |
457 |
"""visit an EmptyNode node by returning a fresh instance of it"""
|
458 |
newnode = new.EmptyNode() |
459 |
_set_infos(node, newnode, parent) |
460 |
return newnode
|
461 |
|
462 |
def visit_excepthandler(self, node, parent, assign_ctx=None): |
463 |
"""visit an ExceptHandler node by returning a fresh instance of it"""
|
464 |
newnode = new.ExceptHandler() |
465 |
_lineno_parent(node, newnode, parent) |
466 |
if node.type is not None: |
467 |
newnode.type = self.visit(node.type, newnode, assign_ctx)
|
468 |
if node.name is not None: |
469 |
# /!\ node.name can be a tuple
|
470 |
newnode.name = self.visit(node.name, newnode, 'Assign') |
471 |
newnode.body = [self.visit(child, newnode, None) |
472 |
for child in node.body] |
473 |
return newnode
|
474 |
|
475 |
def visit_exec(self, node, parent, assign_ctx=None): |
476 |
"""visit an Exec node by returning a fresh instance of it"""
|
477 |
newnode = new.Exec() |
478 |
_lineno_parent(node, newnode, parent) |
479 |
newnode.expr = self.visit(node.body, newnode)
|
480 |
if node.globals is not None: |
481 |
newnode.globals = self.visit(node.globals, newnode,
|
482 |
assign_ctx) |
483 |
if node.locals is not None: |
484 |
newnode.locals = self.visit(node.locals, newnode,
|
485 |
assign_ctx) |
486 |
return newnode
|
487 |
|
488 |
def visit_extslice(self, node, parent, assign_ctx=None): |
489 |
"""visit an ExtSlice node by returning a fresh instance of it"""
|
490 |
newnode = new.ExtSlice() |
491 |
newnode.parent = parent |
492 |
newnode.dims = [self.visit(dim, newnode, assign_ctx)
|
493 |
for dim in node.dims] |
494 |
return newnode
|
495 |
|
496 |
def _visit_for(self, cls, node, parent, assign_ctx=None): |
497 |
"""visit a For node by returning a fresh instance of it"""
|
498 |
newnode = cls() |
499 |
_lineno_parent(node, newnode, parent) |
500 |
newnode.target = self.visit(node.target, newnode, "Assign") |
501 |
newnode.iter = self.visit(node.iter, newnode, None) |
502 |
newnode.body = [self.visit(child, newnode, None) |
503 |
for child in node.body] |
504 |
newnode.orelse = [self.visit(child, newnode, None) |
505 |
for child in node.orelse] |
506 |
return newnode
|
507 |
|
508 |
def visit_for(self, node, parent, assign_ctx=None): |
509 |
return self._visit_for(new.For, node, parent, |
510 |
assign_ctx=assign_ctx) |
511 |
def visit_importfrom(self, node, parent, assign_ctx=None): |
512 |
"""visit a From node by returning a fresh instance of it"""
|
513 |
names = [(alias.name, alias.asname) for alias in node.names] |
514 |
newnode = new.ImportFrom(node.module or '', names, node.level or None) |
515 |
_set_infos(node, newnode, parent) |
516 |
# store From names to add them to locals after building
|
517 |
self._import_from_nodes.append(newnode)
|
518 |
return newnode
|
519 |
|
520 |
def _visit_functiondef(self, cls, node, parent, assign_ctx=None): |
521 |
"""visit an FunctionDef node to become astroid"""
|
522 |
self._global_names.append({})
|
523 |
newnode = cls(node.name, None)
|
524 |
_lineno_parent(node, newnode, parent) |
525 |
_init_set_doc(node, newnode) |
526 |
newnode.args = self.visit(node.args, newnode, assign_ctx)
|
527 |
newnode.body = [self.visit(child, newnode, assign_ctx)
|
528 |
for child in node.body] |
529 |
decorators = node.decorator_list |
530 |
if decorators:
|
531 |
newnode.decorators = self.visit_decorators(
|
532 |
node, newnode, assign_ctx) |
533 |
if PY3K and node.returns: |
534 |
newnode.returns = self.visit(node.returns, newnode,
|
535 |
assign_ctx) |
536 |
self._global_names.pop()
|
537 |
frame = newnode.parent.frame() |
538 |
frame.set_local(newnode.name, newnode) |
539 |
return newnode
|
540 |
|
541 |
def visit_functiondef(self, node, parent, assign_ctx=None): |
542 |
return self._visit_functiondef(new.FunctionDef, node, parent, |
543 |
assign_ctx=assign_ctx) |
544 |
|
545 |
def visit_generatorexp(self, node, parent, assign_ctx=None): |
546 |
"""visit a GenExpr node by returning a fresh instance of it"""
|
547 |
newnode = new.GeneratorExp() |
548 |
_lineno_parent(node, newnode, parent) |
549 |
newnode.elt = self.visit(node.elt, newnode, assign_ctx)
|
550 |
newnode.generators = [self.visit(child, newnode, assign_ctx)
|
551 |
for child in node.generators] |
552 |
return newnode
|
553 |
|
554 |
def visit_attribute(self, node, parent, assign_ctx=None): |
555 |
"""visit a Getattr node by returning a fresh instance of it"""
|
556 |
# pylint: disable=redefined-variable-type
|
557 |
if assign_ctx == "Del": |
558 |
# FIXME : maybe we should reintroduce and visit_delattr ?
|
559 |
# for instance, deactivating asscontext
|
560 |
newnode = new.DelAttr() |
561 |
elif assign_ctx == "Assign": |
562 |
# FIXME : maybe we should call visit_assattr ?
|
563 |
newnode = new.AssignAttr() |
564 |
self._delayed_assattr.append(newnode)
|
565 |
else:
|
566 |
newnode = new.Attribute() |
567 |
_lineno_parent(node, newnode, parent) |
568 |
newnode.expr = self.visit(node.value, newnode, None) |
569 |
newnode.attrname = node.attr |
570 |
return newnode
|
571 |
|
572 |
def visit_global(self, node, parent, assign_ctx=None): |
573 |
"""visit an Global node to become astroid"""
|
574 |
newnode = new.Global(node.names) |
575 |
_set_infos(node, newnode, parent) |
576 |
if self._global_names: # global at the module level, no effect |
577 |
for name in node.names: |
578 |
self._global_names[-1].setdefault(name, []).append(newnode) |
579 |
return newnode
|
580 |
|
581 |
def visit_if(self, node, parent, assign_ctx=None): |
582 |
"""visit a If node by returning a fresh instance of it"""
|
583 |
newnode = new.If() |
584 |
_lineno_parent(node, newnode, parent) |
585 |
newnode.test = self.visit(node.test, newnode, assign_ctx)
|
586 |
newnode.body = [self.visit(child, newnode, assign_ctx)
|
587 |
for child in node.body] |
588 |
newnode.orelse = [self.visit(child, newnode, assign_ctx)
|
589 |
for child in node.orelse] |
590 |
return newnode
|
591 |
|
592 |
def visit_ifexp(self, node, parent, assign_ctx=None): |
593 |
"""visit a IfExp node by returning a fresh instance of it"""
|
594 |
newnode = new.IfExp() |
595 |
_lineno_parent(node, newnode, parent) |
596 |
newnode.test = self.visit(node.test, newnode, assign_ctx)
|
597 |
newnode.body = self.visit(node.body, newnode, assign_ctx)
|
598 |
newnode.orelse = self.visit(node.orelse, newnode, assign_ctx)
|
599 |
return newnode
|
600 |
|
601 |
def visit_import(self, node, parent, assign_ctx=None): |
602 |
"""visit a Import node by returning a fresh instance of it"""
|
603 |
newnode = new.Import() |
604 |
_set_infos(node, newnode, parent) |
605 |
newnode.names = [(alias.name, alias.asname) for alias in node.names] |
606 |
# save import names in parent's locals:
|
607 |
for (name, asname) in newnode.names: |
608 |
name = asname or name
|
609 |
newnode.parent.set_local(name.split('.')[0], newnode) |
610 |
return newnode
|
611 |
|
612 |
def visit_index(self, node, parent, assign_ctx=None): |
613 |
"""visit a Index node by returning a fresh instance of it"""
|
614 |
newnode = new.Index() |
615 |
newnode.parent = parent |
616 |
newnode.value = self.visit(node.value, newnode, assign_ctx)
|
617 |
return newnode
|
618 |
|
619 |
def visit_keyword(self, node, parent, assign_ctx=None): |
620 |
"""visit a Keyword node by returning a fresh instance of it"""
|
621 |
newnode = new.Keyword() |
622 |
newnode.parent = parent |
623 |
newnode.arg = node.arg |
624 |
newnode.value = self.visit(node.value, newnode, assign_ctx)
|
625 |
return newnode
|
626 |
|
627 |
def visit_lambda(self, node, parent, assign_ctx=None): |
628 |
"""visit a Lambda node by returning a fresh instance of it"""
|
629 |
newnode = new.Lambda() |
630 |
_lineno_parent(node, newnode, parent) |
631 |
newnode.args = self.visit(node.args, newnode, assign_ctx)
|
632 |
newnode.body = self.visit(node.body, newnode, assign_ctx)
|
633 |
return newnode
|
634 |
|
635 |
def visit_list(self, node, parent, assign_ctx=None): |
636 |
"""visit a List node by returning a fresh instance of it"""
|
637 |
newnode = new.List() |
638 |
_lineno_parent(node, newnode, parent) |
639 |
newnode.elts = [self.visit(child, newnode, assign_ctx)
|
640 |
for child in node.elts] |
641 |
return newnode
|
642 |
|
643 |
def visit_listcomp(self, node, parent, assign_ctx=None): |
644 |
"""visit a ListComp node by returning a fresh instance of it"""
|
645 |
newnode = new.ListComp() |
646 |
_lineno_parent(node, newnode, parent) |
647 |
newnode.elt = self.visit(node.elt, newnode, assign_ctx)
|
648 |
newnode.generators = [self.visit(child, newnode, assign_ctx)
|
649 |
for child in node.generators] |
650 |
return newnode
|
651 |
|
652 |
def visit_name(self, node, parent, assign_ctx=None): |
653 |
"""visit a Name node by returning a fresh instance of it"""
|
654 |
# True and False can be assigned to something in py2x, so we have to
|
655 |
# check first the asscontext
|
656 |
# pylint: disable=redefined-variable-type
|
657 |
if assign_ctx == "Del": |
658 |
newnode = new.DelName() |
659 |
elif assign_ctx is not None: # Ass |
660 |
newnode = new.AssName() |
661 |
elif node.id in CONST_NAME_TRANSFORMS: |
662 |
newnode = new.Const(CONST_NAME_TRANSFORMS[node.id]) |
663 |
_set_infos(node, newnode, parent) |
664 |
return newnode
|
665 |
else:
|
666 |
newnode = new.Name() |
667 |
_lineno_parent(node, newnode, parent) |
668 |
newnode.name = node.id |
669 |
# XXX REMOVE me :
|
670 |
if assign_ctx in ('Del', 'Assign'): # 'Aug' ?? |
671 |
self._save_assignment(newnode)
|
672 |
return newnode
|
673 |
|
674 |
def visit_bytes(self, node, parent, assign_ctx=None): |
675 |
"""visit a Bytes node by returning a fresh instance of Const"""
|
676 |
newnode = new.Const(node.s) |
677 |
_set_infos(node, newnode, parent) |
678 |
return newnode
|
679 |
|
680 |
def visit_num(self, node, parent, assign_ctx=None): |
681 |
"""visit a Num node by returning a fresh instance of Const"""
|
682 |
newnode = new.Const(node.n) |
683 |
_set_infos(node, newnode, parent) |
684 |
return newnode
|
685 |
|
686 |
def visit_pass(self, node, parent, assign_ctx=None): |
687 |
"""visit a Pass node by returning a fresh instance of it"""
|
688 |
newnode = new.Pass() |
689 |
_set_infos(node, newnode, parent) |
690 |
return newnode
|
691 |
|
692 |
def visit_str(self, node, parent, assign_ctx=None): |
693 |
"""visit a Str node by returning a fresh instance of Const"""
|
694 |
newnode = new.Const(node.s) |
695 |
_set_infos(node, newnode, parent) |
696 |
return newnode
|
697 |
|
698 |
def visit_print(self, node, parent, assign_ctx=None): |
699 |
"""visit a Print node by returning a fresh instance of it"""
|
700 |
newnode = new.Print() |
701 |
_lineno_parent(node, newnode, parent) |
702 |
newnode.nl = node.nl |
703 |
if node.dest is not None: |
704 |
newnode.dest = self.visit(node.dest, newnode, assign_ctx)
|
705 |
newnode.values = [self.visit(child, newnode, assign_ctx)
|
706 |
for child in node.values] |
707 |
return newnode
|
708 |
|
709 |
def visit_raise(self, node, parent, assign_ctx=None): |
710 |
"""visit a Raise node by returning a fresh instance of it"""
|
711 |
newnode = new.Raise() |
712 |
_lineno_parent(node, newnode, parent) |
713 |
if node.type is not None: |
714 |
newnode.exc = self.visit(node.type, newnode, assign_ctx)
|
715 |
if node.inst is not None: |
716 |
newnode.inst = self.visit(node.inst, newnode, assign_ctx)
|
717 |
if node.tback is not None: |
718 |
newnode.tback = self.visit(node.tback, newnode, assign_ctx)
|
719 |
return newnode
|
720 |
|
721 |
def visit_return(self, node, parent, assign_ctx=None): |
722 |
"""visit a Return node by returning a fresh instance of it"""
|
723 |
newnode = new.Return() |
724 |
_lineno_parent(node, newnode, parent) |
725 |
if node.value is not None: |
726 |
newnode.value = self.visit(node.value, newnode, assign_ctx)
|
727 |
return newnode
|
728 |
|
729 |
def visit_set(self, node, parent, assign_ctx=None): |
730 |
"""visit a Set node by returning a fresh instance of it"""
|
731 |
newnode = new.Set() |
732 |
_lineno_parent(node, newnode, parent) |
733 |
newnode.elts = [self.visit(child, newnode, assign_ctx)
|
734 |
for child in node.elts] |
735 |
return newnode
|
736 |
|
737 |
def visit_setcomp(self, node, parent, assign_ctx=None): |
738 |
"""visit a SetComp node by returning a fresh instance of it"""
|
739 |
newnode = new.SetComp() |
740 |
_lineno_parent(node, newnode, parent) |
741 |
newnode.elt = self.visit(node.elt, newnode, assign_ctx)
|
742 |
newnode.generators = [self.visit(child, newnode, assign_ctx)
|
743 |
for child in node.generators] |
744 |
return newnode
|
745 |
|
746 |
def visit_slice(self, node, parent, assign_ctx=None): |
747 |
"""visit a Slice node by returning a fresh instance of it"""
|
748 |
newnode = new.Slice() |
749 |
newnode.parent = parent |
750 |
if node.lower is not None: |
751 |
newnode.lower = self.visit(node.lower, newnode, assign_ctx)
|
752 |
if node.upper is not None: |
753 |
newnode.upper = self.visit(node.upper, newnode, assign_ctx)
|
754 |
if node.step is not None: |
755 |
newnode.step = self.visit(node.step, newnode, assign_ctx)
|
756 |
return newnode
|
757 |
|
758 |
def visit_subscript(self, node, parent, assign_ctx=None): |
759 |
"""visit a Subscript node by returning a fresh instance of it"""
|
760 |
newnode = new.Subscript() |
761 |
_lineno_parent(node, newnode, parent) |
762 |
newnode.value = self.visit(node.value, newnode, None) |
763 |
newnode.slice = self.visit(node.slice, newnode, None) |
764 |
return newnode
|
765 |
|
766 |
def visit_tryexcept(self, node, parent, assign_ctx=None): |
767 |
"""visit a TryExcept node by returning a fresh instance of it"""
|
768 |
newnode = new.TryExcept() |
769 |
_lineno_parent(node, newnode, parent) |
770 |
newnode.body = [self.visit(child, newnode, assign_ctx)
|
771 |
for child in node.body] |
772 |
newnode.handlers = [self.visit(child, newnode, assign_ctx)
|
773 |
for child in node.handlers] |
774 |
newnode.orelse = [self.visit(child, newnode, assign_ctx)
|
775 |
for child in node.orelse] |
776 |
return newnode
|
777 |
|
778 |
def visit_tryfinally(self, node, parent, assign_ctx=None): |
779 |
"""visit a TryFinally node by returning a fresh instance of it"""
|
780 |
newnode = new.TryFinally() |
781 |
_lineno_parent(node, newnode, parent) |
782 |
newnode.body = [self.visit(child, newnode, assign_ctx)
|
783 |
for child in node.body] |
784 |
newnode.finalbody = [self.visit(n, newnode, assign_ctx)
|
785 |
for n in node.finalbody] |
786 |
return newnode
|
787 |
|
788 |
def visit_tuple(self, node, parent, assign_ctx=None): |
789 |
"""visit a Tuple node by returning a fresh instance of it"""
|
790 |
newnode = new.Tuple() |
791 |
_lineno_parent(node, newnode, parent) |
792 |
newnode.elts = [self.visit(child, newnode, assign_ctx)
|
793 |
for child in node.elts] |
794 |
return newnode
|
795 |
|
796 |
def visit_unaryop(self, node, parent, assign_ctx=None): |
797 |
"""visit a UnaryOp node by returning a fresh instance of it"""
|
798 |
newnode = new.UnaryOp() |
799 |
_lineno_parent(node, newnode, parent) |
800 |
newnode.operand = self.visit(node.operand, newnode, assign_ctx)
|
801 |
newnode.op = _UNARY_OP_CLASSES[node.op.__class__] |
802 |
return newnode
|
803 |
|
804 |
def visit_while(self, node, parent, assign_ctx=None): |
805 |
"""visit a While node by returning a fresh instance of it"""
|
806 |
newnode = new.While() |
807 |
_lineno_parent(node, newnode, parent) |
808 |
newnode.test = self.visit(node.test, newnode, assign_ctx)
|
809 |
newnode.body = [self.visit(child, newnode, assign_ctx)
|
810 |
for child in node.body] |
811 |
newnode.orelse = [self.visit(child, newnode, assign_ctx)
|
812 |
for child in node.orelse] |
813 |
return newnode
|
814 |
|
815 |
def visit_with(self, node, parent, assign_ctx=None): |
816 |
newnode = new.With() |
817 |
_lineno_parent(node, newnode, parent) |
818 |
expr = self.visit(node.context_expr, newnode, assign_ctx)
|
819 |
if node.optional_vars is not None: |
820 |
vars = self.visit(node.optional_vars, newnode, 'Assign') |
821 |
else:
|
822 |
vars = None
|
823 |
self.asscontext = None |
824 |
newnode.items = [(expr, vars)]
|
825 |
newnode.body = [self.visit(child, newnode, assign_ctx)
|
826 |
for child in node.body] |
827 |
return newnode
|
828 |
|
829 |
def visit_yield(self, node, parent, assign_ctx=None): |
830 |
"""visit a Yield node by returning a fresh instance of it"""
|
831 |
return _create_yield_node(node, parent, self, new.Yield) |
832 |
|
833 |
class TreeRebuilder3k(TreeRebuilder): |
834 |
"""extend and overwrite TreeRebuilder for python3k"""
|
835 |
|
836 |
def visit_arg(self, node, parent, assign_ctx=None): |
837 |
"""visit a arg node by returning a fresh AssName instance"""
|
838 |
# TODO(cpopa): introduce an Arg node instead of using AssignName.
|
839 |
return self.visit_assignname(node, parent, assign_ctx, node.arg) |
840 |
|
841 |
def visit_nameconstant(self, node, parent, assign_ctx=None): |
842 |
# in Python 3.4 we have NameConstant for True / False / None
|
843 |
newnode = new.Const(node.value) |
844 |
_set_infos(node, newnode, parent) |
845 |
return newnode
|
846 |
|
847 |
def visit_arguments(self, node, parent, assign_ctx=None): |
848 |
newnode = super(TreeRebuilder3k, self).visit_arguments(node, parent, assign_ctx) |
849 |
newnode.kwonlyargs = [self.visit(child, newnode, 'Assign') |
850 |
for child in node.kwonlyargs] |
851 |
newnode.kw_defaults = [self.visit(child, newnode, None) |
852 |
if child else None for child in node.kw_defaults] |
853 |
newnode.annotations = [ |
854 |
self.visit(arg.annotation, newnode, None) if arg.annotation else None |
855 |
for arg in node.args] |
856 |
return newnode
|
857 |
|
858 |
def visit_excepthandler(self, node, parent, assign_ctx=None): |
859 |
"""visit an ExceptHandler node by returning a fresh instance of it"""
|
860 |
newnode = new.ExceptHandler() |
861 |
_lineno_parent(node, newnode, parent) |
862 |
if node.type is not None: |
863 |
newnode.type = self.visit(node.type, newnode, assign_ctx)
|
864 |
if node.name is not None: |
865 |
newnode.name = self.visit_assignname(node, newnode, 'Assign', node.name) |
866 |
newnode.body = [self.visit(child, newnode, None) |
867 |
for child in node.body] |
868 |
return newnode
|
869 |
|
870 |
def visit_nonlocal(self, node, parent, assign_ctx=None): |
871 |
"""visit a Nonlocal node and return a new instance of it"""
|
872 |
newnode = new.Nonlocal(node.names) |
873 |
_set_infos(node, newnode, parent) |
874 |
return newnode
|
875 |
|
876 |
def visit_raise(self, node, parent, assign_ctx=None): |
877 |
"""visit a Raise node by returning a fresh instance of it"""
|
878 |
newnode = new.Raise() |
879 |
_lineno_parent(node, newnode, parent) |
880 |
# no traceback; anyway it is not used in Pylint
|
881 |
if node.exc is not None: |
882 |
newnode.exc = self.visit(node.exc, newnode, assign_ctx)
|
883 |
if node.cause is not None: |
884 |
newnode.cause = self.visit(node.cause, newnode, assign_ctx)
|
885 |
return newnode
|
886 |
|
887 |
def visit_starred(self, node, parent, assign_ctx=None): |
888 |
"""visit a Starred node and return a new instance of it"""
|
889 |
newnode = new.Starred() |
890 |
_lineno_parent(node, newnode, parent) |
891 |
newnode.value = self.visit(node.value, newnode, assign_ctx)
|
892 |
return newnode
|
893 |
|
894 |
def visit_try(self, node, parent, assign_ctx=None): |
895 |
# python 3.3 introduce a new Try node replacing TryFinally/TryExcept nodes
|
896 |
# pylint: disable=redefined-variable-type
|
897 |
if node.finalbody:
|
898 |
newnode = new.TryFinally() |
899 |
_lineno_parent(node, newnode, parent) |
900 |
newnode.finalbody = [self.visit(n, newnode, assign_ctx)
|
901 |
for n in node.finalbody] |
902 |
if node.handlers:
|
903 |
excnode = new.TryExcept() |
904 |
_lineno_parent(node, excnode, newnode) |
905 |
excnode.body = [self.visit(child, excnode, assign_ctx)
|
906 |
for child in node.body] |
907 |
excnode.handlers = [self.visit(child, excnode, assign_ctx)
|
908 |
for child in node.handlers] |
909 |
excnode.orelse = [self.visit(child, excnode, assign_ctx)
|
910 |
for child in node.orelse] |
911 |
newnode.body = [excnode] |
912 |
else:
|
913 |
newnode.body = [self.visit(child, newnode, assign_ctx)
|
914 |
for child in node.body] |
915 |
elif node.handlers:
|
916 |
newnode = new.TryExcept() |
917 |
_lineno_parent(node, newnode, parent) |
918 |
newnode.body = [self.visit(child, newnode, assign_ctx)
|
919 |
for child in node.body] |
920 |
newnode.handlers = [self.visit(child, newnode, assign_ctx)
|
921 |
for child in node.handlers] |
922 |
newnode.orelse = [self.visit(child, newnode, assign_ctx)
|
923 |
for child in node.orelse] |
924 |
return newnode
|
925 |
|
926 |
def _visit_with(self, cls, node, parent, assign_ctx=None): |
927 |
if 'items' not in node._fields: |
928 |
# python < 3.3
|
929 |
return super(TreeRebuilder3k, self).visit_with(node, parent, |
930 |
assign_ctx) |
931 |
|
932 |
newnode = cls() |
933 |
_lineno_parent(node, newnode, parent) |
934 |
def visit_child(child): |
935 |
expr = self.visit(child.context_expr, newnode)
|
936 |
if child.optional_vars:
|
937 |
var = self.visit(child.optional_vars, newnode,
|
938 |
'Assign')
|
939 |
else:
|
940 |
var = None
|
941 |
return expr, var
|
942 |
newnode.items = [visit_child(child) |
943 |
for child in node.items] |
944 |
newnode.body = [self.visit(child, newnode, None) |
945 |
for child in node.body] |
946 |
return newnode
|
947 |
|
948 |
def visit_with(self, node, parent, assign_ctx=None): |
949 |
return self._visit_with(new.With, node, parent, assign_ctx=assign_ctx) |
950 |
|
951 |
def visit_yieldfrom(self, node, parent, assign_ctx=None): |
952 |
return _create_yield_node(node, parent, self, new.YieldFrom) |
953 |
|
954 |
def visit_classdef(self, node, parent, assign_ctx=None): |
955 |
newnode = super(TreeRebuilder3k, self).visit_classdef(node, parent, assign_ctx) |
956 |
newnode._newstyle = True
|
957 |
for keyword in node.keywords: |
958 |
if keyword.arg == 'metaclass': |
959 |
newnode._metaclass = self.visit(keyword, newnode, assign_ctx).value
|
960 |
break
|
961 |
return newnode
|
962 |
|
963 |
# Async structs added in Python 3.5
|
964 |
def visit_asyncfunctiondef(self, node, parent, assign_ctx=None): |
965 |
return self._visit_functiondef(new.AsyncFunctionDef, node, parent, |
966 |
assign_ctx=assign_ctx) |
967 |
|
968 |
|
969 |
def visit_asyncfor(self, node, parent, assign_ctx=None): |
970 |
return self._visit_for(new.AsyncFor, node, parent, |
971 |
assign_ctx=assign_ctx) |
972 |
|
973 |
def visit_await(self, node, parent, assign_ctx=None): |
974 |
newnode = new.Await() |
975 |
newnode.lineno = node.lineno |
976 |
newnode.col_offset = node.col_offset |
977 |
newnode.parent = parent |
978 |
newnode.value = self.visit(node.value, newnode, None) |
979 |
return newnode
|
980 |
|
981 |
def visit_asyncwith(self, node, parent, assign_ctx=None): |
982 |
return self._visit_with(new.AsyncWith, node, parent, |
983 |
assign_ctx=assign_ctx) |
984 |
|
985 |
|
986 |
if sys.version_info >= (3, 0): |
987 |
TreeRebuilder = TreeRebuilder3k |