paul@638 | 1 | #!/usr/bin/env python |
paul@638 | 2 | |
paul@638 | 3 | """ |
paul@638 | 4 | Produce syspython code from an inspected program. |
paul@638 | 5 | |
paul@638 | 6 | Copyright (C) 2006, 2007, 2010, 2011, 2012, 2013 Paul Boddie <paul@boddie.org.uk> |
paul@638 | 7 | |
paul@638 | 8 | This program is free software; you can redistribute it and/or modify it under |
paul@638 | 9 | the terms of the GNU General Public License as published by the Free Software |
paul@638 | 10 | Foundation; either version 3 of the License, or (at your option) any later |
paul@638 | 11 | version. |
paul@638 | 12 | |
paul@638 | 13 | This program is distributed in the hope that it will be useful, but WITHOUT |
paul@638 | 14 | ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS |
paul@638 | 15 | FOR A PARTICULAR PURPOSE. See the GNU General Public License for more |
paul@638 | 16 | details. |
paul@638 | 17 | |
paul@638 | 18 | You should have received a copy of the GNU General Public License along with |
paul@638 | 19 | this program. If not, see <http://www.gnu.org/licenses/>. |
paul@638 | 20 | """ |
paul@638 | 21 | |
paul@638 | 22 | from micropython.common import * |
paul@638 | 23 | from micropython.data import * |
paul@638 | 24 | from micropython.errors import * |
paul@638 | 25 | from os.path import exists, extsep, join |
paul@638 | 26 | import compiler.ast |
paul@638 | 27 | import sys |
paul@638 | 28 | import os |
paul@638 | 29 | |
paul@638 | 30 | try: |
paul@638 | 31 | set |
paul@638 | 32 | except NameError: |
paul@638 | 33 | from sets import Set as set |
paul@638 | 34 | |
paul@638 | 35 | # Convenience definitions. |
paul@638 | 36 | |
paul@638 | 37 | special_name = compiler.ast.Name |
paul@645 | 38 | |
paul@645 | 39 | def quoted_name(s): |
paul@645 | 40 | return compiler.ast.Const(s) |
paul@638 | 41 | |
paul@664 | 42 | def quoted_ref(obj): |
paul@670 | 43 | return compiler.ast.CallFunc("static", [quoted_name(obj.full_name())]) |
paul@664 | 44 | |
paul@664 | 45 | def module_attribute(module_name, attrname): |
paul@670 | 46 | return special_name(module_name + "." + attrname) |
paul@664 | 47 | |
paul@676 | 48 | def constant_attribute(parent, attrname): |
paul@676 | 49 | return compiler.ast.CallFunc("static", [quoted_name(parent.full_name() + "." + attrname)]) |
paul@676 | 50 | |
paul@646 | 51 | # Special function names. |
paul@666 | 52 | # Some of the assignment operations cannot be supported unless attribute usage |
paul@666 | 53 | # observations are being made. |
paul@646 | 54 | |
paul@678 | 55 | assattr_functions = ("storeattrcontext", "storeattrcontext", |
paul@711 | 56 | "storeattr", "storeattrindexcontextcond", |
paul@711 | 57 | None) |
paul@678 | 58 | getattr_functions = ("loadattrcontext", "loadattrcontextcond", |
paul@711 | 59 | "loadattr", "loadattrindexcontextcond", |
paul@711 | 60 | "loadconstant") |
paul@646 | 61 | |
paul@638 | 62 | # Source code classes. |
paul@638 | 63 | |
paul@638 | 64 | class ConvertedSource(ASTVisitor): |
paul@638 | 65 | |
paul@638 | 66 | "A conversion of module source code to syspython." |
paul@638 | 67 | |
paul@638 | 68 | def __init__(self, module, program): |
paul@638 | 69 | self.visitor = self |
paul@638 | 70 | self.module = module |
paul@638 | 71 | self.program = program |
paul@645 | 72 | self.objtable = program.get_object_table() |
paul@638 | 73 | self.in_main = False |
paul@638 | 74 | self.units = [] |
paul@638 | 75 | |
paul@638 | 76 | def get_unit(self): |
paul@638 | 77 | return self.units[-1] |
paul@638 | 78 | |
paul@638 | 79 | def get_module(self): |
paul@638 | 80 | return self.units[0] |
paul@638 | 81 | |
paul@638 | 82 | def to_stream(self, stream): |
paul@638 | 83 | |
paul@638 | 84 | "Write the converted code to the given 'stream'." |
paul@638 | 85 | |
paul@638 | 86 | module = self.dispatch(self.module.astnode) |
paul@638 | 87 | stream.write(str(module)) |
paul@638 | 88 | |
paul@638 | 89 | def NOP(self, node): |
paul@638 | 90 | return node |
paul@638 | 91 | |
paul@638 | 92 | def visitModule(self, node): |
paul@638 | 93 | module = node.unit |
paul@638 | 94 | self.units.append(module) |
paul@638 | 95 | |
paul@645 | 96 | definitions = self.process_definitions(node) |
paul@638 | 97 | |
paul@675 | 98 | # keywords(name, ...) |
paul@675 | 99 | |
paul@675 | 100 | keywords = module.keyword_names and [ |
paul@675 | 101 | compiler.ast.CallFunc( |
paul@675 | 102 | special_name("keywords"), |
paul@675 | 103 | [special_name(name) for name in module.keyword_names] |
paul@675 | 104 | ) |
paul@675 | 105 | ] or [] |
paul@675 | 106 | |
paul@670 | 107 | # globalnames(name, ...) |
paul@638 | 108 | |
paul@638 | 109 | globalnames = module.module_attribute_names() and [ |
paul@638 | 110 | compiler.ast.CallFunc( |
paul@670 | 111 | special_name("globalnames"), |
paul@667 | 112 | [special_name(attr.name) for attr in module.attributes_as_list()] |
paul@638 | 113 | ) |
paul@638 | 114 | ] or [] |
paul@638 | 115 | |
paul@638 | 116 | # def __main__(): |
paul@638 | 117 | # ... |
paul@638 | 118 | |
paul@638 | 119 | self.in_main = True |
paul@638 | 120 | |
paul@638 | 121 | main = compiler.ast.Function( |
paul@638 | 122 | [], "__main__", [], [], 0, "Module initialisation.", |
paul@638 | 123 | compiler.ast.Stmt(globalnames + self.dispatch(node.node).nodes) |
paul@638 | 124 | ) |
paul@638 | 125 | |
paul@638 | 126 | self.in_main = False |
paul@638 | 127 | self.units.pop() |
paul@638 | 128 | |
paul@675 | 129 | return compiler.ast.Module(node.doc, compiler.ast.Stmt(keywords + definitions + [main])) |
paul@638 | 130 | |
paul@638 | 131 | # Statements. |
paul@638 | 132 | |
paul@638 | 133 | def visitAssert(self, node): |
paul@638 | 134 | return compiler.ast.Assert(self.dispatch(node.test), node.fail and self.dispatch(node.fail)) |
paul@638 | 135 | |
paul@638 | 136 | def visitAssign(self, node): |
paul@638 | 137 | expr = self.dispatch(node.expr) |
paul@734 | 138 | return compiler.ast.Stmt( |
paul@734 | 139 | [compiler.ast.Assign([compiler.ast.AssName("$expr", "OP_ASSIGN")], expr)] + |
paul@734 | 140 | [self.dispatch(n, compiler.ast.Name("$expr")) for n in node.nodes] |
paul@734 | 141 | ) |
paul@638 | 142 | |
paul@638 | 143 | def visitAugAssign(self, node): |
paul@638 | 144 | |
paul@638 | 145 | # lvalue = op(lvalue, expr) |
paul@670 | 146 | # -> fn(lvalue, op(lvalue, expr)) |
paul@638 | 147 | |
paul@638 | 148 | op_name = operator_functions[node.op] |
paul@638 | 149 | |
paul@638 | 150 | return self.dispatch(node.node, compiler.ast.CallFunc( |
paul@671 | 151 | special_name("apply"), |
paul@671 | 152 | [module_attribute("operator", op_name), |
paul@671 | 153 | self.dispatch(node.node), self.dispatch(node.expr)] |
paul@638 | 154 | )) |
paul@638 | 155 | |
paul@638 | 156 | visitBreak = NOP |
paul@638 | 157 | |
paul@638 | 158 | def visitClass(self, node): |
paul@638 | 159 | if not used_by_unit(node): |
paul@638 | 160 | return compiler.ast.Stmt([]) |
paul@638 | 161 | |
paul@638 | 162 | self.units.append(node.unit) |
paul@638 | 163 | try: |
paul@638 | 164 | # Incorporate class body code in the main function. |
paul@638 | 165 | |
paul@638 | 166 | if self.in_main: |
paul@638 | 167 | return self.dispatch(node.code) |
paul@638 | 168 | else: |
paul@638 | 169 | return self._visitClassDefinition(node) |
paul@638 | 170 | |
paul@638 | 171 | finally: |
paul@638 | 172 | self.units.pop() |
paul@638 | 173 | |
paul@638 | 174 | def _visitClassDefinition(self, node): |
paul@638 | 175 | cls = node.unit |
paul@638 | 176 | |
paul@670 | 177 | # instattrs(name, ...) |
paul@670 | 178 | # clsattrs(name, ...) |
paul@638 | 179 | |
paul@638 | 180 | instattrs = cls.instance_attribute_names() and [ |
paul@638 | 181 | compiler.ast.CallFunc( |
paul@670 | 182 | special_name("instattrs"), |
paul@667 | 183 | [special_name(attr.name) for attr in cls.instance_attributes_as_list()] |
paul@638 | 184 | ) |
paul@638 | 185 | ] or [] |
paul@638 | 186 | |
paul@638 | 187 | clsattrs = cls.class_attribute_names() and [ |
paul@638 | 188 | compiler.ast.CallFunc( |
paul@670 | 189 | special_name("clsattrs"), |
paul@667 | 190 | [special_name(attr.name) for attr in cls.attributes_as_list()] |
paul@638 | 191 | ) |
paul@638 | 192 | ] or [] |
paul@638 | 193 | |
paul@670 | 194 | # inherited(superclass, name, ...) |
paul@638 | 195 | # ... |
paul@638 | 196 | |
paul@638 | 197 | attrs_by_cls = {} |
paul@638 | 198 | for attrname, attr in cls.all_class_attributes().items(): |
paul@638 | 199 | supercls = attr.parent |
paul@638 | 200 | if supercls is cls: |
paul@638 | 201 | continue |
paul@638 | 202 | if not attrs_by_cls.has_key(supercls): |
paul@638 | 203 | attrs_by_cls[supercls] = [] |
paul@638 | 204 | attrs_by_cls[supercls].append(attrname) |
paul@638 | 205 | |
paul@638 | 206 | inherited = [] |
paul@638 | 207 | |
paul@638 | 208 | for supercls, attrnames in attrs_by_cls.items(): |
paul@638 | 209 | inherited.append( |
paul@638 | 210 | compiler.ast.CallFunc( |
paul@670 | 211 | special_name("inherited"), |
paul@645 | 212 | [quoted_ref(supercls)] + [special_name(name) for name in attrnames] |
paul@638 | 213 | )) |
paul@638 | 214 | |
paul@670 | 215 | # descendants(name, ...) |
paul@638 | 216 | |
paul@638 | 217 | descendants = cls.all_descendants() and [ |
paul@638 | 218 | compiler.ast.CallFunc( |
paul@670 | 219 | special_name("descendants"), |
paul@638 | 220 | [special_name(name) for name in cls.all_descendants().keys()] |
paul@638 | 221 | ) |
paul@638 | 222 | ] or [] |
paul@638 | 223 | |
paul@638 | 224 | # Process all the definitions defined inside the class. |
paul@638 | 225 | |
paul@645 | 226 | definitions = self.process_definitions(node) |
paul@638 | 227 | |
paul@638 | 228 | return compiler.ast.Class(node.name, [], node.doc, |
paul@638 | 229 | compiler.ast.Stmt(instattrs + clsattrs + inherited + descendants + definitions) |
paul@638 | 230 | ) |
paul@638 | 231 | |
paul@638 | 232 | visitContinue = NOP |
paul@638 | 233 | |
paul@638 | 234 | def visitDiscard(self, node): |
paul@638 | 235 | return compiler.ast.Discard(self.dispatch(node.expr)) |
paul@638 | 236 | |
paul@638 | 237 | def visitFor(self, node): |
paul@638 | 238 | |
paul@638 | 239 | """ |
paul@638 | 240 | Convert from... |
paul@638 | 241 | |
paul@638 | 242 | for <assign> in <list>: |
paul@638 | 243 | <body> |
paul@638 | 244 | [ else: |
paul@638 | 245 | <else_> ] |
paul@638 | 246 | |
paul@638 | 247 | ...to... |
paul@638 | 248 | |
paul@638 | 249 | _it = iter(<list>) |
paul@638 | 250 | while True: |
paul@638 | 251 | try: |
paul@638 | 252 | <assign> = _it.next() |
paul@638 | 253 | except StopIteration: |
paul@638 | 254 | [ <else_> ] |
paul@638 | 255 | break |
paul@638 | 256 | else: |
paul@638 | 257 | <body> |
paul@638 | 258 | """ |
paul@638 | 259 | |
paul@638 | 260 | unit = self.get_unit() |
paul@638 | 261 | temp = quoted_name(unit.temp_usage) |
paul@638 | 262 | unit.temp_usage += 1 |
paul@638 | 263 | |
paul@638 | 264 | else_nodes = node.else_ and self.dispatch(node.else_).nodes or [] |
paul@638 | 265 | |
paul@638 | 266 | return compiler.ast.Stmt([ |
paul@670 | 267 | # storetemp(_it, __builtins__.iter(<list>)) |
paul@670 | 268 | compiler.ast.CallFunc(special_name("storetemp"), [ |
paul@638 | 269 | temp, |
paul@638 | 270 | compiler.ast.CallFunc( |
paul@671 | 271 | special_name("apply"), |
paul@671 | 272 | [module_attribute("__builtins__", "iter"), self.dispatch(node.list)] |
paul@638 | 273 | ) |
paul@638 | 274 | ]), |
paul@638 | 275 | # while True: ... |
paul@638 | 276 | compiler.ast.While( |
paul@638 | 277 | special_name("True"), |
paul@638 | 278 | # try: ... |
paul@638 | 279 | compiler.ast.TryExcept( |
paul@638 | 280 | compiler.ast.Stmt([ |
paul@638 | 281 | # <assign> = ... |
paul@638 | 282 | self.dispatch(node.assign, |
paul@638 | 283 | # _it.next() |
paul@638 | 284 | compiler.ast.CallFunc( |
paul@670 | 285 | compiler.ast.CallFunc(special_name("loadattrindex"), [ |
paul@670 | 286 | compiler.ast.CallFunc(special_name("loadtemp"), [temp]), |
paul@638 | 287 | special_name("next") |
paul@638 | 288 | ]), |
paul@638 | 289 | [] |
paul@638 | 290 | ) |
paul@638 | 291 | ) |
paul@638 | 292 | ]), |
paul@638 | 293 | # except StopIteration: ... |
paul@638 | 294 | [(special_name("StopIteration"), None, compiler.ast.Stmt(else_nodes + [compiler.ast.Break()]))], |
paul@638 | 295 | # else: ... |
paul@638 | 296 | self.dispatch(node.body) |
paul@638 | 297 | ), |
paul@638 | 298 | None |
paul@638 | 299 | ) |
paul@638 | 300 | ]) |
paul@638 | 301 | |
paul@638 | 302 | def visitFrom(self, node): |
paul@638 | 303 | |
paul@638 | 304 | # Generate __main__ function calls for each step in the imported module |
paul@638 | 305 | # hierarchy. |
paul@638 | 306 | |
paul@638 | 307 | statements = [] |
paul@638 | 308 | |
paul@638 | 309 | for modname in self.module.get_module_paths(node.modname): |
paul@638 | 310 | statements.append( |
paul@638 | 311 | compiler.ast.CallFunc(special_name("%s.__main__" % modname ), []) |
paul@638 | 312 | ) |
paul@638 | 313 | |
paul@638 | 314 | for name, alias in node.names: |
paul@638 | 315 | statements.append( |
paul@670 | 316 | compiler.ast.CallFunc( |
paul@670 | 317 | special_name("storelocal"), |
paul@670 | 318 | [special_name(alias or name), |
paul@638 | 319 | compiler.ast.CallFunc( |
paul@670 | 320 | special_name("loadattr"), |
paul@638 | 321 | [special_name(node.modname), special_name(name)] |
paul@638 | 322 | ) |
paul@670 | 323 | ]) |
paul@638 | 324 | ) |
paul@638 | 325 | |
paul@638 | 326 | return compiler.ast.Stmt(statements) |
paul@638 | 327 | |
paul@638 | 328 | def visitFunction(self, node): |
paul@638 | 329 | if not used_by_unit(node): |
paul@638 | 330 | return compiler.ast.Stmt([]) |
paul@638 | 331 | |
paul@638 | 332 | self.units.append(node.unit) |
paul@638 | 333 | |
paul@638 | 334 | try: |
paul@665 | 335 | if self.in_main: |
paul@665 | 336 | |
paul@665 | 337 | # Generate rebindings of functions. |
paul@638 | 338 | |
paul@665 | 339 | fn = node.unit |
paul@665 | 340 | if fn.name == fn.original_name: |
paul@665 | 341 | return compiler.ast.Stmt([]) |
paul@665 | 342 | else: |
paul@665 | 343 | return compiler.ast.CallFunc( |
paul@670 | 344 | special_name("storeattr"), |
paul@665 | 345 | [quoted_ref(fn.parent), special_name(fn.original_name), |
paul@665 | 346 | quoted_ref(fn)] |
paul@665 | 347 | ) |
paul@638 | 348 | else: |
paul@638 | 349 | return self._visitFunctionDefinition(node) |
paul@638 | 350 | finally: |
paul@638 | 351 | self.units.pop() |
paul@638 | 352 | |
paul@638 | 353 | def _visitFunctionDefinition(self, node): |
paul@638 | 354 | fn = node.unit |
paul@638 | 355 | |
paul@670 | 356 | # localnames(name, ...) |
paul@670 | 357 | # globalnames(name, ...) |
paul@638 | 358 | |
paul@645 | 359 | localnames = fn.all_locals() and [ |
paul@638 | 360 | compiler.ast.CallFunc( |
paul@670 | 361 | special_name("localnames"), |
paul@645 | 362 | [special_name(name) for name in fn.all_locals().keys()] |
paul@638 | 363 | ) |
paul@638 | 364 | ] or [] |
paul@638 | 365 | |
paul@638 | 366 | globalnames = fn.globals and [ |
paul@638 | 367 | compiler.ast.CallFunc( |
paul@670 | 368 | special_name("globalnames"), |
paul@638 | 369 | [special_name(name) for name in fn.globals] |
paul@638 | 370 | ) |
paul@638 | 371 | ] or [] |
paul@638 | 372 | |
paul@638 | 373 | defaults = [self.dispatch(n) for n in node.defaults] |
paul@638 | 374 | |
paul@645 | 375 | # NOTE: Should generate guards for attribute usage operations. |
paul@645 | 376 | |
paul@638 | 377 | code = self.dispatch(node.code) |
paul@638 | 378 | |
paul@638 | 379 | return compiler.ast.Function(node.decorators, node.name, node.argnames, defaults, node.flags, node.doc, |
paul@638 | 380 | compiler.ast.Stmt(localnames + globalnames + code.nodes)) |
paul@638 | 381 | |
paul@638 | 382 | visitGlobal = NOP |
paul@638 | 383 | |
paul@638 | 384 | def visitIf(self, node): |
paul@638 | 385 | return compiler.ast.If( |
paul@638 | 386 | [(self.dispatch(compare), self.dispatch(stmt)) for (compare, stmt) in node.tests], |
paul@638 | 387 | node.else_ and self.dispatch(node.else_) |
paul@638 | 388 | ) |
paul@638 | 389 | |
paul@638 | 390 | def visitImport(self, node): |
paul@638 | 391 | |
paul@638 | 392 | # Generate __main__ function calls for each step in the imported module |
paul@638 | 393 | # hierarchy. |
paul@638 | 394 | |
paul@638 | 395 | statements = [] |
paul@638 | 396 | |
paul@638 | 397 | for name, alias in node.names: |
paul@638 | 398 | for modname in self.module.get_module_paths(name): |
paul@638 | 399 | statements.append( |
paul@638 | 400 | compiler.ast.CallFunc(compiler.ast.Getattr(modname, "__main__"), []) |
paul@638 | 401 | ) |
paul@638 | 402 | |
paul@638 | 403 | statements.append( |
paul@670 | 404 | compiler.ast.CallFunc( |
paul@670 | 405 | special_name("storelocal"), |
paul@670 | 406 | [special_name(alias or name.split(".")[0]), |
paul@638 | 407 | compiler.ast.CallFunc( |
paul@670 | 408 | special_name("static"), |
paul@638 | 409 | [special_name(name)] |
paul@638 | 410 | ) |
paul@670 | 411 | ]) |
paul@638 | 412 | ) |
paul@638 | 413 | |
paul@638 | 414 | return compiler.ast.Stmt(statements) |
paul@638 | 415 | |
paul@645 | 416 | def visitPass(self, node): |
paul@645 | 417 | if not isinstance(self.get_unit(), Class): |
paul@645 | 418 | return compiler.ast.Pass() |
paul@645 | 419 | else: |
paul@645 | 420 | return compiler.ast.Stmt([]) |
paul@638 | 421 | |
paul@638 | 422 | def visitPrint(self, node): |
paul@671 | 423 | return compiler.ast.CallFunc( |
paul@671 | 424 | special_name("apply"), |
paul@671 | 425 | [module_attribute("__builtins__", "_print"), |
paul@671 | 426 | node.dest and self.dispatch(node.dest) or special_name("None")] |
paul@671 | 427 | + [self.dispatch(n) for n in node.nodes] |
paul@638 | 428 | ) |
paul@638 | 429 | |
paul@638 | 430 | def visitPrintnl(self, node): |
paul@671 | 431 | return compiler.ast.CallFunc( |
paul@671 | 432 | special_name("apply"), |
paul@671 | 433 | [module_attribute("__builtins__", "_println"), |
paul@671 | 434 | node.dest and self.dispatch(node.dest) or special_name("None")] |
paul@671 | 435 | + [self.dispatch(n) for n in node.nodes] |
paul@638 | 436 | ) |
paul@638 | 437 | |
paul@638 | 438 | def visitRaise(self, node): |
paul@638 | 439 | return compiler.ast.Raise( |
paul@638 | 440 | node.expr1 and self.dispatch(node.expr1), |
paul@638 | 441 | node.expr2 and self.dispatch(node.expr2), |
paul@638 | 442 | node.expr3 and self.dispatch(node.expr3) |
paul@638 | 443 | ) |
paul@638 | 444 | |
paul@638 | 445 | def visitReturn(self, node): |
paul@638 | 446 | return compiler.ast.Return(self.dispatch(node.value)) |
paul@638 | 447 | |
paul@638 | 448 | def visitStmt(self, node): |
paul@638 | 449 | return compiler.ast.Stmt([self.dispatch(n) for n in node.nodes]) |
paul@638 | 450 | |
paul@638 | 451 | def visitTryExcept(self, node): |
paul@638 | 452 | # NOTE: Need to dispatch to the assignment with the exception. |
paul@638 | 453 | return compiler.ast.TryExcept( |
paul@638 | 454 | self.dispatch(node.body), |
paul@638 | 455 | [(spec and self.dispatch(spec), assign and self.dispatch(assign), self.dispatch(statement)) |
paul@638 | 456 | for spec, assign, statement in node.handlers], |
paul@638 | 457 | node.else_ and self.dispatch(node.else_) |
paul@638 | 458 | ) |
paul@638 | 459 | |
paul@638 | 460 | def visitTryFinally(self, node): |
paul@638 | 461 | return compiler.ast.TryFinally( |
paul@638 | 462 | self.dispatch(node.body), |
paul@638 | 463 | self.dispatch(node.final) |
paul@638 | 464 | ) |
paul@638 | 465 | |
paul@638 | 466 | def visitWhile(self, node): |
paul@638 | 467 | return compiler.ast.While( |
paul@638 | 468 | self.dispatch(node.test), |
paul@638 | 469 | self.dispatch(node.body), |
paul@638 | 470 | node.else_ and self.dispatch(node.else_) |
paul@638 | 471 | ) |
paul@638 | 472 | |
paul@638 | 473 | def visitYield(self, node): |
paul@638 | 474 | return compiler.ast.Yield(self.dispatch(node.value)) |
paul@638 | 475 | |
paul@638 | 476 | # Expression-related helper methods. |
paul@638 | 477 | |
paul@638 | 478 | def _visitBitBinary(self, node): |
paul@638 | 479 | op_name = operator_functions[node.__class__.__name__] |
paul@638 | 480 | last = self.dispatch(node.nodes[0]) |
paul@638 | 481 | |
paul@638 | 482 | for n in node.nodes[1:]: |
paul@638 | 483 | last = compiler.ast.CallFunc( |
paul@671 | 484 | special_name("apply"), |
paul@671 | 485 | [module_attribute("operator", op_name), last, self.dispatch(n)] |
paul@638 | 486 | ) |
paul@638 | 487 | |
paul@638 | 488 | return last |
paul@638 | 489 | |
paul@638 | 490 | def _visitBinary(self, node): |
paul@638 | 491 | op_name = operator_functions[node.__class__.__name__] |
paul@638 | 492 | |
paul@638 | 493 | return compiler.ast.CallFunc( |
paul@671 | 494 | special_name("apply"), |
paul@671 | 495 | [module_attribute("operator", op_name), |
paul@671 | 496 | self.dispatch(node.left), self.dispatch(node.right)] |
paul@638 | 497 | ) |
paul@638 | 498 | |
paul@638 | 499 | def _visitUnary(self, node): |
paul@638 | 500 | op_name = operator_functions[node.__class__.__name__] |
paul@638 | 501 | |
paul@638 | 502 | return compiler.ast.CallFunc( |
paul@671 | 503 | special_name("apply"), |
paul@671 | 504 | [module_attribute("operator", op_name), self.dispatch(node.expr)] |
paul@638 | 505 | ) |
paul@638 | 506 | |
paul@645 | 507 | def _generateValue(self, value): |
paul@645 | 508 | |
paul@645 | 509 | # Literal constants. |
paul@645 | 510 | |
paul@645 | 511 | if isinstance(value, Const): |
paul@645 | 512 | return compiler.ast.Const(value.get_value()) |
paul@645 | 513 | |
paul@645 | 514 | # Other constant structures. |
paul@645 | 515 | |
paul@645 | 516 | if isinstance(value, Constant): |
paul@645 | 517 | return quoted_ref(value) |
paul@645 | 518 | |
paul@645 | 519 | return None |
paul@645 | 520 | |
paul@646 | 521 | def _visitAttr(self, node, expr=None): |
paul@646 | 522 | unit = self.get_unit() |
paul@646 | 523 | |
paul@646 | 524 | # Choose the appropriate special functions. |
paul@646 | 525 | |
paul@711 | 526 | (opattrcontext, opattrcontextcond, opattr, opattrindexcontextcond, opconstant) = \ |
paul@678 | 527 | expr and assattr_functions or getattr_functions |
paul@646 | 528 | |
paul@646 | 529 | accessor = self.dispatch(node.expr) |
paul@646 | 530 | |
paul@646 | 531 | # Generate already-deduced accesses. |
paul@646 | 532 | |
paul@646 | 533 | if node._access_type == "constant": |
paul@711 | 534 | value = self._generateValue(node._value_deduced) |
paul@711 | 535 | |
paul@711 | 536 | # Where constant attributes are accessed via instances, a special |
paul@711 | 537 | # operation setting the context is needed. |
paul@711 | 538 | |
paul@711 | 539 | if node._set_context == "set": |
paul@733 | 540 | return compiler.ast.CallFunc(special_name(opconstant), [accessor]) |
paul@711 | 541 | else: |
paul@711 | 542 | return value |
paul@646 | 543 | |
paul@646 | 544 | # Generate accesses via static objects and instances. |
paul@646 | 545 | |
paul@646 | 546 | if node._attr_deduced: |
paul@676 | 547 | |
paul@676 | 548 | # Static attributes may cause context replacement. |
paul@676 | 549 | |
paul@676 | 550 | if node._access_type == "static": |
paul@676 | 551 | if node._set_context == "set": |
paul@678 | 552 | op = opattrcontext |
paul@676 | 553 | elif node._set_context == "cond": |
paul@678 | 554 | op = opattrcontextcond |
paul@676 | 555 | else: |
paul@678 | 556 | op = opattr |
paul@676 | 557 | |
paul@676 | 558 | parent = self._generateValue(node._attr_deduced.parent) |
paul@676 | 559 | |
paul@676 | 560 | # Non-static attributes. |
paul@676 | 561 | |
paul@646 | 562 | else: |
paul@646 | 563 | op = opattr |
paul@676 | 564 | parent = None |
paul@646 | 565 | |
paul@646 | 566 | # Handle unsupported operations. |
paul@646 | 567 | |
paul@646 | 568 | if not op: |
paul@646 | 569 | raise TranslateError("Storing of class attribute %r via self not permitted." % node.attrname) |
paul@646 | 570 | |
paul@646 | 571 | # Define the arguments: accessor, attribute name and optional value. |
paul@646 | 572 | |
paul@646 | 573 | args = [ |
paul@676 | 574 | parent or accessor, |
paul@646 | 575 | special_name(node.attrname) |
paul@646 | 576 | ] |
paul@646 | 577 | |
paul@646 | 578 | if expr: |
paul@646 | 579 | args.append(expr) |
paul@646 | 580 | |
paul@670 | 581 | # Append any context to be set. |
paul@670 | 582 | |
paul@670 | 583 | if node._set_context and args[0] is not accessor: |
paul@670 | 584 | args.append(accessor) |
paul@670 | 585 | |
paul@646 | 586 | return compiler.ast.CallFunc(special_name(op), args) |
paul@646 | 587 | |
paul@646 | 588 | # Positioned accesses are normal accesses via instances. |
paul@646 | 589 | |
paul@646 | 590 | if node._access_type == "positioned": |
paul@646 | 591 | args = [accessor, special_name(node.attrname)] |
paul@646 | 592 | if expr: |
paul@646 | 593 | args.append(expr) |
paul@646 | 594 | return compiler.ast.CallFunc(special_name(opattr), args) |
paul@646 | 595 | |
paul@646 | 596 | # With no usable deductions, generate a table-based access. |
paul@646 | 597 | |
paul@646 | 598 | args = [accessor, special_name(node.attrname)] |
paul@646 | 599 | if expr: |
paul@646 | 600 | args.append(expr) |
paul@646 | 601 | access = compiler.ast.CallFunc(special_name(opattrindexcontextcond), args) |
paul@646 | 602 | |
paul@646 | 603 | # class.__class__ => __builtins__.type |
paul@646 | 604 | |
paul@646 | 605 | if node.attrname == "__class__": |
paul@646 | 606 | |
paul@670 | 607 | # storetemp(n, <accessor>) |
paul@670 | 608 | # isclass(n) and __builtins__.type or <access> |
paul@646 | 609 | |
paul@646 | 610 | temp = quoted_name(unit.temp_usage) |
paul@646 | 611 | unit.temp_usage += 1 |
paul@646 | 612 | |
paul@646 | 613 | return compiler.ast.Stmt([ |
paul@670 | 614 | compiler.ast.CallFunc(special_name("storetemp"), [temp, access]), |
paul@646 | 615 | compiler.ast.Or([ |
paul@646 | 616 | compiler.ast.And([ |
paul@646 | 617 | compiler.ast.CallFunc( |
paul@670 | 618 | special_name("isclass"), |
paul@670 | 619 | [compiler.ast.CallFunc(special_name("loadtemp"), [temp])] |
paul@646 | 620 | ), |
paul@664 | 621 | module_attribute("__builtins__", "type") |
paul@646 | 622 | ]), |
paul@646 | 623 | access |
paul@646 | 624 | ]) |
paul@646 | 625 | ]) |
paul@646 | 626 | |
paul@646 | 627 | # General accesses. |
paul@646 | 628 | |
paul@646 | 629 | else: |
paul@646 | 630 | return access |
paul@646 | 631 | |
paul@638 | 632 | # Expressions. |
paul@638 | 633 | |
paul@638 | 634 | def visitAdd(self, node): |
paul@638 | 635 | return self._visitBinary(node) |
paul@638 | 636 | |
paul@638 | 637 | def visitAnd(self, node): |
paul@638 | 638 | return compiler.ast.And([self.dispatch(n) for n in node.nodes]) |
paul@638 | 639 | |
paul@663 | 640 | def visitAssAttr(self, node, expr=None): |
paul@663 | 641 | |
paul@663 | 642 | # Handle deletion. |
paul@663 | 643 | |
paul@663 | 644 | if compiler.ast.is_deletion(node): |
paul@663 | 645 | return compiler.ast.Stmt([]) |
paul@663 | 646 | |
paul@646 | 647 | return self._visitAttr(node, expr) |
paul@638 | 648 | |
paul@663 | 649 | def visitAssList(self, node, expr=None): |
paul@663 | 650 | |
paul@663 | 651 | # Handle deletion. |
paul@663 | 652 | |
paul@663 | 653 | if compiler.ast.is_deletion(compiler.ast.flatten_assignment(node)): |
paul@663 | 654 | return compiler.ast.Stmt([]) |
paul@663 | 655 | |
paul@638 | 656 | return compiler.ast.Stmt([ |
paul@638 | 657 | self.dispatch(n, compiler.ast.CallFunc( |
paul@671 | 658 | special_name("apply"), |
paul@671 | 659 | [module_attribute("operator", "getitem"), expr, i] |
paul@638 | 660 | )) |
paul@638 | 661 | for (i, n) in enumerate(node.nodes) |
paul@638 | 662 | ]) |
paul@638 | 663 | |
paul@663 | 664 | def visitAssName(self, node, expr=None): |
paul@663 | 665 | |
paul@663 | 666 | # Handle deletion. |
paul@663 | 667 | |
paul@663 | 668 | if compiler.ast.is_deletion(node): |
paul@663 | 669 | return compiler.ast.Stmt([]) |
paul@663 | 670 | |
paul@638 | 671 | unit = self.get_unit() |
paul@638 | 672 | |
paul@638 | 673 | # Generate appropriate name access operation. |
paul@645 | 674 | # NOTE: Should generate guards for attribute usage operations. |
paul@638 | 675 | |
paul@638 | 676 | scope = getattr(node, "_scope", None) |
paul@638 | 677 | if not scope: |
paul@638 | 678 | attr, scope, from_name = self.get_unit()._get_with_scope(node.name) |
paul@638 | 679 | |
paul@638 | 680 | if scope == "constant": |
paul@638 | 681 | return node |
paul@638 | 682 | elif scope == "local": |
paul@638 | 683 | |
paul@638 | 684 | # Function locals are stored using a function. |
paul@638 | 685 | |
paul@638 | 686 | if isinstance(unit, Function): |
paul@638 | 687 | return compiler.ast.CallFunc( |
paul@670 | 688 | special_name("storelocal"), |
paul@638 | 689 | [special_name(node.name), expr] |
paul@638 | 690 | ) |
paul@638 | 691 | |
paul@638 | 692 | # Class locals are class attribute references. |
paul@638 | 693 | |
paul@638 | 694 | elif isinstance(unit, Class): |
paul@638 | 695 | return compiler.ast.CallFunc( |
paul@670 | 696 | special_name("storeattrcontext"), |
paul@645 | 697 | [quoted_ref(unit), special_name(node.name), expr] |
paul@638 | 698 | ) |
paul@638 | 699 | |
paul@638 | 700 | # Module locals are module attribute references. |
paul@638 | 701 | |
paul@638 | 702 | elif isinstance(unit, Module): |
paul@638 | 703 | return compiler.ast.CallFunc( |
paul@670 | 704 | special_name("storeattr"), |
paul@645 | 705 | [quoted_ref(unit), special_name(node.name), expr] |
paul@638 | 706 | ) |
paul@638 | 707 | else: |
paul@638 | 708 | raise TranslateError("Program unit has no local %r." % name) |
paul@638 | 709 | |
paul@638 | 710 | elif scope == "global": |
paul@638 | 711 | |
paul@638 | 712 | # Globals are references to module attributes. |
paul@638 | 713 | |
paul@638 | 714 | return compiler.ast.CallFunc( |
paul@670 | 715 | special_name("storeattr"), |
paul@645 | 716 | [quoted_ref(self.get_module()), special_name(node.name), expr] |
paul@638 | 717 | ) |
paul@638 | 718 | |
paul@638 | 719 | elif scope == "builtin": |
paul@638 | 720 | |
paul@638 | 721 | # Builtins are accessed via the __builtins__ module. |
paul@638 | 722 | |
paul@638 | 723 | return compiler.ast.CallFunc( |
paul@670 | 724 | special_name("storeattr"), |
paul@638 | 725 | [special_name("__builtins__"), special_name(node.name), expr] |
paul@638 | 726 | ) |
paul@638 | 727 | |
paul@638 | 728 | else: |
paul@638 | 729 | # NOTE: This may happen because a class attribute is optimised away. |
paul@638 | 730 | return compiler.ast.CallFunc( |
paul@670 | 731 | special_name("storeunknown"), |
paul@638 | 732 | [special_name(node.name), expr] |
paul@638 | 733 | ) |
paul@638 | 734 | |
paul@638 | 735 | visitAssTuple = visitAssList |
paul@638 | 736 | |
paul@638 | 737 | def visitBitand(self, node): |
paul@638 | 738 | self._visitBitBinary(node) |
paul@638 | 739 | |
paul@638 | 740 | def visitBitor(self, node): |
paul@638 | 741 | self._visitBitBinary(node) |
paul@638 | 742 | |
paul@638 | 743 | def visitBitxor(self, node): |
paul@638 | 744 | self._visitBitBinary(node) |
paul@638 | 745 | |
paul@638 | 746 | def visitCallFunc(self, node): |
paul@679 | 747 | |
paul@679 | 748 | # Determine whether the invocation target is known. |
paul@679 | 749 | |
paul@679 | 750 | n = node.node |
paul@679 | 751 | attr = n._attr |
paul@679 | 752 | |
paul@679 | 753 | args = [self.dispatch(node.node)] + [self.dispatch(arg) for arg in node.args] |
paul@679 | 754 | |
paul@679 | 755 | if not attr or isinstance(attr, Instance): |
paul@679 | 756 | op = "apply" |
paul@679 | 757 | |
paul@679 | 758 | # Invocations with some knowledge available. |
paul@679 | 759 | |
paul@679 | 760 | else: |
paul@679 | 761 | context = attr.get_context() |
paul@679 | 762 | value = attr.get_value() |
paul@679 | 763 | |
paul@679 | 764 | # Class invocations. |
paul@679 | 765 | |
paul@679 | 766 | if isinstance(value, Class): |
paul@679 | 767 | op = "applyclass" |
paul@679 | 768 | if value: |
paul@679 | 769 | args[0] = quoted_ref(value) |
paul@679 | 770 | else: |
paul@679 | 771 | |
paul@679 | 772 | # Function invocations. |
paul@679 | 773 | |
paul@679 | 774 | if context is ReplaceableContext: |
paul@679 | 775 | op = "applyfunction" |
paul@679 | 776 | |
paul@679 | 777 | # Method invocations via classes. |
paul@679 | 778 | |
paul@679 | 779 | elif isinstance(context, Class) and value: |
paul@679 | 780 | op = "applystaticmethod" |
paul@679 | 781 | args.insert(0, quoted_ref(context)) |
paul@679 | 782 | args[1] = quoted_ref(value) |
paul@679 | 783 | |
paul@679 | 784 | # Plain method invocations. |
paul@679 | 785 | |
paul@679 | 786 | elif context: |
paul@679 | 787 | op = "applymethod" |
paul@679 | 788 | |
paul@679 | 789 | # Unknown invocations. |
paul@679 | 790 | |
paul@679 | 791 | else: |
paul@679 | 792 | op = "apply" |
paul@679 | 793 | |
paul@638 | 794 | return compiler.ast.CallFunc( |
paul@679 | 795 | special_name(op), |
paul@679 | 796 | args, |
paul@663 | 797 | node.star_args and self.dispatch(node.star_args), |
paul@663 | 798 | node.dstar_args and self.dispatch(node.dstar_args) |
paul@638 | 799 | ) |
paul@638 | 800 | |
paul@638 | 801 | def visitCompare(self, node): |
paul@638 | 802 | nodes = [] |
paul@638 | 803 | left = node.expr |
paul@638 | 804 | for op_name, right in node.ops: |
paul@670 | 805 | if op_name == "is": |
paul@670 | 806 | nodes.append( |
paul@670 | 807 | compiler.ast.CallFunc( |
paul@670 | 808 | special_name("__is__"), |
paul@670 | 809 | [self.dispatch(left), self.dispatch(right)] |
paul@670 | 810 | ) |
paul@638 | 811 | ) |
paul@670 | 812 | elif op_name == "is not": |
paul@670 | 813 | nodes.append( |
paul@670 | 814 | compiler.ast.CallFunc( |
paul@670 | 815 | special_name("__is_not__"), |
paul@670 | 816 | [self.dispatch(left), self.dispatch(right)] |
paul@670 | 817 | ) |
paul@670 | 818 | ) |
paul@670 | 819 | else: |
paul@670 | 820 | nodes.append( |
paul@670 | 821 | compiler.ast.CallFunc( |
paul@671 | 822 | special_name("apply"), |
paul@671 | 823 | [module_attribute("operator", operator_functions.get(op_name)), |
paul@671 | 824 | self.dispatch(left), self.dispatch(right)] |
paul@670 | 825 | ) |
paul@670 | 826 | ) |
paul@638 | 827 | left = right |
paul@638 | 828 | return compiler.ast.And(nodes) |
paul@638 | 829 | |
paul@638 | 830 | visitConst = NOP |
paul@638 | 831 | |
paul@638 | 832 | def visitDict(self, node): |
paul@638 | 833 | return compiler.ast.Dict([(self.dispatch(key), self.dispatch(value)) for (key, value) in node.items]) |
paul@638 | 834 | |
paul@638 | 835 | def visitDiv(self, node): |
paul@638 | 836 | return self._visitBinary(node) |
paul@638 | 837 | |
paul@638 | 838 | def visitFloorDiv(self, node): |
paul@638 | 839 | return self._visitBinary(node) |
paul@638 | 840 | |
paul@638 | 841 | def visitGetattr(self, node, expr=None): |
paul@646 | 842 | return self._visitAttr(node, expr) |
paul@645 | 843 | |
paul@638 | 844 | def visitGenExpr(self, node): |
paul@638 | 845 | return compiler.ast.GenExpr(self.dispatch(node.code)) |
paul@638 | 846 | |
paul@638 | 847 | def visitGenExprFor(self, node): |
paul@663 | 848 | expr = self.dispatch(node.iter) |
paul@638 | 849 | return compiler.ast.GenExprFor( |
paul@663 | 850 | self.dispatch(node.assign, expr), # NOTE: Needs to dispatch to AssName/AssTuple/AssList with an expression. |
paul@663 | 851 | expr, |
paul@638 | 852 | [self.dispatch(n) for n in node.ifs] |
paul@638 | 853 | ) |
paul@638 | 854 | |
paul@638 | 855 | def visitGenExprIf(self, node): |
paul@638 | 856 | return compiler.ast.GenExprIf(self.dispatch(node.test)) |
paul@638 | 857 | |
paul@638 | 858 | def visitGenExprInner(self, node): |
paul@638 | 859 | return compiler.ast.GenExprInner( |
paul@638 | 860 | self.dispatch(node.expr), |
paul@638 | 861 | [self.dispatch(n) for n in node.quals] |
paul@638 | 862 | ) |
paul@638 | 863 | |
paul@638 | 864 | def visitIfExp(self, node): |
paul@638 | 865 | return compiler.ast.IfExp( |
paul@638 | 866 | self.dispatch(node.then), |
paul@638 | 867 | self.dispatch(node.test), |
paul@638 | 868 | self.dispatch(node.else_) |
paul@638 | 869 | ) |
paul@638 | 870 | |
paul@638 | 871 | def visitInvert(self, node): |
paul@638 | 872 | return self._visitUnary(node) |
paul@638 | 873 | |
paul@638 | 874 | def visitKeyword(self, node): |
paul@638 | 875 | return compiler.ast.Keyword( |
paul@638 | 876 | node.name, |
paul@638 | 877 | self.dispatch(node.expr) |
paul@638 | 878 | ) |
paul@638 | 879 | |
paul@638 | 880 | def visitLambda(self, node): |
paul@638 | 881 | self.units.append(node.unit) |
paul@638 | 882 | |
paul@638 | 883 | try: |
paul@638 | 884 | return compiler.ast.Lambda( |
paul@638 | 885 | node.argnames, |
paul@638 | 886 | [self.dispatch(n) for n in node.defaults], |
paul@638 | 887 | node.flags, |
paul@638 | 888 | self.dispatch(node.code) |
paul@638 | 889 | ) |
paul@638 | 890 | finally: |
paul@638 | 891 | self.units.pop() |
paul@638 | 892 | |
paul@638 | 893 | def visitLeftShift(self, node): |
paul@638 | 894 | return self._visitBinary(node) |
paul@638 | 895 | |
paul@638 | 896 | def visitList(self, node, expr=None): |
paul@638 | 897 | if expr: |
paul@638 | 898 | return self.visitAssList(node, expr) |
paul@638 | 899 | return compiler.ast.List([self.dispatch(n) for n in node.nodes]) |
paul@638 | 900 | |
paul@638 | 901 | def visitListComp(self, node): |
paul@663 | 902 | |
paul@663 | 903 | """ |
paul@663 | 904 | Convert from... |
paul@663 | 905 | |
paul@663 | 906 | [<expr> for <assign> in <list> [ for <assign> in <list> ]... [ if <test> ]... ] |
paul@663 | 907 | |
paul@663 | 908 | ...to... |
paul@663 | 909 | |
paul@663 | 910 | _out = [] |
paul@663 | 911 | ... |
paul@663 | 912 | """ |
paul@663 | 913 | |
paul@663 | 914 | unit = self.get_unit() |
paul@663 | 915 | temp = quoted_name(unit.temp_usage) |
paul@663 | 916 | unit.temp_usage += 1 |
paul@663 | 917 | |
paul@663 | 918 | return compiler.ast.Stmt([ |
paul@670 | 919 | # storetemp(_out, __builtins__.list()) |
paul@670 | 920 | compiler.ast.CallFunc(special_name("storetemp"), [ |
paul@663 | 921 | temp, |
paul@663 | 922 | compiler.ast.CallFunc( |
paul@671 | 923 | special_name("apply"), |
paul@671 | 924 | [module_attribute("__builtins__", "list")] |
paul@663 | 925 | ) |
paul@663 | 926 | ]), |
paul@663 | 927 | # ... |
paul@663 | 928 | self.dispatch(node.quals[0], temp, node.expr, node.quals[1:]) |
paul@663 | 929 | ]) |
paul@663 | 930 | |
paul@663 | 931 | def visitListCompFor(self, node, out_temp, expr, quals): |
paul@663 | 932 | |
paul@663 | 933 | """ |
paul@663 | 934 | Convert from... |
paul@663 | 935 | |
paul@663 | 936 | [<expr> for <assign> in <list> ...] |
paul@663 | 937 | |
paul@663 | 938 | ...to... |
paul@663 | 939 | |
paul@663 | 940 | _it = iter(<list>) |
paul@663 | 941 | while True: |
paul@663 | 942 | try: |
paul@663 | 943 | <assign> = _it.next() |
paul@663 | 944 | except StopIteration: |
paul@663 | 945 | break |
paul@663 | 946 | else: |
paul@663 | 947 | ... |
paul@663 | 948 | _out.append(<expr>) |
paul@663 | 949 | """ |
paul@663 | 950 | |
paul@663 | 951 | unit = self.get_unit() |
paul@663 | 952 | temp = quoted_name(unit.temp_usage) |
paul@663 | 953 | unit.temp_usage += 1 |
paul@663 | 954 | |
paul@663 | 955 | # Either generate more "for" or "if" constructs. |
paul@663 | 956 | |
paul@663 | 957 | if node.ifs or quals: |
paul@663 | 958 | nodes = node.ifs + quals |
paul@663 | 959 | body = self.dispatch(nodes[0], out_temp, expr, nodes[1:]) |
paul@663 | 960 | |
paul@663 | 961 | # Or generate the append statement. |
paul@663 | 962 | |
paul@663 | 963 | else: |
paul@663 | 964 | body = self._visitListCompExpr(out_temp, expr) |
paul@663 | 965 | |
paul@663 | 966 | # Wrap the above body in the loop construct. |
paul@663 | 967 | |
paul@663 | 968 | return compiler.ast.Stmt([ |
paul@670 | 969 | # storetemp(_it, __builtins__.iter(<list>)) |
paul@670 | 970 | compiler.ast.CallFunc(special_name("storetemp"), [ |
paul@663 | 971 | temp, |
paul@663 | 972 | compiler.ast.CallFunc( |
paul@671 | 973 | special_name("apply"), |
paul@671 | 974 | [module_attribute("__builtins__", "iter"), self.dispatch(node.list)] |
paul@663 | 975 | ) |
paul@663 | 976 | ]), |
paul@663 | 977 | # while True: ... |
paul@663 | 978 | compiler.ast.While( |
paul@663 | 979 | special_name("True"), |
paul@663 | 980 | # try: ... |
paul@663 | 981 | compiler.ast.TryExcept( |
paul@663 | 982 | compiler.ast.Stmt([ |
paul@663 | 983 | # <assign> = ... |
paul@663 | 984 | self.dispatch(node.assign, |
paul@663 | 985 | # _it.next() |
paul@663 | 986 | compiler.ast.CallFunc( |
paul@670 | 987 | compiler.ast.CallFunc(special_name("loadattrindex"), [ |
paul@670 | 988 | compiler.ast.CallFunc(special_name("loadtemp"), [temp]), |
paul@663 | 989 | special_name("next") |
paul@663 | 990 | ]), |
paul@663 | 991 | [] |
paul@663 | 992 | ) |
paul@663 | 993 | ) |
paul@663 | 994 | ]), |
paul@663 | 995 | # except StopIteration: ... |
paul@663 | 996 | [(special_name("StopIteration"), None, compiler.ast.Stmt([compiler.ast.Break()]))], |
paul@663 | 997 | # else: ... |
paul@663 | 998 | body |
paul@663 | 999 | ), |
paul@663 | 1000 | None |
paul@663 | 1001 | ) |
paul@663 | 1002 | ]) |
paul@663 | 1003 | |
paul@663 | 1004 | def visitListCompIf(self, node, out_temp, expr, quals): |
paul@663 | 1005 | |
paul@663 | 1006 | # Either generate more "for" or "if" constructs. |
paul@663 | 1007 | |
paul@663 | 1008 | if quals: |
paul@663 | 1009 | body = self.dispatch(quals[0], out_temp, expr, quals[1:]) |
paul@663 | 1010 | |
paul@663 | 1011 | # Or generate the append statement. |
paul@663 | 1012 | |
paul@663 | 1013 | else: |
paul@663 | 1014 | body = self._visitListCompExpr(out_temp, expr) |
paul@663 | 1015 | |
paul@663 | 1016 | return compiler.ast.If( |
paul@663 | 1017 | [(self.dispatch(node.test), body)], |
paul@663 | 1018 | None |
paul@638 | 1019 | ) |
paul@638 | 1020 | |
paul@663 | 1021 | def _visitListCompExpr(self, out_temp, expr): |
paul@663 | 1022 | |
paul@663 | 1023 | "To the 'out_temp' object, append the result of 'expr'." |
paul@638 | 1024 | |
paul@663 | 1025 | return compiler.ast.Stmt([ |
paul@663 | 1026 | # _out.append(<expr>) |
paul@663 | 1027 | compiler.ast.CallFunc( |
paul@670 | 1028 | compiler.ast.CallFunc(special_name("loadattrindex"), [ |
paul@670 | 1029 | compiler.ast.CallFunc(special_name("loadtemp"), [out_temp]), |
paul@663 | 1030 | special_name("append") |
paul@663 | 1031 | ]), |
paul@663 | 1032 | [self.dispatch(expr)] |
paul@663 | 1033 | ) |
paul@663 | 1034 | ]) |
paul@638 | 1035 | |
paul@638 | 1036 | def visitMod(self, node): |
paul@638 | 1037 | return self._visitBinary(node) |
paul@638 | 1038 | |
paul@638 | 1039 | def visitMul(self, node): |
paul@638 | 1040 | return self._visitBinary(node) |
paul@638 | 1041 | |
paul@638 | 1042 | def visitName(self, node, expr=None): |
paul@638 | 1043 | if expr: |
paul@638 | 1044 | return self.visitAssName(node, expr) |
paul@638 | 1045 | |
paul@638 | 1046 | unit = self.get_unit() |
paul@645 | 1047 | attr = node._attr |
paul@645 | 1048 | scope = node._scope |
paul@638 | 1049 | |
paul@638 | 1050 | # Generate appropriate name access operation. |
paul@638 | 1051 | |
paul@638 | 1052 | if scope == "constant": |
paul@638 | 1053 | return node |
paul@638 | 1054 | |
paul@645 | 1055 | # Function locals are referenced normally. |
paul@638 | 1056 | |
paul@645 | 1057 | elif scope == "local" and isinstance(unit, Function): |
paul@645 | 1058 | return node |
paul@638 | 1059 | |
paul@645 | 1060 | # Other attributes should already be resolved. |
paul@638 | 1061 | |
paul@663 | 1062 | elif attr is not None and not isinstance(attr, Instance): |
paul@664 | 1063 | if attr.is_constant(): |
paul@676 | 1064 | return constant_attribute(attr.parent, node.name) |
paul@664 | 1065 | else: |
paul@664 | 1066 | return compiler.ast.CallFunc( |
paul@670 | 1067 | special_name("loadattr"), |
paul@664 | 1068 | [quoted_ref(attr.parent), special_name(node.name)] |
paul@664 | 1069 | ) |
paul@638 | 1070 | |
paul@663 | 1071 | # Function globals are referenced via the module. |
paul@663 | 1072 | |
paul@663 | 1073 | elif scope == "global": |
paul@663 | 1074 | return compiler.ast.CallFunc( |
paul@670 | 1075 | special_name("loadattr"), |
paul@663 | 1076 | [quoted_ref(self.get_module()), special_name(node.name)] |
paul@663 | 1077 | ) |
paul@663 | 1078 | |
paul@645 | 1079 | # NOTE: Unknown attributes may arise because a class attribute has been |
paul@645 | 1080 | # NOTE: optimised away. |
paul@638 | 1081 | |
paul@638 | 1082 | else: |
paul@638 | 1083 | return compiler.ast.CallFunc( |
paul@670 | 1084 | special_name("loadunknown"), |
paul@638 | 1085 | [special_name(node.name)] |
paul@638 | 1086 | ) |
paul@638 | 1087 | |
paul@638 | 1088 | def visitNot(self, node): |
paul@638 | 1089 | return compiler.ast.Not(self.dispatch(node.expr)) |
paul@638 | 1090 | |
paul@638 | 1091 | def visitOr(self, node): |
paul@638 | 1092 | return compiler.ast.Or([self.dispatch(n) for n in node.nodes]) |
paul@638 | 1093 | |
paul@638 | 1094 | def visitPower(self, node): |
paul@638 | 1095 | return self._visitBinary(node) |
paul@638 | 1096 | |
paul@638 | 1097 | def visitRightShift(self, node): |
paul@638 | 1098 | return self._visitBinary(node) |
paul@638 | 1099 | |
paul@699 | 1100 | def visitSet(self, node): |
paul@699 | 1101 | return compiler.ast.Set([self.dispatch(n) for n in node.nodes]) |
paul@699 | 1102 | |
paul@638 | 1103 | def visitSlice(self, node, expr=None): |
paul@638 | 1104 | return compiler.ast.CallFunc( |
paul@671 | 1105 | special_name("apply"), |
paul@671 | 1106 | [module_attribute("operator", expr and "setslice" or "getslice"), |
paul@671 | 1107 | self.dispatch(node.expr), |
paul@671 | 1108 | node.lower and self.dispatch(node.lower), |
paul@671 | 1109 | node.upper and self.dispatch(node.upper)] |
paul@671 | 1110 | + (expr and [expr] or []) |
paul@638 | 1111 | ) |
paul@638 | 1112 | |
paul@638 | 1113 | def visitSliceobj(self, node): |
paul@675 | 1114 | return compiler.ast.CallFunc( |
paul@675 | 1115 | special_name("apply"), |
paul@675 | 1116 | [module_attribute("__builtins__", "slice")] |
paul@675 | 1117 | + [self.dispatch(n) for n in node.nodes] |
paul@675 | 1118 | ) |
paul@638 | 1119 | |
paul@638 | 1120 | def visitSub(self, node): |
paul@638 | 1121 | return self._visitBinary(node) |
paul@638 | 1122 | |
paul@638 | 1123 | def visitSubscript(self, node, expr=None): |
paul@638 | 1124 | return compiler.ast.CallFunc( |
paul@671 | 1125 | special_name("apply"), |
paul@671 | 1126 | [module_attribute("operator", expr and "setitem" or "getitem"), |
paul@671 | 1127 | self.dispatch(node.expr), |
paul@671 | 1128 | compiler.ast.Tuple([self.dispatch(sub) for sub in node.subs])] |
paul@671 | 1129 | + (expr and [expr] or []) |
paul@638 | 1130 | ) |
paul@638 | 1131 | |
paul@638 | 1132 | def visitTuple(self, node, expr=None): |
paul@638 | 1133 | if expr: |
paul@638 | 1134 | return self.visitAssTuple(node, expr) |
paul@638 | 1135 | return compiler.ast.Tuple([self.dispatch(n) for n in node.nodes]) |
paul@638 | 1136 | |
paul@638 | 1137 | def visitUnaryAdd(self, node): |
paul@638 | 1138 | return self._visitUnary(node) |
paul@638 | 1139 | |
paul@638 | 1140 | def visitUnarySub(self, node): |
paul@638 | 1141 | return self._visitUnary(node) |
paul@638 | 1142 | |
paul@638 | 1143 | # Convenience functions. |
paul@638 | 1144 | |
paul@638 | 1145 | def convert(module, program, filename): |
paul@638 | 1146 | stream = open(filename, "wb") |
paul@638 | 1147 | try: |
paul@638 | 1148 | source = ConvertedSource(module, program) |
paul@638 | 1149 | source.to_stream(stream) |
paul@638 | 1150 | finally: |
paul@638 | 1151 | stream.close() |
paul@638 | 1152 | |
paul@638 | 1153 | def translate(program, directory): |
paul@638 | 1154 | if not exists(directory): |
paul@638 | 1155 | os.mkdir(directory) |
paul@638 | 1156 | |
paul@638 | 1157 | # NOTE: Add constants here. |
paul@638 | 1158 | |
paul@638 | 1159 | for module in program.get_importer().get_modules(): |
paul@638 | 1160 | convert(module, program, join(directory, "%s%spy" % (module.full_name(), extsep))) |
paul@638 | 1161 | |
paul@638 | 1162 | # vim: tabstop=4 expandtab shiftwidth=4 |