mirror of
https://github.com/python/cpython.git
synced 2025-09-26 10:19:53 +00:00
Merged revisions 61596-61597 via svnmerge from
svn+ssh://pythondev@svn.python.org/python/trunk ........ r61596 | martin.v.loewis | 2008-03-18 23:43:46 -0500 (Di, 18 Mär 2008) | 2 lines Import lib2to3. ........ r61597 | martin.v.loewis | 2008-03-18 23:58:04 -0500 (Di, 18 Mär 2008) | 3 lines Initialized merge tracking via "svnmerge" with revisions "1-61595" from svn+ssh://pythondev@svn.python.org/sandbox/trunk/2to3/lib2to3 ........
This commit is contained in:
parent
c42bcbb1f0
commit
ef04c44e29
67 changed files with 11990 additions and 0 deletions
58
Lib/lib2to3/tests/benchmark.py
Normal file
58
Lib/lib2to3/tests/benchmark.py
Normal file
|
@ -0,0 +1,58 @@
|
|||
#!/usr/bin/env python2.5
|
||||
"""
|
||||
This is a benchmarking script to test the speed of 2to3's pattern matching
|
||||
system. It's equivalent to "refactor.py -f all" for every Python module
|
||||
in sys.modules, but without engaging the actual transformations.
|
||||
"""
|
||||
|
||||
__author__ = "Collin Winter <collinw at gmail.com>"
|
||||
|
||||
# Python imports
|
||||
import os.path
|
||||
import sys
|
||||
from time import time
|
||||
|
||||
# Test imports
|
||||
from support import adjust_path
|
||||
adjust_path()
|
||||
|
||||
# Local imports
|
||||
from .. import refactor
|
||||
|
||||
### Mock code for refactor.py and the fixers
|
||||
###############################################################################
|
||||
class Options:
|
||||
def __init__(self, **kwargs):
|
||||
for k, v in kwargs.items():
|
||||
setattr(self, k, v)
|
||||
|
||||
self.verbose = False
|
||||
|
||||
def dummy_transform(*args, **kwargs):
|
||||
pass
|
||||
|
||||
### Collect list of modules to match against
|
||||
###############################################################################
|
||||
files = []
|
||||
for mod in sys.modules.values():
|
||||
if mod is None or not hasattr(mod, '__file__'):
|
||||
continue
|
||||
f = mod.__file__
|
||||
if f.endswith('.pyc'):
|
||||
f = f[:-1]
|
||||
if f.endswith('.py'):
|
||||
files.append(f)
|
||||
|
||||
### Set up refactor and run the benchmark
|
||||
###############################################################################
|
||||
options = Options(fix=["all"], print_function=False, doctests_only=False)
|
||||
refactor = refactor.RefactoringTool(options)
|
||||
for fixer in refactor.fixers:
|
||||
# We don't want them to actually fix the tree, just match against it.
|
||||
fixer.transform = dummy_transform
|
||||
|
||||
t = time()
|
||||
for f in files:
|
||||
print "Matching", f
|
||||
refactor.refactor_file(f)
|
||||
print "%d seconds to match %d files" % (time() - t, len(sys.modules))
|
Loading…
Add table
Add a link
Reference in a new issue