Why does Python code run faster in a function?

by

Inside a function, the bytecode is:

  2           0 SETUP_LOOP              20 (to 23)
              3 LOAD_GLOBAL              0 (xrange)
              6 LOAD_CONST               3 (100000000)
              9 CALL_FUNCTION            1
             12 GET_ITER            
        >>   13 FOR_ITER                 6 (to 22)
             16 STORE_FAST               0 (i)

  3          19 JUMP_ABSOLUTE           13
        >>   22 POP_BLOCK           
        >>   23 LOAD_CONST               0 (None)
             26 RETURN_VALUE

At the top level, the bytecode is:

  1           0 SETUP_LOOP              20 (to 23)
              3 LOAD_NAME                0 (xrange)
              6 LOAD_CONST               3 (100000000)
              9 CALL_FUNCTION            1
             12 GET_ITER            
        >>   13 FOR_ITER                 6 (to 22)
             16 STORE_NAME               1 (i)

  2          19 JUMP_ABSOLUTE           13
        >>   22 POP_BLOCK           
        >>   23 LOAD_CONST               2 (None)
             26 RETURN_VALUE

The difference is that STORE_FAST is faster (!) than STORE_NAME. This is because in a function, i is a local but at toplevel it is a global.

To examine bytecode, use the dis module. I was able to disassemble the function directly, but to disassemble the toplevel code I had to use the compile builtin.

More Related Contents:

  1. How do I profile a Python script?
  2. Which Python memory profiler is recommended? [closed]
  3. Why is looping over range() in Python faster than using a while loop?
  4. python: deque vs list performance comparison
  5. Python Requests vs PyCurl Performance
  6. Python Slice Assignment Memory Usage
  7. Searching for a string in a large text file – profiling various methods in python
  8. Python Numpy Data Types Performance
  9. Why shouldn’t I use PyPy over CPython if PyPy is 6.3 times faster?
  10. deque.popleft() and list.pop(0). Is there performance difference?
  11. How do I profile memory usage in Python?
  12. Replace values in a pandas series via dictionary efficiently
  13. Python Sets vs Lists
  14. Performance of Pandas apply vs np.vectorize to create new column from existing columns
  15. Most efficient way of making an if-elif-elif-else statement when the else is done the most?
  16. How to load existing db file to memory in Python sqlite3?
  17. Python readlines() usage and efficient practice for reading
  18. Python decompression relative performance?
  19. Pandas pd.Series.isin performance with set versus array
  20. Efficiently detect sign-changes in python
  21. Performance Advantages to Iterators?
  22. Efficient way to take the minimum/maximum n values and indices from a matrix using NumPy
  23. Most efficient way for a lookup/search in a huge list (python)
  24. numpy float: 10x slower than builtin in arithmetic operations?
  25. Fastest way to write huge data in file
  26. No speedup when summing uint16 vs uint64 arrays with NumPy?
  27. Accurate timing of functions in python
  28. Why does this take so long to match? Is it a bug?
  29. Which is the most efficient way to iterate through a list in python?
  30. Length of longest word in a list

Leave a Comment