blob: 487c47184c20475ce59b33972dada6490b430a16 [file] [log] [blame]
Georg Brandl8ec7f652007-08-15 14:28:01 +00001
Georg Brandl63fa1682007-10-21 10:24:20 +00002:mod:`dis` --- Disassembler for Python bytecode
3===============================================
Georg Brandl8ec7f652007-08-15 14:28:01 +00004
5.. module:: dis
Georg Brandl63fa1682007-10-21 10:24:20 +00006 :synopsis: Disassembler for Python bytecode.
Georg Brandl8ec7f652007-08-15 14:28:01 +00007
8
Georg Brandl63fa1682007-10-21 10:24:20 +00009The :mod:`dis` module supports the analysis of Python :term:`bytecode` by disassembling
Georg Brandl8ec7f652007-08-15 14:28:01 +000010it. Since there is no Python assembler, this module defines the Python assembly
Georg Brandl63fa1682007-10-21 10:24:20 +000011language. The Python bytecode which this module takes as an input is defined
Georg Brandl8ec7f652007-08-15 14:28:01 +000012in 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
Georg Brandl63fa1682007-10-21 10:24:20 +000038 sequence, it prints one line per bytecode instruction. If no object is
Georg Brandl8ec7f652007-08-15 14:28:01 +000039 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
Georg Brandl63fa1682007-10-21 10:24:20 +000073 Sequence of operation names, indexable using the bytecode.
Georg Brandl8ec7f652007-08-15 14:28:01 +000074
75
76.. data:: opmap
77
Georg Brandl63fa1682007-10-21 10:24:20 +000078 Dictionary mapping bytecodes to operation names.
Georg Brandl8ec7f652007-08-15 14:28:01 +000079
80
81.. data:: cmp_op
82
83 Sequence of all compare operation names.
84
85
86.. data:: hasconst
87
Georg Brandl63fa1682007-10-21 10:24:20 +000088 Sequence of bytecodes that have a constant parameter.
Georg Brandl8ec7f652007-08-15 14:28:01 +000089
90
91.. data:: hasfree
92
Georg Brandl63fa1682007-10-21 10:24:20 +000093 Sequence of bytecodes that access a free variable.
Georg Brandl8ec7f652007-08-15 14:28:01 +000094
95
96.. data:: hasname
97
Georg Brandl63fa1682007-10-21 10:24:20 +000098 Sequence of bytecodes that access an attribute by name.
Georg Brandl8ec7f652007-08-15 14:28:01 +000099
100
101.. data:: hasjrel
102
Georg Brandl63fa1682007-10-21 10:24:20 +0000103 Sequence of bytecodes that have a relative jump target.
Georg Brandl8ec7f652007-08-15 14:28:01 +0000104
105
106.. data:: hasjabs
107
Georg Brandl63fa1682007-10-21 10:24:20 +0000108 Sequence of bytecodes that have an absolute jump target.
Georg Brandl8ec7f652007-08-15 14:28:01 +0000109
110
111.. data:: haslocal
112
Georg Brandl63fa1682007-10-21 10:24:20 +0000113 Sequence of bytecodes that access a local variable.
Georg Brandl8ec7f652007-08-15 14:28:01 +0000114
115
116.. data:: hascompare
117
Georg Brandl63fa1682007-10-21 10:24:20 +0000118 Sequence of bytecodes of Boolean operations.
Georg Brandl8ec7f652007-08-15 14:28:01 +0000119
120
121.. _bytecodes:
122
Georg Brandl63fa1682007-10-21 10:24:20 +0000123Python Bytecode Instructions
124----------------------------
Georg Brandl8ec7f652007-08-15 14:28:01 +0000125
Georg Brandl63fa1682007-10-21 10:24:20 +0000126The Python compiler currently generates the following bytecode instructions.
Georg Brandl8ec7f652007-08-15 14:28:01 +0000127
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
Georg Brandlcf3fb252007-10-21 10:52:38 +0000485 Pops ``TOS`` and yields it from a :term:`generator`.
Georg Brandl8ec7f652007-08-15 14:28:01 +0000486
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
Georg Brandlff27e0c2007-10-20 13:22:53 +0000526 * SECOND = ``None``
527 * (SECOND, THIRD) = (``WHY_{RETURN,CONTINUE}``), retval
528 * SECOND = ``WHY_*``; no retval below it
Georg Brandl4debd552007-08-23 17:54:11 +0000529 * (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
Georg Brandlff27e0c2007-10-20 13:22:53 +0000538 .. XXX explain the WHY stuff!
539
Georg Brandl4debd552007-08-23 17:54:11 +0000540
Georg Brandl8ec7f652007-08-15 14:28:01 +0000541All of the following opcodes expect arguments. An argument is two bytes, with
542the more significant byte last.
543
Georg Brandl8ec7f652007-08-15 14:28:01 +0000544.. opcode:: STORE_NAME (namei)
545
546 Implements ``name = TOS``. *namei* is the index of *name* in the attribute
547 :attr:`co_names` of the code object. The compiler tries to use ``STORE_LOCAL``
548 or ``STORE_GLOBAL`` if possible.
549
550
551.. opcode:: DELETE_NAME (namei)
552
553 Implements ``del name``, where *namei* is the index into :attr:`co_names`
554 attribute of the code object.
555
556
557.. opcode:: UNPACK_SEQUENCE (count)
558
559 Unpacks TOS into *count* individual values, which are put onto the stack
560 right-to-left.
561
Georg Brandl8ec7f652007-08-15 14:28:01 +0000562
563.. opcode:: DUP_TOPX (count)
564
565 Duplicate *count* items, keeping them in the same order. Due to implementation
566 limits, *count* should be between 1 and 5 inclusive.
567
568
569.. opcode:: STORE_ATTR (namei)
570
571 Implements ``TOS.name = TOS1``, where *namei* is the index of name in
572 :attr:`co_names`.
573
574
575.. opcode:: DELETE_ATTR (namei)
576
577 Implements ``del TOS.name``, using *namei* as index into :attr:`co_names`.
578
579
580.. opcode:: STORE_GLOBAL (namei)
581
582 Works as ``STORE_NAME``, but stores the name as a global.
583
584
585.. opcode:: DELETE_GLOBAL (namei)
586
587 Works as ``DELETE_NAME``, but deletes a global name.
588
Georg Brandl8ec7f652007-08-15 14:28:01 +0000589
590.. opcode:: LOAD_CONST (consti)
591
592 Pushes ``co_consts[consti]`` onto the stack.
593
594
595.. opcode:: LOAD_NAME (namei)
596
597 Pushes the value associated with ``co_names[namei]`` onto the stack.
598
599
600.. opcode:: BUILD_TUPLE (count)
601
602 Creates a tuple consuming *count* items from the stack, and pushes the resulting
603 tuple onto the stack.
604
605
606.. opcode:: BUILD_LIST (count)
607
608 Works as ``BUILD_TUPLE``, but creates a list.
609
610
611.. opcode:: BUILD_MAP (zero)
612
613 Pushes a new empty dictionary object onto the stack. The argument is ignored
614 and set to zero by the compiler.
615
616
617.. opcode:: LOAD_ATTR (namei)
618
619 Replaces TOS with ``getattr(TOS, co_names[namei])``.
620
621
622.. opcode:: COMPARE_OP (opname)
623
624 Performs a Boolean operation. The operation name can be found in
625 ``cmp_op[opname]``.
626
627
628.. opcode:: IMPORT_NAME (namei)
629
630 Imports the module ``co_names[namei]``. The module object is pushed onto the
631 stack. The current namespace is not affected: for a proper import statement, a
632 subsequent ``STORE_FAST`` instruction modifies the namespace.
633
634
635.. opcode:: IMPORT_FROM (namei)
636
637 Loads the attribute ``co_names[namei]`` from the module found in TOS. The
638 resulting object is pushed onto the stack, to be subsequently stored by a
639 ``STORE_FAST`` instruction.
640
641
642.. opcode:: JUMP_FORWARD (delta)
643
Georg Brandl63fa1682007-10-21 10:24:20 +0000644 Increments bytecode counter by *delta*.
Georg Brandl8ec7f652007-08-15 14:28:01 +0000645
646
647.. opcode:: JUMP_IF_TRUE (delta)
648
Georg Brandl63fa1682007-10-21 10:24:20 +0000649 If TOS is true, increment the bytecode counter by *delta*. TOS is left on the
Georg Brandl8ec7f652007-08-15 14:28:01 +0000650 stack.
651
652
653.. opcode:: JUMP_IF_FALSE (delta)
654
Georg Brandl63fa1682007-10-21 10:24:20 +0000655 If TOS is false, increment the bytecode counter by *delta*. TOS is not
Georg Brandl8ec7f652007-08-15 14:28:01 +0000656 changed.
657
658
659.. opcode:: JUMP_ABSOLUTE (target)
660
Georg Brandl63fa1682007-10-21 10:24:20 +0000661 Set bytecode counter to *target*.
Georg Brandl8ec7f652007-08-15 14:28:01 +0000662
663
664.. opcode:: FOR_ITER (delta)
665
Georg Brandle7a09902007-10-21 12:10:28 +0000666 ``TOS`` is an :term:`iterator`. Call its :meth:`next` method. If this
667 yields a new value, push it on the stack (leaving the iterator below it). If
668 the iterator indicates it is exhausted ``TOS`` is popped, and the bytecode
669 counter is incremented by *delta*.
Georg Brandl8ec7f652007-08-15 14:28:01 +0000670
Georg Brandl8ec7f652007-08-15 14:28:01 +0000671
672.. opcode:: LOAD_GLOBAL (namei)
673
674 Loads the global named ``co_names[namei]`` onto the stack.
675
Georg Brandl8ec7f652007-08-15 14:28:01 +0000676
677.. opcode:: SETUP_LOOP (delta)
678
679 Pushes a block for a loop onto the block stack. The block spans from the
680 current instruction with a size of *delta* bytes.
681
682
683.. opcode:: SETUP_EXCEPT (delta)
684
685 Pushes a try block from a try-except clause onto the block stack. *delta* points
686 to the first except block.
687
688
689.. opcode:: SETUP_FINALLY (delta)
690
691 Pushes a try block from a try-except clause onto the block stack. *delta* points
692 to the finally block.
693
694
695.. opcode:: LOAD_FAST (var_num)
696
697 Pushes a reference to the local ``co_varnames[var_num]`` onto the stack.
698
699
700.. opcode:: STORE_FAST (var_num)
701
702 Stores TOS into the local ``co_varnames[var_num]``.
703
704
705.. opcode:: DELETE_FAST (var_num)
706
707 Deletes local ``co_varnames[var_num]``.
708
709
710.. opcode:: LOAD_CLOSURE (i)
711
712 Pushes a reference to the cell contained in slot *i* of the cell and free
713 variable storage. The name of the variable is ``co_cellvars[i]`` if *i* is
714 less than the length of *co_cellvars*. Otherwise it is ``co_freevars[i -
715 len(co_cellvars)]``.
716
717
718.. opcode:: LOAD_DEREF (i)
719
720 Loads the cell contained in slot *i* of the cell and free variable storage.
721 Pushes a reference to the object the cell contains on the stack.
722
723
724.. opcode:: STORE_DEREF (i)
725
726 Stores TOS into the cell contained in slot *i* of the cell and free variable
727 storage.
728
729
730.. opcode:: SET_LINENO (lineno)
731
732 This opcode is obsolete.
733
734
735.. opcode:: RAISE_VARARGS (argc)
736
737 Raises an exception. *argc* indicates the number of parameters to the raise
738 statement, ranging from 0 to 3. The handler will find the traceback as TOS2,
739 the parameter as TOS1, and the exception as TOS.
740
741
742.. opcode:: CALL_FUNCTION (argc)
743
744 Calls a function. The low byte of *argc* indicates the number of positional
745 parameters, the high byte the number of keyword parameters. On the stack, the
746 opcode finds the keyword parameters first. For each keyword argument, the value
747 is on top of the key. Below the keyword parameters, the positional parameters
748 are on the stack, with the right-most parameter on top. Below the parameters,
749 the function object to call is on the stack.
750
751
752.. opcode:: MAKE_FUNCTION (argc)
753
754 Pushes a new function object on the stack. TOS is the code associated with the
755 function. The function object is defined to have *argc* default parameters,
756 which are found below TOS.
757
758
759.. opcode:: MAKE_CLOSURE (argc)
760
761 Creates a new function object, sets its *func_closure* slot, and pushes it on
Georg Brandl4debd552007-08-23 17:54:11 +0000762 the stack. TOS is the code associated with the function, TOS1 the tuple
763 containing cells for the closure's free variables. The function also has
764 *argc* default parameters, which are found below the cells.
Georg Brandl8ec7f652007-08-15 14:28:01 +0000765
766
767.. opcode:: BUILD_SLICE (argc)
768
769 .. index:: builtin: slice
770
771 Pushes a slice object on the stack. *argc* must be 2 or 3. If it is 2,
772 ``slice(TOS1, TOS)`` is pushed; if it is 3, ``slice(TOS2, TOS1, TOS)`` is
Georg Brandlb19be572007-12-29 10:57:00 +0000773 pushed. See the :func:`slice` built-in function for more information.
Georg Brandl8ec7f652007-08-15 14:28:01 +0000774
775
776.. opcode:: EXTENDED_ARG (ext)
777
778 Prefixes any opcode which has an argument too big to fit into the default two
779 bytes. *ext* holds two additional bytes which, taken together with the
780 subsequent opcode's argument, comprise a four-byte argument, *ext* being the two
781 most-significant bytes.
782
783
784.. opcode:: CALL_FUNCTION_VAR (argc)
785
786 Calls a function. *argc* is interpreted as in ``CALL_FUNCTION``. The top element
787 on the stack contains the variable argument list, followed by keyword and
788 positional arguments.
789
790
791.. opcode:: CALL_FUNCTION_KW (argc)
792
793 Calls a function. *argc* is interpreted as in ``CALL_FUNCTION``. The top element
794 on the stack contains the keyword arguments dictionary, followed by explicit
795 keyword and positional arguments.
796
797
798.. opcode:: CALL_FUNCTION_VAR_KW (argc)
799
800 Calls a function. *argc* is interpreted as in ``CALL_FUNCTION``. The top
801 element on the stack contains the keyword arguments dictionary, followed by the
802 variable-arguments tuple, followed by explicit keyword and positional arguments.
803
804
805.. opcode:: HAVE_ARGUMENT ()
806
807 This is not really an opcode. It identifies the dividing line between opcodes
808 which don't take arguments ``< HAVE_ARGUMENT`` and those which do ``>=
809 HAVE_ARGUMENT``.
810