1
# Copyright (C) 2006 by 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 version 2 as published by
5
# the Free Software Foundation.
7
# This program is distributed in the hope that it will be useful,
8
# but WITHOUT ANY WARRANTY; without even the implied warranty of
9
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
10
# GNU General Public License for more details.
12
# You should have received a copy of the GNU General Public License
13
# along with this program; if not, write to the Free Software
14
# Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
16
"""Tests for bzr add performance."""
19
from bzrlib.tests.blackbox import ExternalBase
22
class TestAdd(ExternalBase):
24
def test_one_add_kernel_like_tree(self):
25
"""Adding a kernel sized tree should be bearable (<5secs) fast."""
26
# a kernel tree has ~10000 and 500 directory, with most files around
28
# we simulate this by three levels of dirs named 0-7, givin 512 dirs,
30
# on roberts machine this originally took 25936ms/32244ms
31
# after quick tuning (more needed): 14640ms/19677ms
34
for outer in range(8):
35
files.append("%s/" % outer)
36
for middle in range(8):
37
files.append("%s/%s/" % (outer, middle))
38
for inner in range(8):
39
prefix = "%s/%s/%s/" % (outer, middle, inner)
41
files.extend([prefix + str(foo) for foo in range(20)])
42
self.build_tree(files)
43
self.time(self.run_bzr, 'add')
added
removed
bzrlib/benchmarks/bench_add.py
