blob: a73e6b37d10c34299f2bd487255d77eaa666ecdf [file] [log] [blame]
Georg Brandl9afde1c2007-11-01 20:32:30 +00001:mod:`dis` --- Disassembler for Python bytecode
2===============================================
Georg Brandl116aa622007-08-15 14:28:22 +00003
4.. module:: dis
Georg Brandl9afde1c2007-11-01 20:32:30 +00005 :synopsis: Disassembler for Python bytecode.
Georg Brandl116aa622007-08-15 14:28:22 +00006
7
Georg Brandl71515ca2009-05-17 12:29:12 +00008The :mod:`dis` module supports the analysis of Python :term:`bytecode` by
9disassembling it. Since there is no Python assembler, this module defines the
10Python assembly language. The Python bytecode which this module takes as an
11input is defined in the file :file:`Include/opcode.h` and used by the compiler
12and the interpreter.
Georg Brandl116aa622007-08-15 14:28:22 +000013
14Example: Given the function :func:`myfunc`::
15
16 def myfunc(alist):
17 return len(alist)
18
19the following command can be used to get the disassembly of :func:`myfunc`::
20
21 >>> dis.dis(myfunc)
22 2 0 LOAD_GLOBAL 0 (len)
23 3 LOAD_FAST 0 (alist)
24 6 CALL_FUNCTION 1
25 9 RETURN_VALUE
26
27(The "2" is a line number).
28
29The :mod:`dis` module defines the following functions and constants:
30
31
Georg Brandlc2a4f4f2009-04-10 09:03:43 +000032.. function:: dis(x=None)
Georg Brandl116aa622007-08-15 14:28:22 +000033
Georg Brandlc2a4f4f2009-04-10 09:03:43 +000034 Disassemble the *x* object. *x* can denote either a module, a
Georg Brandl116aa622007-08-15 14:28:22 +000035 class, a method, a function, or a code object. For a module, it disassembles
36 all functions. For a class, it disassembles all methods. For a single code
Georg Brandl9afde1c2007-11-01 20:32:30 +000037 sequence, it prints one line per bytecode instruction. If no object is
Georg Brandl116aa622007-08-15 14:28:22 +000038 provided, it disassembles the last traceback.
39
40
Georg Brandlc2a4f4f2009-04-10 09:03:43 +000041.. function:: distb(tb=None)
Georg Brandl116aa622007-08-15 14:28:22 +000042
43 Disassembles the top-of-stack function of a traceback, using the last traceback
44 if none was passed. The instruction causing the exception is indicated.
45
46
Georg Brandlc2a4f4f2009-04-10 09:03:43 +000047.. function:: disassemble(code, lasti=-1)
48 disco(code, lasti=-1)
Georg Brandl116aa622007-08-15 14:28:22 +000049
50 Disassembles a code object, indicating the last instruction if *lasti* was
51 provided. The output is divided in the following columns:
52
53 #. the line number, for the first instruction of each line
54 #. the current instruction, indicated as ``-->``,
55 #. a labelled instruction, indicated with ``>>``,
56 #. the address of the instruction,
57 #. the operation code name,
58 #. operation parameters, and
59 #. interpretation of the parameters in parentheses.
60
61 The parameter interpretation recognizes local and global variable names,
62 constant values, branch targets, and compare operators.
63
64
Benjamin Peterson75edad02009-01-01 15:05:06 +000065.. function:: findlinestarts(code)
66
67 This generator function uses the ``co_firstlineno`` and ``co_lnotab``
68 attributes of the code object *code* to find the offsets which are starts of
69 lines in the source code. They are generated as ``(offset, lineno)`` pairs.
70
71
72.. function:: findlabels(code)
73
74 Detect all offsets in the code object *code* which are jump targets, and
75 return a list of these offsets.
Georg Brandl48310cd2009-01-03 21:18:54 +000076
77
Georg Brandl116aa622007-08-15 14:28:22 +000078.. data:: opname
79
Georg Brandl9afde1c2007-11-01 20:32:30 +000080 Sequence of operation names, indexable using the bytecode.
Georg Brandl116aa622007-08-15 14:28:22 +000081
82
83.. data:: opmap
84
Georg Brandl9afde1c2007-11-01 20:32:30 +000085 Dictionary mapping bytecodes to operation names.
Georg Brandl116aa622007-08-15 14:28:22 +000086
87
88.. data:: cmp_op
89
90 Sequence of all compare operation names.
91
92
93.. data:: hasconst
94
Georg Brandl9afde1c2007-11-01 20:32:30 +000095 Sequence of bytecodes that have a constant parameter.
Georg Brandl116aa622007-08-15 14:28:22 +000096
97
98.. data:: hasfree
99
Georg Brandl9afde1c2007-11-01 20:32:30 +0000100 Sequence of bytecodes that access a free variable.
Georg Brandl116aa622007-08-15 14:28:22 +0000101
102
103.. data:: hasname
104
Georg Brandl9afde1c2007-11-01 20:32:30 +0000105 Sequence of bytecodes that access an attribute by name.
Georg Brandl116aa622007-08-15 14:28:22 +0000106
107
108.. data:: hasjrel
109
Georg Brandl9afde1c2007-11-01 20:32:30 +0000110 Sequence of bytecodes that have a relative jump target.
Georg Brandl116aa622007-08-15 14:28:22 +0000111
112
113.. data:: hasjabs
114
Georg Brandl9afde1c2007-11-01 20:32:30 +0000115 Sequence of bytecodes that have an absolute jump target.
Georg Brandl116aa622007-08-15 14:28:22 +0000116
117
118.. data:: haslocal
119
Georg Brandl9afde1c2007-11-01 20:32:30 +0000120 Sequence of bytecodes that access a local variable.
Georg Brandl116aa622007-08-15 14:28:22 +0000121
122
123.. data:: hascompare
124
Georg Brandl9afde1c2007-11-01 20:32:30 +0000125 Sequence of bytecodes of Boolean operations.
Georg Brandl116aa622007-08-15 14:28:22 +0000126
127
128.. _bytecodes:
129
Georg Brandl9afde1c2007-11-01 20:32:30 +0000130Python Bytecode Instructions
131----------------------------
Georg Brandl116aa622007-08-15 14:28:22 +0000132
Georg Brandl9afde1c2007-11-01 20:32:30 +0000133The Python compiler currently generates the following bytecode instructions.
Georg Brandl116aa622007-08-15 14:28:22 +0000134
135
136.. opcode:: STOP_CODE ()
137
138 Indicates end-of-code to the compiler, not used by the interpreter.
139
140
141.. opcode:: NOP ()
142
143 Do nothing code. Used as a placeholder by the bytecode optimizer.
144
145
146.. opcode:: POP_TOP ()
147
148 Removes the top-of-stack (TOS) item.
149
150
151.. opcode:: ROT_TWO ()
152
153 Swaps the two top-most stack items.
154
155
156.. opcode:: ROT_THREE ()
157
158 Lifts second and third stack item one position up, moves top down to position
159 three.
160
161
162.. opcode:: ROT_FOUR ()
163
164 Lifts second, third and forth stack item one position up, moves top down to
165 position four.
166
167
168.. opcode:: DUP_TOP ()
169
170 Duplicates the reference on top of the stack.
171
172Unary Operations take the top of the stack, apply the operation, and push the
173result back on the stack.
174
175
176.. opcode:: UNARY_POSITIVE ()
177
178 Implements ``TOS = +TOS``.
179
180
181.. opcode:: UNARY_NEGATIVE ()
182
183 Implements ``TOS = -TOS``.
184
185
186.. opcode:: UNARY_NOT ()
187
188 Implements ``TOS = not TOS``.
189
190
191.. opcode:: UNARY_INVERT ()
192
193 Implements ``TOS = ~TOS``.
194
195
196.. opcode:: GET_ITER ()
197
198 Implements ``TOS = iter(TOS)``.
199
200Binary operations remove the top of the stack (TOS) and the second top-most
201stack item (TOS1) from the stack. They perform the operation, and put the
202result back on the stack.
203
204
205.. opcode:: BINARY_POWER ()
206
207 Implements ``TOS = TOS1 ** TOS``.
208
209
210.. opcode:: BINARY_MULTIPLY ()
211
212 Implements ``TOS = TOS1 * TOS``.
213
214
215.. opcode:: BINARY_FLOOR_DIVIDE ()
216
217 Implements ``TOS = TOS1 // TOS``.
218
219
220.. opcode:: BINARY_TRUE_DIVIDE ()
221
Ezio Melotti5f7dde12010-01-05 08:38:30 +0000222 Implements ``TOS = TOS1 / TOS``.
Georg Brandl116aa622007-08-15 14:28:22 +0000223
224
225.. opcode:: BINARY_MODULO ()
226
227 Implements ``TOS = TOS1 % TOS``.
228
229
230.. opcode:: BINARY_ADD ()
231
232 Implements ``TOS = TOS1 + TOS``.
233
234
235.. opcode:: BINARY_SUBTRACT ()
236
237 Implements ``TOS = TOS1 - TOS``.
238
239
240.. opcode:: BINARY_SUBSCR ()
241
242 Implements ``TOS = TOS1[TOS]``.
243
244
245.. opcode:: BINARY_LSHIFT ()
246
247 Implements ``TOS = TOS1 << TOS``.
248
249
250.. opcode:: BINARY_RSHIFT ()
251
252 Implements ``TOS = TOS1 >> TOS``.
253
254
255.. opcode:: BINARY_AND ()
256
257 Implements ``TOS = TOS1 & TOS``.
258
259
260.. opcode:: BINARY_XOR ()
261
262 Implements ``TOS = TOS1 ^ TOS``.
263
264
265.. opcode:: BINARY_OR ()
266
267 Implements ``TOS = TOS1 | TOS``.
268
269In-place operations are like binary operations, in that they remove TOS and
270TOS1, and push the result back on the stack, but the operation is done in-place
271when TOS1 supports it, and the resulting TOS may be (but does not have to be)
272the original TOS1.
273
274
275.. opcode:: INPLACE_POWER ()
276
277 Implements in-place ``TOS = TOS1 ** TOS``.
278
279
280.. opcode:: INPLACE_MULTIPLY ()
281
282 Implements in-place ``TOS = TOS1 * TOS``.
283
284
285.. opcode:: INPLACE_FLOOR_DIVIDE ()
286
287 Implements in-place ``TOS = TOS1 // TOS``.
288
289
290.. opcode:: INPLACE_TRUE_DIVIDE ()
291
Ezio Melotti5f7dde12010-01-05 08:38:30 +0000292 Implements in-place ``TOS = TOS1 / TOS``.
Georg Brandl116aa622007-08-15 14:28:22 +0000293
294
295.. opcode:: INPLACE_MODULO ()
296
297 Implements in-place ``TOS = TOS1 % TOS``.
298
299
300.. opcode:: INPLACE_ADD ()
301
302 Implements in-place ``TOS = TOS1 + TOS``.
303
304
305.. opcode:: INPLACE_SUBTRACT ()
306
307 Implements in-place ``TOS = TOS1 - TOS``.
308
309
310.. opcode:: INPLACE_LSHIFT ()
311
312 Implements in-place ``TOS = TOS1 << TOS``.
313
314
315.. opcode:: INPLACE_RSHIFT ()
316
317 Implements in-place ``TOS = TOS1 >> TOS``.
318
319
320.. opcode:: INPLACE_AND ()
321
322 Implements in-place ``TOS = TOS1 & TOS``.
323
324
325.. opcode:: INPLACE_XOR ()
326
327 Implements in-place ``TOS = TOS1 ^ TOS``.
328
329
330.. opcode:: INPLACE_OR ()
331
332 Implements in-place ``TOS = TOS1 | TOS``.
333
Georg Brandl116aa622007-08-15 14:28:22 +0000334
335.. opcode:: STORE_SUBSCR ()
336
337 Implements ``TOS1[TOS] = TOS2``.
338
339
340.. opcode:: DELETE_SUBSCR ()
341
342 Implements ``del TOS1[TOS]``.
343
344Miscellaneous opcodes.
345
346
347.. opcode:: PRINT_EXPR ()
348
349 Implements the expression statement for the interactive mode. TOS is removed
350 from the stack and printed. In non-interactive mode, an expression statement is
351 terminated with ``POP_STACK``.
352
353
354.. opcode:: BREAK_LOOP ()
355
356 Terminates a loop due to a :keyword:`break` statement.
357
358
359.. opcode:: CONTINUE_LOOP (target)
360
361 Continues a loop due to a :keyword:`continue` statement. *target* is the
362 address to jump to (which should be a ``FOR_ITER`` instruction).
363
364
Antoine Pitrouf289ae62008-12-18 11:06:25 +0000365.. opcode:: SET_ADD (i)
Georg Brandl116aa622007-08-15 14:28:22 +0000366
Antoine Pitrouf289ae62008-12-18 11:06:25 +0000367 Calls ``set.add(TOS1[-i], TOS)``. Used to implement set comprehensions.
Georg Brandl116aa622007-08-15 14:28:22 +0000368
369
Antoine Pitrouf289ae62008-12-18 11:06:25 +0000370.. opcode:: LIST_APPEND (i)
Georg Brandl116aa622007-08-15 14:28:22 +0000371
Antoine Pitrouf289ae62008-12-18 11:06:25 +0000372 Calls ``list.append(TOS[-i], TOS)``. Used to implement list comprehensions.
373
374
375.. opcode:: MAP_ADD (i)
376
377 Calls ``dict.setitem(TOS1[-i], TOS, TOS1)``. Used to implement dict
378 comprehensions.
379
380
381For all of the SET_ADD, LIST_APPEND and MAP_ADD instructions, while the
382added value or key/value pair is popped off, the container object remains on
383the stack so that it is available for further iterations of the loop.
Georg Brandl116aa622007-08-15 14:28:22 +0000384
385
Georg Brandl116aa622007-08-15 14:28:22 +0000386.. opcode:: RETURN_VALUE ()
387
388 Returns with TOS to the caller of the function.
389
390
391.. opcode:: YIELD_VALUE ()
392
Georg Brandl9afde1c2007-11-01 20:32:30 +0000393 Pops ``TOS`` and yields it from a :term:`generator`.
Georg Brandl116aa622007-08-15 14:28:22 +0000394
395
396.. opcode:: IMPORT_STAR ()
397
398 Loads all symbols not starting with ``'_'`` directly from the module TOS to the
399 local namespace. The module is popped after loading all names. This opcode
400 implements ``from module import *``.
401
402
403.. opcode:: POP_BLOCK ()
404
405 Removes one block from the block stack. Per frame, there is a stack of blocks,
406 denoting nested loops, try statements, and such.
407
408
Benjamin Petersoneec3d712008-06-11 15:59:43 +0000409.. opcode:: POP_EXCEPT ()
410
411 Removes one block from the block stack. The popped block must be an exception
412 handler block, as implicitly created when entering an except handler.
413 In addition to popping extraneous values from the frame stack, the
414 last three popped values are used to restore the exception state.
415
416
Georg Brandl116aa622007-08-15 14:28:22 +0000417.. opcode:: END_FINALLY ()
418
419 Terminates a :keyword:`finally` clause. The interpreter recalls whether the
420 exception has to be re-raised, or whether the function returns, and continues
421 with the outer-next block.
422
423
Benjamin Peterson69164c72008-07-03 14:45:20 +0000424.. opcode:: LOAD_BUILD_CLASS ()
Georg Brandl116aa622007-08-15 14:28:22 +0000425
Georg Brandl5ac22302008-07-20 21:39:03 +0000426 Pushes :func:`builtins.__build_class__` onto the stack. It is later called
Benjamin Petersonaac8fd32008-07-20 22:02:26 +0000427 by ``CALL_FUNCTION`` to construct a class.
Georg Brandl116aa622007-08-15 14:28:22 +0000428
Guido van Rossum04110fb2007-08-24 16:32:05 +0000429
430.. opcode:: WITH_CLEANUP ()
431
Benjamin Petersoneec3d712008-06-11 15:59:43 +0000432 Cleans up the stack when a :keyword:`with` statement block exits. TOS is
433 the context manager's :meth:`__exit__` bound method. Below TOS are 1--3
434 values indicating how/why the finally clause was entered:
Guido van Rossum04110fb2007-08-24 16:32:05 +0000435
Benjamin Petersoneec3d712008-06-11 15:59:43 +0000436 * SECOND = ``None``
437 * (SECOND, THIRD) = (``WHY_{RETURN,CONTINUE}``), retval
438 * SECOND = ``WHY_*``; no retval below it
439 * (SECOND, THIRD, FOURTH) = exc_info()
Guido van Rossum04110fb2007-08-24 16:32:05 +0000440
Benjamin Petersoneec3d712008-06-11 15:59:43 +0000441 In the last case, ``TOS(SECOND, THIRD, FOURTH)`` is called, otherwise
442 ``TOS(None, None, None)``. In addition, TOS is removed from the stack.
Guido van Rossum04110fb2007-08-24 16:32:05 +0000443
Benjamin Petersoneec3d712008-06-11 15:59:43 +0000444 If the stack represents an exception, *and* the function call returns
445 a 'true' value, this information is "zapped" and replaced with a single
446 ``WHY_SILENCED`` to prevent ``END_FINALLY`` from re-raising the exception.
447 (But non-local gotos will still be resumed.)
Guido van Rossum04110fb2007-08-24 16:32:05 +0000448
Georg Brandl9afde1c2007-11-01 20:32:30 +0000449 .. XXX explain the WHY stuff!
450
Guido van Rossum04110fb2007-08-24 16:32:05 +0000451
Georg Brandl5ac22302008-07-20 21:39:03 +0000452.. opcode:: STORE_LOCALS
453
454 Pops TOS from the stack and stores it as the current frame's ``f_locals``.
455 This is used in class construction.
456
457
Georg Brandl116aa622007-08-15 14:28:22 +0000458All of the following opcodes expect arguments. An argument is two bytes, with
459the more significant byte last.
460
Georg Brandl116aa622007-08-15 14:28:22 +0000461.. opcode:: STORE_NAME (namei)
462
463 Implements ``name = TOS``. *namei* is the index of *name* in the attribute
Christian Heimes8640e742008-02-23 16:23:06 +0000464 :attr:`co_names` of the code object. The compiler tries to use ``STORE_FAST``
Georg Brandl116aa622007-08-15 14:28:22 +0000465 or ``STORE_GLOBAL`` if possible.
466
467
468.. opcode:: DELETE_NAME (namei)
469
470 Implements ``del name``, where *namei* is the index into :attr:`co_names`
471 attribute of the code object.
472
473
474.. opcode:: UNPACK_SEQUENCE (count)
475
476 Unpacks TOS into *count* individual values, which are put onto the stack
477 right-to-left.
478
Georg Brandl116aa622007-08-15 14:28:22 +0000479
Georg Brandl5ac22302008-07-20 21:39:03 +0000480.. opcode:: UNPACK_EX (counts)
481
482 Implements assignment with a starred target: Unpacks an iterable in TOS into
483 individual values, where the total number of values can be smaller than the
484 number of items in the iterable: one the new values will be a list of all
485 leftover items.
486
487 The low byte of *counts* is the number of values before the list value, the
488 high byte of *counts* the number of values after it. The resulting values
489 are put onto the stack right-to-left.
Georg Brandl48310cd2009-01-03 21:18:54 +0000490
Georg Brandl5ac22302008-07-20 21:39:03 +0000491
Georg Brandl116aa622007-08-15 14:28:22 +0000492.. opcode:: DUP_TOPX (count)
493
494 Duplicate *count* items, keeping them in the same order. Due to implementation
495 limits, *count* should be between 1 and 5 inclusive.
496
497
498.. opcode:: STORE_ATTR (namei)
499
500 Implements ``TOS.name = TOS1``, where *namei* is the index of name in
501 :attr:`co_names`.
502
503
504.. opcode:: DELETE_ATTR (namei)
505
506 Implements ``del TOS.name``, using *namei* as index into :attr:`co_names`.
507
508
509.. opcode:: STORE_GLOBAL (namei)
510
511 Works as ``STORE_NAME``, but stores the name as a global.
512
513
514.. opcode:: DELETE_GLOBAL (namei)
515
516 Works as ``DELETE_NAME``, but deletes a global name.
517
Georg Brandl116aa622007-08-15 14:28:22 +0000518
519.. opcode:: LOAD_CONST (consti)
520
521 Pushes ``co_consts[consti]`` onto the stack.
522
523
524.. opcode:: LOAD_NAME (namei)
525
526 Pushes the value associated with ``co_names[namei]`` onto the stack.
527
528
529.. opcode:: BUILD_TUPLE (count)
530
531 Creates a tuple consuming *count* items from the stack, and pushes the resulting
532 tuple onto the stack.
533
534
535.. opcode:: BUILD_LIST (count)
536
537 Works as ``BUILD_TUPLE``, but creates a list.
538
539
540.. opcode:: BUILD_SET (count)
541
542 Works as ``BUILD_TUPLE``, but creates a set.
543
544
Christian Heimesa62da1d2008-01-12 19:39:10 +0000545.. opcode:: BUILD_MAP (count)
Georg Brandl116aa622007-08-15 14:28:22 +0000546
Christian Heimesa62da1d2008-01-12 19:39:10 +0000547 Pushes a new dictionary object onto the stack. The dictionary is pre-sized
548 to hold *count* entries.
Georg Brandl116aa622007-08-15 14:28:22 +0000549
550
551.. opcode:: LOAD_ATTR (namei)
552
553 Replaces TOS with ``getattr(TOS, co_names[namei])``.
554
555
556.. opcode:: COMPARE_OP (opname)
557
558 Performs a Boolean operation. The operation name can be found in
559 ``cmp_op[opname]``.
560
561
562.. opcode:: IMPORT_NAME (namei)
563
Christian Heimesa342c012008-04-20 21:01:16 +0000564 Imports the module ``co_names[namei]``. TOS and TOS1 are popped and provide
565 the *fromlist* and *level* arguments of :func:`__import__`. The module
566 object is pushed onto the stack. The current namespace is not affected:
567 for a proper import statement, a subsequent ``STORE_FAST`` instruction
568 modifies the namespace.
Georg Brandl116aa622007-08-15 14:28:22 +0000569
570
571.. opcode:: IMPORT_FROM (namei)
572
573 Loads the attribute ``co_names[namei]`` from the module found in TOS. The
574 resulting object is pushed onto the stack, to be subsequently stored by a
575 ``STORE_FAST`` instruction.
576
577
578.. opcode:: JUMP_FORWARD (delta)
579
Georg Brandl9afde1c2007-11-01 20:32:30 +0000580 Increments bytecode counter by *delta*.
Georg Brandl116aa622007-08-15 14:28:22 +0000581
582
Jeffrey Yasskin9de7ec72009-02-25 02:25:04 +0000583.. opcode:: POP_JUMP_IF_TRUE (target)
Georg Brandl116aa622007-08-15 14:28:22 +0000584
Jeffrey Yasskin9de7ec72009-02-25 02:25:04 +0000585 If TOS is true, sets the bytecode counter to *target*. TOS is popped.
Georg Brandl116aa622007-08-15 14:28:22 +0000586
587
Jeffrey Yasskin9de7ec72009-02-25 02:25:04 +0000588.. opcode:: POP_JUMP_IF_FALSE (target)
Georg Brandl116aa622007-08-15 14:28:22 +0000589
Jeffrey Yasskin9de7ec72009-02-25 02:25:04 +0000590 If TOS is false, sets the bytecode counter to *target*. TOS is popped.
591
592
593.. opcode:: JUMP_IF_TRUE_OR_POP (target)
594
595 If TOS is true, sets the bytecode counter to *target* and leaves TOS
596 on the stack. Otherwise (TOS is false), TOS is popped.
597
598
599.. opcode:: JUMP_IF_FALSE_OR_POP (target)
600
601 If TOS is false, sets the bytecode counter to *target* and leaves
602 TOS on the stack. Otherwise (TOS is true), TOS is popped.
Georg Brandl116aa622007-08-15 14:28:22 +0000603
604
605.. opcode:: JUMP_ABSOLUTE (target)
606
Georg Brandl9afde1c2007-11-01 20:32:30 +0000607 Set bytecode counter to *target*.
Georg Brandl116aa622007-08-15 14:28:22 +0000608
609
610.. opcode:: FOR_ITER (delta)
611
Georg Brandl9afde1c2007-11-01 20:32:30 +0000612 ``TOS`` is an :term:`iterator`. Call its :meth:`__next__` method. If this
613 yields a new value, push it on the stack (leaving the iterator below it). If
614 the iterator indicates it is exhausted ``TOS`` is popped, and the byte code
615 counter is incremented by *delta*.
Georg Brandl116aa622007-08-15 14:28:22 +0000616
Georg Brandl116aa622007-08-15 14:28:22 +0000617
618.. opcode:: LOAD_GLOBAL (namei)
619
620 Loads the global named ``co_names[namei]`` onto the stack.
621
Georg Brandl116aa622007-08-15 14:28:22 +0000622
623.. opcode:: SETUP_LOOP (delta)
624
625 Pushes a block for a loop onto the block stack. The block spans from the
626 current instruction with a size of *delta* bytes.
627
628
629.. opcode:: SETUP_EXCEPT (delta)
630
631 Pushes a try block from a try-except clause onto the block stack. *delta* points
632 to the first except block.
633
634
635.. opcode:: SETUP_FINALLY (delta)
636
637 Pushes a try block from a try-except clause onto the block stack. *delta* points
638 to the finally block.
639
Christian Heimesa62da1d2008-01-12 19:39:10 +0000640.. opcode:: STORE_MAP ()
641
642 Store a key and value pair in a dictionary. Pops the key and value while leaving
643 the dictionary on the stack.
Georg Brandl116aa622007-08-15 14:28:22 +0000644
645.. opcode:: LOAD_FAST (var_num)
646
647 Pushes a reference to the local ``co_varnames[var_num]`` onto the stack.
648
649
650.. opcode:: STORE_FAST (var_num)
651
652 Stores TOS into the local ``co_varnames[var_num]``.
653
654
655.. opcode:: DELETE_FAST (var_num)
656
657 Deletes local ``co_varnames[var_num]``.
658
659
660.. opcode:: LOAD_CLOSURE (i)
661
662 Pushes a reference to the cell contained in slot *i* of the cell and free
663 variable storage. The name of the variable is ``co_cellvars[i]`` if *i* is
664 less than the length of *co_cellvars*. Otherwise it is ``co_freevars[i -
665 len(co_cellvars)]``.
666
667
668.. opcode:: LOAD_DEREF (i)
669
670 Loads the cell contained in slot *i* of the cell and free variable storage.
671 Pushes a reference to the object the cell contains on the stack.
672
673
674.. opcode:: STORE_DEREF (i)
675
676 Stores TOS into the cell contained in slot *i* of the cell and free variable
677 storage.
678
679
680.. opcode:: SET_LINENO (lineno)
681
682 This opcode is obsolete.
683
684
685.. opcode:: RAISE_VARARGS (argc)
686
687 Raises an exception. *argc* indicates the number of parameters to the raise
688 statement, ranging from 0 to 3. The handler will find the traceback as TOS2,
689 the parameter as TOS1, and the exception as TOS.
690
691
692.. opcode:: CALL_FUNCTION (argc)
693
694 Calls a function. The low byte of *argc* indicates the number of positional
695 parameters, the high byte the number of keyword parameters. On the stack, the
696 opcode finds the keyword parameters first. For each keyword argument, the value
697 is on top of the key. Below the keyword parameters, the positional parameters
698 are on the stack, with the right-most parameter on top. Below the parameters,
Georg Brandl48310cd2009-01-03 21:18:54 +0000699 the function object to call is on the stack. Pops all function arguments, and
Benjamin Peterson206e3072008-10-19 14:07:49 +0000700 the function itself off the stack, and pushes the return value.
Georg Brandl116aa622007-08-15 14:28:22 +0000701
702
703.. opcode:: MAKE_FUNCTION (argc)
704
705 Pushes a new function object on the stack. TOS is the code associated with the
706 function. The function object is defined to have *argc* default parameters,
707 which are found below TOS.
708
709
710.. opcode:: MAKE_CLOSURE (argc)
711
Guido van Rossum04110fb2007-08-24 16:32:05 +0000712 Creates a new function object, sets its *__closure__* slot, and pushes it on
713 the stack. TOS is the code associated with the function, TOS1 the tuple
714 containing cells for the closure's free variables. The function also has
715 *argc* default parameters, which are found below the cells.
Georg Brandl116aa622007-08-15 14:28:22 +0000716
717
718.. opcode:: BUILD_SLICE (argc)
719
720 .. index:: builtin: slice
721
722 Pushes a slice object on the stack. *argc* must be 2 or 3. If it is 2,
723 ``slice(TOS1, TOS)`` is pushed; if it is 3, ``slice(TOS2, TOS1, TOS)`` is
Christian Heimes5b5e81c2007-12-31 16:14:33 +0000724 pushed. See the :func:`slice` built-in function for more information.
Georg Brandl116aa622007-08-15 14:28:22 +0000725
726
727.. opcode:: EXTENDED_ARG (ext)
728
729 Prefixes any opcode which has an argument too big to fit into the default two
730 bytes. *ext* holds two additional bytes which, taken together with the
731 subsequent opcode's argument, comprise a four-byte argument, *ext* being the two
732 most-significant bytes.
733
734
735.. opcode:: CALL_FUNCTION_VAR (argc)
736
737 Calls a function. *argc* is interpreted as in ``CALL_FUNCTION``. The top element
738 on the stack contains the variable argument list, followed by keyword and
739 positional arguments.
740
741
742.. opcode:: CALL_FUNCTION_KW (argc)
743
744 Calls a function. *argc* is interpreted as in ``CALL_FUNCTION``. The top element
745 on the stack contains the keyword arguments dictionary, followed by explicit
746 keyword and positional arguments.
747
748
749.. opcode:: CALL_FUNCTION_VAR_KW (argc)
750
751 Calls a function. *argc* is interpreted as in ``CALL_FUNCTION``. The top
752 element on the stack contains the keyword arguments dictionary, followed by the
753 variable-arguments tuple, followed by explicit keyword and positional arguments.
754
755
756.. opcode:: HAVE_ARGUMENT ()
757
758 This is not really an opcode. It identifies the dividing line between opcodes
759 which don't take arguments ``< HAVE_ARGUMENT`` and those which do ``>=
760 HAVE_ARGUMENT``.
761