1
# Copyright (C) 2006 Canonical Ltd
3
# This program is free software; you can redistribute it and/or modify
4
# it under the terms of the GNU General Public License as published by
5
# the Free Software Foundation; either version 2 of the License, or
6
# (at your option) any later version.
8
# This program is distributed in the hope that it will be useful,
9
# but WITHOUT ANY WARRANTY; without even the implied warranty of
10
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
11
# GNU General Public License for more details.
13
# You should have received a copy of the GNU General Public License
14
# along with this program; if not, write to the Free Software
15
# Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
17
"""Tests for bzr working tree performance."""
21
from bzrlib import ignores
22
from bzrlib.benchmarks import Benchmark
23
from bzrlib.workingtree import WorkingTree
26
class WorkingTreeBenchmark(Benchmark):
27
"""Benchmarks for `bzrlib.workingtree` performance."""
29
def test_list_files_kernel_like_tree(self):
30
tree = self.make_kernel_like_added_tree()
33
self.time(list, tree.list_files())
37
def test_list_files_unknown_kernel_like_tree(self):
38
tree = self.make_kernel_like_tree(link_working=True)
39
tree = WorkingTree.open('.')
40
# Bzr only traverses directories if they are versioned
41
# So add all the directories, but not the files, yielding
42
# lots of unknown files.
43
for root, dirs, files in os.walk('.'):
51
self.time(list, tree.list_files())
55
def test_is_ignored_single_call(self):
56
"""How long does is_ignored take to initialise and check one file."""
57
t = self.make_branch_and_tree('.')
58
self.time(t.is_ignored, "CVS")
60
def test_is_ignored_10824_calls(self):
61
"""How long does is_ignored take to initialise and check one file."""
62
t = self.make_branch_and_tree('.')
63
def call_is_ignored_10824_not_ignored():
64
for x in xrange(10824):
66
self.time(call_is_ignored_10824_not_ignored)
68
def test_is_ignored_10_patterns(self):
69
t = self.make_branch_and_tree('.')
70
ignores.add_runtime_ignores([u'*.%i' % i for i in range(1, 9)])
71
ignores.add_runtime_ignores(['./foo', 'foo/bar'])
72
self.time(t.is_ignored,'bar')
73
ignores._runtime_ignores = set()
75
def test_is_ignored_50_patterns(self):
76
t = self.make_branch_and_tree('.')
77
ignores.add_runtime_ignores([u'*.%i' % i for i in range(1, 49)])
78
ignores.add_runtime_ignores(['./foo', 'foo/bar'])
79
self.time(t.is_ignored,'bar')
80
ignores._runtime_ignores = set()
82
def test_is_ignored_100_patterns(self):
83
t = self.make_branch_and_tree('.')
84
ignores.add_runtime_ignores([u'*.%i' % i for i in range(1, 99)])
85
ignores.add_runtime_ignores(['./foo', 'foo/bar'])
86
self.time(t.is_ignored,'bar')
87
ignores._runtime_ignores = set()
89
def test_is_ignored_1000_patterns(self):
90
t = self.make_branch_and_tree('.')
91
ignores.add_runtime_ignores([u'*.%i' % i for i in range(1, 999)])
92
ignores.add_runtime_ignores(['./foo', 'foo/bar'])
93
self.time(t.is_ignored,'bar')
94
ignores._runtime_ignores = set()
96
def test_walkdirs_kernel_like_tree(self):
97
"""Walking a kernel sized tree is fast!(150ms)."""
98
self.make_kernel_like_tree()
100
tree = WorkingTree.open('.')
101
# on roberts machine: this originally took: 157ms/4177ms
102
# plain os.walk takes 213ms on this tree
103
self.time(list, tree.walkdirs())
105
def test_walkdirs_kernel_like_tree_unknown(self):
106
"""Walking a kernel sized tree is fast!(150ms)."""
107
self.make_kernel_like_tree()
108
tree = WorkingTree.open('.')
109
# on roberts machine: this originally took: 157ms/4177ms
110
# plain os.walk takes 213ms on this tree
111
self.time(list, tree.walkdirs())