blob: 9b4b7dccf619263503bbb0b7f1bc262826414f47 [file] [log] [blame]
Georg Brandl8ec7f652007-08-15 14:28:01 +00001
2:mod:`dis` --- Disassembler for Python byte code
3================================================
4
5.. module:: dis
6 :synopsis: Disassembler for Python byte code.
7
8
9The :mod:`dis` module supports the analysis of Python byte code by disassembling
10it. Since there is no Python assembler, this module defines the Python assembly
11language. The Python byte code which this module takes as an input is defined
12in the file :file:`Include/opcode.h` and used by the compiler and the
13interpreter.
14
15Example: Given the function :func:`myfunc`::
16
17 def myfunc(alist):
18 return len(alist)
19
20the following command can be used to get the disassembly of :func:`myfunc`::
21
22 >>> dis.dis(myfunc)
23 2 0 LOAD_GLOBAL 0 (len)
24 3 LOAD_FAST 0 (alist)
25 6 CALL_FUNCTION 1
26 9 RETURN_VALUE
27
28(The "2" is a line number).
29
30The :mod:`dis` module defines the following functions and constants:
31
32
33.. function:: dis([bytesource])
34
35 Disassemble the *bytesource* object. *bytesource* can denote either a module, a
36 class, a method, a function, or a code object. For a module, it disassembles
37 all functions. For a class, it disassembles all methods. For a single code
38 sequence, it prints one line per byte code instruction. If no object is
39 provided, it disassembles the last traceback.
40
41
42.. function:: distb([tb])
43
44 Disassembles the top-of-stack function of a traceback, using the last traceback
45 if none was passed. The instruction causing the exception is indicated.
46
47
48.. function:: disassemble(code[, lasti])
49
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
65.. function:: disco(code[, lasti])
66
67 A synonym for disassemble. It is more convenient to type, and kept for
68 compatibility with earlier Python releases.
69
70
71.. data:: opname
72
73 Sequence of operation names, indexable using the byte code.
74
75
76.. data:: opmap
77
78 Dictionary mapping byte codes to operation names.
79
80
81.. data:: cmp_op
82
83 Sequence of all compare operation names.
84
85
86.. data:: hasconst
87
88 Sequence of byte codes that have a constant parameter.
89
90
91.. data:: hasfree
92
93 Sequence of byte codes that access a free variable.
94
95
96.. data:: hasname
97
98 Sequence of byte codes that access an attribute by name.
99
100
101.. data:: hasjrel
102
103 Sequence of byte codes that have a relative jump target.
104
105
106.. data:: hasjabs
107
108 Sequence of byte codes that have an absolute jump target.
109
110
111.. data:: haslocal
112
113 Sequence of byte codes that access a local variable.
114
115
116.. data:: hascompare
117
118 Sequence of byte codes of Boolean operations.
119
120
121.. _bytecodes:
122
123Python Byte Code Instructions
124-----------------------------
125
126The Python compiler currently generates the following byte code instructions.
127
128
129.. opcode:: STOP_CODE ()
130
131 Indicates end-of-code to the compiler, not used by the interpreter.
132
133
134.. opcode:: NOP ()
135
136 Do nothing code. Used as a placeholder by the bytecode optimizer.
137
138
139.. opcode:: POP_TOP ()
140
141 Removes the top-of-stack (TOS) item.
142
143
144.. opcode:: ROT_TWO ()
145
146 Swaps the two top-most stack items.
147
148
149.. opcode:: ROT_THREE ()
150
151 Lifts second and third stack item one position up, moves top down to position
152 three.
153
154
155.. opcode:: ROT_FOUR ()
156
157 Lifts second, third and forth stack item one position up, moves top down to
158 position four.
159
160
161.. opcode:: DUP_TOP ()
162
163 Duplicates the reference on top of the stack.
164
165Unary Operations take the top of the stack, apply the operation, and push the
166result back on the stack.
167
168
169.. opcode:: UNARY_POSITIVE ()
170
171 Implements ``TOS = +TOS``.
172
173
174.. opcode:: UNARY_NEGATIVE ()
175
176 Implements ``TOS = -TOS``.
177
178
179.. opcode:: UNARY_NOT ()
180
181 Implements ``TOS = not TOS``.
182
183
184.. opcode:: UNARY_CONVERT ()
185
186 Implements ``TOS = `TOS```.
187
188
189.. opcode:: UNARY_INVERT ()
190
191 Implements ``TOS = ~TOS``.
192
193
194.. opcode:: GET_ITER ()
195
196 Implements ``TOS = iter(TOS)``.
197
198Binary operations remove the top of the stack (TOS) and the second top-most
199stack item (TOS1) from the stack. They perform the operation, and put the
200result back on the stack.
201
202
203.. opcode:: BINARY_POWER ()
204
205 Implements ``TOS = TOS1 ** TOS``.
206
207
208.. opcode:: BINARY_MULTIPLY ()
209
210 Implements ``TOS = TOS1 * TOS``.
211
212
213.. opcode:: BINARY_DIVIDE ()
214
215 Implements ``TOS = TOS1 / TOS`` when ``from __future__ import division`` is not
216 in effect.
217
218
219.. opcode:: BINARY_FLOOR_DIVIDE ()
220
221 Implements ``TOS = TOS1 // TOS``.
222
223
224.. opcode:: BINARY_TRUE_DIVIDE ()
225
226 Implements ``TOS = TOS1 / TOS`` when ``from __future__ import division`` is in
227 effect.
228
229
230.. opcode:: BINARY_MODULO ()
231
232 Implements ``TOS = TOS1 % TOS``.
233
234
235.. opcode:: BINARY_ADD ()
236
237 Implements ``TOS = TOS1 + TOS``.
238
239
240.. opcode:: BINARY_SUBTRACT ()
241
242 Implements ``TOS = TOS1 - TOS``.
243
244
245.. opcode:: BINARY_SUBSCR ()
246
247 Implements ``TOS = TOS1[TOS]``.
248
249
250.. opcode:: BINARY_LSHIFT ()
251
252 Implements ``TOS = TOS1 << TOS``.
253
254
255.. opcode:: BINARY_RSHIFT ()
256
257 Implements ``TOS = TOS1 >> TOS``.
258
259
260.. opcode:: BINARY_AND ()
261
262 Implements ``TOS = TOS1 & TOS``.
263
264
265.. opcode:: BINARY_XOR ()
266
267 Implements ``TOS = TOS1 ^ TOS``.
268
269
270.. opcode:: BINARY_OR ()
271
272 Implements ``TOS = TOS1 | TOS``.
273
274In-place operations are like binary operations, in that they remove TOS and
275TOS1, and push the result back on the stack, but the operation is done in-place
276when TOS1 supports it, and the resulting TOS may be (but does not have to be)
277the original TOS1.
278
279
280.. opcode:: INPLACE_POWER ()
281
282 Implements in-place ``TOS = TOS1 ** TOS``.
283
284
285.. opcode:: INPLACE_MULTIPLY ()
286
287 Implements in-place ``TOS = TOS1 * TOS``.
288
289
290.. opcode:: INPLACE_DIVIDE ()
291
292 Implements in-place ``TOS = TOS1 / TOS`` when ``from __future__ import
293 division`` is not in effect.
294
295
296.. opcode:: INPLACE_FLOOR_DIVIDE ()
297
298 Implements in-place ``TOS = TOS1 // TOS``.
299
300
301.. opcode:: INPLACE_TRUE_DIVIDE ()
302
303 Implements in-place ``TOS = TOS1 / TOS`` when ``from __future__ import
304 division`` is in effect.
305
306
307.. opcode:: INPLACE_MODULO ()
308
309 Implements in-place ``TOS = TOS1 % TOS``.
310
311
312.. opcode:: INPLACE_ADD ()
313
314 Implements in-place ``TOS = TOS1 + TOS``.
315
316
317.. opcode:: INPLACE_SUBTRACT ()
318
319 Implements in-place ``TOS = TOS1 - TOS``.
320
321
322.. opcode:: INPLACE_LSHIFT ()
323
324 Implements in-place ``TOS = TOS1 << TOS``.
325
326
327.. opcode:: INPLACE_RSHIFT ()
328
329 Implements in-place ``TOS = TOS1 >> TOS``.
330
331
332.. opcode:: INPLACE_AND ()
333
334 Implements in-place ``TOS = TOS1 & TOS``.
335
336
337.. opcode:: INPLACE_XOR ()
338
339 Implements in-place ``TOS = TOS1 ^ TOS``.
340
341
342.. opcode:: INPLACE_OR ()
343
344 Implements in-place ``TOS = TOS1 | TOS``.
345
346The slice opcodes take up to three parameters.
347
348
349.. opcode:: SLICE+0 ()
350
351 Implements ``TOS = TOS[:]``.
352
353
354.. opcode:: SLICE+1 ()
355
356 Implements ``TOS = TOS1[TOS:]``.
357
358
359.. opcode:: SLICE+2 ()
360
361 Implements ``TOS = TOS1[:TOS]``.
362
363
364.. opcode:: SLICE+3 ()
365
366 Implements ``TOS = TOS2[TOS1:TOS]``.
367
368Slice assignment needs even an additional parameter. As any statement, they put
369nothing on the stack.
370
371
372.. opcode:: STORE_SLICE+0 ()
373
374 Implements ``TOS[:] = TOS1``.
375
376
377.. opcode:: STORE_SLICE+1 ()
378
379 Implements ``TOS1[TOS:] = TOS2``.
380
381
382.. opcode:: STORE_SLICE+2 ()
383
384 Implements ``TOS1[:TOS] = TOS2``.
385
386
387.. opcode:: STORE_SLICE+3 ()
388
389 Implements ``TOS2[TOS1:TOS] = TOS3``.
390
391
392.. opcode:: DELETE_SLICE+0 ()
393
394 Implements ``del TOS[:]``.
395
396
397.. opcode:: DELETE_SLICE+1 ()
398
399 Implements ``del TOS1[TOS:]``.
400
401
402.. opcode:: DELETE_SLICE+2 ()
403
404 Implements ``del TOS1[:TOS]``.
405
406
407.. opcode:: DELETE_SLICE+3 ()
408
409 Implements ``del TOS2[TOS1:TOS]``.
410
411
412.. opcode:: STORE_SUBSCR ()
413
414 Implements ``TOS1[TOS] = TOS2``.
415
416
417.. opcode:: DELETE_SUBSCR ()
418
419 Implements ``del TOS1[TOS]``.
420
421Miscellaneous opcodes.
422
423
424.. opcode:: PRINT_EXPR ()
425
426 Implements the expression statement for the interactive mode. TOS is removed
427 from the stack and printed. In non-interactive mode, an expression statement is
428 terminated with ``POP_STACK``.
429
430
431.. opcode:: PRINT_ITEM ()
432
433 Prints TOS to the file-like object bound to ``sys.stdout``. There is one such
434 instruction for each item in the :keyword:`print` statement.
435
436
437.. opcode:: PRINT_ITEM_TO ()
438
439 Like ``PRINT_ITEM``, but prints the item second from TOS to the file-like object
440 at TOS. This is used by the extended print statement.
441
442
443.. opcode:: PRINT_NEWLINE ()
444
445 Prints a new line on ``sys.stdout``. This is generated as the last operation of
446 a :keyword:`print` statement, unless the statement ends with a comma.
447
448
449.. opcode:: PRINT_NEWLINE_TO ()
450
451 Like ``PRINT_NEWLINE``, but prints the new line on the file-like object on the
452 TOS. This is used by the extended print statement.
453
454
455.. opcode:: BREAK_LOOP ()
456
457 Terminates a loop due to a :keyword:`break` statement.
458
459
460.. opcode:: CONTINUE_LOOP (target)
461
462 Continues a loop due to a :keyword:`continue` statement. *target* is the
463 address to jump to (which should be a ``FOR_ITER`` instruction).
464
465
466.. opcode:: LIST_APPEND ()
467
468 Calls ``list.append(TOS1, TOS)``. Used to implement list comprehensions.
469
470
471.. opcode:: LOAD_LOCALS ()
472
473 Pushes a reference to the locals of the current scope on the stack. This is used
474 in the code for a class definition: After the class body is evaluated, the
475 locals are passed to the class definition.
476
477
478.. opcode:: RETURN_VALUE ()
479
480 Returns with TOS to the caller of the function.
481
482
483.. opcode:: YIELD_VALUE ()
484
485 Pops ``TOS`` and yields it from a generator.
486
487
488.. opcode:: IMPORT_STAR ()
489
490 Loads all symbols not starting with ``'_'`` directly from the module TOS to the
491 local namespace. The module is popped after loading all names. This opcode
492 implements ``from module import *``.
493
494
495.. opcode:: EXEC_STMT ()
496
497 Implements ``exec TOS2,TOS1,TOS``. The compiler fills missing optional
498 parameters with ``None``.
499
500
501.. opcode:: POP_BLOCK ()
502
503 Removes one block from the block stack. Per frame, there is a stack of blocks,
504 denoting nested loops, try statements, and such.
505
506
507.. opcode:: END_FINALLY ()
508
509 Terminates a :keyword:`finally` clause. The interpreter recalls whether the
510 exception has to be re-raised, or whether the function returns, and continues
511 with the outer-next block.
512
513
514.. opcode:: BUILD_CLASS ()
515
516 Creates a new class object. TOS is the methods dictionary, TOS1 the tuple of
517 the names of the base classes, and TOS2 the class name.
518
Georg Brandl4debd552007-08-23 17:54:11 +0000519
520.. opcode:: WITH_CLEANUP ()
521
522 Cleans up the stack when a :keyword:`with` statement block exits. TOS is the
523 context manager's :meth:`__exit__` bound method. Below that are 1--3 values
524 indicating how/why the finally clause was entered:
525
526 * SECOND = None
527 * (SECOND, THIRD) = (WHY_{RETURN,CONTINUE}), retval
528 * SECOND = WHY_\*; no retval below it
529 * (SECOND, THIRD, FOURTH) = exc_info()
530
531 In the last case, ``TOS(SECOND, THIRD, FOURTH)`` is called, otherwise
532 ``TOS(None, None, None)``.
533
534 In addition, if the stack represents an exception, *and* the function call
535 returns a 'true' value, this information is "zapped", to prevent ``END_FINALLY``
536 from re-raising the exception. (But non-local gotos should still be resumed.)
537
538
Georg Brandl8ec7f652007-08-15 14:28:01 +0000539All of the following opcodes expect arguments. An argument is two bytes, with
540the more significant byte last.
541
Georg Brandl8ec7f652007-08-15 14:28:01 +0000542.. opcode:: STORE_NAME (namei)
543
544 Implements ``name = TOS``. *namei* is the index of *name* in the attribute
545 :attr:`co_names` of the code object. The compiler tries to use ``STORE_LOCAL``
546 or ``STORE_GLOBAL`` if possible.
547
548
549.. opcode:: DELETE_NAME (namei)
550
551 Implements ``del name``, where *namei* is the index into :attr:`co_names`
552 attribute of the code object.
553
554
555.. opcode:: UNPACK_SEQUENCE (count)
556
557 Unpacks TOS into *count* individual values, which are put onto the stack
558 right-to-left.
559
560.. % \begin{opcodedesc}{UNPACK_LIST}{count}
561.. % This opcode is obsolete.
562.. % \end{opcodedesc}
563.. % \begin{opcodedesc}{UNPACK_ARG}{count}
564.. % This opcode is obsolete.
565.. % \end{opcodedesc}
566
567
568.. opcode:: DUP_TOPX (count)
569
570 Duplicate *count* items, keeping them in the same order. Due to implementation
571 limits, *count* should be between 1 and 5 inclusive.
572
573
574.. opcode:: STORE_ATTR (namei)
575
576 Implements ``TOS.name = TOS1``, where *namei* is the index of name in
577 :attr:`co_names`.
578
579
580.. opcode:: DELETE_ATTR (namei)
581
582 Implements ``del TOS.name``, using *namei* as index into :attr:`co_names`.
583
584
585.. opcode:: STORE_GLOBAL (namei)
586
587 Works as ``STORE_NAME``, but stores the name as a global.
588
589
590.. opcode:: DELETE_GLOBAL (namei)
591
592 Works as ``DELETE_NAME``, but deletes a global name.
593
594.. % \begin{opcodedesc}{UNPACK_VARARG}{argc}
595.. % This opcode is obsolete.
596.. % \end{opcodedesc}
597
598
599.. opcode:: LOAD_CONST (consti)
600
601 Pushes ``co_consts[consti]`` onto the stack.
602
603
604.. opcode:: LOAD_NAME (namei)
605
606 Pushes the value associated with ``co_names[namei]`` onto the stack.
607
608
609.. opcode:: BUILD_TUPLE (count)
610
611 Creates a tuple consuming *count* items from the stack, and pushes the resulting
612 tuple onto the stack.
613
614
615.. opcode:: BUILD_LIST (count)
616
617 Works as ``BUILD_TUPLE``, but creates a list.
618
619
620.. opcode:: BUILD_MAP (zero)
621
622 Pushes a new empty dictionary object onto the stack. The argument is ignored
623 and set to zero by the compiler.
624
625
626.. opcode:: LOAD_ATTR (namei)
627
628 Replaces TOS with ``getattr(TOS, co_names[namei])``.
629
630
631.. opcode:: COMPARE_OP (opname)
632
633 Performs a Boolean operation. The operation name can be found in
634 ``cmp_op[opname]``.
635
636
637.. opcode:: IMPORT_NAME (namei)
638
639 Imports the module ``co_names[namei]``. The module object is pushed onto the
640 stack. The current namespace is not affected: for a proper import statement, a
641 subsequent ``STORE_FAST`` instruction modifies the namespace.
642
643
644.. opcode:: IMPORT_FROM (namei)
645
646 Loads the attribute ``co_names[namei]`` from the module found in TOS. The
647 resulting object is pushed onto the stack, to be subsequently stored by a
648 ``STORE_FAST`` instruction.
649
650
651.. opcode:: JUMP_FORWARD (delta)
652
653 Increments byte code counter by *delta*.
654
655
656.. opcode:: JUMP_IF_TRUE (delta)
657
658 If TOS is true, increment the byte code counter by *delta*. TOS is left on the
659 stack.
660
661
662.. opcode:: JUMP_IF_FALSE (delta)
663
664 If TOS is false, increment the byte code counter by *delta*. TOS is not
665 changed.
666
667
668.. opcode:: JUMP_ABSOLUTE (target)
669
670 Set byte code counter to *target*.
671
672
673.. opcode:: FOR_ITER (delta)
674
675 ``TOS`` is an iterator. Call its :meth:`next` method. If this yields a new
676 value, push it on the stack (leaving the iterator below it). If the iterator
677 indicates it is exhausted ``TOS`` is popped, and the byte code counter is
678 incremented by *delta*.
679
680.. % \begin{opcodedesc}{FOR_LOOP}{delta}
681.. % This opcode is obsolete.
682.. % \end{opcodedesc}
683.. % \begin{opcodedesc}{LOAD_LOCAL}{namei}
684.. % This opcode is obsolete.
685.. % \end{opcodedesc}
686
687
688.. opcode:: LOAD_GLOBAL (namei)
689
690 Loads the global named ``co_names[namei]`` onto the stack.
691
692.. % \begin{opcodedesc}{SET_FUNC_ARGS}{argc}
693.. % This opcode is obsolete.
694.. % \end{opcodedesc}
695
696
697.. opcode:: SETUP_LOOP (delta)
698
699 Pushes a block for a loop onto the block stack. The block spans from the
700 current instruction with a size of *delta* bytes.
701
702
703.. opcode:: SETUP_EXCEPT (delta)
704
705 Pushes a try block from a try-except clause onto the block stack. *delta* points
706 to the first except block.
707
708
709.. opcode:: SETUP_FINALLY (delta)
710
711 Pushes a try block from a try-except clause onto the block stack. *delta* points
712 to the finally block.
713
714
715.. opcode:: LOAD_FAST (var_num)
716
717 Pushes a reference to the local ``co_varnames[var_num]`` onto the stack.
718
719
720.. opcode:: STORE_FAST (var_num)
721
722 Stores TOS into the local ``co_varnames[var_num]``.
723
724
725.. opcode:: DELETE_FAST (var_num)
726
727 Deletes local ``co_varnames[var_num]``.
728
729
730.. opcode:: LOAD_CLOSURE (i)
731
732 Pushes a reference to the cell contained in slot *i* of the cell and free
733 variable storage. The name of the variable is ``co_cellvars[i]`` if *i* is
734 less than the length of *co_cellvars*. Otherwise it is ``co_freevars[i -
735 len(co_cellvars)]``.
736
737
738.. opcode:: LOAD_DEREF (i)
739
740 Loads the cell contained in slot *i* of the cell and free variable storage.
741 Pushes a reference to the object the cell contains on the stack.
742
743
744.. opcode:: STORE_DEREF (i)
745
746 Stores TOS into the cell contained in slot *i* of the cell and free variable
747 storage.
748
749
750.. opcode:: SET_LINENO (lineno)
751
752 This opcode is obsolete.
753
754
755.. opcode:: RAISE_VARARGS (argc)
756
757 Raises an exception. *argc* indicates the number of parameters to the raise
758 statement, ranging from 0 to 3. The handler will find the traceback as TOS2,
759 the parameter as TOS1, and the exception as TOS.
760
761
762.. opcode:: CALL_FUNCTION (argc)
763
764 Calls a function. The low byte of *argc* indicates the number of positional
765 parameters, the high byte the number of keyword parameters. On the stack, the
766 opcode finds the keyword parameters first. For each keyword argument, the value
767 is on top of the key. Below the keyword parameters, the positional parameters
768 are on the stack, with the right-most parameter on top. Below the parameters,
769 the function object to call is on the stack.
770
771
772.. opcode:: MAKE_FUNCTION (argc)
773
774 Pushes a new function object on the stack. TOS is the code associated with the
775 function. The function object is defined to have *argc* default parameters,
776 which are found below TOS.
777
778
779.. opcode:: MAKE_CLOSURE (argc)
780
781 Creates a new function object, sets its *func_closure* slot, and pushes it on
Georg Brandl4debd552007-08-23 17:54:11 +0000782 the stack. TOS is the code associated with the function, TOS1 the tuple
783 containing cells for the closure's free variables. The function also has
784 *argc* default parameters, which are found below the cells.
Georg Brandl8ec7f652007-08-15 14:28:01 +0000785
786
787.. opcode:: BUILD_SLICE (argc)
788
789 .. index:: builtin: slice
790
791 Pushes a slice object on the stack. *argc* must be 2 or 3. If it is 2,
792 ``slice(TOS1, TOS)`` is pushed; if it is 3, ``slice(TOS2, TOS1, TOS)`` is
793 pushed. See the ``slice()`` built-in function for more information.
794
795
796.. opcode:: EXTENDED_ARG (ext)
797
798 Prefixes any opcode which has an argument too big to fit into the default two
799 bytes. *ext* holds two additional bytes which, taken together with the
800 subsequent opcode's argument, comprise a four-byte argument, *ext* being the two
801 most-significant bytes.
802
803
804.. opcode:: CALL_FUNCTION_VAR (argc)
805
806 Calls a function. *argc* is interpreted as in ``CALL_FUNCTION``. The top element
807 on the stack contains the variable argument list, followed by keyword and
808 positional arguments.
809
810
811.. opcode:: CALL_FUNCTION_KW (argc)
812
813 Calls a function. *argc* is interpreted as in ``CALL_FUNCTION``. The top element
814 on the stack contains the keyword arguments dictionary, followed by explicit
815 keyword and positional arguments.
816
817
818.. opcode:: CALL_FUNCTION_VAR_KW (argc)
819
820 Calls a function. *argc* is interpreted as in ``CALL_FUNCTION``. The top
821 element on the stack contains the keyword arguments dictionary, followed by the
822 variable-arguments tuple, followed by explicit keyword and positional arguments.
823
824
825.. opcode:: HAVE_ARGUMENT ()
826
827 This is not really an opcode. It identifies the dividing line between opcodes
828 which don't take arguments ``< HAVE_ARGUMENT`` and those which do ``>=
829 HAVE_ARGUMENT``.
830