1
# Copyright (C) 2006 Canonical Ltd
1
# Copyright (C) 2006 by Canonical Ltd
3
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.
4
# it under the terms of the GNU General Public License version 2 as published by
5
# the Free Software Foundation.
8
7
# This program is distributed in the hope that it will be useful,
9
8
# but WITHOUT ANY WARRANTY; without even the implied warranty of
17
16
"""Tests for bzr add performance."""
20
from bzrlib.benchmarks import Benchmark
23
class AddBenchmark(Benchmark):
24
"""Benchmarks for 'bzr add'"""
19
from bzrlib.tests.blackbox import ExternalBase
22
class TestAdd(ExternalBase):
26
24
def test_one_add_kernel_like_tree(self):
27
25
"""Adding a kernel sized tree should be bearable (<5secs) fast."""
28
self.make_kernel_like_tree(link_working=True)
29
# on roberts machine: this originally took: 25936ms/32244ms
30
# after making smart_add use the parent_ie: 5033ms/ 9368ms
31
# plain os.walk takes 213ms on this tree
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)
32
43
self.time(self.run_bzr, 'add')