paul@0 | 1 | import imp |
paul@0 | 2 | import os |
paul@0 | 3 | import marshal |
paul@0 | 4 | import struct |
paul@0 | 5 | import sys |
paul@0 | 6 | from cStringIO import StringIO |
paul@0 | 7 | |
paul@0 | 8 | from compiler import ast, parse, walk, syntax |
paul@0 | 9 | from compiler import pyassem, misc, future, symbols |
paul@0 | 10 | from compiler.consts import SC_LOCAL, SC_GLOBAL_IMPLICIT, SC_GLOBAL_EXPLICT, \ |
paul@0 | 11 | SC_FREE, SC_CELL |
paul@0 | 12 | from compiler.consts import (CO_VARARGS, CO_VARKEYWORDS, CO_NEWLOCALS, |
paul@0 | 13 | CO_NESTED, CO_GENERATOR, CO_FUTURE_DIVISION, |
paul@0 | 14 | CO_FUTURE_ABSIMPORT, CO_FUTURE_WITH_STATEMENT, CO_FUTURE_PRINT_FUNCTION) |
paul@0 | 15 | from compiler.pyassem import TupleArg |
paul@0 | 16 | |
paul@0 | 17 | # XXX The version-specific code can go, since this code only works with 2.x. |
paul@0 | 18 | # Do we have Python 1.x or Python 2.x? |
paul@0 | 19 | try: |
paul@0 | 20 | VERSION = sys.version_info[0] |
paul@0 | 21 | except AttributeError: |
paul@0 | 22 | VERSION = 1 |
paul@0 | 23 | |
paul@0 | 24 | callfunc_opcode_info = { |
paul@0 | 25 | # (Have *args, Have **args) : opcode |
paul@0 | 26 | (0,0) : "CALL_FUNCTION", |
paul@0 | 27 | (1,0) : "CALL_FUNCTION_VAR", |
paul@0 | 28 | (0,1) : "CALL_FUNCTION_KW", |
paul@0 | 29 | (1,1) : "CALL_FUNCTION_VAR_KW", |
paul@0 | 30 | } |
paul@0 | 31 | |
paul@0 | 32 | LOOP = 1 |
paul@0 | 33 | EXCEPT = 2 |
paul@0 | 34 | TRY_FINALLY = 3 |
paul@0 | 35 | END_FINALLY = 4 |
paul@0 | 36 | |
paul@0 | 37 | def compileFile(filename, display=0): |
paul@0 | 38 | f = open(filename, 'U') |
paul@0 | 39 | buf = f.read() |
paul@0 | 40 | f.close() |
paul@0 | 41 | mod = Module(buf, filename) |
paul@0 | 42 | try: |
paul@0 | 43 | mod.compile(display) |
paul@0 | 44 | except SyntaxError: |
paul@0 | 45 | raise |
paul@0 | 46 | else: |
paul@0 | 47 | f = open(filename + "c", "wb") |
paul@0 | 48 | mod.dump(f) |
paul@0 | 49 | f.close() |
paul@0 | 50 | |
paul@0 | 51 | def compile(source, filename, mode, flags=None, dont_inherit=None): |
paul@0 | 52 | """Replacement for builtin compile() function""" |
paul@0 | 53 | if flags is not None or dont_inherit is not None: |
paul@0 | 54 | raise RuntimeError, "not implemented yet" |
paul@0 | 55 | |
paul@0 | 56 | if mode == "single": |
paul@0 | 57 | gen = Interactive(source, filename) |
paul@0 | 58 | elif mode == "exec": |
paul@0 | 59 | gen = Module(source, filename) |
paul@0 | 60 | elif mode == "eval": |
paul@0 | 61 | gen = Expression(source, filename) |
paul@0 | 62 | else: |
paul@0 | 63 | raise ValueError("compile() 3rd arg must be 'exec' or " |
paul@0 | 64 | "'eval' or 'single'") |
paul@0 | 65 | gen.compile() |
paul@0 | 66 | return gen.code |
paul@0 | 67 | |
paul@0 | 68 | class AbstractCompileMode: |
paul@0 | 69 | |
paul@0 | 70 | mode = None # defined by subclass |
paul@0 | 71 | |
paul@0 | 72 | def __init__(self, source, filename): |
paul@0 | 73 | self.source = source |
paul@0 | 74 | self.filename = filename |
paul@0 | 75 | self.code = None |
paul@0 | 76 | |
paul@0 | 77 | def _get_tree(self): |
paul@0 | 78 | tree = parse(self.source, self.mode) |
paul@0 | 79 | misc.set_filename(self.filename, tree) |
paul@0 | 80 | syntax.check(tree) |
paul@0 | 81 | return tree |
paul@0 | 82 | |
paul@0 | 83 | def compile(self): |
paul@0 | 84 | pass # implemented by subclass |
paul@0 | 85 | |
paul@0 | 86 | def getCode(self): |
paul@0 | 87 | return self.code |
paul@0 | 88 | |
paul@0 | 89 | class Expression(AbstractCompileMode): |
paul@0 | 90 | |
paul@0 | 91 | mode = "eval" |
paul@0 | 92 | |
paul@0 | 93 | def compile(self): |
paul@0 | 94 | tree = self._get_tree() |
paul@0 | 95 | gen = ExpressionCodeGenerator(tree) |
paul@0 | 96 | self.code = gen.getCode() |
paul@0 | 97 | |
paul@0 | 98 | class Interactive(AbstractCompileMode): |
paul@0 | 99 | |
paul@0 | 100 | mode = "single" |
paul@0 | 101 | |
paul@0 | 102 | def compile(self): |
paul@0 | 103 | tree = self._get_tree() |
paul@0 | 104 | gen = InteractiveCodeGenerator(tree) |
paul@0 | 105 | self.code = gen.getCode() |
paul@0 | 106 | |
paul@0 | 107 | class Module(AbstractCompileMode): |
paul@0 | 108 | |
paul@0 | 109 | mode = "exec" |
paul@0 | 110 | |
paul@0 | 111 | def compile(self, display=0): |
paul@0 | 112 | tree = self._get_tree() |
paul@0 | 113 | gen = ModuleCodeGenerator(tree) |
paul@0 | 114 | if display: |
paul@0 | 115 | import pprint |
paul@0 | 116 | print pprint.pprint(tree) |
paul@0 | 117 | self.code = gen.getCode() |
paul@0 | 118 | |
paul@0 | 119 | def dump(self, f): |
paul@0 | 120 | f.write(self.getPycHeader()) |
paul@0 | 121 | marshal.dump(self.code, f) |
paul@0 | 122 | |
paul@0 | 123 | MAGIC = imp.get_magic() |
paul@0 | 124 | |
paul@0 | 125 | def getPycHeader(self): |
paul@0 | 126 | # compile.c uses marshal to write a long directly, with |
paul@0 | 127 | # calling the interface that would also generate a 1-byte code |
paul@0 | 128 | # to indicate the type of the value. simplest way to get the |
paul@0 | 129 | # same effect is to call marshal and then skip the code. |
paul@0 | 130 | mtime = os.path.getmtime(self.filename) |
paul@0 | 131 | mtime = struct.pack('<i', mtime) |
paul@0 | 132 | return self.MAGIC + mtime |
paul@0 | 133 | |
paul@0 | 134 | class LocalNameFinder: |
paul@0 | 135 | """Find local names in scope""" |
paul@0 | 136 | def __init__(self, names=()): |
paul@0 | 137 | self.names = misc.Set() |
paul@0 | 138 | self.globals = misc.Set() |
paul@0 | 139 | for name in names: |
paul@0 | 140 | self.names.add(name) |
paul@0 | 141 | |
paul@0 | 142 | # XXX list comprehensions and for loops |
paul@0 | 143 | |
paul@0 | 144 | def getLocals(self): |
paul@0 | 145 | for elt in self.globals.elements(): |
paul@0 | 146 | if self.names.has_elt(elt): |
paul@0 | 147 | self.names.remove(elt) |
paul@0 | 148 | return self.names |
paul@0 | 149 | |
paul@0 | 150 | def visitDict(self, node): |
paul@0 | 151 | pass |
paul@0 | 152 | |
paul@0 | 153 | def visitGlobal(self, node): |
paul@0 | 154 | for name in node.names: |
paul@0 | 155 | self.globals.add(name) |
paul@0 | 156 | |
paul@0 | 157 | def visitFunction(self, node): |
paul@0 | 158 | self.names.add(node.name) |
paul@0 | 159 | |
paul@0 | 160 | def visitLambda(self, node): |
paul@0 | 161 | pass |
paul@0 | 162 | |
paul@0 | 163 | def visitImport(self, node): |
paul@0 | 164 | for name, alias in node.names: |
paul@0 | 165 | self.names.add(alias or name) |
paul@0 | 166 | |
paul@0 | 167 | def visitFrom(self, node): |
paul@0 | 168 | for name, alias in node.names: |
paul@0 | 169 | self.names.add(alias or name) |
paul@0 | 170 | |
paul@0 | 171 | def visitClass(self, node): |
paul@0 | 172 | self.names.add(node.name) |
paul@0 | 173 | |
paul@0 | 174 | def visitAssName(self, node): |
paul@0 | 175 | self.names.add(node.name) |
paul@0 | 176 | |
paul@0 | 177 | def is_constant_false(node): |
paul@0 | 178 | if isinstance(node, ast.Const): |
paul@0 | 179 | if not node.value: |
paul@0 | 180 | return 1 |
paul@0 | 181 | return 0 |
paul@0 | 182 | |
paul@0 | 183 | class CodeGenerator: |
paul@0 | 184 | """Defines basic code generator for Python bytecode |
paul@0 | 185 | |
paul@0 | 186 | This class is an abstract base class. Concrete subclasses must |
paul@0 | 187 | define an __init__() that defines self.graph and then calls the |
paul@0 | 188 | __init__() defined in this class. |
paul@0 | 189 | |
paul@0 | 190 | The concrete class must also define the class attributes |
paul@0 | 191 | NameFinder, FunctionGen, and ClassGen. These attributes can be |
paul@0 | 192 | defined in the initClass() method, which is a hook for |
paul@0 | 193 | initializing these methods after all the classes have been |
paul@0 | 194 | defined. |
paul@0 | 195 | """ |
paul@0 | 196 | |
paul@0 | 197 | optimized = 0 # is namespace access optimized? |
paul@0 | 198 | __initialized = None |
paul@0 | 199 | class_name = None # provide default for instance variable |
paul@0 | 200 | |
paul@0 | 201 | def __init__(self): |
paul@0 | 202 | if self.__initialized is None: |
paul@0 | 203 | self.initClass() |
paul@0 | 204 | self.__class__.__initialized = 1 |
paul@0 | 205 | self.checkClass() |
paul@0 | 206 | self.locals = misc.Stack() |
paul@0 | 207 | self.setups = misc.Stack() |
paul@0 | 208 | self.last_lineno = None |
paul@0 | 209 | self._setupGraphDelegation() |
paul@0 | 210 | self._div_op = "BINARY_DIVIDE" |
paul@0 | 211 | |
paul@0 | 212 | # XXX set flags based on future features |
paul@0 | 213 | futures = self.get_module().futures |
paul@0 | 214 | for feature in futures: |
paul@0 | 215 | if feature == "division": |
paul@0 | 216 | self.graph.setFlag(CO_FUTURE_DIVISION) |
paul@0 | 217 | self._div_op = "BINARY_TRUE_DIVIDE" |
paul@0 | 218 | elif feature == "absolute_import": |
paul@0 | 219 | self.graph.setFlag(CO_FUTURE_ABSIMPORT) |
paul@0 | 220 | elif feature == "with_statement": |
paul@0 | 221 | self.graph.setFlag(CO_FUTURE_WITH_STATEMENT) |
paul@0 | 222 | elif feature == "print_function": |
paul@0 | 223 | self.graph.setFlag(CO_FUTURE_PRINT_FUNCTION) |
paul@0 | 224 | |
paul@0 | 225 | def initClass(self): |
paul@0 | 226 | """This method is called once for each class""" |
paul@0 | 227 | |
paul@0 | 228 | def checkClass(self): |
paul@0 | 229 | """Verify that class is constructed correctly""" |
paul@0 | 230 | try: |
paul@0 | 231 | assert hasattr(self, 'graph') |
paul@0 | 232 | assert getattr(self, 'NameFinder') |
paul@0 | 233 | assert getattr(self, 'FunctionGen') |
paul@0 | 234 | assert getattr(self, 'ClassGen') |
paul@0 | 235 | except AssertionError, msg: |
paul@0 | 236 | intro = "Bad class construction for %s" % self.__class__.__name__ |
paul@0 | 237 | raise AssertionError, intro |
paul@0 | 238 | |
paul@0 | 239 | def _setupGraphDelegation(self): |
paul@0 | 240 | self.emit = self.graph.emit |
paul@0 | 241 | self.newBlock = self.graph.newBlock |
paul@0 | 242 | self.startBlock = self.graph.startBlock |
paul@0 | 243 | self.nextBlock = self.graph.nextBlock |
paul@0 | 244 | self.setDocstring = self.graph.setDocstring |
paul@0 | 245 | |
paul@0 | 246 | def getCode(self): |
paul@0 | 247 | """Return a code object""" |
paul@0 | 248 | return self.graph.getCode() |
paul@0 | 249 | |
paul@0 | 250 | def mangle(self, name): |
paul@0 | 251 | if self.class_name is not None: |
paul@0 | 252 | return misc.mangle(name, self.class_name) |
paul@0 | 253 | else: |
paul@0 | 254 | return name |
paul@0 | 255 | |
paul@0 | 256 | def parseSymbols(self, tree): |
paul@0 | 257 | s = symbols.SymbolVisitor() |
paul@0 | 258 | walk(tree, s) |
paul@0 | 259 | return s.scopes |
paul@0 | 260 | |
paul@0 | 261 | def get_module(self): |
paul@0 | 262 | raise RuntimeError, "should be implemented by subclasses" |
paul@0 | 263 | |
paul@0 | 264 | # Next five methods handle name access |
paul@0 | 265 | |
paul@0 | 266 | def isLocalName(self, name): |
paul@0 | 267 | return self.locals.top().has_elt(name) |
paul@0 | 268 | |
paul@0 | 269 | def storeName(self, name): |
paul@0 | 270 | self._nameOp('STORE', name) |
paul@0 | 271 | |
paul@0 | 272 | def loadName(self, name): |
paul@0 | 273 | self._nameOp('LOAD', name) |
paul@0 | 274 | |
paul@0 | 275 | def delName(self, name): |
paul@0 | 276 | self._nameOp('DELETE', name) |
paul@0 | 277 | |
paul@0 | 278 | def _nameOp(self, prefix, name): |
paul@0 | 279 | name = self.mangle(name) |
paul@0 | 280 | scope = self.scope.check_name(name) |
paul@0 | 281 | if scope == SC_LOCAL: |
paul@0 | 282 | if not self.optimized: |
paul@0 | 283 | self.emit(prefix + '_NAME', name) |
paul@0 | 284 | else: |
paul@0 | 285 | self.emit(prefix + '_FAST', name) |
paul@0 | 286 | elif scope == SC_GLOBAL_EXPLICT: |
paul@0 | 287 | self.emit(prefix + '_GLOBAL', name) |
paul@0 | 288 | elif scope == SC_GLOBAL_IMPLICIT: |
paul@0 | 289 | if not self.optimized: |
paul@0 | 290 | self.emit(prefix + '_NAME', name) |
paul@0 | 291 | else: |
paul@0 | 292 | self.emit(prefix + '_GLOBAL', name) |
paul@0 | 293 | elif scope == SC_FREE or scope == SC_CELL: |
paul@0 | 294 | self.emit(prefix + '_DEREF', name) |
paul@0 | 295 | else: |
paul@0 | 296 | raise RuntimeError, "unsupported scope for var %s: %d" % \ |
paul@0 | 297 | (name, scope) |
paul@0 | 298 | |
paul@0 | 299 | def _implicitNameOp(self, prefix, name): |
paul@0 | 300 | """Emit name ops for names generated implicitly by for loops |
paul@0 | 301 | |
paul@0 | 302 | The interpreter generates names that start with a period or |
paul@0 | 303 | dollar sign. The symbol table ignores these names because |
paul@0 | 304 | they aren't present in the program text. |
paul@0 | 305 | """ |
paul@0 | 306 | if self.optimized: |
paul@0 | 307 | self.emit(prefix + '_FAST', name) |
paul@0 | 308 | else: |
paul@0 | 309 | self.emit(prefix + '_NAME', name) |
paul@0 | 310 | |
paul@0 | 311 | # The set_lineno() function and the explicit emit() calls for |
paul@0 | 312 | # SET_LINENO below are only used to generate the line number table. |
paul@0 | 313 | # As of Python 2.3, the interpreter does not have a SET_LINENO |
paul@0 | 314 | # instruction. pyassem treats SET_LINENO opcodes as a special case. |
paul@0 | 315 | |
paul@0 | 316 | def set_lineno(self, node, force=False): |
paul@0 | 317 | """Emit SET_LINENO if necessary. |
paul@0 | 318 | |
paul@0 | 319 | The instruction is considered necessary if the node has a |
paul@0 | 320 | lineno attribute and it is different than the last lineno |
paul@0 | 321 | emitted. |
paul@0 | 322 | |
paul@0 | 323 | Returns true if SET_LINENO was emitted. |
paul@0 | 324 | |
paul@0 | 325 | There are no rules for when an AST node should have a lineno |
paul@0 | 326 | attribute. The transformer and AST code need to be reviewed |
paul@0 | 327 | and a consistent policy implemented and documented. Until |
paul@0 | 328 | then, this method works around missing line numbers. |
paul@0 | 329 | """ |
paul@0 | 330 | lineno = getattr(node, 'lineno', None) |
paul@0 | 331 | if lineno is not None and (lineno != self.last_lineno |
paul@0 | 332 | or force): |
paul@0 | 333 | self.emit('SET_LINENO', lineno) |
paul@0 | 334 | self.last_lineno = lineno |
paul@0 | 335 | return True |
paul@0 | 336 | return False |
paul@0 | 337 | |
paul@0 | 338 | # The first few visitor methods handle nodes that generator new |
paul@0 | 339 | # code objects. They use class attributes to determine what |
paul@0 | 340 | # specialized code generators to use. |
paul@0 | 341 | |
paul@0 | 342 | NameFinder = LocalNameFinder |
paul@0 | 343 | FunctionGen = None |
paul@0 | 344 | ClassGen = None |
paul@0 | 345 | |
paul@0 | 346 | def visitModule(self, node): |
paul@0 | 347 | self.scopes = self.parseSymbols(node) |
paul@0 | 348 | self.scope = self.scopes[node] |
paul@0 | 349 | self.emit('SET_LINENO', 0) |
paul@0 | 350 | if node.doc: |
paul@0 | 351 | self.emit('LOAD_CONST', node.doc) |
paul@0 | 352 | self.storeName('__doc__') |
paul@0 | 353 | lnf = walk(node.node, self.NameFinder(), verbose=0) |
paul@0 | 354 | self.locals.push(lnf.getLocals()) |
paul@0 | 355 | self.visit(node.node) |
paul@0 | 356 | self.emit('LOAD_CONST', None) |
paul@0 | 357 | self.emit('RETURN_VALUE') |
paul@0 | 358 | |
paul@0 | 359 | def visitExpression(self, node): |
paul@0 | 360 | self.set_lineno(node) |
paul@0 | 361 | self.scopes = self.parseSymbols(node) |
paul@0 | 362 | self.scope = self.scopes[node] |
paul@0 | 363 | self.visit(node.node) |
paul@0 | 364 | self.emit('RETURN_VALUE') |
paul@0 | 365 | |
paul@0 | 366 | def visitFunction(self, node): |
paul@0 | 367 | self._visitFuncOrLambda(node, isLambda=0) |
paul@0 | 368 | if node.doc: |
paul@0 | 369 | self.setDocstring(node.doc) |
paul@0 | 370 | self.storeName(node.name) |
paul@0 | 371 | |
paul@0 | 372 | def visitLambda(self, node): |
paul@0 | 373 | self._visitFuncOrLambda(node, isLambda=1) |
paul@0 | 374 | |
paul@0 | 375 | def _visitFuncOrLambda(self, node, isLambda=0): |
paul@0 | 376 | if not isLambda and node.decorators: |
paul@0 | 377 | for decorator in node.decorators.nodes: |
paul@0 | 378 | self.visit(decorator) |
paul@0 | 379 | ndecorators = len(node.decorators.nodes) |
paul@0 | 380 | else: |
paul@0 | 381 | ndecorators = 0 |
paul@0 | 382 | |
paul@0 | 383 | gen = self.FunctionGen(node, self.scopes, isLambda, |
paul@0 | 384 | self.class_name, self.get_module()) |
paul@0 | 385 | walk(node.code, gen) |
paul@0 | 386 | gen.finish() |
paul@0 | 387 | self.set_lineno(node) |
paul@0 | 388 | for default in node.defaults: |
paul@0 | 389 | self.visit(default) |
paul@0 | 390 | self._makeClosure(gen, len(node.defaults)) |
paul@0 | 391 | for i in range(ndecorators): |
paul@0 | 392 | self.emit('CALL_FUNCTION', 1) |
paul@0 | 393 | |
paul@0 | 394 | def visitClass(self, node): |
paul@0 | 395 | gen = self.ClassGen(node, self.scopes, |
paul@0 | 396 | self.get_module()) |
paul@0 | 397 | walk(node.code, gen) |
paul@0 | 398 | gen.finish() |
paul@0 | 399 | self.set_lineno(node) |
paul@0 | 400 | self.emit('LOAD_CONST', node.name) |
paul@0 | 401 | for base in node.bases: |
paul@0 | 402 | self.visit(base) |
paul@0 | 403 | self.emit('BUILD_TUPLE', len(node.bases)) |
paul@0 | 404 | self._makeClosure(gen, 0) |
paul@0 | 405 | self.emit('CALL_FUNCTION', 0) |
paul@0 | 406 | self.emit('BUILD_CLASS') |
paul@0 | 407 | self.storeName(node.name) |
paul@0 | 408 | |
paul@0 | 409 | # The rest are standard visitor methods |
paul@0 | 410 | |
paul@0 | 411 | # The next few implement control-flow statements |
paul@0 | 412 | |
paul@0 | 413 | def visitIf(self, node): |
paul@0 | 414 | end = self.newBlock() |
paul@0 | 415 | numtests = len(node.tests) |
paul@0 | 416 | for i in range(numtests): |
paul@0 | 417 | test, suite = node.tests[i] |
paul@0 | 418 | if is_constant_false(test): |
paul@0 | 419 | # XXX will need to check generator stuff here |
paul@0 | 420 | continue |
paul@0 | 421 | self.set_lineno(test) |
paul@0 | 422 | self.visit(test) |
paul@0 | 423 | nextTest = self.newBlock() |
paul@0 | 424 | self.emit('POP_JUMP_IF_FALSE', nextTest) |
paul@0 | 425 | self.nextBlock() |
paul@0 | 426 | self.visit(suite) |
paul@0 | 427 | self.emit('JUMP_FORWARD', end) |
paul@0 | 428 | self.startBlock(nextTest) |
paul@0 | 429 | if node.else_: |
paul@0 | 430 | self.visit(node.else_) |
paul@0 | 431 | self.nextBlock(end) |
paul@0 | 432 | |
paul@0 | 433 | def visitWhile(self, node): |
paul@0 | 434 | self.set_lineno(node) |
paul@0 | 435 | |
paul@0 | 436 | loop = self.newBlock() |
paul@0 | 437 | else_ = self.newBlock() |
paul@0 | 438 | |
paul@0 | 439 | after = self.newBlock() |
paul@0 | 440 | self.emit('SETUP_LOOP', after) |
paul@0 | 441 | |
paul@0 | 442 | self.nextBlock(loop) |
paul@0 | 443 | self.setups.push((LOOP, loop)) |
paul@0 | 444 | |
paul@0 | 445 | self.set_lineno(node, force=True) |
paul@0 | 446 | self.visit(node.test) |
paul@0 | 447 | self.emit('POP_JUMP_IF_FALSE', else_ or after) |
paul@0 | 448 | |
paul@0 | 449 | self.nextBlock() |
paul@0 | 450 | self.visit(node.body) |
paul@0 | 451 | self.emit('JUMP_ABSOLUTE', loop) |
paul@0 | 452 | |
paul@0 | 453 | self.startBlock(else_) # or just the POPs if not else clause |
paul@0 | 454 | self.emit('POP_BLOCK') |
paul@0 | 455 | self.setups.pop() |
paul@0 | 456 | if node.else_: |
paul@0 | 457 | self.visit(node.else_) |
paul@0 | 458 | self.nextBlock(after) |
paul@0 | 459 | |
paul@0 | 460 | def visitFor(self, node): |
paul@0 | 461 | start = self.newBlock() |
paul@0 | 462 | anchor = self.newBlock() |
paul@0 | 463 | after = self.newBlock() |
paul@0 | 464 | self.setups.push((LOOP, start)) |
paul@0 | 465 | |
paul@0 | 466 | self.set_lineno(node) |
paul@0 | 467 | self.emit('SETUP_LOOP', after) |
paul@0 | 468 | self.visit(node.list) |
paul@0 | 469 | self.emit('GET_ITER') |
paul@0 | 470 | |
paul@0 | 471 | self.nextBlock(start) |
paul@0 | 472 | self.set_lineno(node, force=1) |
paul@0 | 473 | self.emit('FOR_ITER', anchor) |
paul@0 | 474 | self.visit(node.assign) |
paul@0 | 475 | self.visit(node.body) |
paul@0 | 476 | self.emit('JUMP_ABSOLUTE', start) |
paul@0 | 477 | self.nextBlock(anchor) |
paul@0 | 478 | self.emit('POP_BLOCK') |
paul@0 | 479 | self.setups.pop() |
paul@0 | 480 | if node.else_: |
paul@0 | 481 | self.visit(node.else_) |
paul@0 | 482 | self.nextBlock(after) |
paul@0 | 483 | |
paul@0 | 484 | def visitBreak(self, node): |
paul@0 | 485 | if not self.setups: |
paul@0 | 486 | raise SyntaxError, "'break' outside loop (%s, %d)" % \ |
paul@0 | 487 | (node.filename, node.lineno) |
paul@0 | 488 | self.set_lineno(node) |
paul@0 | 489 | self.emit('BREAK_LOOP') |
paul@0 | 490 | |
paul@0 | 491 | def visitContinue(self, node): |
paul@0 | 492 | if not self.setups: |
paul@0 | 493 | raise SyntaxError, "'continue' outside loop (%s, %d)" % \ |
paul@0 | 494 | (node.filename, node.lineno) |
paul@0 | 495 | kind, block = self.setups.top() |
paul@0 | 496 | if kind == LOOP: |
paul@0 | 497 | self.set_lineno(node) |
paul@0 | 498 | self.emit('JUMP_ABSOLUTE', block) |
paul@0 | 499 | self.nextBlock() |
paul@0 | 500 | elif kind == EXCEPT or kind == TRY_FINALLY: |
paul@0 | 501 | self.set_lineno(node) |
paul@0 | 502 | # find the block that starts the loop |
paul@0 | 503 | top = len(self.setups) |
paul@0 | 504 | while top > 0: |
paul@0 | 505 | top = top - 1 |
paul@0 | 506 | kind, loop_block = self.setups[top] |
paul@0 | 507 | if kind == LOOP: |
paul@0 | 508 | break |
paul@0 | 509 | if kind != LOOP: |
paul@0 | 510 | raise SyntaxError, "'continue' outside loop (%s, %d)" % \ |
paul@0 | 511 | (node.filename, node.lineno) |
paul@0 | 512 | self.emit('CONTINUE_LOOP', loop_block) |
paul@0 | 513 | self.nextBlock() |
paul@0 | 514 | elif kind == END_FINALLY: |
paul@0 | 515 | msg = "'continue' not allowed inside 'finally' clause (%s, %d)" |
paul@0 | 516 | raise SyntaxError, msg % (node.filename, node.lineno) |
paul@0 | 517 | |
paul@0 | 518 | def visitTest(self, node, jump): |
paul@0 | 519 | end = self.newBlock() |
paul@0 | 520 | for child in node.nodes[:-1]: |
paul@0 | 521 | self.visit(child) |
paul@0 | 522 | self.emit(jump, end) |
paul@0 | 523 | self.nextBlock() |
paul@0 | 524 | self.visit(node.nodes[-1]) |
paul@0 | 525 | self.nextBlock(end) |
paul@0 | 526 | |
paul@0 | 527 | def visitAnd(self, node): |
paul@0 | 528 | self.visitTest(node, 'JUMP_IF_FALSE_OR_POP') |
paul@0 | 529 | |
paul@0 | 530 | def visitOr(self, node): |
paul@0 | 531 | self.visitTest(node, 'JUMP_IF_TRUE_OR_POP') |
paul@0 | 532 | |
paul@0 | 533 | def visitIfExp(self, node): |
paul@0 | 534 | endblock = self.newBlock() |
paul@0 | 535 | elseblock = self.newBlock() |
paul@0 | 536 | self.visit(node.test) |
paul@0 | 537 | self.emit('POP_JUMP_IF_FALSE', elseblock) |
paul@0 | 538 | self.visit(node.then) |
paul@0 | 539 | self.emit('JUMP_FORWARD', endblock) |
paul@0 | 540 | self.nextBlock(elseblock) |
paul@0 | 541 | self.visit(node.else_) |
paul@0 | 542 | self.nextBlock(endblock) |
paul@0 | 543 | |
paul@0 | 544 | def visitCompare(self, node): |
paul@0 | 545 | self.visit(node.expr) |
paul@0 | 546 | cleanup = self.newBlock() |
paul@0 | 547 | for op, code in node.ops[:-1]: |
paul@0 | 548 | self.visit(code) |
paul@0 | 549 | self.emit('DUP_TOP') |
paul@0 | 550 | self.emit('ROT_THREE') |
paul@0 | 551 | self.emit('COMPARE_OP', op) |
paul@0 | 552 | self.emit('JUMP_IF_FALSE_OR_POP', cleanup) |
paul@0 | 553 | self.nextBlock() |
paul@0 | 554 | # now do the last comparison |
paul@0 | 555 | if node.ops: |
paul@0 | 556 | op, code = node.ops[-1] |
paul@0 | 557 | self.visit(code) |
paul@0 | 558 | self.emit('COMPARE_OP', op) |
paul@0 | 559 | if len(node.ops) > 1: |
paul@0 | 560 | end = self.newBlock() |
paul@0 | 561 | self.emit('JUMP_FORWARD', end) |
paul@0 | 562 | self.startBlock(cleanup) |
paul@0 | 563 | self.emit('ROT_TWO') |
paul@0 | 564 | self.emit('POP_TOP') |
paul@0 | 565 | self.nextBlock(end) |
paul@0 | 566 | |
paul@0 | 567 | # list comprehensions |
paul@0 | 568 | def visitListComp(self, node): |
paul@0 | 569 | self.set_lineno(node) |
paul@0 | 570 | # setup list |
paul@0 | 571 | self.emit('BUILD_LIST', 0) |
paul@0 | 572 | |
paul@0 | 573 | stack = [] |
paul@0 | 574 | for i, for_ in zip(range(len(node.quals)), node.quals): |
paul@0 | 575 | start, anchor = self.visit(for_) |
paul@0 | 576 | cont = None |
paul@0 | 577 | for if_ in for_.ifs: |
paul@0 | 578 | if cont is None: |
paul@0 | 579 | cont = self.newBlock() |
paul@0 | 580 | self.visit(if_, cont) |
paul@0 | 581 | stack.insert(0, (start, cont, anchor)) |
paul@0 | 582 | |
paul@0 | 583 | self.visit(node.expr) |
paul@0 | 584 | self.emit('LIST_APPEND', len(node.quals) + 1) |
paul@0 | 585 | |
paul@0 | 586 | for start, cont, anchor in stack: |
paul@0 | 587 | if cont: |
paul@0 | 588 | self.nextBlock(cont) |
paul@0 | 589 | self.emit('JUMP_ABSOLUTE', start) |
paul@0 | 590 | self.startBlock(anchor) |
paul@0 | 591 | |
paul@0 | 592 | def visitSetComp(self, node): |
paul@0 | 593 | self.set_lineno(node) |
paul@0 | 594 | # setup list |
paul@0 | 595 | self.emit('BUILD_SET', 0) |
paul@0 | 596 | |
paul@0 | 597 | stack = [] |
paul@0 | 598 | for i, for_ in zip(range(len(node.quals)), node.quals): |
paul@0 | 599 | start, anchor = self.visit(for_) |
paul@0 | 600 | cont = None |
paul@0 | 601 | for if_ in for_.ifs: |
paul@0 | 602 | if cont is None: |
paul@0 | 603 | cont = self.newBlock() |
paul@0 | 604 | self.visit(if_, cont) |
paul@0 | 605 | stack.insert(0, (start, cont, anchor)) |
paul@0 | 606 | |
paul@0 | 607 | self.visit(node.expr) |
paul@0 | 608 | self.emit('SET_ADD', len(node.quals) + 1) |
paul@0 | 609 | |
paul@0 | 610 | for start, cont, anchor in stack: |
paul@0 | 611 | if cont: |
paul@0 | 612 | self.nextBlock(cont) |
paul@0 | 613 | self.emit('JUMP_ABSOLUTE', start) |
paul@0 | 614 | self.startBlock(anchor) |
paul@0 | 615 | |
paul@0 | 616 | def visitDictComp(self, node): |
paul@0 | 617 | self.set_lineno(node) |
paul@0 | 618 | # setup list |
paul@0 | 619 | self.emit('BUILD_MAP', 0) |
paul@0 | 620 | |
paul@0 | 621 | stack = [] |
paul@0 | 622 | for i, for_ in zip(range(len(node.quals)), node.quals): |
paul@0 | 623 | start, anchor = self.visit(for_) |
paul@0 | 624 | cont = None |
paul@0 | 625 | for if_ in for_.ifs: |
paul@0 | 626 | if cont is None: |
paul@0 | 627 | cont = self.newBlock() |
paul@0 | 628 | self.visit(if_, cont) |
paul@0 | 629 | stack.insert(0, (start, cont, anchor)) |
paul@0 | 630 | |
paul@0 | 631 | self.visit(node.value) |
paul@0 | 632 | self.visit(node.key) |
paul@0 | 633 | self.emit('MAP_ADD', len(node.quals) + 1) |
paul@0 | 634 | |
paul@0 | 635 | for start, cont, anchor in stack: |
paul@0 | 636 | if cont: |
paul@0 | 637 | self.nextBlock(cont) |
paul@0 | 638 | self.emit('JUMP_ABSOLUTE', start) |
paul@0 | 639 | self.startBlock(anchor) |
paul@0 | 640 | |
paul@0 | 641 | def visitListCompFor(self, node): |
paul@0 | 642 | start = self.newBlock() |
paul@0 | 643 | anchor = self.newBlock() |
paul@0 | 644 | |
paul@0 | 645 | self.visit(node.list) |
paul@0 | 646 | self.emit('GET_ITER') |
paul@0 | 647 | self.nextBlock(start) |
paul@0 | 648 | self.set_lineno(node, force=True) |
paul@0 | 649 | self.emit('FOR_ITER', anchor) |
paul@0 | 650 | self.nextBlock() |
paul@0 | 651 | self.visit(node.assign) |
paul@0 | 652 | return start, anchor |
paul@0 | 653 | |
paul@0 | 654 | def visitListCompIf(self, node, branch): |
paul@0 | 655 | self.set_lineno(node, force=True) |
paul@0 | 656 | self.visit(node.test) |
paul@0 | 657 | self.emit('POP_JUMP_IF_FALSE', branch) |
paul@0 | 658 | self.newBlock() |
paul@0 | 659 | |
paul@0 | 660 | def _makeClosure(self, gen, args): |
paul@0 | 661 | frees = gen.scope.get_free_vars() |
paul@0 | 662 | if frees: |
paul@0 | 663 | for name in frees: |
paul@0 | 664 | self.emit('LOAD_CLOSURE', name) |
paul@0 | 665 | self.emit('BUILD_TUPLE', len(frees)) |
paul@0 | 666 | self.emit('LOAD_CONST', gen) |
paul@0 | 667 | self.emit('MAKE_CLOSURE', args) |
paul@0 | 668 | else: |
paul@0 | 669 | self.emit('LOAD_CONST', gen) |
paul@0 | 670 | self.emit('MAKE_FUNCTION', args) |
paul@0 | 671 | |
paul@0 | 672 | def visitGenExpr(self, node): |
paul@0 | 673 | gen = GenExprCodeGenerator(node, self.scopes, self.class_name, |
paul@0 | 674 | self.get_module()) |
paul@0 | 675 | walk(node.code, gen) |
paul@0 | 676 | gen.finish() |
paul@0 | 677 | self.set_lineno(node) |
paul@0 | 678 | self._makeClosure(gen, 0) |
paul@0 | 679 | # precomputation of outmost iterable |
paul@0 | 680 | self.visit(node.code.quals[0].iter) |
paul@0 | 681 | self.emit('GET_ITER') |
paul@0 | 682 | self.emit('CALL_FUNCTION', 1) |
paul@0 | 683 | |
paul@0 | 684 | def visitGenExprInner(self, node): |
paul@0 | 685 | self.set_lineno(node) |
paul@0 | 686 | # setup list |
paul@0 | 687 | |
paul@0 | 688 | stack = [] |
paul@0 | 689 | for i, for_ in zip(range(len(node.quals)), node.quals): |
paul@0 | 690 | start, anchor, end = self.visit(for_) |
paul@0 | 691 | cont = None |
paul@0 | 692 | for if_ in for_.ifs: |
paul@0 | 693 | if cont is None: |
paul@0 | 694 | cont = self.newBlock() |
paul@0 | 695 | self.visit(if_, cont) |
paul@0 | 696 | stack.insert(0, (start, cont, anchor, end)) |
paul@0 | 697 | |
paul@0 | 698 | self.visit(node.expr) |
paul@0 | 699 | self.emit('YIELD_VALUE') |
paul@0 | 700 | self.emit('POP_TOP') |
paul@0 | 701 | |
paul@0 | 702 | for start, cont, anchor, end in stack: |
paul@0 | 703 | if cont: |
paul@0 | 704 | self.nextBlock(cont) |
paul@0 | 705 | self.emit('JUMP_ABSOLUTE', start) |
paul@0 | 706 | self.startBlock(anchor) |
paul@0 | 707 | self.emit('POP_BLOCK') |
paul@0 | 708 | self.setups.pop() |
paul@0 | 709 | self.nextBlock(end) |
paul@0 | 710 | |
paul@0 | 711 | self.emit('LOAD_CONST', None) |
paul@0 | 712 | |
paul@0 | 713 | def visitGenExprFor(self, node): |
paul@0 | 714 | start = self.newBlock() |
paul@0 | 715 | anchor = self.newBlock() |
paul@0 | 716 | end = self.newBlock() |
paul@0 | 717 | |
paul@0 | 718 | self.setups.push((LOOP, start)) |
paul@0 | 719 | self.emit('SETUP_LOOP', end) |
paul@0 | 720 | |
paul@0 | 721 | if node.is_outmost: |
paul@0 | 722 | self.loadName('.0') |
paul@0 | 723 | else: |
paul@0 | 724 | self.visit(node.iter) |
paul@0 | 725 | self.emit('GET_ITER') |
paul@0 | 726 | |
paul@0 | 727 | self.nextBlock(start) |
paul@0 | 728 | self.set_lineno(node, force=True) |
paul@0 | 729 | self.emit('FOR_ITER', anchor) |
paul@0 | 730 | self.nextBlock() |
paul@0 | 731 | self.visit(node.assign) |
paul@0 | 732 | return start, anchor, end |
paul@0 | 733 | |
paul@0 | 734 | def visitGenExprIf(self, node, branch): |
paul@0 | 735 | self.set_lineno(node, force=True) |
paul@0 | 736 | self.visit(node.test) |
paul@0 | 737 | self.emit('POP_JUMP_IF_FALSE', branch) |
paul@0 | 738 | self.newBlock() |
paul@0 | 739 | |
paul@0 | 740 | # exception related |
paul@0 | 741 | |
paul@0 | 742 | def visitAssert(self, node): |
paul@0 | 743 | # XXX would be interesting to implement this via a |
paul@0 | 744 | # transformation of the AST before this stage |
paul@0 | 745 | if __debug__: |
paul@0 | 746 | end = self.newBlock() |
paul@0 | 747 | self.set_lineno(node) |
paul@0 | 748 | # XXX AssertionError appears to be special case -- it is always |
paul@0 | 749 | # loaded as a global even if there is a local name. I guess this |
paul@0 | 750 | # is a sort of renaming op. |
paul@0 | 751 | self.nextBlock() |
paul@0 | 752 | self.visit(node.test) |
paul@0 | 753 | self.emit('POP_JUMP_IF_TRUE', end) |
paul@0 | 754 | self.nextBlock() |
paul@0 | 755 | self.emit('LOAD_GLOBAL', 'AssertionError') |
paul@0 | 756 | if node.fail: |
paul@0 | 757 | self.visit(node.fail) |
paul@0 | 758 | self.emit('RAISE_VARARGS', 2) |
paul@0 | 759 | else: |
paul@0 | 760 | self.emit('RAISE_VARARGS', 1) |
paul@0 | 761 | self.nextBlock(end) |
paul@0 | 762 | |
paul@0 | 763 | def visitRaise(self, node): |
paul@0 | 764 | self.set_lineno(node) |
paul@0 | 765 | n = 0 |
paul@0 | 766 | if node.expr1: |
paul@0 | 767 | self.visit(node.expr1) |
paul@0 | 768 | n = n + 1 |
paul@0 | 769 | if node.expr2: |
paul@0 | 770 | self.visit(node.expr2) |
paul@0 | 771 | n = n + 1 |
paul@0 | 772 | if node.expr3: |
paul@0 | 773 | self.visit(node.expr3) |
paul@0 | 774 | n = n + 1 |
paul@0 | 775 | self.emit('RAISE_VARARGS', n) |
paul@0 | 776 | |
paul@0 | 777 | def visitTryExcept(self, node): |
paul@0 | 778 | body = self.newBlock() |
paul@0 | 779 | handlers = self.newBlock() |
paul@0 | 780 | end = self.newBlock() |
paul@0 | 781 | if node.else_: |
paul@0 | 782 | lElse = self.newBlock() |
paul@0 | 783 | else: |
paul@0 | 784 | lElse = end |
paul@0 | 785 | self.set_lineno(node) |
paul@0 | 786 | self.emit('SETUP_EXCEPT', handlers) |
paul@0 | 787 | self.nextBlock(body) |
paul@0 | 788 | self.setups.push((EXCEPT, body)) |
paul@0 | 789 | self.visit(node.body) |
paul@0 | 790 | self.emit('POP_BLOCK') |
paul@0 | 791 | self.setups.pop() |
paul@0 | 792 | self.emit('JUMP_FORWARD', lElse) |
paul@0 | 793 | self.startBlock(handlers) |
paul@0 | 794 | |
paul@0 | 795 | last = len(node.handlers) - 1 |
paul@0 | 796 | for i in range(len(node.handlers)): |
paul@0 | 797 | expr, target, body = node.handlers[i] |
paul@0 | 798 | self.set_lineno(expr) |
paul@0 | 799 | if expr: |
paul@0 | 800 | self.emit('DUP_TOP') |
paul@0 | 801 | self.visit(expr) |
paul@0 | 802 | self.emit('COMPARE_OP', 'exception match') |
paul@0 | 803 | next = self.newBlock() |
paul@0 | 804 | self.emit('POP_JUMP_IF_FALSE', next) |
paul@0 | 805 | self.nextBlock() |
paul@0 | 806 | self.emit('POP_TOP') |
paul@0 | 807 | if target: |
paul@0 | 808 | self.visit(target) |
paul@0 | 809 | else: |
paul@0 | 810 | self.emit('POP_TOP') |
paul@0 | 811 | self.emit('POP_TOP') |
paul@0 | 812 | self.visit(body) |
paul@0 | 813 | self.emit('JUMP_FORWARD', end) |
paul@0 | 814 | if expr: |
paul@0 | 815 | self.nextBlock(next) |
paul@0 | 816 | else: |
paul@0 | 817 | self.nextBlock() |
paul@0 | 818 | self.emit('END_FINALLY') |
paul@0 | 819 | if node.else_: |
paul@0 | 820 | self.nextBlock(lElse) |
paul@0 | 821 | self.visit(node.else_) |
paul@0 | 822 | self.nextBlock(end) |
paul@0 | 823 | |
paul@0 | 824 | def visitTryFinally(self, node): |
paul@0 | 825 | body = self.newBlock() |
paul@0 | 826 | final = self.newBlock() |
paul@0 | 827 | self.set_lineno(node) |
paul@0 | 828 | self.emit('SETUP_FINALLY', final) |
paul@0 | 829 | self.nextBlock(body) |
paul@0 | 830 | self.setups.push((TRY_FINALLY, body)) |
paul@0 | 831 | self.visit(node.body) |
paul@0 | 832 | self.emit('POP_BLOCK') |
paul@0 | 833 | self.setups.pop() |
paul@0 | 834 | self.emit('LOAD_CONST', None) |
paul@0 | 835 | self.nextBlock(final) |
paul@0 | 836 | self.setups.push((END_FINALLY, final)) |
paul@0 | 837 | self.visit(node.final) |
paul@0 | 838 | self.emit('END_FINALLY') |
paul@0 | 839 | self.setups.pop() |
paul@0 | 840 | |
paul@0 | 841 | __with_count = 0 |
paul@0 | 842 | |
paul@0 | 843 | def visitWith(self, node): |
paul@0 | 844 | body = self.newBlock() |
paul@0 | 845 | final = self.newBlock() |
paul@0 | 846 | self.__with_count += 1 |
paul@0 | 847 | valuevar = "_[%d]" % self.__with_count |
paul@0 | 848 | self.set_lineno(node) |
paul@0 | 849 | self.visit(node.expr) |
paul@0 | 850 | self.emit('DUP_TOP') |
paul@0 | 851 | self.emit('LOAD_ATTR', '__exit__') |
paul@0 | 852 | self.emit('ROT_TWO') |
paul@0 | 853 | self.emit('LOAD_ATTR', '__enter__') |
paul@0 | 854 | self.emit('CALL_FUNCTION', 0) |
paul@0 | 855 | if node.vars is None: |
paul@0 | 856 | self.emit('POP_TOP') |
paul@0 | 857 | else: |
paul@0 | 858 | self._implicitNameOp('STORE', valuevar) |
paul@0 | 859 | self.emit('SETUP_FINALLY', final) |
paul@0 | 860 | self.nextBlock(body) |
paul@0 | 861 | self.setups.push((TRY_FINALLY, body)) |
paul@0 | 862 | if node.vars is not None: |
paul@0 | 863 | self._implicitNameOp('LOAD', valuevar) |
paul@0 | 864 | self._implicitNameOp('DELETE', valuevar) |
paul@0 | 865 | self.visit(node.vars) |
paul@0 | 866 | self.visit(node.body) |
paul@0 | 867 | self.emit('POP_BLOCK') |
paul@0 | 868 | self.setups.pop() |
paul@0 | 869 | self.emit('LOAD_CONST', None) |
paul@0 | 870 | self.nextBlock(final) |
paul@0 | 871 | self.setups.push((END_FINALLY, final)) |
paul@0 | 872 | self.emit('WITH_CLEANUP') |
paul@0 | 873 | self.emit('END_FINALLY') |
paul@0 | 874 | self.setups.pop() |
paul@0 | 875 | self.__with_count -= 1 |
paul@0 | 876 | |
paul@0 | 877 | # misc |
paul@0 | 878 | |
paul@0 | 879 | def visitDiscard(self, node): |
paul@0 | 880 | self.set_lineno(node) |
paul@0 | 881 | self.visit(node.expr) |
paul@0 | 882 | self.emit('POP_TOP') |
paul@0 | 883 | |
paul@0 | 884 | def visitConst(self, node): |
paul@0 | 885 | self.emit('LOAD_CONST', node.value) |
paul@0 | 886 | |
paul@0 | 887 | def visitKeyword(self, node): |
paul@0 | 888 | self.emit('LOAD_CONST', node.name) |
paul@0 | 889 | self.visit(node.expr) |
paul@0 | 890 | |
paul@0 | 891 | def visitGlobal(self, node): |
paul@0 | 892 | # no code to generate |
paul@0 | 893 | pass |
paul@0 | 894 | |
paul@0 | 895 | def visitName(self, node): |
paul@0 | 896 | self.set_lineno(node) |
paul@0 | 897 | self.loadName(node.name) |
paul@0 | 898 | |
paul@0 | 899 | def visitPass(self, node): |
paul@0 | 900 | self.set_lineno(node) |
paul@0 | 901 | |
paul@0 | 902 | def visitImport(self, node): |
paul@0 | 903 | self.set_lineno(node) |
paul@0 | 904 | level = 0 if self.graph.checkFlag(CO_FUTURE_ABSIMPORT) else -1 |
paul@0 | 905 | for name, alias in node.names: |
paul@0 | 906 | if VERSION > 1: |
paul@0 | 907 | self.emit('LOAD_CONST', level) |
paul@0 | 908 | self.emit('LOAD_CONST', None) |
paul@0 | 909 | self.emit('IMPORT_NAME', name) |
paul@0 | 910 | mod = name.split(".")[0] |
paul@0 | 911 | if alias: |
paul@0 | 912 | self._resolveDots(name) |
paul@0 | 913 | self.storeName(alias) |
paul@0 | 914 | else: |
paul@0 | 915 | self.storeName(mod) |
paul@0 | 916 | |
paul@0 | 917 | def visitFrom(self, node): |
paul@0 | 918 | self.set_lineno(node) |
paul@0 | 919 | level = node.level |
paul@0 | 920 | if level == 0 and not self.graph.checkFlag(CO_FUTURE_ABSIMPORT): |
paul@0 | 921 | level = -1 |
paul@0 | 922 | fromlist = tuple(name for (name, alias) in node.names) |
paul@0 | 923 | if VERSION > 1: |
paul@0 | 924 | self.emit('LOAD_CONST', level) |
paul@0 | 925 | self.emit('LOAD_CONST', fromlist) |
paul@0 | 926 | self.emit('IMPORT_NAME', node.modname) |
paul@0 | 927 | for name, alias in node.names: |
paul@0 | 928 | if VERSION > 1: |
paul@0 | 929 | if name == '*': |
paul@0 | 930 | self.namespace = 0 |
paul@0 | 931 | self.emit('IMPORT_STAR') |
paul@0 | 932 | # There can only be one name w/ from ... import * |
paul@0 | 933 | assert len(node.names) == 1 |
paul@0 | 934 | return |
paul@0 | 935 | else: |
paul@0 | 936 | self.emit('IMPORT_FROM', name) |
paul@0 | 937 | self._resolveDots(name) |
paul@0 | 938 | self.storeName(alias or name) |
paul@0 | 939 | else: |
paul@0 | 940 | self.emit('IMPORT_FROM', name) |
paul@0 | 941 | self.emit('POP_TOP') |
paul@0 | 942 | |
paul@0 | 943 | def _resolveDots(self, name): |
paul@0 | 944 | elts = name.split(".") |
paul@0 | 945 | if len(elts) == 1: |
paul@0 | 946 | return |
paul@0 | 947 | for elt in elts[1:]: |
paul@0 | 948 | self.emit('LOAD_ATTR', elt) |
paul@0 | 949 | |
paul@0 | 950 | def visitGetattr(self, node): |
paul@0 | 951 | self.visit(node.expr) |
paul@0 | 952 | self.emit('LOAD_ATTR', self.mangle(node.attrname)) |
paul@0 | 953 | |
paul@0 | 954 | # next five implement assignments |
paul@0 | 955 | |
paul@0 | 956 | def visitAssign(self, node): |
paul@0 | 957 | self.set_lineno(node) |
paul@0 | 958 | self.visit(node.expr) |
paul@0 | 959 | dups = len(node.nodes) - 1 |
paul@0 | 960 | for i in range(len(node.nodes)): |
paul@0 | 961 | elt = node.nodes[i] |
paul@0 | 962 | if i < dups: |
paul@0 | 963 | self.emit('DUP_TOP') |
paul@0 | 964 | if isinstance(elt, ast.Node): |
paul@0 | 965 | self.visit(elt) |
paul@0 | 966 | |
paul@0 | 967 | def visitAssName(self, node): |
paul@0 | 968 | if node.flags == 'OP_ASSIGN': |
paul@0 | 969 | self.storeName(node.name) |
paul@0 | 970 | elif node.flags == 'OP_DELETE': |
paul@0 | 971 | self.set_lineno(node) |
paul@0 | 972 | self.delName(node.name) |
paul@0 | 973 | else: |
paul@0 | 974 | print "oops", node.flags |
paul@0 | 975 | |
paul@0 | 976 | def visitAssAttr(self, node): |
paul@0 | 977 | self.visit(node.expr) |
paul@0 | 978 | if node.flags == 'OP_ASSIGN': |
paul@0 | 979 | self.emit('STORE_ATTR', self.mangle(node.attrname)) |
paul@0 | 980 | elif node.flags == 'OP_DELETE': |
paul@0 | 981 | self.emit('DELETE_ATTR', self.mangle(node.attrname)) |
paul@0 | 982 | else: |
paul@0 | 983 | print "warning: unexpected flags:", node.flags |
paul@0 | 984 | print node |
paul@0 | 985 | |
paul@0 | 986 | def _visitAssSequence(self, node, op='UNPACK_SEQUENCE'): |
paul@0 | 987 | if findOp(node) != 'OP_DELETE': |
paul@0 | 988 | self.emit(op, len(node.nodes)) |
paul@0 | 989 | for child in node.nodes: |
paul@0 | 990 | self.visit(child) |
paul@0 | 991 | |
paul@0 | 992 | if VERSION > 1: |
paul@0 | 993 | visitAssTuple = _visitAssSequence |
paul@0 | 994 | visitAssList = _visitAssSequence |
paul@0 | 995 | else: |
paul@0 | 996 | def visitAssTuple(self, node): |
paul@0 | 997 | self._visitAssSequence(node, 'UNPACK_TUPLE') |
paul@0 | 998 | |
paul@0 | 999 | def visitAssList(self, node): |
paul@0 | 1000 | self._visitAssSequence(node, 'UNPACK_LIST') |
paul@0 | 1001 | |
paul@0 | 1002 | # augmented assignment |
paul@0 | 1003 | |
paul@0 | 1004 | def visitAugAssign(self, node): |
paul@0 | 1005 | self.set_lineno(node) |
paul@0 | 1006 | aug_node = wrap_aug(node.node) |
paul@0 | 1007 | self.visit(aug_node, "load") |
paul@0 | 1008 | self.visit(node.expr) |
paul@0 | 1009 | self.emit(self._augmented_opcode[node.op]) |
paul@0 | 1010 | self.visit(aug_node, "store") |
paul@0 | 1011 | |
paul@0 | 1012 | _augmented_opcode = { |
paul@0 | 1013 | '+=' : 'INPLACE_ADD', |
paul@0 | 1014 | '-=' : 'INPLACE_SUBTRACT', |
paul@0 | 1015 | '*=' : 'INPLACE_MULTIPLY', |
paul@0 | 1016 | '/=' : 'INPLACE_DIVIDE', |
paul@0 | 1017 | '//=': 'INPLACE_FLOOR_DIVIDE', |
paul@0 | 1018 | '%=' : 'INPLACE_MODULO', |
paul@0 | 1019 | '**=': 'INPLACE_POWER', |
paul@0 | 1020 | '>>=': 'INPLACE_RSHIFT', |
paul@0 | 1021 | '<<=': 'INPLACE_LSHIFT', |
paul@0 | 1022 | '&=' : 'INPLACE_AND', |
paul@0 | 1023 | '^=' : 'INPLACE_XOR', |
paul@0 | 1024 | '|=' : 'INPLACE_OR', |
paul@0 | 1025 | } |
paul@0 | 1026 | |
paul@0 | 1027 | def visitAugName(self, node, mode): |
paul@0 | 1028 | if mode == "load": |
paul@0 | 1029 | self.loadName(node.name) |
paul@0 | 1030 | elif mode == "store": |
paul@0 | 1031 | self.storeName(node.name) |
paul@0 | 1032 | |
paul@0 | 1033 | def visitAugGetattr(self, node, mode): |
paul@0 | 1034 | if mode == "load": |
paul@0 | 1035 | self.visit(node.expr) |
paul@0 | 1036 | self.emit('DUP_TOP') |
paul@0 | 1037 | self.emit('LOAD_ATTR', self.mangle(node.attrname)) |
paul@0 | 1038 | elif mode == "store": |
paul@0 | 1039 | self.emit('ROT_TWO') |
paul@0 | 1040 | self.emit('STORE_ATTR', self.mangle(node.attrname)) |
paul@0 | 1041 | |
paul@0 | 1042 | def visitAugSlice(self, node, mode): |
paul@0 | 1043 | if mode == "load": |
paul@0 | 1044 | self.visitSlice(node, 1) |
paul@0 | 1045 | elif mode == "store": |
paul@0 | 1046 | slice = 0 |
paul@0 | 1047 | if node.lower: |
paul@0 | 1048 | slice = slice | 1 |
paul@0 | 1049 | if node.upper: |
paul@0 | 1050 | slice = slice | 2 |
paul@0 | 1051 | if slice == 0: |
paul@0 | 1052 | self.emit('ROT_TWO') |
paul@0 | 1053 | elif slice == 3: |
paul@0 | 1054 | self.emit('ROT_FOUR') |
paul@0 | 1055 | else: |
paul@0 | 1056 | self.emit('ROT_THREE') |
paul@0 | 1057 | self.emit('STORE_SLICE+%d' % slice) |
paul@0 | 1058 | |
paul@0 | 1059 | def visitAugSubscript(self, node, mode): |
paul@0 | 1060 | if mode == "load": |
paul@0 | 1061 | self.visitSubscript(node, 1) |
paul@0 | 1062 | elif mode == "store": |
paul@0 | 1063 | self.emit('ROT_THREE') |
paul@0 | 1064 | self.emit('STORE_SUBSCR') |
paul@0 | 1065 | |
paul@0 | 1066 | def visitExec(self, node): |
paul@0 | 1067 | self.visit(node.expr) |
paul@0 | 1068 | if node.locals is None: |
paul@0 | 1069 | self.emit('LOAD_CONST', None) |
paul@0 | 1070 | else: |
paul@0 | 1071 | self.visit(node.locals) |
paul@0 | 1072 | if node.globals is None: |
paul@0 | 1073 | self.emit('DUP_TOP') |
paul@0 | 1074 | else: |
paul@0 | 1075 | self.visit(node.globals) |
paul@0 | 1076 | self.emit('EXEC_STMT') |
paul@0 | 1077 | |
paul@0 | 1078 | def visitCallFunc(self, node): |
paul@0 | 1079 | pos = 0 |
paul@0 | 1080 | kw = 0 |
paul@0 | 1081 | self.set_lineno(node) |
paul@0 | 1082 | self.visit(node.node) |
paul@0 | 1083 | for arg in node.args: |
paul@0 | 1084 | self.visit(arg) |
paul@0 | 1085 | if isinstance(arg, ast.Keyword): |
paul@0 | 1086 | kw = kw + 1 |
paul@0 | 1087 | else: |
paul@0 | 1088 | pos = pos + 1 |
paul@0 | 1089 | if node.star_args is not None: |
paul@0 | 1090 | self.visit(node.star_args) |
paul@0 | 1091 | if node.dstar_args is not None: |
paul@0 | 1092 | self.visit(node.dstar_args) |
paul@0 | 1093 | have_star = node.star_args is not None |
paul@0 | 1094 | have_dstar = node.dstar_args is not None |
paul@0 | 1095 | opcode = callfunc_opcode_info[have_star, have_dstar] |
paul@0 | 1096 | self.emit(opcode, kw << 8 | pos) |
paul@0 | 1097 | |
paul@0 | 1098 | def visitPrint(self, node, newline=0): |
paul@0 | 1099 | self.set_lineno(node) |
paul@0 | 1100 | if node.dest: |
paul@0 | 1101 | self.visit(node.dest) |
paul@0 | 1102 | for child in node.nodes: |
paul@0 | 1103 | if node.dest: |
paul@0 | 1104 | self.emit('DUP_TOP') |
paul@0 | 1105 | self.visit(child) |
paul@0 | 1106 | if node.dest: |
paul@0 | 1107 | self.emit('ROT_TWO') |
paul@0 | 1108 | self.emit('PRINT_ITEM_TO') |
paul@0 | 1109 | else: |
paul@0 | 1110 | self.emit('PRINT_ITEM') |
paul@0 | 1111 | if node.dest and not newline: |
paul@0 | 1112 | self.emit('POP_TOP') |
paul@0 | 1113 | |
paul@0 | 1114 | def visitPrintnl(self, node): |
paul@0 | 1115 | self.visitPrint(node, newline=1) |
paul@0 | 1116 | if node.dest: |
paul@0 | 1117 | self.emit('PRINT_NEWLINE_TO') |
paul@0 | 1118 | else: |
paul@0 | 1119 | self.emit('PRINT_NEWLINE') |
paul@0 | 1120 | |
paul@0 | 1121 | def visitReturn(self, node): |
paul@0 | 1122 | self.set_lineno(node) |
paul@0 | 1123 | self.visit(node.value) |
paul@0 | 1124 | self.emit('RETURN_VALUE') |
paul@0 | 1125 | |
paul@0 | 1126 | def visitYield(self, node): |
paul@0 | 1127 | self.set_lineno(node) |
paul@0 | 1128 | self.visit(node.value) |
paul@0 | 1129 | self.emit('YIELD_VALUE') |
paul@0 | 1130 | |
paul@0 | 1131 | # slice and subscript stuff |
paul@0 | 1132 | |
paul@0 | 1133 | def visitSlice(self, node, aug_flag=None): |
paul@0 | 1134 | # aug_flag is used by visitAugSlice |
paul@0 | 1135 | self.visit(node.expr) |
paul@0 | 1136 | slice = 0 |
paul@0 | 1137 | if node.lower: |
paul@0 | 1138 | self.visit(node.lower) |
paul@0 | 1139 | slice = slice | 1 |
paul@0 | 1140 | if node.upper: |
paul@0 | 1141 | self.visit(node.upper) |
paul@0 | 1142 | slice = slice | 2 |
paul@0 | 1143 | if aug_flag: |
paul@0 | 1144 | if slice == 0: |
paul@0 | 1145 | self.emit('DUP_TOP') |
paul@0 | 1146 | elif slice == 3: |
paul@0 | 1147 | self.emit('DUP_TOPX', 3) |
paul@0 | 1148 | else: |
paul@0 | 1149 | self.emit('DUP_TOPX', 2) |
paul@0 | 1150 | if node.flags == 'OP_APPLY': |
paul@0 | 1151 | self.emit('SLICE+%d' % slice) |
paul@0 | 1152 | elif node.flags == 'OP_ASSIGN': |
paul@0 | 1153 | self.emit('STORE_SLICE+%d' % slice) |
paul@0 | 1154 | elif node.flags == 'OP_DELETE': |
paul@0 | 1155 | self.emit('DELETE_SLICE+%d' % slice) |
paul@0 | 1156 | else: |
paul@0 | 1157 | print "weird slice", node.flags |
paul@0 | 1158 | raise |
paul@0 | 1159 | |
paul@0 | 1160 | def visitSubscript(self, node, aug_flag=None): |
paul@0 | 1161 | self.visit(node.expr) |
paul@0 | 1162 | for sub in node.subs: |
paul@0 | 1163 | self.visit(sub) |
paul@0 | 1164 | if len(node.subs) > 1: |
paul@0 | 1165 | self.emit('BUILD_TUPLE', len(node.subs)) |
paul@0 | 1166 | if aug_flag: |
paul@0 | 1167 | self.emit('DUP_TOPX', 2) |
paul@0 | 1168 | if node.flags == 'OP_APPLY': |
paul@0 | 1169 | self.emit('BINARY_SUBSCR') |
paul@0 | 1170 | elif node.flags == 'OP_ASSIGN': |
paul@0 | 1171 | self.emit('STORE_SUBSCR') |
paul@0 | 1172 | elif node.flags == 'OP_DELETE': |
paul@0 | 1173 | self.emit('DELETE_SUBSCR') |
paul@0 | 1174 | |
paul@0 | 1175 | # binary ops |
paul@0 | 1176 | |
paul@0 | 1177 | def binaryOp(self, node, op): |
paul@0 | 1178 | self.visit(node.left) |
paul@0 | 1179 | self.visit(node.right) |
paul@0 | 1180 | self.emit(op) |
paul@0 | 1181 | |
paul@0 | 1182 | def visitAdd(self, node): |
paul@0 | 1183 | return self.binaryOp(node, 'BINARY_ADD') |
paul@0 | 1184 | |
paul@0 | 1185 | def visitSub(self, node): |
paul@0 | 1186 | return self.binaryOp(node, 'BINARY_SUBTRACT') |
paul@0 | 1187 | |
paul@0 | 1188 | def visitMul(self, node): |
paul@0 | 1189 | return self.binaryOp(node, 'BINARY_MULTIPLY') |
paul@0 | 1190 | |
paul@0 | 1191 | def visitDiv(self, node): |
paul@0 | 1192 | return self.binaryOp(node, self._div_op) |
paul@0 | 1193 | |
paul@0 | 1194 | def visitFloorDiv(self, node): |
paul@0 | 1195 | return self.binaryOp(node, 'BINARY_FLOOR_DIVIDE') |
paul@0 | 1196 | |
paul@0 | 1197 | def visitMod(self, node): |
paul@0 | 1198 | return self.binaryOp(node, 'BINARY_MODULO') |
paul@0 | 1199 | |
paul@0 | 1200 | def visitPower(self, node): |
paul@0 | 1201 | return self.binaryOp(node, 'BINARY_POWER') |
paul@0 | 1202 | |
paul@0 | 1203 | def visitLeftShift(self, node): |
paul@0 | 1204 | return self.binaryOp(node, 'BINARY_LSHIFT') |
paul@0 | 1205 | |
paul@0 | 1206 | def visitRightShift(self, node): |
paul@0 | 1207 | return self.binaryOp(node, 'BINARY_RSHIFT') |
paul@0 | 1208 | |
paul@0 | 1209 | # unary ops |
paul@0 | 1210 | |
paul@0 | 1211 | def unaryOp(self, node, op): |
paul@0 | 1212 | self.visit(node.expr) |
paul@0 | 1213 | self.emit(op) |
paul@0 | 1214 | |
paul@0 | 1215 | def visitInvert(self, node): |
paul@0 | 1216 | return self.unaryOp(node, 'UNARY_INVERT') |
paul@0 | 1217 | |
paul@0 | 1218 | def visitUnarySub(self, node): |
paul@0 | 1219 | return self.unaryOp(node, 'UNARY_NEGATIVE') |
paul@0 | 1220 | |
paul@0 | 1221 | def visitUnaryAdd(self, node): |
paul@0 | 1222 | return self.unaryOp(node, 'UNARY_POSITIVE') |
paul@0 | 1223 | |
paul@0 | 1224 | def visitUnaryInvert(self, node): |
paul@0 | 1225 | return self.unaryOp(node, 'UNARY_INVERT') |
paul@0 | 1226 | |
paul@0 | 1227 | def visitNot(self, node): |
paul@0 | 1228 | return self.unaryOp(node, 'UNARY_NOT') |
paul@0 | 1229 | |
paul@0 | 1230 | def visitBackquote(self, node): |
paul@0 | 1231 | return self.unaryOp(node, 'UNARY_CONVERT') |
paul@0 | 1232 | |
paul@0 | 1233 | # bit ops |
paul@0 | 1234 | |
paul@0 | 1235 | def bitOp(self, nodes, op): |
paul@0 | 1236 | self.visit(nodes[0]) |
paul@0 | 1237 | for node in nodes[1:]: |
paul@0 | 1238 | self.visit(node) |
paul@0 | 1239 | self.emit(op) |
paul@0 | 1240 | |
paul@0 | 1241 | def visitBitand(self, node): |
paul@0 | 1242 | return self.bitOp(node.nodes, 'BINARY_AND') |
paul@0 | 1243 | |
paul@0 | 1244 | def visitBitor(self, node): |
paul@0 | 1245 | return self.bitOp(node.nodes, 'BINARY_OR') |
paul@0 | 1246 | |
paul@0 | 1247 | def visitBitxor(self, node): |
paul@0 | 1248 | return self.bitOp(node.nodes, 'BINARY_XOR') |
paul@0 | 1249 | |
paul@0 | 1250 | # object constructors |
paul@0 | 1251 | |
paul@0 | 1252 | def visitEllipsis(self, node): |
paul@0 | 1253 | self.emit('LOAD_CONST', Ellipsis) |
paul@0 | 1254 | |
paul@0 | 1255 | def visitTuple(self, node): |
paul@0 | 1256 | self.set_lineno(node) |
paul@0 | 1257 | for elt in node.nodes: |
paul@0 | 1258 | self.visit(elt) |
paul@0 | 1259 | self.emit('BUILD_TUPLE', len(node.nodes)) |
paul@0 | 1260 | |
paul@0 | 1261 | def visitList(self, node): |
paul@0 | 1262 | self.set_lineno(node) |
paul@0 | 1263 | for elt in node.nodes: |
paul@0 | 1264 | self.visit(elt) |
paul@0 | 1265 | self.emit('BUILD_LIST', len(node.nodes)) |
paul@0 | 1266 | |
paul@0 | 1267 | def visitSet(self, node): |
paul@0 | 1268 | self.set_lineno(node) |
paul@0 | 1269 | for elt in node.nodes: |
paul@0 | 1270 | self.visit(elt) |
paul@0 | 1271 | self.emit('BUILD_SET', len(node.nodes)) |
paul@0 | 1272 | |
paul@0 | 1273 | def visitSliceobj(self, node): |
paul@0 | 1274 | for child in node.nodes: |
paul@0 | 1275 | self.visit(child) |
paul@0 | 1276 | self.emit('BUILD_SLICE', len(node.nodes)) |
paul@0 | 1277 | |
paul@0 | 1278 | def visitDict(self, node): |
paul@0 | 1279 | self.set_lineno(node) |
paul@0 | 1280 | self.emit('BUILD_MAP', 0) |
paul@0 | 1281 | for k, v in node.items: |
paul@0 | 1282 | self.emit('DUP_TOP') |
paul@0 | 1283 | self.visit(k) |
paul@0 | 1284 | self.visit(v) |
paul@0 | 1285 | self.emit('ROT_THREE') |
paul@0 | 1286 | self.emit('STORE_SUBSCR') |
paul@0 | 1287 | |
paul@0 | 1288 | class NestedScopeMixin: |
paul@0 | 1289 | """Defines initClass() for nested scoping (Python 2.2-compatible)""" |
paul@0 | 1290 | def initClass(self): |
paul@0 | 1291 | self.__class__.NameFinder = LocalNameFinder |
paul@0 | 1292 | self.__class__.FunctionGen = FunctionCodeGenerator |
paul@0 | 1293 | self.__class__.ClassGen = ClassCodeGenerator |
paul@0 | 1294 | |
paul@0 | 1295 | class ModuleCodeGenerator(NestedScopeMixin, CodeGenerator): |
paul@0 | 1296 | __super_init = CodeGenerator.__init__ |
paul@0 | 1297 | |
paul@0 | 1298 | scopes = None |
paul@0 | 1299 | |
paul@0 | 1300 | def __init__(self, tree): |
paul@0 | 1301 | self.graph = pyassem.PyFlowGraph("<module>", tree.filename) |
paul@0 | 1302 | self.futures = future.find_futures(tree) |
paul@0 | 1303 | self.__super_init() |
paul@0 | 1304 | walk(tree, self) |
paul@0 | 1305 | |
paul@0 | 1306 | def get_module(self): |
paul@0 | 1307 | return self |
paul@0 | 1308 | |
paul@0 | 1309 | class ExpressionCodeGenerator(NestedScopeMixin, CodeGenerator): |
paul@0 | 1310 | __super_init = CodeGenerator.__init__ |
paul@0 | 1311 | |
paul@0 | 1312 | scopes = None |
paul@0 | 1313 | futures = () |
paul@0 | 1314 | |
paul@0 | 1315 | def __init__(self, tree): |
paul@0 | 1316 | self.graph = pyassem.PyFlowGraph("<expression>", tree.filename) |
paul@0 | 1317 | self.__super_init() |
paul@0 | 1318 | walk(tree, self) |
paul@0 | 1319 | |
paul@0 | 1320 | def get_module(self): |
paul@0 | 1321 | return self |
paul@0 | 1322 | |
paul@0 | 1323 | class InteractiveCodeGenerator(NestedScopeMixin, CodeGenerator): |
paul@0 | 1324 | |
paul@0 | 1325 | __super_init = CodeGenerator.__init__ |
paul@0 | 1326 | |
paul@0 | 1327 | scopes = None |
paul@0 | 1328 | futures = () |
paul@0 | 1329 | |
paul@0 | 1330 | def __init__(self, tree): |
paul@0 | 1331 | self.graph = pyassem.PyFlowGraph("<interactive>", tree.filename) |
paul@0 | 1332 | self.__super_init() |
paul@0 | 1333 | self.set_lineno(tree) |
paul@0 | 1334 | walk(tree, self) |
paul@0 | 1335 | self.emit('RETURN_VALUE') |
paul@0 | 1336 | |
paul@0 | 1337 | def get_module(self): |
paul@0 | 1338 | return self |
paul@0 | 1339 | |
paul@0 | 1340 | def visitDiscard(self, node): |
paul@0 | 1341 | # XXX Discard means it's an expression. Perhaps this is a bad |
paul@0 | 1342 | # name. |
paul@0 | 1343 | self.visit(node.expr) |
paul@0 | 1344 | self.emit('PRINT_EXPR') |
paul@0 | 1345 | |
paul@0 | 1346 | class AbstractFunctionCode: |
paul@0 | 1347 | optimized = 1 |
paul@0 | 1348 | lambdaCount = 0 |
paul@0 | 1349 | |
paul@0 | 1350 | def __init__(self, func, scopes, isLambda, class_name, mod): |
paul@0 | 1351 | self.class_name = class_name |
paul@0 | 1352 | self.module = mod |
paul@0 | 1353 | if isLambda: |
paul@0 | 1354 | klass = FunctionCodeGenerator |
paul@0 | 1355 | name = "<lambda.%d>" % klass.lambdaCount |
paul@0 | 1356 | klass.lambdaCount = klass.lambdaCount + 1 |
paul@0 | 1357 | else: |
paul@0 | 1358 | name = func.name |
paul@0 | 1359 | |
paul@0 | 1360 | args, hasTupleArg = generateArgList(func.argnames) |
paul@0 | 1361 | self.graph = pyassem.PyFlowGraph(name, func.filename, args, |
paul@0 | 1362 | optimized=1) |
paul@0 | 1363 | self.isLambda = isLambda |
paul@0 | 1364 | self.super_init() |
paul@0 | 1365 | |
paul@0 | 1366 | if not isLambda and func.doc: |
paul@0 | 1367 | self.setDocstring(func.doc) |
paul@0 | 1368 | |
paul@0 | 1369 | lnf = walk(func.code, self.NameFinder(args), verbose=0) |
paul@0 | 1370 | self.locals.push(lnf.getLocals()) |
paul@0 | 1371 | if func.varargs: |
paul@0 | 1372 | self.graph.setFlag(CO_VARARGS) |
paul@0 | 1373 | if func.kwargs: |
paul@0 | 1374 | self.graph.setFlag(CO_VARKEYWORDS) |
paul@0 | 1375 | self.set_lineno(func) |
paul@0 | 1376 | if hasTupleArg: |
paul@0 | 1377 | self.generateArgUnpack(func.argnames) |
paul@0 | 1378 | |
paul@0 | 1379 | def get_module(self): |
paul@0 | 1380 | return self.module |
paul@0 | 1381 | |
paul@0 | 1382 | def finish(self): |
paul@0 | 1383 | self.graph.startExitBlock() |
paul@0 | 1384 | if not self.isLambda: |
paul@0 | 1385 | self.emit('LOAD_CONST', None) |
paul@0 | 1386 | self.emit('RETURN_VALUE') |
paul@0 | 1387 | |
paul@0 | 1388 | def generateArgUnpack(self, args): |
paul@0 | 1389 | for i in range(len(args)): |
paul@0 | 1390 | arg = args[i] |
paul@0 | 1391 | if isinstance(arg, tuple): |
paul@0 | 1392 | self.emit('LOAD_FAST', '.%d' % (i * 2)) |
paul@0 | 1393 | self.unpackSequence(arg) |
paul@0 | 1394 | |
paul@0 | 1395 | def unpackSequence(self, tup): |
paul@0 | 1396 | if VERSION > 1: |
paul@0 | 1397 | self.emit('UNPACK_SEQUENCE', len(tup)) |
paul@0 | 1398 | else: |
paul@0 | 1399 | self.emit('UNPACK_TUPLE', len(tup)) |
paul@0 | 1400 | for elt in tup: |
paul@0 | 1401 | if isinstance(elt, tuple): |
paul@0 | 1402 | self.unpackSequence(elt) |
paul@0 | 1403 | else: |
paul@0 | 1404 | self._nameOp('STORE', elt) |
paul@0 | 1405 | |
paul@0 | 1406 | unpackTuple = unpackSequence |
paul@0 | 1407 | |
paul@0 | 1408 | class FunctionCodeGenerator(NestedScopeMixin, AbstractFunctionCode, |
paul@0 | 1409 | CodeGenerator): |
paul@0 | 1410 | super_init = CodeGenerator.__init__ # call be other init |
paul@0 | 1411 | scopes = None |
paul@0 | 1412 | |
paul@0 | 1413 | __super_init = AbstractFunctionCode.__init__ |
paul@0 | 1414 | |
paul@0 | 1415 | def __init__(self, func, scopes, isLambda, class_name, mod): |
paul@0 | 1416 | self.scopes = scopes |
paul@0 | 1417 | self.scope = scopes[func] |
paul@0 | 1418 | self.__super_init(func, scopes, isLambda, class_name, mod) |
paul@0 | 1419 | self.graph.setFreeVars(self.scope.get_free_vars()) |
paul@0 | 1420 | self.graph.setCellVars(self.scope.get_cell_vars()) |
paul@0 | 1421 | if self.scope.generator is not None: |
paul@0 | 1422 | self.graph.setFlag(CO_GENERATOR) |
paul@0 | 1423 | |
paul@0 | 1424 | class GenExprCodeGenerator(NestedScopeMixin, AbstractFunctionCode, |
paul@0 | 1425 | CodeGenerator): |
paul@0 | 1426 | super_init = CodeGenerator.__init__ # call be other init |
paul@0 | 1427 | scopes = None |
paul@0 | 1428 | |
paul@0 | 1429 | __super_init = AbstractFunctionCode.__init__ |
paul@0 | 1430 | |
paul@0 | 1431 | def __init__(self, gexp, scopes, class_name, mod): |
paul@0 | 1432 | self.scopes = scopes |
paul@0 | 1433 | self.scope = scopes[gexp] |
paul@0 | 1434 | self.__super_init(gexp, scopes, 1, class_name, mod) |
paul@0 | 1435 | self.graph.setFreeVars(self.scope.get_free_vars()) |
paul@0 | 1436 | self.graph.setCellVars(self.scope.get_cell_vars()) |
paul@0 | 1437 | self.graph.setFlag(CO_GENERATOR) |
paul@0 | 1438 | |
paul@0 | 1439 | class AbstractClassCode: |
paul@0 | 1440 | |
paul@0 | 1441 | def __init__(self, klass, scopes, module): |
paul@0 | 1442 | self.class_name = klass.name |
paul@0 | 1443 | self.module = module |
paul@0 | 1444 | self.graph = pyassem.PyFlowGraph(klass.name, klass.filename, |
paul@0 | 1445 | optimized=0, klass=1) |
paul@0 | 1446 | self.super_init() |
paul@0 | 1447 | lnf = walk(klass.code, self.NameFinder(), verbose=0) |
paul@0 | 1448 | self.locals.push(lnf.getLocals()) |
paul@0 | 1449 | self.graph.setFlag(CO_NEWLOCALS) |
paul@0 | 1450 | if klass.doc: |
paul@0 | 1451 | self.setDocstring(klass.doc) |
paul@0 | 1452 | |
paul@0 | 1453 | def get_module(self): |
paul@0 | 1454 | return self.module |
paul@0 | 1455 | |
paul@0 | 1456 | def finish(self): |
paul@0 | 1457 | self.graph.startExitBlock() |
paul@0 | 1458 | self.emit('LOAD_LOCALS') |
paul@0 | 1459 | self.emit('RETURN_VALUE') |
paul@0 | 1460 | |
paul@0 | 1461 | class ClassCodeGenerator(NestedScopeMixin, AbstractClassCode, CodeGenerator): |
paul@0 | 1462 | super_init = CodeGenerator.__init__ |
paul@0 | 1463 | scopes = None |
paul@0 | 1464 | |
paul@0 | 1465 | __super_init = AbstractClassCode.__init__ |
paul@0 | 1466 | |
paul@0 | 1467 | def __init__(self, klass, scopes, module): |
paul@0 | 1468 | self.scopes = scopes |
paul@0 | 1469 | self.scope = scopes[klass] |
paul@0 | 1470 | self.__super_init(klass, scopes, module) |
paul@0 | 1471 | self.graph.setFreeVars(self.scope.get_free_vars()) |
paul@0 | 1472 | self.graph.setCellVars(self.scope.get_cell_vars()) |
paul@0 | 1473 | self.set_lineno(klass) |
paul@0 | 1474 | self.emit("LOAD_GLOBAL", "__name__") |
paul@0 | 1475 | self.storeName("__module__") |
paul@0 | 1476 | if klass.doc: |
paul@0 | 1477 | self.emit("LOAD_CONST", klass.doc) |
paul@0 | 1478 | self.storeName('__doc__') |
paul@0 | 1479 | |
paul@0 | 1480 | def generateArgList(arglist): |
paul@0 | 1481 | """Generate an arg list marking TupleArgs""" |
paul@0 | 1482 | args = [] |
paul@0 | 1483 | extra = [] |
paul@0 | 1484 | count = 0 |
paul@0 | 1485 | for i in range(len(arglist)): |
paul@0 | 1486 | elt = arglist[i] |
paul@0 | 1487 | if isinstance(elt, str): |
paul@0 | 1488 | args.append(elt) |
paul@0 | 1489 | elif isinstance(elt, tuple): |
paul@0 | 1490 | args.append(TupleArg(i * 2, elt)) |
paul@0 | 1491 | extra.extend(misc.flatten(elt)) |
paul@0 | 1492 | count = count + 1 |
paul@0 | 1493 | else: |
paul@0 | 1494 | raise ValueError, "unexpect argument type:", elt |
paul@0 | 1495 | return args + extra, count |
paul@0 | 1496 | |
paul@0 | 1497 | def findOp(node): |
paul@0 | 1498 | """Find the op (DELETE, LOAD, STORE) in an AssTuple tree""" |
paul@0 | 1499 | v = OpFinder() |
paul@0 | 1500 | walk(node, v, verbose=0) |
paul@0 | 1501 | return v.op |
paul@0 | 1502 | |
paul@0 | 1503 | class OpFinder: |
paul@0 | 1504 | def __init__(self): |
paul@0 | 1505 | self.op = None |
paul@0 | 1506 | def visitAssName(self, node): |
paul@0 | 1507 | if self.op is None: |
paul@0 | 1508 | self.op = node.flags |
paul@0 | 1509 | elif self.op != node.flags: |
paul@0 | 1510 | raise ValueError, "mixed ops in stmt" |
paul@0 | 1511 | visitAssAttr = visitAssName |
paul@0 | 1512 | visitSubscript = visitAssName |
paul@0 | 1513 | |
paul@0 | 1514 | class Delegator: |
paul@0 | 1515 | """Base class to support delegation for augmented assignment nodes |
paul@0 | 1516 | |
paul@0 | 1517 | To generator code for augmented assignments, we use the following |
paul@0 | 1518 | wrapper classes. In visitAugAssign, the left-hand expression node |
paul@0 | 1519 | is visited twice. The first time the visit uses the normal method |
paul@0 | 1520 | for that node . The second time the visit uses a different method |
paul@0 | 1521 | that generates the appropriate code to perform the assignment. |
paul@0 | 1522 | These delegator classes wrap the original AST nodes in order to |
paul@0 | 1523 | support the variant visit methods. |
paul@0 | 1524 | """ |
paul@0 | 1525 | def __init__(self, obj): |
paul@0 | 1526 | self.obj = obj |
paul@0 | 1527 | |
paul@0 | 1528 | def __getattr__(self, attr): |
paul@0 | 1529 | return getattr(self.obj, attr) |
paul@0 | 1530 | |
paul@0 | 1531 | class AugGetattr(Delegator): |
paul@0 | 1532 | pass |
paul@0 | 1533 | |
paul@0 | 1534 | class AugName(Delegator): |
paul@0 | 1535 | pass |
paul@0 | 1536 | |
paul@0 | 1537 | class AugSlice(Delegator): |
paul@0 | 1538 | pass |
paul@0 | 1539 | |
paul@0 | 1540 | class AugSubscript(Delegator): |
paul@0 | 1541 | pass |
paul@0 | 1542 | |
paul@0 | 1543 | wrapper = { |
paul@0 | 1544 | ast.Getattr: AugGetattr, |
paul@0 | 1545 | ast.Name: AugName, |
paul@0 | 1546 | ast.Slice: AugSlice, |
paul@0 | 1547 | ast.Subscript: AugSubscript, |
paul@0 | 1548 | } |
paul@0 | 1549 | |
paul@0 | 1550 | def wrap_aug(node): |
paul@0 | 1551 | return wrapper[node.__class__](node) |
paul@0 | 1552 | |
paul@0 | 1553 | if __name__ == "__main__": |
paul@0 | 1554 | for file in sys.argv[1:]: |
paul@0 | 1555 | compileFile(file) |