paul@0 | 1 | #!/usr/bin/env python |
paul@0 | 2 | |
paul@0 | 3 | """ |
paul@0 | 4 | Inspect source files, obtaining details of classes and attributes. |
paul@0 | 5 | |
paul@299 | 6 | Copyright (C) 2007, 2008, 2009, 2010 Paul Boddie <paul@boddie.org.uk> |
paul@0 | 7 | |
paul@0 | 8 | This program is free software; you can redistribute it and/or modify it under |
paul@0 | 9 | the terms of the GNU General Public License as published by the Free Software |
paul@0 | 10 | Foundation; either version 3 of the License, or (at your option) any later |
paul@0 | 11 | version. |
paul@0 | 12 | |
paul@0 | 13 | This program is distributed in the hope that it will be useful, but WITHOUT |
paul@0 | 14 | ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS |
paul@0 | 15 | FOR A PARTICULAR PURPOSE. See the GNU General Public License for more |
paul@0 | 16 | details. |
paul@0 | 17 | |
paul@0 | 18 | You should have received a copy of the GNU General Public License along with |
paul@0 | 19 | this program. If not, see <http://www.gnu.org/licenses/>. |
paul@91 | 20 | |
paul@91 | 21 | -------- |
paul@91 | 22 | |
paul@91 | 23 | The results of inspecting a module are as follows: |
paul@91 | 24 | |
paul@91 | 25 | Constants |
paul@91 | 26 | --------- |
paul@91 | 27 | |
paul@91 | 28 | All constants identified within the code shall be registered. |
paul@91 | 29 | |
paul@91 | 30 | Classes |
paul@91 | 31 | ------- |
paul@91 | 32 | |
paul@91 | 33 | All global classes shall be registered; local classes (within functions) or |
paul@91 | 34 | nested classes (within classes) are not currently registered. |
paul@91 | 35 | |
paul@91 | 36 | Base classes must be detected and constant. |
paul@91 | 37 | |
paul@91 | 38 | All classes without bases are made to inherit from __builtins__.object in order |
paul@91 | 39 | to support some standard methods. |
paul@91 | 40 | |
paul@91 | 41 | Functions |
paul@91 | 42 | --------- |
paul@91 | 43 | |
paul@91 | 44 | All functions and lambda definitions shall be registered. |
paul@91 | 45 | |
paul@91 | 46 | Namespaces |
paul@91 | 47 | ---------- |
paul@91 | 48 | |
paul@91 | 49 | Modules define their own "global" namespace, within which classes, functions |
paul@91 | 50 | and lambda definitions establish a hierarchy of namespaces. |
paul@91 | 51 | |
paul@91 | 52 | Only local, global and built-in namespaces are recognised; closures are not |
paul@91 | 53 | supported. |
paul@91 | 54 | |
paul@91 | 55 | Assignments |
paul@91 | 56 | ----------- |
paul@91 | 57 | |
paul@91 | 58 | Name assignment and attribute assignment involving modules and classes cause |
paul@91 | 59 | names to be associated with values within namespaces. |
paul@91 | 60 | |
paul@91 | 61 | Any assignments within loops are considered to cause the targets of such |
paul@91 | 62 | assignments to provide non-constant values. |
paul@91 | 63 | |
paul@91 | 64 | Assignments to names are only really considered to cause the targets of such |
paul@91 | 65 | assignments to provide constant values if the targets reside in the module |
paul@91 | 66 | namespace or in class namespaces, subject to the above conditions. |
paul@91 | 67 | |
paul@91 | 68 | Assignments to names within functions are not generally considered to cause the |
paul@91 | 69 | targets of such assignments to provide constant values since functions can be |
paul@331 | 70 | invoked many times with different inputs. This affects particularly the |
paul@331 | 71 | definition of functions or lambdas within functions. However, there may be |
paul@331 | 72 | benefits in considering a local to be constant within a single invocation. |
paul@0 | 73 | """ |
paul@0 | 74 | |
paul@39 | 75 | from micropython.common import * |
paul@83 | 76 | from micropython.data import * |
paul@0 | 77 | import compiler.ast |
paul@15 | 78 | |
paul@21 | 79 | # Program visitors. |
paul@21 | 80 | |
paul@15 | 81 | class InspectedModule(ASTVisitor, Module): |
paul@15 | 82 | |
paul@20 | 83 | """ |
paul@20 | 84 | An inspected module, providing core details via the Module superclass, but |
paul@20 | 85 | capable of being used as an AST visitor. |
paul@20 | 86 | """ |
paul@15 | 87 | |
paul@71 | 88 | def __init__(self, name, importer): |
paul@71 | 89 | |
paul@71 | 90 | """ |
paul@71 | 91 | Initialise this visitor with a module 'name' and an 'importer' which is |
paul@71 | 92 | used to provide access to other modules when required. |
paul@71 | 93 | """ |
paul@71 | 94 | |
paul@15 | 95 | ASTVisitor.__init__(self) |
paul@343 | 96 | Module.__init__(self, name, importer) |
paul@15 | 97 | self.visitor = self |
paul@15 | 98 | |
paul@91 | 99 | # Import machinery links. |
paul@91 | 100 | |
paul@343 | 101 | self.optimisations = self.importer.optimisations |
paul@61 | 102 | self.builtins = self.importer.modules.get("__builtins__") |
paul@15 | 103 | self.loaded = 0 |
paul@15 | 104 | |
paul@1 | 105 | # Current expression state. |
paul@1 | 106 | |
paul@1 | 107 | self.expr = None |
paul@1 | 108 | |
paul@1 | 109 | # Namespace state. |
paul@1 | 110 | |
paul@34 | 111 | self.in_init = 0 # Find instance attributes in __init__ methods. |
paul@91 | 112 | self.in_method = 0 # Find instance attributes in all methods. |
paul@331 | 113 | self.in_function = 0 # Note function presence, affecting definitions. |
paul@34 | 114 | self.in_loop = 0 # Note loop "membership", affecting assignments. |
paul@12 | 115 | self.namespaces = [] |
paul@235 | 116 | self.functions = [] |
paul@0 | 117 | |
paul@0 | 118 | def parse(self, filename): |
paul@9 | 119 | |
paul@9 | 120 | "Parse the file having the given 'filename'." |
paul@9 | 121 | |
paul@0 | 122 | module = compiler.parseFile(filename) |
paul@0 | 123 | self.process(module) |
paul@0 | 124 | |
paul@0 | 125 | def process(self, module): |
paul@9 | 126 | |
paul@9 | 127 | "Process the given 'module'." |
paul@9 | 128 | |
paul@343 | 129 | self.astnode = module |
paul@236 | 130 | |
paul@260 | 131 | # Add __name__ to the namespace by adding an explicit assignment to the |
paul@260 | 132 | # module. |
paul@260 | 133 | |
paul@260 | 134 | module.node.nodes.insert(0, compiler.ast.Assign( |
paul@260 | 135 | [compiler.ast.AssName("__name__", 0)], |
paul@260 | 136 | compiler.ast.Const(self.full_name()) |
paul@260 | 137 | )) |
paul@260 | 138 | |
paul@236 | 139 | # First, visit module-level code, recording global names. |
paul@236 | 140 | |
paul@1 | 141 | processed = self.dispatch(module) |
paul@235 | 142 | |
paul@236 | 143 | # Then, for each function, detect and record globals declared in those |
paul@236 | 144 | # functions. |
paul@236 | 145 | |
paul@236 | 146 | for node, namespaces in self.functions: |
paul@236 | 147 | self.process_globals(node) |
paul@236 | 148 | |
paul@344 | 149 | self.finalise_attribute_usage() |
paul@284 | 150 | |
paul@236 | 151 | # Then, visit each function, recording other names. |
paul@236 | 152 | |
paul@235 | 153 | for node, namespaces in self.functions: |
paul@235 | 154 | self._visitFunctionBody(node, namespaces) |
paul@344 | 155 | namespaces[-1].finalise_attribute_usage() |
paul@280 | 156 | |
paul@236 | 157 | # Add references to other modules declared using the __all__ global. |
paul@236 | 158 | |
paul@13 | 159 | if self.has_key("__all__"): |
paul@12 | 160 | all = self["__all__"] |
paul@1 | 161 | if isinstance(all, compiler.ast.List): |
paul@1 | 162 | for n in all.nodes: |
paul@167 | 163 | self.store(n.value, self.importer.add_module(self.name + "." + n.value)) |
paul@235 | 164 | |
paul@1 | 165 | return processed |
paul@0 | 166 | |
paul@236 | 167 | def process_globals(self, node): |
paul@236 | 168 | |
paul@236 | 169 | """ |
paul@236 | 170 | Within the given 'node', process global declarations, adjusting the |
paul@236 | 171 | module namespace. |
paul@236 | 172 | """ |
paul@236 | 173 | |
paul@236 | 174 | for n in node.getChildNodes(): |
paul@236 | 175 | if isinstance(n, compiler.ast.Global): |
paul@236 | 176 | for name in n.names: |
paul@236 | 177 | if not self.has_key(name): |
paul@236 | 178 | self[name] = None |
paul@236 | 179 | else: |
paul@236 | 180 | self.process_globals(n) |
paul@236 | 181 | |
paul@3 | 182 | def vacuum(self): |
paul@9 | 183 | |
paul@171 | 184 | """ |
paul@171 | 185 | Vacuum the module namespace, removing unreferenced objects and unused |
paul@171 | 186 | names. |
paul@171 | 187 | """ |
paul@9 | 188 | |
paul@241 | 189 | if self.should_optimise_unused_objects(): |
paul@252 | 190 | self.vacuum_object(self) |
paul@0 | 191 | |
paul@167 | 192 | all_objects = list(self.all_objects) |
paul@167 | 193 | |
paul@167 | 194 | for obj in all_objects: |
paul@351 | 195 | self.vacuum_object(obj) |
paul@171 | 196 | |
paul@252 | 197 | def vacuum_object(self, obj, delete_all=0): |
paul@241 | 198 | |
paul@252 | 199 | "Vacuum the given object 'obj'." |
paul@171 | 200 | |
paul@351 | 201 | for name, attr in obj.items_for_vacuum(): |
paul@270 | 202 | |
paul@270 | 203 | # Only consider deleting entire unused objects or things accessible |
paul@270 | 204 | # via names which are never used. |
paul@270 | 205 | |
paul@344 | 206 | if delete_all or not self.importer.uses_attribute(obj.full_name(), name): |
paul@351 | 207 | obj.vacuum_item(name) |
paul@270 | 208 | |
paul@270 | 209 | # Delete any unambiguous attribute value. Such values can only |
paul@270 | 210 | # have been defined within the object and therefore are not |
paul@270 | 211 | # redefined by other code regions. |
paul@270 | 212 | |
paul@252 | 213 | if attr.assignments == 1: |
paul@252 | 214 | value = attr.get_value() |
paul@171 | 215 | |
paul@252 | 216 | if value is not obj and value in self.all_objects: |
paul@252 | 217 | self.all_objects.remove(value) |
paul@171 | 218 | |
paul@351 | 219 | # Delete class contents and lambdas from functions. |
paul@241 | 220 | |
paul@351 | 221 | self.vacuum_object(value, 1) |
paul@171 | 222 | |
paul@287 | 223 | def unfinalise(self): |
paul@287 | 224 | |
paul@287 | 225 | "Reset finalised information for the module." |
paul@287 | 226 | |
paul@287 | 227 | for obj in self.all_objects: |
paul@287 | 228 | obj.unfinalise_attributes() |
paul@287 | 229 | |
paul@171 | 230 | def finalise(self): |
paul@171 | 231 | |
paul@171 | 232 | "Finalise the module." |
paul@171 | 233 | |
paul@171 | 234 | for obj in self.all_objects: |
paul@287 | 235 | obj.finalise_attributes() |
paul@171 | 236 | |
paul@167 | 237 | def add_object(self, obj, any_scope=0): |
paul@167 | 238 | |
paul@167 | 239 | """ |
paul@167 | 240 | Record 'obj' if non-local or if the optional 'any_scope' is set to a |
paul@167 | 241 | true value. |
paul@167 | 242 | """ |
paul@167 | 243 | |
paul@167 | 244 | if any_scope or not (self.namespaces and isinstance(self.namespaces[-1], Function)): |
paul@167 | 245 | self.all_objects.add(obj) |
paul@167 | 246 | |
paul@167 | 247 | # Optimisation tests. |
paul@167 | 248 | |
paul@167 | 249 | def should_optimise_unused_objects(self): |
paul@167 | 250 | return "unused_objects" in self.optimisations |
paul@167 | 251 | |
paul@3 | 252 | # Namespace methods. |
paul@0 | 253 | |
paul@330 | 254 | def in_class(self, namespaces=None): |
paul@330 | 255 | namespaces = namespaces or self.namespaces |
paul@330 | 256 | return len(namespaces) > 1 and isinstance(namespaces[-2], Class) |
paul@330 | 257 | |
paul@0 | 258 | def store(self, name, obj): |
paul@12 | 259 | |
paul@12 | 260 | "Record attribute or local 'name', storing 'obj'." |
paul@12 | 261 | |
paul@339 | 262 | # Store in the module. |
paul@339 | 263 | |
paul@12 | 264 | if not self.namespaces: |
paul@342 | 265 | if self.in_loop and self.used_in_scope(name, "builtins"): |
paul@339 | 266 | raise InspectError("Name %r already used as a built-in." % name) |
paul@339 | 267 | else: |
paul@339 | 268 | self.set(name, obj, not self.in_loop) |
paul@339 | 269 | |
paul@339 | 270 | # Or store locally. |
paul@339 | 271 | |
paul@12 | 272 | else: |
paul@341 | 273 | locals = self.namespaces[-1] |
paul@341 | 274 | |
paul@342 | 275 | if self.in_loop and locals.used_in_scope(name, "global") and not name in locals.globals: |
paul@341 | 276 | raise InspectError("Name %r already used as global." % name) |
paul@342 | 277 | elif self.in_loop and locals.used_in_scope(name, "builtins"): |
paul@341 | 278 | raise InspectError("Name %r already used as a built-in." % name) |
paul@341 | 279 | else: |
paul@341 | 280 | locals.set(name, obj, not self.in_loop) |
paul@12 | 281 | |
paul@85 | 282 | def store_lambda(self, obj): |
paul@91 | 283 | |
paul@91 | 284 | "Store a lambda function 'obj'." |
paul@91 | 285 | |
paul@167 | 286 | self.add_object(obj) |
paul@351 | 287 | self.get_namespace().add_lambda(obj) |
paul@85 | 288 | |
paul@94 | 289 | def store_module_attr(self, name, module): |
paul@94 | 290 | |
paul@94 | 291 | """ |
paul@94 | 292 | Record module attribute 'name' in the given 'module' using the current |
paul@94 | 293 | expression. |
paul@94 | 294 | """ |
paul@94 | 295 | |
paul@192 | 296 | module.set(name, self.expr, 0) |
paul@94 | 297 | |
paul@91 | 298 | def store_class_attr(self, name): |
paul@91 | 299 | |
paul@94 | 300 | """ |
paul@94 | 301 | Record class attribute 'name' in the current class using the current |
paul@94 | 302 | expression. |
paul@94 | 303 | """ |
paul@91 | 304 | |
paul@91 | 305 | if self.in_method and self.namespaces[-2].has_key(name): |
paul@192 | 306 | self.namespaces[-2].set(name, self.expr, 0) |
paul@91 | 307 | return 1 |
paul@91 | 308 | |
paul@91 | 309 | return 0 |
paul@91 | 310 | |
paul@34 | 311 | def store_instance_attr(self, name): |
paul@12 | 312 | |
paul@12 | 313 | "Record instance attribute 'name' in the current class." |
paul@12 | 314 | |
paul@91 | 315 | if self.in_method: |
paul@15 | 316 | |
paul@12 | 317 | # Current namespace is the function. |
paul@12 | 318 | # Previous namespace is the class. |
paul@15 | 319 | |
paul@12 | 320 | self.namespaces[-2].add_instance_attribute(name) |
paul@0 | 321 | |
paul@272 | 322 | def get_namespace(self): |
paul@71 | 323 | |
paul@71 | 324 | "Return the parent (or most recent) namespace currently exposed." |
paul@71 | 325 | |
paul@12 | 326 | return (self.namespaces[-1:] or [self])[0] |
paul@7 | 327 | |
paul@323 | 328 | def use_name(self, name, node=None): |
paul@323 | 329 | |
paul@323 | 330 | """ |
paul@323 | 331 | Use the given 'name' within the current namespace/unit, either in |
paul@323 | 332 | conjunction with a particular object (if 'node' is specified and not |
paul@323 | 333 | None) or unconditionally. |
paul@323 | 334 | """ |
paul@250 | 335 | |
paul@323 | 336 | if node is not None and isinstance(node, compiler.ast.Name): |
paul@323 | 337 | self.use_attribute(node.name, name) |
paul@250 | 338 | |
paul@323 | 339 | # For general name usage, declare usage of the given name from this |
paul@323 | 340 | # particular unit. |
paul@323 | 341 | |
paul@323 | 342 | else: |
paul@323 | 343 | unit = self.get_namespace() |
paul@323 | 344 | self.importer.use_name(name, unit.full_name()) |
paul@250 | 345 | |
paul@279 | 346 | # Attribute usage methods. |
paul@279 | 347 | # These are convenience methods which refer to the specific namespace's |
paul@279 | 348 | # implementation of these operations. |
paul@279 | 349 | |
paul@272 | 350 | def new_branchpoint(self): |
paul@272 | 351 | self.get_namespace()._new_branchpoint() |
paul@272 | 352 | |
paul@311 | 353 | def new_branch(self, loop_node=None): |
paul@311 | 354 | self.get_namespace()._new_branch(loop_node) |
paul@272 | 355 | |
paul@299 | 356 | def abandon_branch(self): |
paul@299 | 357 | self.get_namespace()._abandon_branch() |
paul@299 | 358 | |
paul@272 | 359 | def shelve_branch(self): |
paul@272 | 360 | self.get_namespace()._shelve_branch() |
paul@272 | 361 | |
paul@272 | 362 | def merge_branches(self): |
paul@272 | 363 | self.get_namespace()._merge_branches() |
paul@272 | 364 | |
paul@278 | 365 | def define_attribute_user(self, node): |
paul@279 | 366 | |
paul@279 | 367 | """ |
paul@279 | 368 | Define 'node' as the user of attributes, indicating the point where the |
paul@279 | 369 | user is defined. |
paul@279 | 370 | """ |
paul@279 | 371 | |
paul@278 | 372 | self.get_namespace()._define_attribute_user(node) |
paul@272 | 373 | |
paul@280 | 374 | def use_attribute(self, name, attrname): |
paul@323 | 375 | |
paul@323 | 376 | "Note usage on the attribute user 'name' of the attribute 'attrname'." |
paul@323 | 377 | |
paul@280 | 378 | return self.get_namespace()._use_attribute(name, attrname) |
paul@272 | 379 | |
paul@347 | 380 | def use_specific_attribute(self, objname, attrname): |
paul@347 | 381 | |
paul@347 | 382 | """ |
paul@347 | 383 | Note usage on the object having the given 'objname' of the attribute |
paul@351 | 384 | 'attrname'. If 'objname' is None, the current namespace is chosen as the |
paul@351 | 385 | object providing the attribute. |
paul@347 | 386 | """ |
paul@347 | 387 | |
paul@347 | 388 | return self.get_namespace()._use_specific_attribute(objname, attrname) |
paul@347 | 389 | |
paul@3 | 390 | # Visitor methods. |
paul@3 | 391 | |
paul@3 | 392 | def default(self, node, *args): |
paul@339 | 393 | raise InspectError("Node class %r is not supported." % node.__class__) |
paul@3 | 394 | |
paul@0 | 395 | def NOP(self, node): |
paul@21 | 396 | for n in node.getChildNodes(): |
paul@21 | 397 | self.dispatch(n) |
paul@19 | 398 | return None |
paul@0 | 399 | |
paul@299 | 400 | def NOP_ABANDON(self, node): |
paul@302 | 401 | self.NOP(node) |
paul@299 | 402 | self.abandon_branch() |
paul@299 | 403 | |
paul@82 | 404 | def OP(self, node): |
paul@82 | 405 | for n in node.getChildNodes(): |
paul@82 | 406 | self.dispatch(n) |
paul@82 | 407 | return Instance() |
paul@1 | 408 | |
paul@314 | 409 | # Generic support for classes of operations. |
paul@314 | 410 | |
paul@354 | 411 | def _ensureOperators(self): |
paul@354 | 412 | if not self.has_key("$operator"): |
paul@354 | 413 | module = self.importer.load("operator") |
paul@354 | 414 | self["$operator"] = module |
paul@354 | 415 | return self["$operator"].get_value() |
paul@354 | 416 | |
paul@172 | 417 | def _visitUnary(self, node): |
paul@172 | 418 | |
paul@172 | 419 | "Accounting method for the unary operator 'node'." |
paul@172 | 420 | |
paul@172 | 421 | method = unary_methods[node.__class__.__name__] |
paul@323 | 422 | self.use_name(method, node) |
paul@172 | 423 | return self.OP(node) |
paul@172 | 424 | |
paul@172 | 425 | def _visitBinary(self, node): |
paul@172 | 426 | |
paul@172 | 427 | "Accounting method for the binary operator 'node'." |
paul@172 | 428 | |
paul@354 | 429 | operator_module = self._ensureOperators() |
paul@354 | 430 | operator_fn = operator_functions[node.__class__.__name__] |
paul@354 | 431 | self.use_specific_attribute(operator_module.full_name(), operator_fn) |
paul@172 | 432 | return self.OP(node) |
paul@172 | 433 | |
paul@85 | 434 | def _visitFunction(self, node, name): |
paul@85 | 435 | |
paul@85 | 436 | """ |
paul@85 | 437 | Return a function object for the function defined by 'node' with the |
paul@85 | 438 | given 'name'. If a lambda expression is being visited, 'name' should be |
paul@85 | 439 | None. |
paul@85 | 440 | """ |
paul@85 | 441 | |
paul@233 | 442 | # Define the function object. |
paul@233 | 443 | |
paul@85 | 444 | function = Function( |
paul@85 | 445 | name, |
paul@272 | 446 | self.get_namespace(), |
paul@85 | 447 | node.argnames, |
paul@85 | 448 | node.defaults, |
paul@85 | 449 | (node.flags & 4 != 0), |
paul@85 | 450 | (node.flags & 8 != 0), |
paul@331 | 451 | self.in_loop or self.in_function, |
paul@85 | 452 | self, |
paul@85 | 453 | node |
paul@85 | 454 | ) |
paul@85 | 455 | |
paul@233 | 456 | self.add_object(function, any_scope=1) |
paul@233 | 457 | |
paul@85 | 458 | # Make a back reference from the node for code generation. |
paul@85 | 459 | |
paul@85 | 460 | node.unit = function |
paul@85 | 461 | |
paul@85 | 462 | # Process the defaults. |
paul@85 | 463 | |
paul@85 | 464 | for n in node.defaults: |
paul@85 | 465 | self.expr = self.dispatch(n) |
paul@192 | 466 | function.store_default(self.expr) |
paul@85 | 467 | |
paul@235 | 468 | self.functions.append((node, self.namespaces + [function])) |
paul@85 | 469 | |
paul@330 | 470 | # Store the function. |
paul@330 | 471 | |
paul@85 | 472 | if name is not None: |
paul@85 | 473 | self.store(name, function) |
paul@85 | 474 | else: |
paul@85 | 475 | self.store_lambda(function) |
paul@167 | 476 | |
paul@330 | 477 | # Test the defaults and assess whether an dynamic object will result. |
paul@330 | 478 | |
paul@331 | 479 | function.make_dynamic() |
paul@331 | 480 | return function |
paul@85 | 481 | |
paul@235 | 482 | def _visitFunctionBody(self, node, namespaces): |
paul@235 | 483 | |
paul@235 | 484 | "Enter the function." |
paul@235 | 485 | |
paul@235 | 486 | # Current namespace is the function. |
paul@235 | 487 | # Previous namespace is the class. |
paul@235 | 488 | |
paul@330 | 489 | if self.in_class(namespaces): |
paul@235 | 490 | if namespaces[-1].name == "__init__": |
paul@235 | 491 | self.in_init = 1 |
paul@235 | 492 | self.in_method = 1 |
paul@235 | 493 | |
paul@331 | 494 | in_function = self.in_function |
paul@331 | 495 | in_loop = self.in_loop |
paul@331 | 496 | self.in_function = 1 |
paul@331 | 497 | self.in_loop = 0 |
paul@331 | 498 | |
paul@235 | 499 | self.namespaces = namespaces |
paul@235 | 500 | self.dispatch(node.code) |
paul@235 | 501 | |
paul@331 | 502 | self.in_loop = in_loop |
paul@331 | 503 | self.in_function = in_function |
paul@235 | 504 | self.in_init = 0 |
paul@235 | 505 | self.in_method = 0 |
paul@235 | 506 | |
paul@172 | 507 | # Specific handler methods. |
paul@172 | 508 | |
paul@172 | 509 | visitAdd = _visitBinary |
paul@82 | 510 | |
paul@82 | 511 | visitAnd = OP |
paul@0 | 512 | |
paul@4 | 513 | visitAssert = NOP |
paul@4 | 514 | |
paul@0 | 515 | def visitAssign(self, node): |
paul@0 | 516 | self.expr = self.dispatch(node.expr) |
paul@0 | 517 | for n in node.nodes: |
paul@0 | 518 | self.dispatch(n) |
paul@0 | 519 | return None |
paul@0 | 520 | |
paul@0 | 521 | def visitAssAttr(self, node): |
paul@0 | 522 | expr = self.dispatch(node.expr) |
paul@272 | 523 | |
paul@272 | 524 | # Record the attribute on the presumed target. |
paul@272 | 525 | |
paul@94 | 526 | if isinstance(expr, Attr): |
paul@94 | 527 | if expr.name == "self": |
paul@94 | 528 | if not self.store_class_attr(node.attrname): |
paul@94 | 529 | self.store_instance_attr(node.attrname) |
paul@192 | 530 | elif isinstance(expr.get_value(), Module): |
paul@192 | 531 | self.store_module_attr(node.attrname, expr.get_value()) |
paul@192 | 532 | print "Warning: attribute %r of module %r set outside the module." % (node.attrname, expr.get_value().name) |
paul@272 | 533 | |
paul@285 | 534 | # Note usage of the attribute where a local is involved. |
paul@272 | 535 | |
paul@272 | 536 | if expr.parent is self.get_namespace(): |
paul@309 | 537 | node._attrusers = self.use_attribute(expr.name, node.attrname) |
paul@309 | 538 | node._username = expr.name |
paul@272 | 539 | |
paul@0 | 540 | return None |
paul@0 | 541 | |
paul@0 | 542 | def visitAssList(self, node): |
paul@204 | 543 | |
paul@204 | 544 | # Declare names which will be used by generated code. |
paul@204 | 545 | |
paul@323 | 546 | self.use_name("__getitem__", node) |
paul@204 | 547 | |
paul@204 | 548 | # Process the assignment. |
paul@204 | 549 | |
paul@139 | 550 | for i, n in enumerate(node.nodes): |
paul@0 | 551 | self.dispatch(n) |
paul@168 | 552 | self.importer.make_constant(i) # for __getitem__(i) at run-time |
paul@0 | 553 | return None |
paul@0 | 554 | |
paul@0 | 555 | def visitAssName(self, node): |
paul@289 | 556 | if hasattr(node, "flags") and node.flags == "OP_DELETE": |
paul@298 | 557 | print "Warning: deletion of attribute %r in %r is not supported." % (node.name, self.full_name()) |
paul@339 | 558 | #raise InspectError("Deletion of attribute %r is not supported." % node.name) |
paul@274 | 559 | |
paul@120 | 560 | self.store(node.name, self.expr) |
paul@278 | 561 | self.define_attribute_user(node) |
paul@285 | 562 | |
paul@285 | 563 | # Ensure the presence of the given name in this namespace. |
paul@285 | 564 | |
paul@285 | 565 | self.use_specific_attribute(None, node.name) |
paul@0 | 566 | return None |
paul@0 | 567 | |
paul@0 | 568 | visitAssTuple = visitAssList |
paul@0 | 569 | |
paul@172 | 570 | def visitAugAssign(self, node): |
paul@172 | 571 | |
paul@172 | 572 | # Accounting. |
paul@172 | 573 | |
paul@354 | 574 | operator_fn = operator_functions.get(node.op) |
paul@354 | 575 | operator_module = self._ensureOperators() |
paul@354 | 576 | self.use_specific_attribute(operator_module.full_name(), operator_fn) |
paul@244 | 577 | |
paul@244 | 578 | # Process the assignment. |
paul@244 | 579 | |
paul@244 | 580 | self.expr = self.dispatch(node.expr) |
paul@244 | 581 | |
paul@244 | 582 | # NOTE: Similar to micropython.ast handler code. |
paul@244 | 583 | # NOTE: Slices and subscripts not supported. |
paul@244 | 584 | |
paul@244 | 585 | if isinstance(node.node, compiler.ast.Name): |
paul@244 | 586 | self.visitAssName(node.node) |
paul@244 | 587 | elif isinstance(node.node, compiler.ast.Getattr): |
paul@244 | 588 | self.visitAssAttr(node.node) |
paul@244 | 589 | else: |
paul@339 | 590 | raise InspectError("AugAssign(Slice or Subscript)") |
paul@244 | 591 | |
paul@244 | 592 | return None |
paul@2 | 593 | |
paul@82 | 594 | visitBackquote = OP |
paul@4 | 595 | |
paul@172 | 596 | visitBitand = _visitBinary |
paul@2 | 597 | |
paul@172 | 598 | visitBitor = _visitBinary |
paul@2 | 599 | |
paul@172 | 600 | visitBitxor = _visitBinary |
paul@4 | 601 | |
paul@299 | 602 | visitBreak = NOP_ABANDON |
paul@4 | 603 | |
paul@82 | 604 | visitCallFunc = OP |
paul@0 | 605 | |
paul@0 | 606 | def visitClass(self, node): |
paul@91 | 607 | |
paul@91 | 608 | """ |
paul@91 | 609 | Register the class at the given 'node' subject to the restrictions |
paul@91 | 610 | mentioned in the module docstring. |
paul@91 | 611 | """ |
paul@91 | 612 | |
paul@12 | 613 | if self.namespaces: |
paul@41 | 614 | print "Class %r in %r is not global: ignored." % (node.name, self.namespaces[-1].full_name()) |
paul@82 | 615 | return None |
paul@0 | 616 | else: |
paul@331 | 617 | if self.in_loop: |
paul@331 | 618 | print "Warning: class %r in %r defined in a loop." % (node.name, self.full_name()) |
paul@331 | 619 | |
paul@272 | 620 | cls = Class(node.name, self.get_namespace(), self, node) |
paul@37 | 621 | |
paul@349 | 622 | # Make a back reference from the node for code generation. |
paul@349 | 623 | |
paul@349 | 624 | node.unit = cls |
paul@349 | 625 | |
paul@349 | 626 | # Process base classes in the context of the class's namespace. |
paul@349 | 627 | # This confines references to such classes to the class instead of |
paul@349 | 628 | # the namespace in which it is defined. |
paul@349 | 629 | |
paul@349 | 630 | self.namespaces.append(cls) |
paul@349 | 631 | |
paul@37 | 632 | # Visit the base class expressions, attempting to find concrete |
paul@37 | 633 | # definitions of classes. |
paul@37 | 634 | |
paul@0 | 635 | for base in node.bases: |
paul@36 | 636 | expr = self.dispatch(base) |
paul@349 | 637 | |
paul@349 | 638 | # Each base class must be constant and known at compile-time. |
paul@349 | 639 | |
paul@36 | 640 | if isinstance(expr, Attr): |
paul@36 | 641 | if expr.assignments != 1: |
paul@339 | 642 | raise InspectError("Base class %r for %r is not constant." % (base, cls.full_name())) |
paul@36 | 643 | else: |
paul@192 | 644 | cls.add_base(expr.get_value()) |
paul@349 | 645 | |
paul@349 | 646 | # Where no expression value is available, the base class is |
paul@349 | 647 | # not identifiable. |
paul@349 | 648 | |
paul@349 | 649 | else: |
paul@339 | 650 | raise InspectError("Base class %r for %r is not found: it may be hidden in some way." % (base, cls.full_name())) |
paul@0 | 651 | |
paul@59 | 652 | # NOTE: Potentially dubious measure to permit __init__ availability. |
paul@59 | 653 | # If no bases exist, adopt the 'object' class. |
paul@59 | 654 | |
paul@61 | 655 | if not node.bases and not (self.name == "__builtins__" and node.name == "object") : |
paul@59 | 656 | expr = self.dispatch(compiler.ast.Name("object")) |
paul@192 | 657 | cls.add_base(expr.get_value()) |
paul@59 | 658 | |
paul@349 | 659 | # Make an entry for the class in the parent namespace. |
paul@21 | 660 | |
paul@349 | 661 | self.namespaces.pop() |
paul@0 | 662 | self.store(node.name, cls) |
paul@167 | 663 | self.add_object(cls) |
paul@0 | 664 | |
paul@349 | 665 | # Process the class body in its own namespace. |
paul@59 | 666 | |
paul@12 | 667 | self.namespaces.append(cls) |
paul@0 | 668 | self.dispatch(node.code) |
paul@12 | 669 | self.namespaces.pop() |
paul@0 | 670 | |
paul@349 | 671 | cls.finalise_attribute_usage() |
paul@82 | 672 | return cls |
paul@0 | 673 | |
paul@172 | 674 | def visitCompare(self, node): |
paul@172 | 675 | |
paul@172 | 676 | # Accounting. |
paul@172 | 677 | # NOTE: Replicates some code in micropython.ast.visitCompare. |
paul@172 | 678 | |
paul@323 | 679 | this_node = node |
paul@323 | 680 | |
paul@172 | 681 | for op in node.ops: |
paul@172 | 682 | op_name, next_node = op |
paul@323 | 683 | |
paul@354 | 684 | # Define name/attribute usage. |
paul@354 | 685 | # Get the applicable operation. |
paul@323 | 686 | |
paul@354 | 687 | operator_fn = operator_functions.get(op_name) |
paul@354 | 688 | |
paul@354 | 689 | # For operators, reference the specific function involved. |
paul@323 | 690 | |
paul@354 | 691 | if operator_fn is not None: |
paul@354 | 692 | operator_module = self._ensureOperators() |
paul@354 | 693 | self.use_specific_attribute(operator_module.full_name(), operator_fn) |
paul@323 | 694 | |
paul@354 | 695 | # Define __contains__ usage on the next node. |
paul@354 | 696 | |
paul@172 | 697 | elif op_name.endswith("in"): |
paul@323 | 698 | self.use_name("__contains__", next_node) |
paul@323 | 699 | |
paul@323 | 700 | this_node = next_node |
paul@172 | 701 | |
paul@172 | 702 | return self.OP(node) |
paul@4 | 703 | |
paul@21 | 704 | def visitConst(self, node): |
paul@177 | 705 | |
paul@177 | 706 | # Register the constant, if necessary, returning the resulting object. |
paul@177 | 707 | |
paul@323 | 708 | self.use_name(self.importer.get_constant_type_name(node.value), node) |
paul@168 | 709 | return self.importer.make_constant(node.value) |
paul@0 | 710 | |
paul@299 | 711 | visitContinue = NOP_ABANDON |
paul@4 | 712 | |
paul@4 | 713 | visitDecorators = NOP |
paul@4 | 714 | |
paul@82 | 715 | visitDict = OP |
paul@0 | 716 | |
paul@0 | 717 | visitDiscard = NOP |
paul@0 | 718 | |
paul@172 | 719 | visitDiv = _visitBinary |
paul@4 | 720 | |
paul@4 | 721 | visitEllipsis = NOP |
paul@4 | 722 | |
paul@4 | 723 | visitExec = NOP |
paul@4 | 724 | |
paul@82 | 725 | visitExpression = OP |
paul@4 | 726 | |
paul@172 | 727 | visitFloorDiv = _visitBinary |
paul@4 | 728 | |
paul@34 | 729 | def visitFor(self, node): |
paul@272 | 730 | self.new_branchpoint() |
paul@204 | 731 | |
paul@204 | 732 | # Declare names which will be used by generated code. |
paul@204 | 733 | |
paul@323 | 734 | self.use_name("__iter__", node.list) |
paul@250 | 735 | self.use_name("next") |
paul@345 | 736 | self.use_name("StopIteration") |
paul@204 | 737 | |
paul@331 | 738 | in_loop = self.in_loop |
paul@289 | 739 | self.in_loop = 1 |
paul@341 | 740 | self.dispatch(node.list) |
paul@272 | 741 | self.dispatch(node.assign) |
paul@272 | 742 | |
paul@204 | 743 | # Enter the loop. |
paul@275 | 744 | # Propagate attribute usage to branches. |
paul@204 | 745 | |
paul@272 | 746 | self.new_branch() |
paul@272 | 747 | self.dispatch(node.body) |
paul@272 | 748 | self.shelve_branch() |
paul@331 | 749 | self.in_loop = in_loop |
paul@272 | 750 | |
paul@275 | 751 | # Maintain a branch for the else clause or the current retained usage |
paul@275 | 752 | # where execution avoids the conditional clauses. |
paul@275 | 753 | |
paul@275 | 754 | self.new_branch() |
paul@272 | 755 | if node.else_ is not None: |
paul@272 | 756 | self.dispatch(node.else_) |
paul@275 | 757 | self.shelve_branch() |
paul@272 | 758 | |
paul@272 | 759 | self.merge_branches() |
paul@82 | 760 | return None |
paul@0 | 761 | |
paul@0 | 762 | def visitFrom(self, node): |
paul@0 | 763 | module = self.importer.load(node.modname, 1) |
paul@0 | 764 | |
paul@35 | 765 | #if module is None: |
paul@35 | 766 | # print "Warning:", node.modname, "not imported." |
paul@0 | 767 | |
paul@0 | 768 | for name, alias in node.names: |
paul@0 | 769 | if name != "*": |
paul@285 | 770 | if module is not None and module.has_key(name): |
paul@24 | 771 | attr = module[name] |
paul@192 | 772 | self.store(alias or name, attr) |
paul@192 | 773 | if isinstance(attr.get_value(), Module) and not attr.get_value().loaded: |
paul@192 | 774 | self.importer.load(attr.get_value().name) |
paul@24 | 775 | |
paul@24 | 776 | # Support the import of names from missing modules. |
paul@24 | 777 | |
paul@3 | 778 | else: |
paul@24 | 779 | self.store(alias or name, UnresolvedName(name, node.modname, self)) |
paul@3 | 780 | else: |
paul@3 | 781 | if module is not None: |
paul@285 | 782 | for n in module.keys(): |
paul@24 | 783 | attr = module[n] |
paul@192 | 784 | self.store(n, attr) |
paul@192 | 785 | if isinstance(attr.get_value(), Module) and not attr.get_value().loaded: |
paul@192 | 786 | self.importer.load(attr.get_value().name) |
paul@0 | 787 | |
paul@0 | 788 | return None |
paul@0 | 789 | |
paul@0 | 790 | def visitFunction(self, node): |
paul@85 | 791 | return self._visitFunction(node, node.name) |
paul@0 | 792 | |
paul@82 | 793 | visitGenExpr = OP |
paul@4 | 794 | |
paul@4 | 795 | visitGenExprFor = NOP |
paul@4 | 796 | |
paul@4 | 797 | visitGenExprIf = NOP |
paul@4 | 798 | |
paul@4 | 799 | visitGenExprInner = NOP |
paul@4 | 800 | |
paul@0 | 801 | def visitGetattr(self, node): |
paul@0 | 802 | expr = self.dispatch(node.expr) |
paul@169 | 803 | attrname = node.attrname |
paul@169 | 804 | |
paul@272 | 805 | # Attempt to identify the nature of the attribute. |
paul@272 | 806 | |
paul@36 | 807 | if isinstance(expr, Attr): |
paul@192 | 808 | value = expr.get_value() |
paul@285 | 809 | |
paul@285 | 810 | # Get the attribute and record its usage. |
paul@285 | 811 | |
paul@87 | 812 | if isinstance(value, (Class, Module)): |
paul@285 | 813 | attr = value.get(attrname) |
paul@285 | 814 | self.use_specific_attribute(value.full_name(), attrname) |
paul@285 | 815 | |
paul@36 | 816 | elif isinstance(value, UnresolvedName): |
paul@169 | 817 | attr = UnresolvedName(attrname, value.full_name(), self) |
paul@285 | 818 | |
paul@87 | 819 | else: |
paul@167 | 820 | attr = None |
paul@272 | 821 | |
paul@285 | 822 | # Note usage of the attribute where a local is involved. |
paul@272 | 823 | |
paul@285 | 824 | if expr.parent is self.get_namespace(): |
paul@309 | 825 | node._attrusers = self.use_attribute(expr.name, attrname) |
paul@309 | 826 | node._username = expr.name |
paul@285 | 827 | else: |
paul@323 | 828 | self.use_name(attrname, node.expr) |
paul@272 | 829 | |
paul@167 | 830 | elif self.builtins is not None: |
paul@169 | 831 | attr = self.builtins.get(attrname) |
paul@285 | 832 | self.use_specific_attribute(self.builtins.full_name(), attrname) |
paul@280 | 833 | |
paul@61 | 834 | else: |
paul@169 | 835 | attr = UnresolvedName(attrname, value.full_name(), self) |
paul@169 | 836 | |
paul@167 | 837 | return attr |
paul@4 | 838 | |
paul@12 | 839 | def visitGlobal(self, node): |
paul@12 | 840 | if self.namespaces: |
paul@12 | 841 | for name in node.names: |
paul@178 | 842 | ns = self.namespaces[-1] |
paul@178 | 843 | if not ns.make_global(name): |
paul@339 | 844 | raise InspectError("Name %r is global and local in %r" % (name, ns.full_name())) |
paul@37 | 845 | |
paul@236 | 846 | # The name is recorded in an earlier process. |
paul@0 | 847 | |
paul@0 | 848 | def visitIf(self, node): |
paul@272 | 849 | self.new_branchpoint() |
paul@272 | 850 | |
paul@275 | 851 | # Propagate attribute usage to branches. |
paul@275 | 852 | |
paul@0 | 853 | for test, body in node.tests: |
paul@202 | 854 | self.dispatch(test) |
paul@272 | 855 | |
paul@272 | 856 | self.new_branch() |
paul@0 | 857 | self.dispatch(body) |
paul@272 | 858 | self.shelve_branch() |
paul@272 | 859 | |
paul@275 | 860 | # Maintain a branch for the else clause or the current retained usage |
paul@275 | 861 | # where execution avoids the conditional clauses. |
paul@275 | 862 | |
paul@275 | 863 | self.new_branch() |
paul@0 | 864 | if node.else_ is not None: |
paul@0 | 865 | self.dispatch(node.else_) |
paul@275 | 866 | self.shelve_branch() |
paul@272 | 867 | |
paul@272 | 868 | self.merge_branches() |
paul@0 | 869 | return None |
paul@0 | 870 | |
paul@12 | 871 | visitIfExp = NOP |
paul@12 | 872 | |
paul@0 | 873 | def visitImport(self, node): |
paul@0 | 874 | for name, alias in node.names: |
paul@2 | 875 | if alias is not None: |
paul@167 | 876 | module = self.importer.load(name, 1) or UnresolvedName(None, name, self) |
paul@167 | 877 | self.store(alias, module) |
paul@2 | 878 | else: |
paul@167 | 879 | module = self.importer.load(name) or UnresolvedName(None, name.split(".")[0], self) |
paul@167 | 880 | self.store(name.split(".")[0], module) |
paul@0 | 881 | |
paul@0 | 882 | return None |
paul@0 | 883 | |
paul@172 | 884 | visitInvert = _visitUnary |
paul@4 | 885 | |
paul@59 | 886 | def visitKeyword(self, node): |
paul@59 | 887 | self.dispatch(node.expr) |
paul@168 | 888 | self.importer.make_constant(node.name) |
paul@71 | 889 | self.keyword_names.add(node.name) |
paul@59 | 890 | return None |
paul@4 | 891 | |
paul@85 | 892 | def visitLambda(self, node): |
paul@351 | 893 | fn = self._visitFunction(node, None) |
paul@351 | 894 | self.use_specific_attribute(None, fn.name) |
paul@351 | 895 | return fn |
paul@4 | 896 | |
paul@172 | 897 | visitLeftShift = _visitBinary |
paul@1 | 898 | |
paul@346 | 899 | def visitList(self, node): |
paul@347 | 900 | self.use_specific_attribute("__builtins__", "list") |
paul@346 | 901 | self.OP(node) |
paul@0 | 902 | |
paul@341 | 903 | def visitListComp(self, node): |
paul@341 | 904 | for qual in node.quals: |
paul@341 | 905 | self.dispatch(qual) |
paul@341 | 906 | self.dispatch(node.expr) |
paul@341 | 907 | |
paul@341 | 908 | def visitListCompFor(self, node): |
paul@341 | 909 | self.new_branchpoint() |
paul@341 | 910 | |
paul@341 | 911 | # Declare names which will be used by generated code. |
paul@341 | 912 | |
paul@341 | 913 | self.use_name("__iter__", node.list) |
paul@341 | 914 | self.use_name("next") |
paul@4 | 915 | |
paul@341 | 916 | in_loop = self.in_loop |
paul@341 | 917 | self.in_loop = 1 |
paul@341 | 918 | self.dispatch(node.list) |
paul@341 | 919 | self.dispatch(node.assign) |
paul@341 | 920 | |
paul@341 | 921 | # Enter the loop. |
paul@341 | 922 | # Propagate attribute usage to branches. |
paul@341 | 923 | |
paul@341 | 924 | self.new_branch() |
paul@341 | 925 | |
paul@341 | 926 | for if_ in node.ifs: |
paul@341 | 927 | self.dispatch(if_) |
paul@341 | 928 | |
paul@341 | 929 | self.shelve_branch() |
paul@341 | 930 | self.in_loop = in_loop |
paul@341 | 931 | |
paul@341 | 932 | self.merge_branches() |
paul@341 | 933 | return None |
paul@4 | 934 | |
paul@4 | 935 | visitListCompIf = NOP |
paul@4 | 936 | |
paul@172 | 937 | visitMod = _visitBinary |
paul@4 | 938 | |
paul@0 | 939 | def visitModule(self, node): |
paul@143 | 940 | |
paul@143 | 941 | # Make a back reference from the node for code generation. |
paul@143 | 942 | |
paul@143 | 943 | node.unit = self |
paul@0 | 944 | return self.dispatch(node.node) |
paul@0 | 945 | |
paul@172 | 946 | visitMul = _visitBinary |
paul@2 | 947 | |
paul@0 | 948 | def visitName(self, node): |
paul@343 | 949 | return self.get_namespace().get_using_node(node.name, node) |
paul@0 | 950 | |
paul@82 | 951 | visitNot = OP |
paul@0 | 952 | |
paul@82 | 953 | visitOr = OP |
paul@0 | 954 | |
paul@0 | 955 | visitPass = NOP |
paul@0 | 956 | |
paul@172 | 957 | visitPower = _visitBinary |
paul@4 | 958 | |
paul@4 | 959 | visitPrint = NOP |
paul@4 | 960 | |
paul@4 | 961 | visitPrintnl = NOP |
paul@4 | 962 | |
paul@299 | 963 | visitRaise = NOP_ABANDON |
paul@0 | 964 | |
paul@299 | 965 | visitReturn = NOP_ABANDON |
paul@4 | 966 | |
paul@172 | 967 | visitRightShift = _visitBinary |
paul@1 | 968 | |
paul@342 | 969 | def visitSlice(self, node): |
paul@347 | 970 | self.use_specific_attribute("__builtins__", "slice") |
paul@342 | 971 | self.use_name("__getitem__", node) |
paul@342 | 972 | self.OP(node) |
paul@4 | 973 | |
paul@82 | 974 | visitSliceobj = OP |
paul@23 | 975 | |
paul@0 | 976 | def visitStmt(self, node): |
paul@0 | 977 | for n in node.nodes: |
paul@0 | 978 | self.dispatch(n) |
paul@0 | 979 | return None |
paul@0 | 980 | |
paul@172 | 981 | visitSub = _visitBinary |
paul@4 | 982 | |
paul@216 | 983 | def visitSubscript(self, node): |
paul@323 | 984 | self.use_name("__getitem__", node) |
paul@216 | 985 | self.OP(node) |
paul@0 | 986 | |
paul@0 | 987 | def visitTryExcept(self, node): |
paul@0 | 988 | self.dispatch(node.body) |
paul@272 | 989 | |
paul@272 | 990 | self.new_branchpoint() |
paul@272 | 991 | |
paul@0 | 992 | for name, var, n in node.handlers: |
paul@272 | 993 | self.new_branch() |
paul@97 | 994 | |
paul@97 | 995 | # Establish the local for the handler. |
paul@97 | 996 | |
paul@99 | 997 | if var is not None: |
paul@99 | 998 | self.dispatch(var) |
paul@99 | 999 | if n is not None: |
paul@99 | 1000 | self.dispatch(n) |
paul@272 | 1001 | |
paul@272 | 1002 | self.shelve_branch() |
paul@272 | 1003 | |
paul@0 | 1004 | if node.else_ is not None: |
paul@272 | 1005 | self.new_branch() |
paul@0 | 1006 | self.dispatch(node.else_) |
paul@272 | 1007 | self.shelve_branch() |
paul@272 | 1008 | |
paul@272 | 1009 | self.merge_branches() |
paul@0 | 1010 | return None |
paul@0 | 1011 | |
paul@4 | 1012 | visitTryFinally = NOP |
paul@4 | 1013 | |
paul@82 | 1014 | visitTuple = OP |
paul@1 | 1015 | |
paul@172 | 1016 | visitUnaryAdd = _visitUnary |
paul@4 | 1017 | |
paul@172 | 1018 | visitUnarySub = _visitUnary |
paul@4 | 1019 | |
paul@34 | 1020 | def visitWhile(self, node): |
paul@272 | 1021 | self.new_branchpoint() |
paul@272 | 1022 | |
paul@275 | 1023 | # Propagate attribute usage to branches. |
paul@275 | 1024 | |
paul@331 | 1025 | in_loop = self.in_loop |
paul@34 | 1026 | self.in_loop = 1 |
paul@272 | 1027 | self.dispatch(node.test) |
paul@311 | 1028 | self.new_branch(node) |
paul@272 | 1029 | self.dispatch(node.body) |
paul@272 | 1030 | self.shelve_branch() |
paul@331 | 1031 | self.in_loop = in_loop |
paul@272 | 1032 | |
paul@275 | 1033 | # Maintain a branch for the else clause or the current retained usage |
paul@275 | 1034 | # where execution avoids the conditional clauses. |
paul@311 | 1035 | # NOTE: Consider merging here before the else clause. |
paul@275 | 1036 | |
paul@275 | 1037 | self.new_branch() |
paul@272 | 1038 | if node.else_ is not None: |
paul@272 | 1039 | self.dispatch(node.else_) |
paul@275 | 1040 | self.shelve_branch() |
paul@272 | 1041 | |
paul@272 | 1042 | self.merge_branches() |
paul@82 | 1043 | return None |
paul@4 | 1044 | |
paul@4 | 1045 | visitWith = NOP |
paul@4 | 1046 | |
paul@4 | 1047 | visitYield = NOP |
paul@4 | 1048 | |
paul@0 | 1049 | # vim: tabstop=4 expandtab shiftwidth=4 |