1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
|
# Copyright (C) 2006, 2007 Canonical Ltd
#
# This program is free software; you can redistribute it and/or modify
# it under the terms of the GNU General Public License as published by
# the Free Software Foundation; either version 2 of the License, or
# (at your option) any later version.
#
# This program is distributed in the hope that it will be useful,
# but WITHOUT ANY WARRANTY; without even the implied warranty of
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
# GNU General Public License for more details.
#
# You should have received a copy of the GNU General Public License
# along with this program; if not, write to the Free Software
# Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
"""Tests for the extra cases that WorkingTree.walkdirs can encounter."""
import os
from bzrlib import transform
from bzrlib.osutils import has_symlinks
from bzrlib.tests import TestSkipped
from bzrlib.tests.workingtree_implementations import TestCaseWithWorkingTree
# tests to write:
# type mismatches - file to link, dir, dir to file, link, link to file, dir
class TestWalkdirs(TestCaseWithWorkingTree):
def get_tree_with_unknowns(self):
tree = self.make_branch_and_tree('.')
self.build_tree([
'unknown file',
'unknown dir/',
'unknown dir/a file',
])
u_f_stat = os.lstat('unknown file')
u_d_stat = os.lstat('unknown dir')
u_d_f_stat = os.lstat('unknown dir/a file')
expected_dirblocks = [
(('', tree.path2id('')),
[
('unknown dir', 'unknown dir', 'directory', u_d_stat, None, None),
('unknown file', 'unknown file', 'file', u_f_stat, None, None),
]
),
(('unknown dir', None),
[('unknown dir/a file', 'a file', 'file', u_d_f_stat, None, None),
]
),
]
return tree, expected_dirblocks
def test_walkdir_unknowns(self):
"""unknown files and directories should be reported by walkdirs."""
# test that its iterable by iterating:
result = []
tree, expected_dirblocks = self.get_tree_with_unknowns()
tree.lock_read()
for dirinfo, dirblock in tree.walkdirs():
result.append((dirinfo, list(dirblock)))
tree.unlock()
# check each return value for debugging ease.
for pos, item in enumerate(expected_dirblocks):
self.assertEqual(item, result[pos])
self.assertEqual(len(expected_dirblocks), len(result))
def test_walkdir_from_unknown_dir(self):
"""Doing a walkdir when the requested prefix is unknown but on disk."""
result = []
tree, expected_dirblocks = self.get_tree_with_unknowns()
tree.lock_read()
for dirinfo, dirblock in tree.walkdirs('unknown dir'):
result.append((dirinfo, list(dirblock)))
tree.unlock()
# check each return value for debugging ease.
for pos, item in enumerate(expected_dirblocks[1:]):
self.assertEqual(item, result[pos])
self.assertEqual(len(expected_dirblocks) - 1, len(result))
def get_tree_with_missings(self):
tree = self.make_branch_and_tree('.')
paths = [
'missing file',
'missing dir/',
'missing dir/a file',
]
ids = [
'a file',
'a dir',
'a dir-a file',
]
self.build_tree(paths)
tree.add(paths, ids)
# now make the files be missing
tree.bzrdir.root_transport.delete_tree('missing dir')
tree.bzrdir.root_transport.delete('missing file')
expected_dirblocks = [
(('', tree.path2id('')),
[
('missing dir', 'missing dir', 'unknown', None, 'a dir', 'directory'),
('missing file', 'missing file', 'unknown', None, 'a file', 'file'),
]
),
(('missing dir', 'a dir'),
[('missing dir/a file', 'a file', 'unknown', None, 'a dir-a file', 'file'),
]
),
]
return tree, expected_dirblocks
def test_walkdir_missings(self):
"""missing files and directories should be reported by walkdirs."""
# test that its iterable by iterating:
result = []
tree, expected_dirblocks = self.get_tree_with_missings()
tree.lock_read()
for dirinfo, dirblock in tree.walkdirs():
result.append((dirinfo, list(dirblock)))
tree.unlock()
# check each return value for debugging ease.
for pos, item in enumerate(expected_dirblocks):
self.assertEqual(item, result[pos])
self.assertEqual(len(expected_dirblocks), len(result))
def test_walkdir_from_missing_dir(self):
"""Doing a walkdir when the requested prefix is missing but on disk."""
result = []
tree, expected_dirblocks = self.get_tree_with_missings()
tree.lock_read()
for dirinfo, dirblock in tree.walkdirs('missing dir'):
result.append((dirinfo, list(dirblock)))
tree.unlock()
# check each return value for debugging ease.
for pos, item in enumerate(expected_dirblocks[1:]):
self.assertEqual(item, result[pos])
self.assertEqual(len(expected_dirblocks[1:]), len(result))
def test_walkdirs_type_changes(self):
"""Walkdir shows the actual kinds on disk and the recorded kinds."""
if not has_symlinks():
raise TestSkipped('No symlink support')
tree = self.make_branch_and_tree('.')
paths = ['file1', 'file2', 'dir1/', 'dir2/']
ids = ['file1', 'file2', 'dir1', 'dir2']
self.build_tree(paths)
tree.add(paths, ids)
tt = transform.TreeTransform(tree)
root_transaction_id = tt.trans_id_tree_path('')
tt.new_symlink('link1',
root_transaction_id, 'link-target', 'link1')
tt.new_symlink('link2',
root_transaction_id, 'link-target', 'link2')
tt.apply()
tree.bzrdir.root_transport.delete_tree('dir1')
tree.bzrdir.root_transport.delete_tree('dir2')
tree.bzrdir.root_transport.delete('file1')
tree.bzrdir.root_transport.delete('file2')
tree.bzrdir.root_transport.delete('link1')
tree.bzrdir.root_transport.delete('link2')
changed_paths = ['dir1', 'file1/', 'link1', 'link2/']
self.build_tree(changed_paths)
os.symlink('target', 'dir2')
os.symlink('target', 'file2')
dir1_stat = os.lstat('dir1')
dir2_stat = os.lstat('dir2')
file1_stat = os.lstat('file1')
file2_stat = os.lstat('file2')
link1_stat = os.lstat('link1')
link2_stat = os.lstat('link2')
expected_dirblocks = [
(('', tree.path2id('')),
[('dir1', 'dir1', 'file', dir1_stat, 'dir1', 'directory'),
('dir2', 'dir2', 'symlink', dir2_stat, 'dir2', 'directory'),
('file1', 'file1', 'directory', file1_stat, 'file1', 'file'),
('file2', 'file2', 'symlink', file2_stat, 'file2', 'file'),
('link1', 'link1', 'file', link1_stat, 'link1', 'symlink'),
('link2', 'link2', 'directory', link2_stat, 'link2', 'symlink'),
]
),
(('dir1', 'dir1'),
[
]
),
(('dir2', 'dir2'),
[
]
),
(('file1', None),
[
]
),
(('link2', None),
[
]
),
]
tree.lock_read()
result = list(tree.walkdirs())
tree.unlock()
# check each return value for debugging ease.
for pos, item in enumerate(expected_dirblocks):
self.assertEqual(item, result[pos])
self.assertEqual(len(expected_dirblocks), len(result))
def test_walkdirs_type_changes_wo_symlinks(self):
# similar to test_walkdirs_type_changes
# but don't use symlinks for safe testing on win32
tree = self.make_branch_and_tree('.')
paths = ['file1', 'dir1/']
ids = ['file1', 'dir1']
self.build_tree(paths)
tree.add(paths, ids)
tree.bzrdir.root_transport.delete_tree('dir1')
tree.bzrdir.root_transport.delete('file1')
changed_paths = ['dir1', 'file1/']
self.build_tree(changed_paths)
dir1_stat = os.lstat('dir1')
file1_stat = os.lstat('file1')
expected_dirblocks = [
(('', tree.path2id('')),
[('dir1', 'dir1', 'file', dir1_stat, 'dir1', 'directory'),
('file1', 'file1', 'directory', file1_stat, 'file1', 'file'),
]
),
(('dir1', 'dir1'),
[
]
),
(('file1', None),
[
]
),
]
tree.lock_read()
result = list(tree.walkdirs())
tree.unlock()
# check each return value for debugging ease.
for pos, item in enumerate(expected_dirblocks):
self.assertEqual(item, result[pos])
self.assertEqual(len(expected_dirblocks), len(result))
|